/* * Copyright (c) 2003, the JUNG Project and the Regents of the University * of California * All rights reserved. * * This software is open-source under the BSD license; see either * "license.txt" or * http://jung.sourceforge.net/license.txt for a description. */ package edu.uci.ics.jung.algorithms.util; import java.util.Collection; import java.util.Collections; import java.util.Map; import java.util.Set; /** * An implementation of Map that returns the constructor-supplied * value for any input. * * @param the key type * @param the value type */ public class ConstantMap implements Map { private Map delegate; /** * Creates an instance whose {@code get} method always returns {@code value}. */ public ConstantMap(V value) { delegate = Collections.unmodifiableMap(Collections.singletonMap(null, value)); } public V get(Object key) { return delegate.get(null); } public void clear() { delegate.clear(); } public boolean containsKey(Object key) { return true; } public boolean containsValue(Object value) { return delegate.containsValue(value); } public Set> entrySet() { return delegate.entrySet(); } @Override public boolean equals(Object o) { return delegate.equals(o); } @Override public int hashCode() { return delegate.hashCode(); } public boolean isEmpty() { return delegate.isEmpty(); } public Set keySet() { return delegate.keySet(); } public V put(K key, V value) { return delegate.put(key, value); } public void putAll(Map t) { delegate.putAll(t); } public V remove(Object key) { return delegate.remove(key); } public int size() { return delegate.size(); } public Collection values() { return delegate.values(); } }