Jim Washington wrote at 2007-3-27 16:28 -0400:
>Yes, I think so, at least in the implementation/algorithm I am using.
>There may be other implementations that do not need this. Note,
>however, that the canonical list does not have to be complex objects.
>The canonical list is just a representation of the "unsorted" state. It
>can, for example, be a proxy list of iids, list indexes, or OOBTree
>keys. The algorithm does not care what it is reordering.
If you need to keep the "canonical list" around, then sort them
and then keep the sorted result around (i.e. cache the sorted list).
This way, you could avoid the "factoradic index".
Zope3-dev mailing list