Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
C
cpython
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
Analytics
Analytics
Repository
Value Stream
Wiki
Wiki
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Commits
Issue Boards
Open sidebar
Kirill Smelkov
cpython
Commits
b1f7632c
Commit
b1f7632c
authored
Jul 06, 2013
by
Brett Cannon
Browse files
Options
Browse Files
Download
Plain Diff
merge
parents
7e5d5570
5bfa8671
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
6 additions
and
6 deletions
+6
-6
Modules/_collectionsmodule.c
Modules/_collectionsmodule.c
+6
-6
No files found.
Modules/_collectionsmodule.c
View file @
b1f7632c
...
@@ -805,17 +805,17 @@ deque_traverse(dequeobject *deque, visitproc visit, void *arg)
...
@@ -805,17 +805,17 @@ deque_traverse(dequeobject *deque, visitproc visit, void *arg)
Py_ssize_t
index
;
Py_ssize_t
index
;
Py_ssize_t
indexlo
=
deque
->
leftindex
;
Py_ssize_t
indexlo
=
deque
->
leftindex
;
for
(
b
=
deque
->
leftblock
;
b
!=
NULL
;
b
=
b
->
rightlink
)
{
for
(
b
=
deque
->
leftblock
;
b
!=
deque
->
rightblock
;
b
=
b
->
rightlink
)
{
const
Py_ssize_t
indexhi
=
b
==
deque
->
rightblock
?
for
(
index
=
indexlo
;
index
<
BLOCKLEN
;
index
++
)
{
deque
->
rightindex
:
BLOCKLEN
-
1
;
for
(
index
=
indexlo
;
index
<=
indexhi
;
++
index
)
{
item
=
b
->
data
[
index
];
item
=
b
->
data
[
index
];
Py_VISIT
(
item
);
Py_VISIT
(
item
);
}
}
indexlo
=
0
;
indexlo
=
0
;
}
}
for
(
index
=
indexlo
;
index
<=
deque
->
rightindex
;
index
++
)
{
item
=
b
->
data
[
index
];
Py_VISIT
(
item
);
}
return
0
;
return
0
;
}
}
...
...
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