public int searchLeft ( SearchComparator comp , Object searchKey ) { int idx = - 1 ; int top = middleIndex ( ) ; if ( comp . type ( ) == SearchComparator . EQ ) idx = findEqual ( comp , 0 , top , searchKey ) ; else idx = findGreater ( comp , 0 , top , searchKey ) ; return idx ; }
Search the left half of the node .