On Tue, Apr 24, 2001 at 12:12:09PM -0700, Mr.Bad wrote:
> Actually, on further thought, this seems like a particularly rare
> situation. Like, in a linear key space, given a search key S and
> another key A, there's only one other key that's equidistant from S
> with A.
Yes, you are right, it is pretty rare. And regardless, I don't think you
should spend so much effort on the current datastore class when the one in
the 0.4 branch already does something like what you proposed (returns an
Enumeration of the keys starting from the closest).
In the spec for the protocol, I wrote that if two keys are eqidistant,
then the smallest should always be considered closer. Wouldn't that work?
--
'DeCSS would be fine. Where is it?'
'Here,' Montag touched his head.
'Ah,' Granger smiled and nodded.
Oskar Sandberg
[EMAIL PROTECTED]
_______________________________________________
Devl mailing list
[EMAIL PROTECTED]
http://lists.freenetproject.org/mailman/listinfo/devl
