[PD] bugs and question

Thomas Grill t.grill at gmx.net
Fri Sep 6 09:45:06 CEST 2002

> do you mean, that one can write a lookup function having a constant
> execution time, regardless of a symbol table size?  Could you give
> me a pointer?

"Constant time" may not be true, but possibly there are better storages
(although they may not be that lightweight).
Have a look at: http://www.sourcejudy.com  (the "Judy scalable hashing"
configuration should be especially interesting).


More information about the Pd-list mailing list