it.unimi.dsi.fastutil.ints.AbstractInt2IntMap Maven / Gradle / Ivy
Show all versions of java-commons Show documentation
/* Generic definitions */
/* Assertions (useful to generate conditional code) */
/* Current type and class (and size, if applicable) */
/* Value methods */
/* Interfaces (keys) */
/* Interfaces (values) */
/* Abstract implementations (keys) */
/* Abstract implementations (values) */
/* Static containers (keys) */
/* Static containers (values) */
/* Implementations */
/* Synchronized wrappers */
/* Unmodifiable wrappers */
/* Other wrappers */
/* Methods (keys) */
/* Methods (values) */
/* Methods (keys/values) */
/* Methods that have special names depending on keys (but the special names depend on values) */
/* Equality */
/* Object/Reference-only definitions (keys) */
/* Primitive-type-only definitions (keys) */
/* Object/Reference-only definitions (values) */
/* Primitive-type-only definitions (values) */
/*
* Copyright (C) 2002-2016 Sebastiano Vigna
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package it.unimi.dsi.fastutil.ints;
import it.unimi.dsi.fastutil.objects.ObjectIterator;
import it.unimi.dsi.fastutil.objects.ObjectSet;
import java.util.Iterator;
import java.util.Map;
/**
* An abstract class providing basic methods for maps implementing a
* type-specific interface.
*
*
* Optional operations just throw an {@link UnsupportedOperationException}.
* Generic versions of accessors delegate to the corresponding type-specific
* counterparts following the interface rules (they take care of returning
* null on a missing key).
*
*
* As a further help, this class provides a {@link BasicEntry BasicEntry} inner
* class that implements a type-specific version of {@link Map.Entry};
* it is particularly useful for those classes that do not implement their own
* entries (e.g., most immutable maps).
*/
public abstract class AbstractInt2IntMap extends AbstractInt2IntFunction
implements
Int2IntMap,
java.io.Serializable {
private static final long serialVersionUID = -4940583368468432370L;
protected AbstractInt2IntMap() {
}
public boolean containsValue(Object ov) {
if (ov == null)
return false;
return containsValue(((((Integer) (ov)).intValue())));
}
/** Checks whether the given value is contained in {@link #values()}. */
public boolean containsValue(int v) {
return values().contains(v);
}
/** Checks whether the given value is contained in {@link #keySet()}. */
public boolean containsKey(int k) {
return keySet().contains(k);
}
/**
* Puts all pairs in the given map. If the map implements the interface of
* this map, it uses the faster iterators.
*
* @param m
* a map.
*/
@SuppressWarnings("deprecation")
public void putAll(Map m) {
int n = m.size();
final Iterator> i = m
.entrySet().iterator();
if (m instanceof Int2IntMap) {
Int2IntMap.Entry e;
while (n-- != 0) {
e = (Int2IntMap.Entry) i.next();
put(e.getIntKey(), e.getIntValue());
}
} else {
Map.Entry e;
while (n-- != 0) {
e = i.next();
put(e.getKey(), e.getValue());
}
}
}
public boolean isEmpty() {
return size() == 0;
}
/**
* This class provides a basic but complete type-specific entry class for
* all those maps implementations that do not have entries on their own
* (e.g., most immutable maps).
*
*
* This class does not implement
* {@link Map.Entry#setValue(Object) setValue()}, as the
* modification would not be reflected in the base map.
*/
public static class BasicEntry implements Int2IntMap.Entry {
protected int key;
protected int value;
public BasicEntry(final Integer key, final Integer value) {
this.key = ((key).intValue());
this.value = ((value).intValue());
}
public BasicEntry(final int key, final int value) {
this.key = key;
this.value = value;
}
/**
* {@inheritDoc}
*
* @deprecated Please use the corresponding type-specific method
* instead.
*/
@Deprecated
public Integer getKey() {
return (Integer.valueOf(key));
}
public int getIntKey() {
return key;
}
/**
* {@inheritDoc}
*
* @deprecated Please use the corresponding type-specific method
* instead.
*/
@Deprecated
public Integer getValue() {
return (Integer.valueOf(value));
}
public int getIntValue() {
return value;
}
public int setValue(final int value) {
throw new UnsupportedOperationException();
}
/**
* {@inheritDoc}
*
* @deprecated Please use the corresponding type-specific method
* instead.
*/
@Deprecated
public Integer setValue(final Integer value) {
return Integer.valueOf(setValue(value.intValue()));
}
public boolean equals(final Object o) {
if (!(o instanceof Map.Entry))
return false;
final Map.Entry e = (Map.Entry) o;
if (e.getKey() == null || !(e.getKey() instanceof Integer))
return false;
if (e.getValue() == null || !(e.getValue() instanceof Integer))
return false;
return ((key) == (((((Integer) (e.getKey())).intValue()))))
&& ((value) == (((((Integer) (e.getValue())).intValue()))));
}
public int hashCode() {
return (key) ^ (value);
}
public String toString() {
return key + "->" + value;
}
}
/**
* Returns a type-specific-set view of the keys of this map.
*
*
* The view is backed by the set returned by {@link #entrySet()}. Note that
* no attempt is made at caching the result of this method, as this
* would require adding some attributes that lightweight implementations
* would not need. Subclasses may easily override this policy by calling
* this method and caching the result, but implementors are encouraged to
* write more efficient ad-hoc implementations.
*
* @return a set view of the keys of this map; it may be safely cast to a
* type-specific interface.
*/
public IntSet keySet() {
return new AbstractIntSet() {
public boolean contains(final int k) {
return containsKey(k);
}
public int size() {
return AbstractInt2IntMap.this.size();
}
public void clear() {
AbstractInt2IntMap.this.clear();
}
public IntIterator iterator() {
return new AbstractIntIterator() {
final ObjectIterator> i = entrySet()
.iterator();
@Override
public int nextInt() {
return ((Int2IntMap.Entry) i.next()).getIntKey();
};
@Override
public boolean hasNext() {
return i.hasNext();
}
@Override
public void remove() {
i.remove();
}
};
}
};
}
/**
* Returns a type-specific-set view of the values of this map.
*
*
* The view is backed by the set returned by {@link #entrySet()}. Note that
* no attempt is made at caching the result of this method, as this
* would require adding some attributes that lightweight implementations
* would not need. Subclasses may easily override this policy by calling
* this method and caching the result, but implementors are encouraged to
* write more efficient ad-hoc implementations.
*
* @return a set view of the values of this map; it may be safely cast to a
* type-specific interface.
*/
public IntCollection values() {
return new AbstractIntCollection() {
public boolean contains(final int k) {
return containsValue(k);
}
public int size() {
return AbstractInt2IntMap.this.size();
}
public void clear() {
AbstractInt2IntMap.this.clear();
}
public IntIterator iterator() {
return new AbstractIntIterator() {
final ObjectIterator> i = entrySet()
.iterator();
/**
* {@inheritDoc}
*
* @deprecated Please use the corresponding type-specific
* method instead.
*/
@Deprecated
public int nextInt() {
return ((Int2IntMap.Entry) i.next()).getIntValue();
};
public boolean hasNext() {
return i.hasNext();
}
};
}
};
}
@SuppressWarnings({"unchecked", "rawtypes"})
public ObjectSet> entrySet() {
return (ObjectSet) int2IntEntrySet();
}
/**
* Returns a hash code for this map.
*
* The hash code of a map is computed by summing the hash codes of its
* entries.
*
* @return a hash code for this map.
*/
public int hashCode() {
int h = 0, n = size();
final ObjectIterator> i = entrySet()
.iterator();
while (n-- != 0)
h += i.next().hashCode();
return h;
}
public boolean equals(Object o) {
if (o == this)
return true;
if (!(o instanceof Map))
return false;
Map m = (Map) o;
if (m.size() != size())
return false;
return entrySet().containsAll(m.entrySet());
}
public String toString() {
final StringBuilder s = new StringBuilder();
final ObjectIterator> i = entrySet()
.iterator();
int n = size();
Int2IntMap.Entry e;
boolean first = true;
s.append("{");
while (n-- != 0) {
if (first)
first = false;
else
s.append(", ");
e = (Int2IntMap.Entry) i.next();
s.append(String.valueOf(e.getIntKey()));
s.append("=>");
s.append(String.valueOf(e.getIntValue()));
}
s.append("}");
return s.toString();
}
}