igoreus/bloomfilter

There is no license information available for the latest version (v0.1.1) of this package.

Implementation of bloom filter

v0.1.1 2016-10-26 07:13 UTC

Requires (Dev)

• phpunit/phpunit: ^4.6

Unknown License

• Igor Veremchuk

README

A Bloom filter is a space-efficient probabilistic data structure, conceived by Burton Howard Bloom in 1970, that is used to test whether an element is a member of a set (False positive matches are possible, but false negatives are not).

<?php

use \Igoreus\BloomFilter\Persist\Redis;
use \Igoreus\BloomFilter\BloomFilter;

$setToStore = [
    'Test string 1',
    'Test string 2',
    'Test string 3',
    'Test string 4',
    'Test string 5',
];

$filter = BloomFilter::createFromApproximateSize(
    Redis::create(),
    count($setToStore),
    0.001
);

foreach ($setToStore as $string) {
    $filter->add($string);
}

if ($filter->has('Test string 1')) {
    echo 'Possibly in set"' . PHP_EOL;
} else {
    echo 'Definitely not in set' . PHP_EOL;
}