list.pop(0) vs. collections.dequeue
showell30 at yahoo.com
Mon Jan 25 23:09:00 CET 2010
On Jan 25, 1:32 pm, Arnaud Delobelle <arno... at googlemail.com> wrote:
> Steve Howell <showel... at yahoo.com> 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.
I just realized you meant the Python code itself. It is here:
More information about the Python-list