private void linkNodeLast ( LinkedHashMapEntry < K , V > p ) { LinkedHashMapEntry < K , V > last = tail ; tail = p ; if ( last == null ) head = p ; else { p . before = last ; last . after = p ; } }
link at the end of list