On Tue, Mar 27, 2007 at 03:25:00PM -0400, Jim Washington wrote:
> A factoradic index is representable as a long integer. Given that
> integer and the canonical list, you can regenerate the permutation
> represented by that integer. So, instead of caching the sorted list
> itself, you find and keep this integer, which is all the information
> needed to algorithmically re-obtain the sorted list.
> So, this would be slower than caching, but (I think) faster than re-sorting.
Doesn't it mean you need the entire canonical list in memory?
Zope3-dev mailing list