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

it.unimi.dsi.fastutil.longs.AbstractLong2DoubleMap Maven / Gradle / Ivy

Go to download

fastutil extends the Java Collections Framework by providing type-specific maps, sets, lists, and queues with a small memory footprint and fast operations; it provides also big (64-bit) arrays, sets, and lists, sorting algorithms, fast, practical I/O classes for binary and text files, and facilities for memory mapping large files. This jar (fastutil-core.jar) contains data structures based on integers, longs, doubles, and objects, only; fastutil.jar contains all classes. If you have both jars in your dependencies, this jar should be excluded.

There is a newer version: 8.5.15
Show newest version
/*
	* Copyright (C) 2002-2022 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.longs;

import static it.unimi.dsi.fastutil.Size64.sizeOf;
import it.unimi.dsi.fastutil.doubles.DoubleCollection;
import it.unimi.dsi.fastutil.doubles.AbstractDoubleCollection;
import it.unimi.dsi.fastutil.doubles.DoubleIterator;
import it.unimi.dsi.fastutil.doubles.DoubleSpliterator;
import it.unimi.dsi.fastutil.doubles.DoubleSpliterators;
import it.unimi.dsi.fastutil.objects.ObjectIterator;
import it.unimi.dsi.fastutil.objects.ObjectSpliterator;
import it.unimi.dsi.fastutil.objects.ObjectSpliterators;
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 AbstractLong2DoubleMap extends AbstractLong2DoubleFunction implements Long2DoubleMap, java.io.Serializable { private static final long serialVersionUID = -4940583368468432370L; protected AbstractLong2DoubleMap() { } /** * {@inheritDoc} * * @implSpec This implementation does a linear search over the entry set, finding an entry that has * the key specified. *

* If you override {@link #keySet()}, you should probably override this method too to take * advantage of the (presumably) faster {@linkplain java.util.Set#contains key membership * test} your {@link #keySet()} provides. *

* If you override this method but not {@link #keySet()}, then the returned key set will * take advantage of this method. */ @Override public boolean containsKey(final long k) { final ObjectIterator i = long2DoubleEntrySet().iterator(); while (i.hasNext()) if (i.next().getLongKey() == k) return true; return false; } /** * {@inheritDoc} * * @implSpec This implementation does a linear search over the entry set, finding an entry that has * the value specified. *

* If you override {@link #values()}, you should probably override this method too to take * advantage of the (presumably) faster {@linkplain java.util.Collection#contains value * membership test} your {@link #values()} provides. *

* If you override this method but not {@link #values()}, then the returned values * collection will take advantage of this method. */ @Override public boolean containsValue(final double v) { final ObjectIterator i = long2DoubleEntrySet().iterator(); while (i.hasNext()) if (i.next().getDoubleValue() == v) return true; return false; } @Override public boolean isEmpty() { return size() == 0; } /** * {@inheritDoc} * * @implSpec This method just delegates to the interface default method, as the default method, but * it is final, so it cannot be overridden. */ @Override public final double mergeDouble(final long key, final double value, final it.unimi.dsi.fastutil.doubles.DoubleBinaryOperator remappingFunction) { return mergeDouble(key, value, (java.util.function.DoubleBinaryOperator)remappingFunction); } /** * 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 Long2DoubleMap.Entry { protected long key; protected double value; public BasicEntry() { } public BasicEntry(final Long key, final Double value) { this.key = (key).longValue(); this.value = (value).doubleValue(); } public BasicEntry(final long key, final double value) { this.key = key; this.value = value; } @Override public long getLongKey() { return key; } @Override public double getDoubleValue() { return value; } @Override public double setValue(final double value) { throw new UnsupportedOperationException(); } @Override public boolean equals(final Object o) { if (!(o instanceof Map.Entry)) return false; if (o instanceof Long2DoubleMap.Entry) { final Long2DoubleMap.Entry e = (Long2DoubleMap.Entry)o; return ((key) == (e.getLongKey())) && (Double.doubleToLongBits(value) == Double.doubleToLongBits(e.getDoubleValue())); } final Map.Entry e = (Map.Entry)o; final Object key = e.getKey(); if (key == null || !(key instanceof Long)) return false; final Object value = e.getValue(); if (value == null || !(value instanceof Double)) return false; return ((this.key) == (((Long)(key)).longValue())) && (Double.doubleToLongBits(this.value) == Double.doubleToLongBits(((Double)(value)).doubleValue())); } @Override public int hashCode() { return it.unimi.dsi.fastutil.HashCommon.long2int(key) ^ it.unimi.dsi.fastutil.HashCommon.double2int(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 Long2DoubleMap map; public BasicEntrySet(final Long2DoubleMap map) { this.map = map; } @Override public boolean contains(final Object o) { if (!(o instanceof Map.Entry)) return false; if (o instanceof Long2DoubleMap.Entry) { final Long2DoubleMap.Entry e = (Long2DoubleMap.Entry)o; final long k = e.getLongKey(); return map.containsKey(k) && (Double.doubleToLongBits(map.get(k)) == Double.doubleToLongBits(e.getDoubleValue())); } final Map.Entry e = (Map.Entry)o; final Object key = e.getKey(); if (key == null || !(key instanceof Long)) return false; final long k = ((Long)(key)).longValue(); final Object value = e.getValue(); if (value == null || !(value instanceof Double)) return false; return map.containsKey(k) && (Double.doubleToLongBits(map.get(k)) == Double.doubleToLongBits(((Double)(value)).doubleValue())); } @Override public boolean remove(final Object o) { if (!(o instanceof Map.Entry)) return false; if (o instanceof Long2DoubleMap.Entry) { final Long2DoubleMap.Entry e = (Long2DoubleMap.Entry)o; return map.remove(e.getLongKey(), e.getDoubleValue()); } Map.Entry e = (Map.Entry)o; final Object key = e.getKey(); if (key == null || !(key instanceof Long)) return false; final long k = ((Long)(key)).longValue(); final Object value = e.getValue(); if (value == null || !(value instanceof Double)) return false; final double v = ((Double)(value)).doubleValue(); return map.remove(k, v); } @Override public int size() { return map.size(); } @Override public ObjectSpliterator spliterator() { return ObjectSpliterators.asSpliterator(iterator(), sizeOf(map), ObjectSpliterators.SET_SPLITERATOR_CHARACTERISTICS); } } /** * 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 LongSet keySet() { return new AbstractLongSet() { @Override public boolean contains(final long k) { return containsKey(k); } @Override public int size() { return AbstractLong2DoubleMap.this.size(); } @Override public void clear() { AbstractLong2DoubleMap.this.clear(); } @Override public LongIterator iterator() { return new LongIterator() { private final ObjectIterator i = Long2DoubleMaps.fastIterator(AbstractLong2DoubleMap.this); @Override public long nextLong() { return i.next().getLongKey(); } @Override public boolean hasNext() { return i.hasNext(); } @Override public void remove() { i.remove(); } @Override public void forEachRemaining(final java.util.function.LongConsumer action) { i.forEachRemaining(entry -> action.accept(entry.getLongKey())); } }; } @Override public LongSpliterator spliterator() { return LongSpliterators.asSpliterator(iterator(), sizeOf(AbstractLong2DoubleMap.this), LongSpliterators.SET_SPLITERATOR_CHARACTERISTICS); } }; } /** * 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 DoubleCollection values() { return new AbstractDoubleCollection() { @Override public boolean contains(final double k) { return containsValue(k); } @Override public int size() { return AbstractLong2DoubleMap.this.size(); } @Override public void clear() { AbstractLong2DoubleMap.this.clear(); } @Override public DoubleIterator iterator() { return new DoubleIterator() { private final ObjectIterator i = Long2DoubleMaps.fastIterator(AbstractLong2DoubleMap.this); @Override public double nextDouble() { return i.next().getDoubleValue(); } @Override public boolean hasNext() { return i.hasNext(); } @Override public void remove() { i.remove(); } @Override public void forEachRemaining(final java.util.function.DoubleConsumer action) { i.forEachRemaining(entry -> action.accept(entry.getDoubleValue())); } }; } @Override public DoubleSpliterator spliterator() { return DoubleSpliterators.asSpliterator(iterator(), sizeOf(AbstractLong2DoubleMap.this), DoubleSpliterators.COLLECTION_SPLITERATOR_CHARACTERISTICS); } }; } /** {@inheritDoc} */ @SuppressWarnings({ "unchecked", "deprecation" }) @Override public void putAll(final Map m) { if (m instanceof Long2DoubleMap) { ObjectIterator i = Long2DoubleMaps.fastIterator((Long2DoubleMap)m); while (i.hasNext()) { final Long2DoubleMap.Entry e = i.next(); put(e.getLongKey(), e.getDoubleValue()); } } 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 = Long2DoubleMaps.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 long2DoubleEntrySet().containsAll(m.entrySet()); } @Override public String toString() { final StringBuilder s = new StringBuilder(); final ObjectIterator i = Long2DoubleMaps.fastIterator(this); int n = size(); Long2DoubleMap.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.getLongKey())); s.append("=>"); s.append(String.valueOf(e.getDoubleValue())); } s.append("}"); return s.toString(); } }





© 2015 - 2024 Weber Informatics LLC | Privacy Policy