On 30.08.16 21:20, Antoine Pitrou wrote: > On Tue, 30 Aug 2016 18:12:01 +0000 > Brett Cannon <brett at python.org> wrote: >>> Why not make it always a list? List objects are reasonably cheap in >>> memory and access time... (unlike dicts) >> >> Because I would prefer to avoid any form of unnecessary performance >> overhead for the common case. > > But the performance overhead of iterating over a 1-element list > is small enough (it's just an array access after a pointer dereference) > that it may not be larger than the overhead of the multiple tests and > conditional branches your example shows. Iterating over a tuple is even faster. It needs one pointer dereference less. And for memory efficiency we can use just a raw array of pointers.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4