Copyright © 2011 Zuse Institute Berlin
Version: $Id$
Authors: Maik Lange (malange@informatik.hu-berlin.de).
References
cell() = {Count :: non_neg_integer(), KeySum :: binary(), KeyHashSum :: non_neg_integer(), ValSum :: value(), ValHashSum :: non_neg_integer()}
iblt() = #iblt{hfs = hfs_lhsp:hfs(), table = table(), cell_count = non_neg_integer(), col_size = non_neg_integer(), item_count = non_neg_integer()}
option() = prime
options() = [] | [option()]
table() = [] | [{ColNr :: pos_integer(), Cells :: [cell()]}]
value() = integer()
new/2 | |
new/3 | |
insert/3 | |
delete/3 | |
get/2 | |
list_entries/1 | lists all correct entries of this structure correct entries can be retrieved out of pure cells a pure cell := count = 1 and check_sum(keySum)=keyHashSum and check_sum(valSum)=valHashSum. |
is_element/2 | |
get_fpr/1 | calculates actual false positive rate depending on saturation degree. |
get_prop/2 |
new(Hfs :: hfs_lhsp:hfs(), CellCount :: pos_integer()) -> iblt()
new(Hfs :: hfs_lhsp:hfs(), CellCount :: pos_integer(), Options :: options()) -> iblt()
insert(IBLT :: iblt(), Key :: rt_chord:key(), Value :: value()) -> iblt()
delete(IBLT :: iblt(), Key :: rt_chord:key(), Value :: value()) -> iblt()
get(Iblt :: iblt(), Key :: rt_chord:key()) -> value() | not_found
list_entries(IBLT :: iblt()) -> [{rt_chord:key(), value()}]
lists all correct entries of this structure correct entries can be retrieved out of pure cells a pure cell := count = 1 and check_sum(keySum)=keyHashSum and check_sum(valSum)=valHashSum
is_element(Iblt :: iblt(), Key :: rt_chord:key()) -> boolean()
get_fpr(Iblt :: iblt()) -> float()
calculates actual false positive rate depending on saturation degree
get_prop(Prop :: atom(), IBLT :: iblt()) -> any()
Generated by EDoc, Sep 11 2020, 15:25:20.