question: compares two nodes by their first keys . concode_field_sep int BINARY_SEARCH_THRESHOLD concode_elem_sep OMVRBTree<K,V> tree concode_elem_sep int pageSplitItems concode_field_sep int getDepth concode_elem_sep void setLeft concode_elem_sep void insert concode_elem_sep V binarySearch concode_elem_sep OMVRBTreeEntry<K,V> getLeftInMemory concode_elem_sep K getKeyAt concode_elem_sep K getLastKey concode_elem_sep void remove concode_elem_sep OMVRBTree<K,V> getTree concode_elem_sep V search concode_elem_sep V getValueAt concode_elem_sep K getFirstKey concode_elem_sep OMVRBTreeEntry<K,V> setParent concode_elem_sep K getKey concode_elem_sep K getKey concode_elem_sep void init concode_elem_sep OMVRBTreeEntry<K,V> getParent concode_elem_sep int getFreeSpace concode_elem_sep V linearSearch concode_elem_sep boolean getColor concode_elem_sep void copyFrom concode_elem_sep OMVRBTreeEntry<K,V> getRightInMemory concode_elem_sep OMVRBTreeEntry<K,V> getParentInMemory concode_elem_sep V getValue concode_elem_sep V getValue concode_elem_sep int getSize concode_elem_sep int getPageSize concode_elem_sep OMVRBTreeEntry<K,V> getRight concode_elem_sep OMVRBTreeEntry<K,V> getNextInMemory concode_elem_sep OMVRBTreeEntry<K,V> getFirstInMemory concode_elem_sep void setColor concode_elem_sep OMVRBTreeEntry<K,V> getPreviousInMemory concode_elem_sep void setRight concode_elem_sep String toString concode_elem_sep OMVRBTreeEntry<K,V> getLeft concode_elem_sep int getPageSplitItems
target: int function ( final OMVRBTreeEntry < K , V > arg0 ) { if ( arg0 == null ) return 1 ; if ( arg0 == this ) return 0 ; if ( getSize ( ) == 0 ) return - 1 ; if ( arg0 . getSize ( ) == 0 ) return 1 ; if ( tree . comparator != null ) return tree . comparator . compare ( getFirstKey ( ) , arg0 . getFirstKey ( ) ) ; return ( ( Comparable < K > ) getFirstKey ( ) ) . compareTo ( arg0 . getFirstKey ( ) ) ; }