insert a value in the map , replacing any old value with the same key . concode_field_sep WeakHashMap<K,V> mapOld concode_elem_sep int move concode_elem_sep EcoDb instance concode_elem_sep String var concode_elem_sep String[] strPool concode_elem_sep int distToEcoTree concode_elem_sep int maxSize concode_elem_sep int nextSibling concode_elem_sep String opn concode_elem_sep int ecoIdx concode_elem_sep byte[] nodesBuffer concode_elem_sep WeakHashMap<K,V> mapNew concode_elem_sep String eco concode_elem_sep WeakLRUCache<GameTree.Node,CacheEntry> gtNodeToIdx concode_elem_sep int varIdx concode_elem_sep int firstChild concode_elem_sep HashMap<Long,Short> posHashToNodeIdx concode_elem_sep int opnIdx concode_elem_sep long startPosHash concode_elem_sep HashMap<Long,ArrayList<Short>> posHashToNodeIdx2 concode_elem_sep int nodeIdx concode_field_sep void insertNew concode_elem_sep String getName concode_elem_sep Result getEco concode_elem_sep V get concode_elem_sep int getS16 concode_elem_sep CacheEntry findNode concode_elem_sep void cacheNode concode_elem_sep void populateCache concode_elem_sep EcoDb getInstance concode_elem_sep int getU16 concode_elem_sep ArrayList<Move> getMoves concode_elem_sep Node readNode concode_elem_sep Node readNode
void function ( K arg0 , V arg1 ) { if ( mapNew . containsKey ( arg0 ) ) { mapNew . put ( arg0 , arg1 ) ; } else { if ( mapOld . containsKey ( arg0 ) ) mapOld . remove ( arg0 ) ; insertNew ( arg0 , arg1 ) ; } }