int function ( int arg0 ) { int loc0 = Arrays . binarySearch ( primeCapacities , arg0 ) ; if ( loc0 < 0 ) { loc0 = - loc0 - 1 ; } return primeCapacities [ loc0 ] ; }
returns a prime number which is > = desiredcapacity and very close to desiredcapacity within 11 % if desiredcapacity > = 1000 . concode_field_sep int[] primeCapacities concode_elem_sep int largestPrime concode_field_sep placeholderType placeHolder