All Downloads are FREE. Search and download functionalities are using the official Maven repository.

it.unimi.dsi.fastutil.doubles.AbstractDouble2FloatMap Maven / Gradle / Ivy

Go to download

fastutil extends the Java Collections Framework by providing type-specific maps, sets, lists and priority queues with a small memory footprint and fast access and insertion; provides also big (64-bit) arrays, sets and lists, and fast, practical I/O classes for binary and text files.

There is a newer version: 8.5.15
Show newest version
/*
	* Copyright (C) 2002-2020 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.doubles;
import it.unimi.dsi.fastutil.floats.FloatCollection;
import it.unimi.dsi.fastutil.floats.AbstractFloatCollection;
import it.unimi.dsi.fastutil.floats.FloatIterator;
import it.unimi.dsi.fastutil.objects.ObjectIterator;
import it.unimi.dsi.fastutil.objects.AbstractObjectSet;
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 * {@code 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 AbstractDouble2FloatMap extends AbstractDouble2FloatFunction implements Double2FloatMap, java.io.Serializable { private static final long serialVersionUID = -4940583368468432370L; protected AbstractDouble2FloatMap() { } @Override public boolean containsValue(final float v) { return values().contains(v); } @Override public boolean containsKey(final double k) { final ObjectIterator i = double2FloatEntrySet().iterator(); while (i.hasNext()) if (i.next().getDoubleKey() == k) return true; return false; } @Override 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 Double2FloatMap.Entry { protected double key; protected float value; public BasicEntry() { } public BasicEntry(final Double key, final Float value) { this.key = (key).doubleValue(); this.value = (value).floatValue(); } public BasicEntry(final double key, final float value) { this.key = key; this.value = value; } @Override public double getDoubleKey() { return key; } @Override public float getFloatValue() { return value; } @Override public float setValue(final float value) { throw new UnsupportedOperationException(); } @Override public boolean equals(final Object o) { if (!(o instanceof Map.Entry)) return false; if (o instanceof Double2FloatMap.Entry) { final Double2FloatMap.Entry e = (Double2FloatMap.Entry) o; return (Double.doubleToLongBits(key) == Double.doubleToLongBits(e.getDoubleKey())) && (Float.floatToIntBits(value) == Float.floatToIntBits(e.getFloatValue())); } final Map.Entry e = (Map.Entry) o; final Object key = e.getKey(); if (key == null || !(key instanceof Double)) return false; final Object value = e.getValue(); if (value == null || !(value instanceof Float)) return false; return (Double.doubleToLongBits(this.key) == Double.doubleToLongBits(((Double) (key)).doubleValue())) && (Float.floatToIntBits(this.value) == Float.floatToIntBits(((Float) (value)).floatValue())); } @Override public int hashCode() { return it.unimi.dsi.fastutil.HashCommon.double2int(key) ^ it.unimi.dsi.fastutil.HashCommon.float2int(value); } @Override public String toString() { return key + "->" + value; } } /** * This class provides a basic implementation for an Entry set which forwards * some queries to the map. */ public abstract static class BasicEntrySet extends AbstractObjectSet { protected final Double2FloatMap map; public BasicEntrySet(final Double2FloatMap map) { this.map = map; } @Override public boolean contains(final Object o) { if (!(o instanceof Map.Entry)) return false; if (o instanceof Double2FloatMap.Entry) { final Double2FloatMap.Entry e = (Double2FloatMap.Entry) o; final double k = e.getDoubleKey(); return map.containsKey(k) && (Float.floatToIntBits(map.get(k)) == Float.floatToIntBits(e.getFloatValue())); } final Map.Entry e = (Map.Entry) o; final Object key = e.getKey(); if (key == null || !(key instanceof Double)) return false; final double k = ((Double) (key)).doubleValue(); final Object value = e.getValue(); if (value == null || !(value instanceof Float)) return false; return map.containsKey(k) && (Float.floatToIntBits(map.get(k)) == Float.floatToIntBits(((Float) (value)).floatValue())); } @Override public boolean remove(final Object o) { if (!(o instanceof Map.Entry)) return false; if (o instanceof Double2FloatMap.Entry) { final Double2FloatMap.Entry e = (Double2FloatMap.Entry) o; return map.remove(e.getDoubleKey(), e.getFloatValue()); } Map.Entry e = (Map.Entry) o; final Object key = e.getKey(); if (key == null || !(key instanceof Double)) return false; final double k = ((Double) (key)).doubleValue(); final Object value = e.getValue(); if (value == null || !(value instanceof Float)) return false; final float v = ((Float) (value)).floatValue(); return map.remove(k, v); } @Override public int size() { return map.size(); } } /** * Returns a type-specific-set view of the keys of this map. * *

* The view is backed by the set returned by {@link Map#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. */ @Override public DoubleSet keySet() { return new AbstractDoubleSet() { @Override public boolean contains(final double k) { return containsKey(k); } @Override public int size() { return AbstractDouble2FloatMap.this.size(); } @Override public void clear() { AbstractDouble2FloatMap.this.clear(); } @Override public DoubleIterator iterator() { return new DoubleIterator() { private final ObjectIterator i = Double2FloatMaps .fastIterator(AbstractDouble2FloatMap.this); @Override public double nextDouble() { return i.next().getDoubleKey(); }; @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 Map#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. */ @Override public FloatCollection values() { return new AbstractFloatCollection() { @Override public boolean contains(final float k) { return containsValue(k); } @Override public int size() { return AbstractDouble2FloatMap.this.size(); } @Override public void clear() { AbstractDouble2FloatMap.this.clear(); } @Override public FloatIterator iterator() { return new FloatIterator() { private final ObjectIterator i = Double2FloatMaps .fastIterator(AbstractDouble2FloatMap.this); @Override public float nextFloat() { return i.next().getFloatValue(); } @Override public boolean hasNext() { return i.hasNext(); } }; } }; } /** {@inheritDoc} */ @SuppressWarnings({"unchecked", "deprecation"}) @Override public void putAll(final Map m) { if (m instanceof Double2FloatMap) { ObjectIterator i = Double2FloatMaps.fastIterator((Double2FloatMap) m); while (i.hasNext()) { final Double2FloatMap.Entry e = i.next(); put(e.getDoubleKey(), e.getFloatValue()); } } else { int n = m.size(); final Iterator> i = m.entrySet().iterator(); Map.Entry e; while (n-- != 0) { e = i.next(); put(e.getKey(), e.getValue()); } } } /** * 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. */ @Override public int hashCode() { int h = 0, n = size(); final ObjectIterator i = Double2FloatMaps.fastIterator(this); while (n-- != 0) h += i.next().hashCode(); return h; } @Override public boolean equals(Object o) { if (o == this) return true; if (!(o instanceof Map)) return false; final Map m = (Map) o; if (m.size() != size()) return false; return double2FloatEntrySet().containsAll(m.entrySet()); } @Override public String toString() { final StringBuilder s = new StringBuilder(); final ObjectIterator i = Double2FloatMaps.fastIterator(this); int n = size(); Double2FloatMap.Entry e; boolean first = true; s.append("{"); while (n-- != 0) { if (first) first = false; else s.append(", "); e = i.next(); s.append(String.valueOf(e.getDoubleKey())); s.append("=>"); s.append(String.valueOf(e.getFloatValue())); } s.append("}"); return s.toString(); } }





© 2015 - 2024 Weber Informatics LLC | Privacy Policy