Ok... found the solution. The technical at least.

import std.algorithm;
import std.range;
void main(){
        ku[] tt = [ku(2), ku(1)];
        //writeln(tt);
        auto index3 = new size_t[tt.length];
        makeIndex!("a.id < b.id")(tt, index3);
        auto ind = indexed(tt, index3);
        //writeln(ind);
}

This yield in 'ind' the array of 'tt', ordered in the expected way.
So, the remaining open questions are just ideologic now...

Thanks for helping and commenting!

Reply via email to