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

it.unimi.dsi.fastutil.bytes.AbstractByte2DoubleSortedMap 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-2017 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.bytes;
import it.unimi.dsi.fastutil.doubles.DoubleCollection;
import it.unimi.dsi.fastutil.doubles.AbstractDoubleCollection;
import it.unimi.dsi.fastutil.doubles.AbstractDoubleIterator;
import it.unimi.dsi.fastutil.doubles.DoubleIterator;
import it.unimi.dsi.fastutil.objects.ObjectBidirectionalIterator;
import it.unimi.dsi.fastutil.objects.ObjectSortedSet;
import java.util.Map;
/** An abstract class providing basic methods for sorted maps implementing a type-specific interface. */
public abstract class AbstractByte2DoubleSortedMap extends AbstractByte2DoubleMap implements Byte2DoubleSortedMap {
	private static final long serialVersionUID = -1773560792952436569L;
	protected AbstractByte2DoubleSortedMap() {}
	/** {@inheritDoc}
	 * 

This implementation delegates to the corresponding type-specific method. * @deprecated Please use the corresponding type-specific method instead. */ @Deprecated @Override public Byte2DoubleSortedMap headMap(final Byte to) { return headMap(((to).byteValue())); } /** {@inheritDoc} *

This implementation delegates to the corresponding type-specific method. * @deprecated Please use the corresponding type-specific method instead. */ @Deprecated @Override public Byte2DoubleSortedMap tailMap(final Byte from) { return tailMap(((from).byteValue())); } /** {@inheritDoc} *

This implementation delegates to the corresponding type-specific method. * @deprecated Please use the corresponding type-specific method instead. */ @Deprecated @Override public Byte2DoubleSortedMap subMap(final Byte from, final Byte to) { return subMap(((from).byteValue()), ((to).byteValue())); } /** {@inheritDoc} *

This implementation delegates to the corresponding type-specific method. * @deprecated Please use the corresponding type-specific method instead. */ @Deprecated @Override public Byte firstKey() { return (Byte.valueOf(firstByteKey())); } /** {@inheritDoc} *

This implementation delegates to the corresponding type-specific method. * @deprecated Please use the corresponding type-specific method instead. */ @Deprecated @Override public Byte lastKey() { return (Byte.valueOf(lastByteKey())); } /** {@inheritDoc} * *

The view is backed by the sorted 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 sorted set view of the keys of this map; it may be safely cast to a type-specific interface. */ @Override public ByteSortedSet keySet() { return new KeySet(); } /** A wrapper exhibiting the keys of a map. */ protected class KeySet extends AbstractByteSortedSet { @Override public boolean contains(final byte k) { return containsKey(k); } @Override public int size() { return AbstractByte2DoubleSortedMap.this.size(); } @Override public void clear() { AbstractByte2DoubleSortedMap.this.clear(); } @Override public ByteComparator comparator() { return AbstractByte2DoubleSortedMap.this.comparator(); } @Override public byte firstByte() { return firstByteKey(); } @Override public byte lastByte() { return lastByteKey(); } @Override public ByteSortedSet headSet(final byte to) { return headMap(to).keySet(); } @Override public ByteSortedSet tailSet(final byte from) { return tailMap(from).keySet(); } @Override public ByteSortedSet subSet(final byte from, final byte to) { return subMap(from, to).keySet(); } @Override public ByteBidirectionalIterator iterator(final byte from) { return new KeySetIterator (byte2DoubleEntrySet().iterator(new BasicEntry (from, (0)))); } @Override public ByteBidirectionalIterator iterator() { return new KeySetIterator (byte2DoubleEntrySet().iterator()); } } /** A wrapper exhibiting a map iterator as an iterator on keys. * *

To provide an iterator on keys, just create an instance of this * class using the corresponding iterator on entries. */ protected static class KeySetIterator extends AbstractByteBidirectionalIterator { protected final ObjectBidirectionalIterator i; public KeySetIterator(ObjectBidirectionalIterator i) { this.i = i; } @Override public byte nextByte() { return i.next().getByteKey(); }; @Override public byte previousByte() { return i.previous().getByteKey(); }; @Override public boolean hasNext() { return i.hasNext(); } @Override public boolean hasPrevious() { return i.hasPrevious(); } } /** {@inheritDoc} * *

The view is backed by the sorted 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 type-specific collection view of the values contained in this map. */ @Override public DoubleCollection values() { return new ValuesCollection(); } /** A wrapper exhibiting the values of a map. */ protected class ValuesCollection extends AbstractDoubleCollection { @Override public DoubleIterator iterator() { return new ValuesIterator (byte2DoubleEntrySet().iterator()); } @Override public boolean contains(final double k) { return containsValue(k); } @Override public int size() { return AbstractByte2DoubleSortedMap.this.size(); } @Override public void clear() { AbstractByte2DoubleSortedMap.this.clear(); } } /** A wrapper exhibiting a map iterator as an iterator on values. * *

To provide an iterator on values, just create an instance of this * class using the corresponding iterator on entries. */ protected static class ValuesIterator extends AbstractDoubleIterator { protected final ObjectBidirectionalIterator i; public ValuesIterator(ObjectBidirectionalIterator i) { this.i = i; } @Override public double nextDouble() { return i.next().getDoubleValue(); }; @Override public boolean hasNext() { return i.hasNext(); } } /** {@inheritDoc} *

This implementation delegates to the corresponding type-specific method. * @deprecated Please use the corresponding type-specific method instead. */ @Deprecated @Override @SuppressWarnings({ "unchecked", "rawtypes" }) public ObjectSortedSet> entrySet() { return (ObjectSortedSet)byte2DoubleEntrySet(); } }





© 2015 - 2024 Weber Informatics LLC | Privacy Policy