int [ ] function ( long arg0 ) { for ( int loc0 = 0 ; loc0 < counts . length ; ++ loc0 ) { counts [ loc0 ] = 0 ; } for ( Long loc0 : map . values ( ) ) { counts [ findBucket ( arg0 - loc0 ) ] += 1 ; } return counts ; }
get the counts of how many keys are in each bucket . the same array is returned by each call to this method . concode_field_sep int[] counts concode_elem_sep HashMap<OBJ,Long> map concode_elem_sep long[] cuts concode_field_sep void add concode_elem_sep int findBucket concode_elem_sep void remove