Method put

classpath/java/util/LinkedHashMap.java:49–62

(K key, V value)

  }

  public V put(K key, V value) {
    if (!super.containsKey(key)) {
      LinkedKey<K> k = new LinkedKey<K>(key);
      if (first == null) {
        first = k;
      } else {
        last.next = k;
        k.previous = last;
      }
      last = k;
      lookup.put(key, k);
    }
    return super.put(key, value);
  }

  public V remove(Object key) {
    LinkedKey<K> linked = lookup.get(key);