<...snip...>
To give an example - to sort on col 2, 4 reverse, and then 3 could be done using something like this:
m2 = sortmap(col[2])
m3 = sortmap(col[3])
m4 = sortmap(col[4])
result = view.remap(m3.remap(reverse(m4)).remap(m2))
(with partial use, i.e. when fetching only a slice of the result, all sorts of neat tricks can be added, leading to behavior which I think resembles what you are describing above)
Except that the above "permutation stacking" is not exactly right... alas.
Are you looking for ideas on how to precondition or extend the column definition to improve the above calculation, or are you looking for effient methods of performing the above calculation without assuming any preconditioning or attributes on the col's?
I'm not familiar with the method you used to perform the column wise store. I'm I correct in assuming that the values in a row are determined by equivelent offsets in the column stores?
Tom K. _____________________________________________ Metakit mailing list - [EMAIL PROTECTED] http://www.equi4.com/mailman/listinfo/metakit
