[erlang-questions] finding the nearest key in a key-value table

Jesper Louis Andersen jesper.louis.andersen@REDACTED
Tue May 27 14:56:41 CEST 2014

On Tue, May 27, 2014 at 2:55 PM, Joe Armstrong <erlang@REDACTED> wrote:

> Now why would anybody want to put 20 byte binaries in a hash table and
> find the K nearest hits :-)

Distributed Hash Table rings ;)

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://erlang.org/pipermail/erlang-questions/attachments/20140527/e4ce2cd6/attachment.htm>

More information about the erlang-questions mailing list