@@ -503,10 +503,10 @@ you can always change a list's elements. Only immutable elements can be used as
|
503 | 503 | dictionary keys, and hence only tuples and not lists can be used as keys. |
504 | 504 | |
505 | 505 | |
506 | | -How are lists implemented? |
507 | | --------------------------- |
| 506 | +How are lists implemented in CPython? |
| 507 | +------------------------------------- |
508 | 508 | |
509 | | -Python's lists are really variable-length arrays, not Lisp-style linked lists. |
| 509 | +CPython's lists are really variable-length arrays, not Lisp-style linked lists. |
510 | 510 | The implementation uses a contiguous array of references to other objects, and |
511 | 511 | keeps a pointer to this array and the array's length in a list head structure. |
512 | 512 | |
@@ -519,10 +519,10 @@ when the array must be grown, some extra space is allocated so the next few
|
519 | 519 | times don't require an actual resize. |
520 | 520 | |
521 | 521 | |
522 | | -How are dictionaries implemented? |
523 | | ---------------------------------- |
| 522 | +How are dictionaries implemented in CPython? |
| 523 | +-------------------------------------------- |
524 | 524 | |
525 | | -Python's dictionaries are implemented as resizable hash tables. Compared to |
| 525 | +CPython's dictionaries are implemented as resizable hash tables. Compared to |
526 | 526 | B-trees, this gives better performance for lookup (the most common operation by |
527 | 527 | far) under most circumstances, and the implementation is simpler. |
528 | 528 | |
|