long function ( int [ ] arg0 ) { long loc0 = Long . MAX_VALUE ; for ( int loc1 = 0 ; loc1 < depth ; ++ loc1 ) { loc0 = Math . min ( loc0 , table [ loc1 ] [ arg0 [ loc1 ] ] ) ; } return loc0 ; }
the estimate is correct within ` epsilon ' total item count , with probability confidence . concode_field_sep int depth concode_elem_sep long size concode_elem_sep int[] recyclableCMSHashBuckets concode_elem_sep double confidence concode_elem_sep int width concode_elem_sep double eps concode_elem_sep long[][] table concode_field_sep long addObjectAndEstimateCount concode_elem_sep int mixLast concode_elem_sep int[] preallocateHashBucketsArray concode_elem_sep double confidence concode_elem_sep void hashBuckets concode_elem_sep double relativeError concode_elem_sep void initTablesWith concode_elem_sep long size concode_elem_sep int avalanche concode_elem_sep int bytesHash concode_elem_sep String toString concode_elem_sep int hashLong concode_elem_sep int mix concode_elem_sep int hash