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 md98-osa at nada.kth.se _______________________________________________ Devl mailing list Devl at freenetproject.org http://lists.freenetproject.org/mailman/listinfo/devl >From - Wed Apr 25 17:54:05 2001 Return-Path: <devl-admin at freenetproject.org> Received: from hawk.freenetproject.org (postfix@[4.18.42.11]) by funky.danky.com (8.9.3/8.8.7) with ESMTP id LAA11233 for <danello at danky.com>; Wed, 25 Apr 2001 11:19:03 -0400 Received: from hawk.freenetproject.org (localhost [127.0.0.1]) by hawk.freenetproject.org (Postfix) with ESMTP id 3E8B958056; Wed, 25 Apr 2001 09:00:10 -0700 (PDT) Delivered-To: devl at freenetproject.org Received: by hawk.freenetproject.org (Postfix, from userid 500) id DA6AC57FF5; Wed, 25 Apr 2001 08:59:38 -0700 (PDT) To: devl at freenetproject.org Subject: Re: [freenet-devl] Windows installer 0.3.8.1
