void function ( K arg0 , V arg1 ) { LeafEntry < K , V > loc0 = btree . insertEntry ( arg0 , arg1 ) ; btree . lockEntry ( loc0 ) ; if ( entry != null ) { btree . unlockEntry ( entry ) ; } entry = loc0 ; }
insert the key/value pair to the btree , move the current position to the insert point concode_field_sep LeafEntry<K,V> entry concode_elem_sep boolean beforeFirst concode_elem_sep BTree<K,V> btree concode_field_sep LeafEntry<K,V> getNextEntry concode_elem_sep boolean next concode_elem_sep K getKey concode_elem_sep int getTotalKeys concode_elem_sep boolean last concode_elem_sep boolean previous concode_elem_sep Collection<V> getValues concode_elem_sep void beforeFirst concode_elem_sep boolean isBeforeFirst concode_elem_sep void afterLast concode_elem_sep void remove concode_elem_sep V getValue concode_elem_sep boolean isAfterLast concode_elem_sep void setValue concode_elem_sep LeafEntry<K,V> getPrevEntry concode_elem_sep void close concode_elem_sep boolean first concode_elem_sep int getTotalValues concode_elem_sep boolean moveTo