File tree Expand file tree Collapse file tree 1 file changed +2
-2
lines changed Expand file tree Collapse file tree 1 file changed +2
-2
lines changed Original file line number Diff line number Diff line change @@ -139,11 +139,11 @@ the interpreter create cycles everywhere. Some notable examples:
139
139
have internal links to themselves.
140
140
141
141
To correctly dispose of these objects once they become unreachable, they need to be
142
- identified first. Inside the function that identifies cycles, two double- linked
142
+ identified first. Inside the function that identifies cycles, two doubly linked
143
143
lists are maintained: one list contains all objects to be scanned, and the other will
144
144
contain all objects "tentatively" unreachable.
145
145
146
- To understand how the algorithm works, Let ’s take the case of a circular linked list
146
+ To understand how the algorithm works, let ’s take the case of a circular linked list
147
147
which has one link referenced by a variable ``A ``, and one self-referencing object which
148
148
is completely unreachable:
149
149
You can’t perform that action at this time.
0 commit comments