The current closeness simply compares the character offset of each character of the two other keys with this one to see which is closer, starting with the first character and continuing lexicographically.
On Thu, 13 Apr 2000, Bill Trost wrote: > Oskar writes: <snip> > WHICH MEANS, the spec needs a precise, detailed, and > humanly-intelligible description of the closeness metric/algorithm. > I'm not sure I really understand it, even after reading the source, > so I'll go willy-nilly here and propose one: simply order the keys by > alphabetical order, with "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"'s > (or "zzzz....") wrapping around to 0. It's an easy order to explain, > and is moderately close to what the code seems to use now -- assuming > an evenly distributed keyspace, a series of "close" guesses by the two > algorithms will have about half of their keys in common. > > _______________________________________________ > Freenet-dev mailing list > Freenet-dev at lists.sourceforge.net > http://lists.sourceforge.net/mailman/listinfo/freenet-dev -- Oskar Sandberg md98-osa at nada.kth.se #!/bin/perl -sp0777i<X+d*lMLa^*lN%0]dsXx++lMlN/dsM0<j]dsj $/=unpack('H*',$_);$_=`echo 16dio\U$k"SK$/SM$n\EsN0p[lN*1 lK[d2%Sa2/d0$^Ixp"|dc`;s/\W//g;$_=pack('H*',/((..)*)$/) _______________________________________________ Freenet-dev mailing list Freenet-dev at lists.sourceforge.net http://lists.sourceforge.net/mailman/listinfo/freenet-dev
