On Jun 21, 2012, at 12:51 AM, Alexey Tourbin wrote:
On Thu, Jun 21, 2012 at 12:15 AM, Alexey Tourbin
alexey.tour...@gmail.com wrote:
On Mon, Jun 18, 2012 at 10:32 PM, Jeffrey Johnson n3...@me.com wrote:
Good: the above confirmation of the characteristics allows a set:versions
implementation
On Jun 18, 2012, at 2:32 PM, Jeffrey Johnson wrote:
The contained in or subset semantic that applies to the operations and
=
is rather easy to do as well. E.g. if (assuming on;y existence, not versioned
inequality ranges)
P == Bloom filter of Provides: tokens
R == Bloom
On Thu, Jun 21, 2012 at 7:28 PM, Jeffrey Johnson n3...@me.com wrote:
More precisely, a set-version can be (in principle) converted to a
Bloom filter which uses only one hash function. The idea is that such
a filter will set bits in a highly sparse set of bits, one by one.
Instead, a
On Jun 21, 2012, at 8:27 PM, Alexey Tourbin alexey.tour...@gmail.com wrote:
On Thu, Jun 21, 2012 at 7:28 PM, Jeffrey Johnson n3...@me.com wrote:
More precisely, a set-version can be (in principle) converted to a
Bloom filter which uses only one hash function. The idea is that such
a filter
