> I tried to prevent another reference to mr. Daciuk :) Why? He's a very nice guy :)
> But you have to lookup this err..index somehow. And that's either > binary or hash lookup. Where's the win? You can do a sparse O(1) index and have a slight gain from these few large initial states. This only makes sense if you perform tons of these lookups, really. Mike's right -- the FST will output a structure that is ready to be used for by-number retrieval of strings (or anything else) as long as the numbers are strictly monotonous (and preferably continuous). The output will be what you're suggesting, Earwin -- accumulated sums. Dawid --------------------------------------------------------------------- To unsubscribe, e-mail: dev-unsubscr...@lucene.apache.org For additional commands, e-mail: dev-h...@lucene.apache.org
