> > For a much faster solution than the idx mechanism, look at this: > http://www.mail-archive.com/[email protected]/msg05199.html > > This is a very interesting idea. Thanks for pointing it out. Is there a formal name for the algorithm? For some more general purpose data structures I am working with, it may be a great solution.
I'll compare it to what I was in the process of doing, which was to have an 'idx something to the effect of (N, nth L N). However, for the numerical table lookups, if I am going to a shared lib, I might as well do the ~O(1) lookup in a static array. /Lindsay
