The old code calls::
bisect.insort(self.chain,(priority,func))
but this fails in Python 3 with something like the message: "can't
order func".
If it were important to use bisect to save time, I suppose one would
pass orderable wrapper objects to bisect. However, speed seems
irrelevant here, so I replaced the call with::
key = lambda a:a[0]
aList.sort(key=key)
Edward
--
You received this message because you are subscribed to the Google Groups
"leo-editor" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/leo-editor?hl=en.