I want to sort sequences of strings lexicographically but those with longer prefix should come earlier, e.g. for s = ['a', 'bc', 'bd', 'bcb', 'ba', 'ab'], the sorted sequence is ['ab', 'a', 'ba', 'bcb', 'bc', 'bd']. Currently I do it with:
s.sort(cmp=lambda x,y: 0 if x==y else
-1 if x.startswith(y) else
+1 if y.startswith(x) else
cmp(x,y))
Can this be done with an equivalent key function instead of cmp ?
George
--
http://mail.python.org/mailman/listinfo/python-list
