I've been unable to find a source for this information, short of looking through the Python source code myself to determine how the objects work. Does anyone know where I could find this online?
Checkout the TimeComplexity page on the py dot org wiki. It covers set/dicts/lists/etc at least as far as time complexity goes.
Raymond D. Hettinger does an excellent talk ( slides ) about Python's built-in collections called 'Core Python Containers - Under the Hood'. The version I saw focussed mainly on set
and dict
, but list
was covered too.
There are also some photos of the pertinent slides from EuroPython in a blog .
Here is a summary of my notes on list
:
memcpy
when growing by over-allocating. Many small lists will waste a lot of space, but large lists never waste more than about 12.5% to overallocation. range(n)
, map()
, list()
, [None] * n
, and slicing. realloc
ed only when it is wasting 50% of space. pop
is cheap. If your asking what I think your asking, you can find them Here ... page 476 and on.
It's written around optimization techniques for Python; It's mostly Big-O notation of time efficiencies not much memory.
The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.