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

it.unimi.dsi.fastutil.doubles.AbstractDouble2ByteMap 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 access and insertion; 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. Note that if you have both this jar and fastutil-core.jar in your dependencies, fastutil-core.jar should be excluded.

There is a newer version: 8.5.15
Show newest version
/* 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.doubles;
import it.unimi.dsi.fastutil.bytes.ByteCollection;
import it.unimi.dsi.fastutil.bytes.AbstractByteCollection;
import it.unimi.dsi.fastutil.bytes.ByteIterator;
import it.unimi.dsi.fastutil.bytes.AbstractByteIterator;
import it.unimi.dsi.fastutil.objects.ObjectSet;
import it.unimi.dsi.fastutil.objects.ObjectIterator;
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 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 AbstractDouble2ByteMap extends AbstractDouble2ByteFunction implements Double2ByteMap, java.io.Serializable { private static final long serialVersionUID = -4940583368468432370L; protected AbstractDouble2ByteMap() { } public boolean containsValue(Object ov) { if (ov == null) return false; return containsValue(((((Byte) (ov)).byteValue()))); } /** Checks whether the given value is contained in {@link #values()}. */ public boolean containsValue(byte v) { return values().contains(v); } /** Checks whether the given value is contained in {@link #keySet()}. */ public boolean containsKey(double 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 Double2ByteMap) { Double2ByteMap.Entry e; while (n-- != 0) { e = (Double2ByteMap.Entry) i.next(); put(e.getDoubleKey(), e.getByteValue()); } } 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 java.util.Map.Entry#setValue(Object) setValue()}, as the * modification would not be reflected in the base map. */ public static class BasicEntry implements Double2ByteMap.Entry { protected double key; protected byte value; public BasicEntry(final Double key, final Byte value) { this.key = ((key).doubleValue()); this.value = ((value).byteValue()); } public BasicEntry(final double key, final byte value) { this.key = key; this.value = value; } /** * {@inheritDoc} * * @deprecated Please use the corresponding type-specific method * instead. */ @Deprecated public Double getKey() { return (Double.valueOf(key)); } public double getDoubleKey() { return key; } /** * {@inheritDoc} * * @deprecated Please use the corresponding type-specific method * instead. */ @Deprecated public Byte getValue() { return (Byte.valueOf(value)); } public byte getByteValue() { return value; } public byte setValue(final byte value) { throw new UnsupportedOperationException(); } /** * {@inheritDoc} * * @deprecated Please use the corresponding type-specific method * instead. */ @Deprecated public Byte setValue(final Byte value) { return Byte.valueOf(setValue(value.byteValue())); } 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 Double)) return false; if (e.getValue() == null || !(e.getValue() instanceof Byte)) return false; return (Double.doubleToLongBits(key) == Double .doubleToLongBits(((((Double) (e.getKey())).doubleValue())))) && ((value) == (((((Byte) (e.getValue())).byteValue())))); } public int hashCode() { return it.unimi.dsi.fastutil.HashCommon.double2int(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 DoubleSet keySet() { return new AbstractDoubleSet() { public boolean contains(final double k) { return containsKey(k); } public int size() { return AbstractDouble2ByteMap.this.size(); } public void clear() { AbstractDouble2ByteMap.this.clear(); } public DoubleIterator iterator() { return new AbstractDoubleIterator() { final ObjectIterator> i = entrySet() .iterator(); /** * {@inheritDoc} * * @deprecated Please use the corresponding type-specific * method instead. */ @Deprecated public double nextDouble() { return ((Double2ByteMap.Entry) i.next()).getDoubleKey(); }; 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 ByteCollection values() { return new AbstractByteCollection() { public boolean contains(final byte k) { return containsValue(k); } public int size() { return AbstractDouble2ByteMap.this.size(); } public void clear() { AbstractDouble2ByteMap.this.clear(); } public ByteIterator iterator() { return new AbstractByteIterator() { final ObjectIterator> i = entrySet() .iterator(); /** * {@inheritDoc} * * @deprecated Please use the corresponding type-specific * method instead. */ @Deprecated public byte nextByte() { return ((Double2ByteMap.Entry) i.next()).getByteValue(); }; public boolean hasNext() { return i.hasNext(); } }; } }; } @SuppressWarnings({"unchecked", "rawtypes"}) public ObjectSet> entrySet() { return (ObjectSet) double2ByteEntrySet(); } /** * 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(); Double2ByteMap.Entry e; boolean first = true; s.append("{"); while (n-- != 0) { if (first) first = false; else s.append(", "); e = (Double2ByteMap.Entry) i.next(); s.append(String.valueOf(e.getDoubleKey())); s.append("=>"); s.append(String.valueOf(e.getByteValue())); } s.append("}"); return s.toString(); } }





© 2015 - 2025 Weber Informatics LLC | Privacy Policy