K leftKey = entry.getKey();
      V leftValue = entry.getValue();
      if (right.containsKey(leftKey)) {
        /*
         * The cast is safe because onlyOnRight contains all the keys of right.
         *
         * TODO(cpovirk): Consider checking onlyOnRight.containsKey instead of right.containsKey.
         * That could change behavior if the input maps use different equivalence relations (and so

      K leftKey = entry.getKey();
      V leftValue = entry.getValue();
      if (right.containsKey(leftKey)) {
        /*
         * The cast is safe because onlyOnRight contains all the keys of right.
         *
         * TODO(cpovirk): Consider checking onlyOnRight.containsKey instead of right.containsKey.
         * That could change behavior if the input maps use different equivalence relations (and so

    segmentFor(hash).refresh(key, hash, defaultLoader, false);
  }

  @Override
  public boolean containsKey(@CheckForNull Object key) {
    // does not impact recency ordering
    if (key == null) {
      return false;
    }
    int hash = hash(key);
    return segmentFor(hash).containsKey(key, hash);
  }

  @Override
  public boolean containsValue(@CheckForNull Object value) {

    segmentFor(hash).refresh(key, hash, defaultLoader, false);
  }

  @Override
  public boolean containsKey(@CheckForNull Object key) {
    // does not impact recency ordering
    if (key == null) {
      return false;
    }
    int hash = hash(key);
    return segmentFor(hash).containsKey(key, hash);
  }

  @Override
  public boolean containsValue(@CheckForNull Object value) {

java.util.Map); public int getCacheSize(); public java.util.Map getBackingMap(); public void flush(); public Object get(Object); private Object getCacheMissed(Object, int); public Object put(Object, Object); public Object remove(Object); public boolean containsKey(Object); public int size(); public boolean isEmpty(); public boolean containsValue(Object); public void putAll(java.util.Map); public void clear(); public java.util.Set keySet(); public java.util.Collection values(); public java.util.Set entrySet();...

java.util.Map); public int getCacheSize(); public java.util.Map getBackingMap(); public void flush(); public Object get(Object); private Object getCacheMissed(Object, int); public Object put(Object, Object); public Object remove(Object); public boolean containsKey(Object); public int size(); public boolean isEmpty(); public boolean containsValue(Object); public void putAll(java.util.Map); public void clear(); public java.util.Set keySet(); public java.util.Collection values(); public java.util.Set entrySet();...

java.util.Map); public int getCacheSize(); public java.util.Map getBackingMap(); public void flush(); public Object get(Object); private Object getCacheMissed(Object, int); public Object put(Object, Object); public Object remove(Object); public boolean containsKey(Object); public int size(); public boolean isEmpty(); public boolean containsValue(Object); public void putAll(java.util.Map); public void clear(); public java.util.Set keySet(); public java.util.Collection values(); public java.util.Set entrySet();...

ions; public synchronized class ComponentMap extends AbstractComponentCol implements java.util.Map { private java.util.Map components; public void ComponentMap(String, java.util.Map); public int size(); public boolean isEmpty(); public boolean containsKey(Object); public boolean containsValue(Object); public Object get(Object); public Object put(Object, Object); public Object remove(Object); public void putAll(java.util.Map); public void clear(); public java.util.Set keySet(); public java.util.Collection...

             */
            try {
                entries = doDfsRootEnum();
                for (int ei = 0; ei < entries.length; ei++) {
                    e = entries[ei];
                    if (map.containsKey(e) == false)
                        map.put(e, e);
                }
            } catch (IOException ioe) {
                if (log.level >= 4)
                    ioe.printStackTrace(log);
            }

java.util.Map); public int getCacheSize(); public java.util.Map getBackingMap(); public void flush(); public Object get(Object); private Object getCacheMissed(Object, int); public Object put(Object, Object); public Object remove(Object); public boolean containsKey(Object); public int size(); public boolean isEmpty(); public boolean containsValue(Object); public void putAll(java.util.Map); public void clear(); public java.util.Set keySet(); public java.util.Collection values(); public java.util.Set entrySet();...