To be more precise, I did not think of writing any external C (or
whatever else other language) routine. What I meant is something like
that:
def my_compare(x,y)
if x <my_less> y : return -1
if x <my_equal> y : return 0
if x <my_greater> y : return 1
......
# then I could say
foo_list.sort(my_compare)
> A generic sort module in python should be peanuts, though. Anyone feel
> like writing one?
Maybe this is the solution, but (being a beginner) I cannot see how can
one refine the *built-in* sort() method on Python level.
Could anyone, please, give some general idea about the mentioned
"peanuts".
--
,
Peter Dobcsanyi