be.bagofwords.cache.fastutil.AbstractLong2LongMap Maven / Gradle / Ivy
package be.bagofwords.cache.fastutil;
/* 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-2014 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.
*
* Modified by Koen Deschacht ([email protected]), 2014-11-11
*/
import it.unimi.dsi.fastutil.longs.*;
import it.unimi.dsi.fastutil.objects.ObjectIterator;
import it.unimi.dsi.fastutil.objects.ObjectSet;
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 java.util.Map.Entry}; it
* is particularly useful for those classes that do not implement their own
* entries (e.g., most immutable maps).
*/
public abstract class AbstractLong2LongMap implements Long2LongMap, java.io.Serializable {
private static final long serialVersionUID = -4940583368468432370L;
protected AbstractLong2LongMap() {
}
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 java.util.Map.Entry#setValue(Object) setValue()}, as the modification
* would not be reflected in the base map.
*/
public static class BasicEntry implements Long2LongMap.Entry {
protected long key;
protected long value;
public BasicEntry(final Long key, final Long value) {
this.key = key;
this.value = value;
}
public BasicEntry(final long key, final long value) {
this.key = key;
this.value = value;
}
public long getKey() {
return key;
}
public long getLongKey() {
return key;
}
public Long getValue() {
return (Long.valueOf(value));
}
public long getLongValue() {
return value;
}
public void setValue(final Long value) {
this.value = value;
}
public boolean equals(final Object o) {
if (!(o instanceof Map.Entry)) return false;
Map.Entry e = (Map.Entry) o;
return ((key) == (((((Long) (e.getKey())).longValue())))) && ((value) == (((((Long) (e.getValue())).longValue()))));
}
public int hashCode() {
return it.unimi.dsi.fastutil.HashCommon.long2int(key) ^ it.unimi.dsi.fastutil.HashCommon.long2int(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 LongSet keySet() {
return new AbstractLongSet() {
public boolean contains(final long k) {
return containsKey(k);
}
public int size() {
return AbstractLong2LongMap.this.size();
}
public void clear() {
AbstractLong2LongMap.this.clear();
}
public LongIterator iterator() {
return new AbstractLongIterator() {
final ObjectIterator> i = entrySet().iterator();
public long nextLong() {
return ((Long2LongMap.Entry) i.next()).getKey();
}
;
public boolean hasNext() {
return i.hasNext();
}
};
}
};
}
/**
* 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 LongCollection values() {
return new AbstractLongCollection() {
public boolean contains(final long k) {
return containsValue(k);
}
public int size() {
return AbstractLong2LongMap.this.size();
}
public void clear() {
AbstractLong2LongMap.this.clear();
}
public LongIterator iterator() {
return new AbstractLongIterator() {
final ObjectIterator> i = entrySet().iterator();
public long nextLong() {
return i.next().getValue();
}
;
public boolean hasNext() {
return i.hasNext();
}
};
}
};
}
@SuppressWarnings({"unchecked", "rawtypes"})
public ObjectSet> entrySet() {
return (ObjectSet) long2LongEntrySet();
}
/**
* 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();
Long2LongMap.Entry e;
boolean first = true;
s.append("{");
while (n-- != 0) {
if (first) first = false;
else s.append(", ");
e = (Long2LongMap.Entry) i.next();
s.append(String.valueOf(e.getKey()));
s.append("=>");
s.append(String.valueOf(e.getValue()));
}
s.append("}");
return s.toString();
}
}