efficient idiomatic queue?

sebastien s.keim at laposte.net
Thu Jan 17 10:28:36 CET 2002


> The Python Cookbook has an algorithm for O(n) FIFO queues submitted by
> Sébastien Keim.
> His approach is interesting and brilliant,
> 
> See:  http://aspn.activestate.com/ASPN/Cookbook/Python/Recipe/68436

Thank's

I've completed the page with some kind of benchmarking.
The results are quite amazing but I would be more confident if someone
could confirm them. (in fact I found them very rude for built-in
lists)



More information about the Python-list mailing list