实际上,C代码非常简单。扩展一个宏并删除一些不相关的注释,基本结构在listobject.h,它将列表定义为:typedef struct {
PyObject_HEAD
Py_ssize_t ob_size;
/* Vector of pointers to list elements. list[0] is ob_item[0], etc. */
PyObject **ob_item;
/* ob_item contains space for 'allocated' elements. The number
* currently in use is ob_size.
* Invariants:
* 0 <= ob_size <= allocated
* len(list) == ob_size
* ob_item == NULL implies ob_size == allocated == 0
*/
Py_ssize_t allocated;} PyListObject;
PyObject_HEAD包含引用计数和类型标识符。因此,它是一个过分配的向量/数组。当数组满时调整大小的代码在listobject.c..它实际上并不是数组的两倍,而是通过分配new_allocated = (newsize >> 3) + (newsize < 9 ? 3 : 6);new_allocated += newsize;
每一次,newsize请求的大小(不一定)allocated + 1因为你可以extend由任意数目的元素代替append一个接一个地给他们看)。