> > idea I would be VERY interested. > Sorry if I'm a bit behind here, but whats wrong with using a hash table that > uses the routing key as the hash, and then just check previous and next hash > entry for closeness? Because hash entries inherently do not order their elements. Besides, the problem with finding closeness in <O(n) time is that the metric for closeness isn't always numerical (it is currently, but may not be for things like searching).
-------------- next part -------------- A non-text attachment was scrubbed... Name: not available Type: application/pgp-signature Size: 232 bytes Desc: not available URL: <https://emu.freenetproject.org/pipermail/devl/attachments/20000805/758bc7fc/attachment.pgp>
