Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
C
cython
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Labels
Merge Requests
0
Merge Requests
0
Analytics
Analytics
Repository
Value Stream
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Commits
Open sidebar
nexedi
cython
Commits
ccb971d0
Commit
ccb971d0
authored
Nov 26, 2010
by
Stefan Behnel
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
extended test case
parent
4029d8cb
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
38 additions
and
2 deletions
+38
-2
tests/run/cascaded_list_unpacking_T467.pyx
tests/run/cascaded_list_unpacking_T467.pyx
+38
-2
No files found.
tests/run/cascaded_list_unpacking_T467.pyx
View file @
ccb971d0
...
...
@@ -12,9 +12,9 @@ def simple_parallel_assignment_from_call():
side_effect_count
=
call_count
-
side_effect_count
return
side_effect_count
,
ao
,
bo
,
ai
,
bi
,
al
,
bl
,
c
,
d
def
recursive_parallel_assignment_from_call
():
def
recursive_parallel_assignment_from_call
_left
():
"""
>>> recursive_parallel_assignment_from_call()
>>> recursive_parallel_assignment_from_call
_left
()
(3, 1, 2, 3, 1, 2, 3, (1, 2), 3, [(1, 2), 3])
"""
cdef
int
ai
,
bi
,
ci
...
...
@@ -24,6 +24,42 @@ def recursive_parallel_assignment_from_call():
side_effect_count
=
call_count
-
side_effect_count
return
side_effect_count
,
ao
,
bo
,
co
,
ai
,
bi
,
ci
,
t
,
o
,
d
def
recursive_parallel_assignment_from_call_right
():
"""
>>> recursive_parallel_assignment_from_call_right()
(3, 1, 2, 3, 1, 2, 3, 1, (2, 3), [1, (2, 3)])
"""
cdef
int
ai
,
bi
,
ci
cdef
object
ao
,
bo
,
co
cdef
int
side_effect_count
=
call_count
ai
,
(
bi
,
ci
)
=
ao
,
(
bo
,
co
)
=
o
,
t
=
d
=
[
intval
(
1
),
(
intval
(
2
),
intval
(
3
))]
side_effect_count
=
call_count
-
side_effect_count
return
side_effect_count
,
ao
,
bo
,
co
,
ai
,
bi
,
ci
,
o
,
t
,
d
def
recursive_parallel_assignment_from_call_left_reversed
():
"""
>>> recursive_parallel_assignment_from_call_left_reversed()
(3, 1, 2, 3, 1, 2, 3, (1, 2), 3, [(1, 2), 3])
"""
cdef
int
ai
,
bi
,
ci
cdef
object
ao
,
bo
,
co
cdef
int
side_effect_count
=
call_count
d
=
t
,
o
=
(
ao
,
bo
),
co
=
(
ai
,
bi
),
ci
=
[(
intval
(
1
),
intval
(
2
)),
intval
(
3
)]
side_effect_count
=
call_count
-
side_effect_count
return
side_effect_count
,
ao
,
bo
,
co
,
ai
,
bi
,
ci
,
t
,
o
,
d
def
recursive_parallel_assignment_from_call_right_reversed
():
"""
>>> recursive_parallel_assignment_from_call_right_reversed()
(3, 1, 2, 3, 1, 2, 3, 1, (2, 3), [1, (2, 3)])
"""
cdef
int
ai
,
bi
,
ci
cdef
object
ao
,
bo
,
co
cdef
int
side_effect_count
=
call_count
d
=
o
,
t
=
ao
,
(
bo
,
co
)
=
ai
,
(
bi
,
ci
)
=
[
intval
(
1
),
(
intval
(
2
),
intval
(
3
))]
side_effect_count
=
call_count
-
side_effect_count
return
side_effect_count
,
ao
,
bo
,
co
,
ai
,
bi
,
ci
,
o
,
t
,
d
cdef
int
call_count
=
0
cdef
int
intval
(
int
x
):
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment