On Mon, Jan 25, 2010 at 5:09 PM, Steve Howell <showel...@yahoo.com> wrote:
> On Jan 25, 1:32 pm, Arnaud Delobelle <arno...@googlemail.com> wrote: > > Steve Howell <showel...@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: > > https://bitbucket.org/showell/shpaml_website/src/tip/shpaml.py > > -- > http://mail.python.org/mailman/listinfo/python-list > looking at that code, i think you could solve your whole problem with a single called to reversed() (which is NOT the same as list.reverse())
-- http://mail.python.org/mailman/listinfo/python-list
