public int searchRight ( SearchComparator comp , Object searchKey ) { int idx = - 1 ; int bot = middleIndex ( ) ; int right = rightMostIndex ( ) ; if ( bot > right ) { String x = "bot = " + bot + ", right = " + right ; throw new OptimisticDepthException ( x ) ; } if ( comp . type ( ) == SearchComparator . EQ ) idx = findEqual ( comp , bot , right , searchKey ) ; else idx = findGreater ( comp , bot , right , searchKey ) ; return idx ; }
Search the right half of the node .