question: binary log : finds the smallest power k such that 2 ^ k > = n concode_field_sep BitSet EMPTY_BITSET concode_elem_sep boolean FULLY_QUALIFIED_NAMES concode_field_sep long fact concode_elem_sep BigInteger fact concode_elem_sep double fact concode_elem_sep int fact concode_elem_sep String objArrayToString concode_elem_sep String objArrayToString concode_elem_sep boolean forAll concode_elem_sep String topLevelTypeString concode_elem_sep int[] realloc concode_elem_sep Collection<T> findAll concode_elem_sep String replaceAll concode_elem_sep boolean forSome concode_elem_sep void doForAll concode_elem_sep String removeAll concode_elem_sep boolean arrayContains concode_elem_sep void addIfNotNull concode_elem_sep T find concode_elem_sep boolean stringContains concode_elem_sep String removePackageName concode_elem_sep List<U> map concode_elem_sep String objectFieldsToString concode_elem_sep List<T> pickNAtRandom concode_elem_sep Set<U> mapToSet concode_elem_sep int hashArray concode_elem_sep String toStringNull concode_elem_sep void clear concode_elem_sep String str concode_elem_sep String str concode_elem_sep List<T> filter concode_elem_sep void filter concode_elem_sep int getInt concode_elem_sep boolean intersecting
target: int function ( long arg0 ) { int loc0 = 0 ; while ( ( 1 << loc0 ) < arg0 ) loc0 ++ ; return loc0 ; }