it.unimi.dsi.fastutil.longs.AbstractLong2ReferenceSortedMap Maven / Gradle / Ivy
Show all versions of fastutil Show documentation
/* Copyright (C) 1991-2016 Free Software Foundation, Inc.
This file is part of the GNU C Library.
The GNU C Library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
The GNU C Library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with the GNU C Library; if not, see
or any other header that includes
because the implicit include comes before any feature
test macros that may be defined in a source file before it first
explicitly includes a system header. GCC knows the name of this
header in order to preinclude it. */
/* glibc's intent is to support the IEC 559 math functionality, real
and complex. If the GCC (4.9 and later) predefined macros
specifying compiler intent are available, use them to determine
whether the overall intent is to support these features; otherwise,
presume an older compiler has intent to support these features and
define these macros by default. */
/* wchar_t uses Unicode 9.0.0. Version 9.0 of the Unicode Standard is
synchronized with ISO/IEC 10646:2014, fourth edition, plus
Amd. 1 and Amd. 2 and 273 characters from forthcoming 10646, fifth edition.
(Amd. 2 was published 2016-05-01,
see https://www.iso.org/obp/ui/#iso:std:iso-iec:10646:ed-4:v1:amd:2:v1:en) */
/* We do not support C11 . */
/* 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) */
/*
* 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.longs;
import it.unimi.dsi.fastutil.objects.ReferenceCollection;
import it.unimi.dsi.fastutil.objects.AbstractReferenceCollection;
import it.unimi.dsi.fastutil.objects.AbstractObjectIterator;
import it.unimi.dsi.fastutil.objects.ObjectIterator;
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 AbstractLong2ReferenceSortedMap extends AbstractLong2ReferenceMap implements Long2ReferenceSortedMap {
private static final long serialVersionUID = -1773560792952436569L;
protected AbstractLong2ReferenceSortedMap() {
}
/**
* Delegates to the corresponding type-specific method.
*
* @deprecated Please use the corresponding type-specific method instead.
*/
@Deprecated
public Long2ReferenceSortedMap headMap(final Long to) {
return headMap(((to).longValue()));
}
/**
* Delegates to the corresponding type-specific method.
*
* @deprecated Please use the corresponding type-specific method instead.
*/
@Deprecated
public Long2ReferenceSortedMap tailMap(final Long from) {
return tailMap(((from).longValue()));
}
/**
* Delegates to the corresponding type-specific method.
*
* @deprecated Please use the corresponding type-specific method instead.
*/
@Deprecated
public Long2ReferenceSortedMap subMap(final Long from, final Long to) {
return subMap(((from).longValue()), ((to).longValue()));
}
/**
* Delegates to the corresponding type-specific method.
*
* @deprecated Please use the corresponding type-specific method instead.
*/
@Deprecated
public Long firstKey() {
return (Long.valueOf(firstLongKey()));
}
/**
* Delegates to the corresponding type-specific method.
*
* @deprecated Please use the corresponding type-specific method instead.
*/
@Deprecated
public Long lastKey() {
return (Long.valueOf(lastLongKey()));
}
/**
* Returns a type-specific-sorted-set view of the keys of this map.
*
*
* 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.
*/
public LongSortedSet keySet() {
return new KeySet();
}
/** A wrapper exhibiting the keys of a map. */
protected class KeySet extends AbstractLongSortedSet {
public boolean contains(final long k) {
return containsKey(k);
}
public int size() {
return AbstractLong2ReferenceSortedMap.this.size();
}
public void clear() {
AbstractLong2ReferenceSortedMap.this.clear();
}
public LongComparator comparator() {
return AbstractLong2ReferenceSortedMap.this.comparator();
}
public long firstLong() {
return firstLongKey();
}
public long lastLong() {
return lastLongKey();
}
public LongSortedSet headSet(final long to) {
return headMap(to).keySet();
}
public LongSortedSet tailSet(final long from) {
return tailMap(from).keySet();
}
public LongSortedSet subSet(final long from, final long to) {
return subMap(from, to).keySet();
}
public LongBidirectionalIterator iterator(final long from) {
return new KeySetIterator(entrySet().iterator(new BasicEntry(from, (null))));
}
public LongBidirectionalIterator iterator() {
return new KeySetIterator(entrySet().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 AbstractLongBidirectionalIterator {
protected final ObjectBidirectionalIterator> i;
public KeySetIterator(ObjectBidirectionalIterator> i) {
this.i = i;
}
public long nextLong() {
return ((i.next().getKey()).longValue());
};
public long previousLong() {
return ((i.previous().getKey()).longValue());
};
public boolean hasNext() {
return i.hasNext();
}
public boolean hasPrevious() {
return i.hasPrevious();
}
}
/**
* Returns a type-specific collection view of the values contained in this
* map.
*
*
* 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.
*/
public ReferenceCollection values() {
return new ValuesCollection();
}
/** A wrapper exhibiting the values of a map. */
protected class ValuesCollection extends AbstractReferenceCollection {
public ObjectIterator iterator() {
return new ValuesIterator(entrySet().iterator());
}
public boolean contains(final Object k) {
return containsValue(k);
}
public int size() {
return AbstractLong2ReferenceSortedMap.this.size();
}
public void clear() {
AbstractLong2ReferenceSortedMap.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 AbstractObjectIterator {
protected final ObjectBidirectionalIterator> i;
public ValuesIterator(ObjectBidirectionalIterator> i) {
this.i = i;
}
public V next() {
return (i.next().getValue());
};
public boolean hasNext() {
return i.hasNext();
}
}
@SuppressWarnings({ "unchecked", "rawtypes" })
public ObjectSortedSet> entrySet() {
return (ObjectSortedSet) long2ReferenceEntrySet();
}
}