list.pop(0) vs. collections.dequeue

Steve Howell showell30 at yahoo.com
Sat Jan 23 17:41:15 CET 2010


On Jan 23, 5:46 am, Christian Heimes <li... at cheimes.de> wrote:
> Steve Howell wrote:
> > Another benchmark is that deques are slower than lists for accessing
> > elements.
>
> deques are optimized for accessing, inserting and removing data from
> both ends. For anything else it's slower than the list type. The fact
> was explained in this very thread yesterday.
>

And the benchmark confirmed it.  The slowness is fairly negligible,
though.



More information about the Python-list mailing list