Returns the value chosen for K. K is the optimal number of hash functions based on the size of the Bloom filter and the expected number of inserted elements. @return optimal k.
()
source not stored for this graph (policy: none)
no outgoing calls