class EntrySet extends AbstractSet<Entry<K, V>> {
    @Override
    public int size() {
      return size;
    }

    @Override
    public Iterator<Entry<K, V>> iterator() {
      return new LinkedTreeMapIterator<Entry<K, V>>() {
        @Override
        public Entry<K, V> next() {
          return nextNode();
        }
      };
    }

    @Override
    public boolean contains(Object o) {
      return o instanceof Entry && findByEntry((Entry<?, ?>) o) != null;
    }

    @Override
    public boolean remove(Object o) {<FILL_FUNCTION_BODY>}

    @Override
    public void clear() {
      LinkedTreeMap.this.clear();
    }
  }

      if (!(o instanceof Entry)) {
        return false;
      }

      Node<K, V> node = findByEntry((Entry<?, ?>) o);
      if (node == null) {
        return false;
      }
      removeInternal(node, true);
      return true;
    
<methods>public void clear() ,public boolean containsKey(java.lang.Object) ,public boolean containsValue(java.lang.Object) ,public abstract Set<Entry<K,V>> entrySet() ,public boolean equals(java.lang.Object) ,public V get(java.lang.Object) ,public int hashCode() ,public boolean isEmpty() ,public Set<K> keySet() ,public V put(K, V) ,public void putAll(Map<? extends K,? extends V>) ,public V remove(java.lang.Object) ,public int size() ,public java.lang.String toString() ,public Collection<V> values() <variables>transient Set<K> keySet,transient Collection<V> values