public int findLowestKey ( int min ) { int lowest = Integer . MAX_VALUE ; int index = index ( hash ( min ) ) ; final int maxTry = capacity ; for ( int i = 0 ; i < maxTry ; i ++ ) { if ( ! slotIsFree ( index ) ) { int k = keys [ index ] ; if ( k == min ) return min ; if ( min < k && k < lowest ) lowest = k ; } index = nextIndex ( index ) ; } return lowest ; }
Finds the highest key GE min for which there is a value .