list.pop(0) vs. collections.dequeue

Arnaud Delobelle arnodel at
Mon Jan 25 22:32:10 CET 2010

Steve Howell <showell30 at> writes:
> My algorithm does exactly N pops and roughly N list accesses, so I
> would be going from N*N + N to N + N log N if switched to blist.

Can you post your algorithm?  It would be interesting to have a concrete
use case to base this discussion on.


More information about the Python-list mailing list