Copyright © 2016 Zuse Institute Berlin
Version: $Id$
Authors: Nico Kruber (kruber@zib.de), Maik Lange (malange@informatik.hu-berlin.de).
References
abstract datatype: cbf()
key() = any()
add/2 | Adds one item to the counting bloom filter. |
add_list/2 | Adds multiple items to the counting bloom filter. |
equals/2 | Checks whether two counting bloom filters are equal. |
get_property/2 | |
is_element/2 | Returns true if the counting bloom filter contains this item. |
item_count/1 | Gets the number of items inserted into this counting bloom filter. |
join/2 | Joins two counting bloom filters so that the returned counting bloom filter represents their union. |
minus/2 | Subtracts counting bloom filter A from B so that the returned counting bloom filter that approximates the set difference (with false positives and false negatives!). |
new/2 | Creates a new counting bloom filter. |
new_bin/3 | Creates a new counting bloom filter with the given binary, hash function set and item count. |
new_bpi/3 | Creates a new counting bloom filter with the given hash function set and a fixed number of positions (bits in standard bloom filters) per item. |
new_fpr/2 | Creates a new counting bloom filter with the default (optimal) hash function set based on the given false positive rate. |
new_fpr/3 | Creates a new counting bloom filter with the given hash function set based on the given false positive rate. |
p_add_list/4 | Helper to add items to the counting bloom filter. |
print/1 | Returns counting bloom filter debug information. |
remove/2 | Removes one item from the counting bloom filter. |
remove_list/2 | Removes multiple items from the counting bloom filter. |
to_bloom/1 |
new_fpr(MaxItems :: non_neg_integer(), FPR :: float()) -> cbf()
Creates a new counting bloom filter with the default (optimal) hash function set based on the given false positive rate.
new_fpr(MaxItems :: non_neg_integer(), FPR :: float(), Hfs :: hfs_plain:hfs() | non_neg_integer()) -> cbf()
Creates a new counting bloom filter with the given hash function set based on the given false positive rate.
new_bpi(MaxItems :: non_neg_integer(), BitsPerItem :: number(), Hfs :: hfs_plain:hfs() | non_neg_integer()) -> cbf()
Creates a new counting bloom filter with the given hash function set and a fixed number of positions (bits in standard bloom filters) per item.
new_bin(Filter :: array:array(integer()), HfCount :: hfs_plain:hfs() | non_neg_integer(), ItemsCount :: non_neg_integer()) -> cbf()
Creates a new counting bloom filter with the given binary, hash function set and item count.
new(BitSize :: pos_integer(), HfCount :: hfs_plain:hfs() | non_neg_integer()) -> cbf()
Creates a new counting bloom filter.
Adds one item to the counting bloom filter.
Adds multiple items to the counting bloom filter.
p_add_list(Hfs :: hfs_plain:hfs(), BFSize :: pos_integer(), BF1 :: array:array(integer()), Items :: [key()]) -> BF2 :: array:array(integer())
Helper to add items to the counting bloom filter.
Removes one item from the counting bloom filter. (may introduce false negatives if removing an item not added previously)
Removes multiple items from the counting bloom filter. (may introduce false negatives if removing an item not added previously)
Returns true if the counting bloom filter contains this item.
item_count(Cbf :: cbf()) -> non_neg_integer()
Gets the number of items inserted into this counting bloom filter.
Joins two counting bloom filters so that the returned counting bloom filter represents their union.
Subtracts counting bloom filter A from B so that the returned counting bloom filter that approximates the set difference (with false positives and false negatives!).
to_bloom(Cbf :: cbf()) -> bloom:bloom_filter()
Checks whether two counting bloom filters are equal.
print(Cbf :: cbf()) -> [{atom(), any()}]
Returns counting bloom filter debug information.
get_property(Cbf :: cbf(), X2 :: fpr) -> float()
Generated by EDoc, Aug 2 2016, 13:42:52.