void function ( @ Nonnegative long arg0 ) { checkArgument ( arg0 >= 0 ) ; int loc0 = ( int ) Math . min ( arg0 , Integer . MAX_VALUE >>> 1 ) ; if ( ( table != null ) && ( table . length >= loc0 ) ) { return ; } table = new long [ ( loc0 == 0 ) ? 1 : ceilingNextPowerOfTwo ( loc0 ) ] ; tableMask = Math . max ( 0 , table . length - 1 ) ; }
increases the capacity of this frequencysketch instance , if necessary , to ensure that it can accurately estimate the popularity of elements given the maximum size of the cache . this operation forgets all previous counts when resizing . concode_field_sep int randomSeed concode_elem_sep long RESET_MASK concode_elem_sep boolean conservative concode_elem_sep int tableMask concode_elem_sep long[] table concode_elem_sep long[] SEED concode_field_sep boolean incrementAt concode_elem_sep void tryReset concode_elem_sep void increment concode_elem_sep void regularIncrement concode_elem_sep int ceilingNextPowerOfTwo concode_elem_sep void conservativeIncrement concode_elem_sep int indexOf concode_elem_sep int frequency concode_elem_sep int spread