On Jan 23, 5:46 am, Christian Heimes <li...@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. -- http://mail.python.org/mailman/listinfo/python-list
