From: Andrés Delfino Date: Sat, 7 Jul 2018 23:25:47 +0000 (-0300) Subject: bpo-33888: Use CPython instead of Python in the FAQ (GH-7767) X-Git-Tag: v3.8.0a1~1409 X-Git-Url: http://git.ipfire.org/gitweb.cgi?a=commitdiff_plain;h=8d41278045ee4e8bf1cadb58a7db58d70ad55237;p=thirdparty%2FPython%2Fcpython.git bpo-33888: Use CPython instead of Python in the FAQ (GH-7767) Make the change where discussing the CPython implementation of lists and dicts. --- diff --git a/Doc/faq/design.rst b/Doc/faq/design.rst index 516812194785..10fa490931c5 100644 --- a/Doc/faq/design.rst +++ b/Doc/faq/design.rst @@ -470,10 +470,10 @@ you can always change a list's elements. Only immutable elements can be used as dictionary keys, and hence only tuples and not lists can be used as keys. -How are lists implemented? --------------------------- +How are lists implemented in CPython? +------------------------------------- -Python's lists are really variable-length arrays, not Lisp-style linked lists. +CPython's lists are really variable-length arrays, not Lisp-style linked lists. The implementation uses a contiguous array of references to other objects, and keeps a pointer to this array and the array's length in a list head structure. @@ -486,10 +486,10 @@ when the array must be grown, some extra space is allocated so the next few times don't require an actual resize. -How are dictionaries implemented? ---------------------------------- +How are dictionaries implemented in CPython? +-------------------------------------------- -Python's dictionaries are implemented as resizable hash tables. Compared to +CPython's dictionaries are implemented as resizable hash tables. Compared to B-trees, this gives better performance for lookup (the most common operation by far) under most circumstances, and the implementation is simpler.