Copyright © 2016 Zuse Institute Berlin
Version: $Id$
Behaviours: hfs_beh.
Authors: Nico Kruber (kruber@zib.de).
abstract datatype: hfs()
itemKey() = any()
apply_val/2 | Hashes Val K-times as defined by the HFS. |
apply_val/3 | Hashes Val with the I'th hash function as defined by the HFS. |
apply_val_feeder/3 | |
apply_val_rem/3 | Hashes Val K-times as defined by the HFS and returns only remainders of divisions by Rem. |
apply_val_rem_feeder/3 | |
new/1 | returns a new hfs with default functions. |
size/1 | Returns number of hash functions in the container. |
tester_create_hfs/1 |
new(HFCount :: pos_integer()) -> hfs()
returns a new hfs with default functions
Hashes Val K-times as defined by the HFS.
apply_val_rem_feeder(HFS :: hfs(), Val :: itemKey(), Rem :: pos_integer()) -> {hfs(), itemKey(), Rem :: pos_integer()}
apply_val_rem(X1 :: hfs(), Val :: itemKey(), Rem :: 2..340282366920938463463374607431768211455) -> [non_neg_integer(), ...]
Hashes Val K-times as defined by the HFS and returns only remainders of divisions by Rem.
apply_val_feeder(HFS :: hfs(), I :: pos_integer(), Val :: itemKey()) -> {hfs(), pos_integer(), itemKey()}
Hashes Val with the I'th hash function as defined by the HFS. (I = 1..hfs_size). NOTE: When multiple different I are needed, prefer apply_val/2 since that function is faster.
size(X1 :: hfs()) -> pos_integer()
Returns number of hash functions in the container
tester_create_hfs(X1 :: {hfs_plain, Hf_count :: 1..100, HashFun :: hfs_beh:hfs_fun()}) -> hfs()
Generated by EDoc, Aug 2 2016, 13:42:52.