@@ -470,10 +470,10 @@ you can always change a list's elements. Only immutable elements can be used as
470470dictionary keys, and hence only tuples and not lists can be used as keys.
471471
472472
473- How are lists implemented?
474- --------------------------
473+ How are lists implemented in CPython ?
474+ -------------------------------------
475475
476- Python 's lists are really variable-length arrays, not Lisp-style linked lists.
476+ CPython 's lists are really variable-length arrays, not Lisp-style linked lists.
477477The implementation uses a contiguous array of references to other objects, and
478478keeps a pointer to this array and the array's length in a list head structure.
479479
@@ -486,10 +486,10 @@ when the array must be grown, some extra space is allocated so the next few
486486times don't require an actual resize.
487487
488488
489- How are dictionaries implemented?
490- ---------------------------------
489+ How are dictionaries implemented in CPython ?
490+ --------------------------------------------
491491
492- Python 's dictionaries are implemented as resizable hash tables. Compared to
492+ CPython 's dictionaries are implemented as resizable hash tables. Compared to
493493B-trees, this gives better performance for lookup (the most common operation by
494494far) under most circumstances, and the implementation is simpler.
495495
0 commit comments