void function ( K arg0 , V arg1 ) { if ( arg0 != null && map . containsKey ( arg0 ) ) { return ; } LinkedValue < K , V > loc0 = new LinkedValue < K , V > ( arg0 , arg1 ) ; loc0 . next = header . next ; loc0 . prev = header ; header . next . prev = loc0 ; header . next = loc0 ; if ( arg0 != null ) { map . put ( arg0 , loc0 ) ; } }
adds a value at the start of the list concode_field_sep LinkedValue<K,V> next concode_elem_sep LinkedValue<K,V> prev concode_elem_sep LinkedValue<K,V> header concode_elem_sep V value concode_elem_sep HashMap<K,LinkedValue<K,V>> map concode_elem_sep K key concode_field_sep void add concode_elem_sep V pop concode_elem_sep boolean isEmpty concode_elem_sep V remove