Constructs an empty Bloom filter. The total length of the Bloom filter will be c n. @param c is the number of bits used per element. @param n is the expected number of elements the filter will contain. @param k is the number of hash functions used.
(double c, int n, int k)
source not stored for this graph (policy: none)
nothing calls this directly
no outgoing calls
no test coverage detected