przemek drochomirecki wrote:
> def unique(s):
> e = {}
> for x in s:
> if not e.has_key(x):
> e[x] = 1
> return e.keys()
This is basically identical in functionality to the code:
def unique(s):
return list(set(s))
And with the new-and-improved C implementation of sets coming in Python
2.5, there's even more of a reason to use them when you can.
STeVe
--
http://mail.python.org/mailman/listinfo/python-list
