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 . concode_field_sep MessageDigest digestFunction concode_elem_sep int numberOfAddedElements concode_elem_sep String hashName concode_elem_sep Charset charset concode_elem_sep int filterSetSize concode_elem_sep double filtersPerElement concode_elem_sep int k concode_elem_sep List<BloomFilter> filterSet concode_elem_sep int expectedNumberOfElements concode_field_sep double getFalsePositiveProbability concode_elem_sep double getFalsePositiveProbability concode_elem_sep void add concode_elem_sep void updateAncestors concode_elem_sep double expectedFalsePositiveProbability concode_elem_sep void clear concode_elem_sep int count concode_elem_sep String sketchString concode_elem_sep BloomFilter getAllBloomFilters concode_elem_sep boolean contains concode_elem_sep int size concode_elem_sep int hashCode concode_elem_sep boolean equals concode_elem_sep BloomFilter get concode_elem_sep double getBitsPerElement concode_elem_sep double getExpectedBitsPerElement concode_elem_sep int getExpectedNumberOfElements concode_elem_sep long createHash concode_elem_sep long createHash concode_elem_sep long createHash
int function ( ) { return k ; }