>>>>> "OS" == Oskar Sandberg <[EMAIL PROTECTED]> writes:
OS> Yes, you are right, it is pretty rare.
That's what I thought.
OS> And regardless, I don't think you should spend so much effort
OS> on the current datastore class when the one in the 0.4 branch
OS> already does something like what you proposed (returns an
OS> Enumeration of the keys starting from the closest).
Well, the main reason I was working on it was to fix a reported
bug. Admittedly, now that I'm thinking of the astronomical chances
against equidistant keys, there's got to be some other reason MJR is
seeing cycles in the key search, but I'm not sure what it is yet.
OS> In the spec for the protocol, I wrote that if two keys are
OS> eqidistant, then the smallest should always be considered
OS> closer. Wouldn't that work?
Yeah, that would work.
~Mr. Bad
--
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Mr. Bad <[EMAIL PROTECTED]> | Pigdog Journal | http://pigdog.org/
freenet:MSK@SSK@u1AntQcZ81Y4c2tJKd1M87cZvPoQAge/pigdog+journal//
"Statements like this give the impression that this article was
written by a madman in a drug induced rage" -- Ben Franklin
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
_______________________________________________
Devl mailing list
[EMAIL PROTECTED]
http://lists.freenetproject.org/mailman/listinfo/devl
