On Feb 24, 2:24 am, Paul Rubin <http://[EMAIL PROTECTED]> wrote: > thebjorn <[EMAIL PROTECTED]> writes: > > If the lists are long enough to care, either rewrite use a set-based > > solution if the items are hashable, or keep the elements sorted and > > rewrite to use the bisect module if the elements can be ordered. > > Well, you want a tree data structure to have fast insertions to > remember what items have already been seen. There's been a bunch > of proposals for an ordered dict type that works like this. > > Some day...
Amen! .. *sigh*... -- http://mail.python.org/mailman/listinfo/python-list
