Package it.unimi.dsi.fastutil.ints

Class Int2LongRBTreeMap

java.lang.Object

it.unimi.dsi.fastutil.ints.AbstractInt2LongFunction

it.unimi.dsi.fastutil.ints.AbstractInt2LongMap

it.unimi.dsi.fastutil.ints.AbstractInt2LongSortedMap

it.unimi.dsi.fastutil.ints.Int2LongRBTreeMap

All Implemented Interfaces:

Function<Integer,Long>, Int2LongFunction, Int2LongMap, Int2LongSortedMap, Serializable, Cloneable, Function<Integer,Long>, IntToLongFunction, Map<Integer,Long>, SortedMap<Integer,Long>

public class Int2LongRBTreeMap
extends AbstractInt2LongSortedMap
implements Serializable, Cloneable

A type-specific red-black tree map with a fast, small-footprint implementation.

The iterators provided by the views of this class are type-specific bidirectional iterators. Moreover, the iterator returned by iterator() can be safely cast to a type-specific list iterator.

See Also:

• Serialized Form

Nested Class Summary

Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.ints.AbstractInt2LongMap

AbstractInt2LongMap.BasicEntry, AbstractInt2LongMap.BasicEntrySet

Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.ints.Int2LongMap

Int2LongMap.FastEntrySet

Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.ints.Int2LongSortedMap

Int2LongSortedMap.FastSortedEntrySet

Constructor Summary

Constructors

Constructor	Description
Int2LongRBTreeMap()	Creates a new empty tree map.
Int2LongRBTreeMap(int[] k, long[] v)	Creates a new tree map using the elements of two parallel arrays.
Int2LongRBTreeMap(int[] k, long[] v, Comparator<? super Integer> c)	Creates a new tree map using the elements of two parallel arrays and the given comparator.
Int2LongRBTreeMap(Int2LongMap m)	Creates a new tree map copying a given map.
Int2LongRBTreeMap(Int2LongSortedMap m)	Creates a new tree map copying a given sorted map (and its Comparator).
Int2LongRBTreeMap(Comparator<? super Integer> c)	Creates a new empty tree map with the given comparator.
Int2LongRBTreeMap(Map<? extends Integer,? extends Long> m)	Creates a new tree map copying a given map.
Int2LongRBTreeMap(SortedMap<Integer,Long> m)	Creates a new tree map copying a given sorted map (and its Comparator).

Method Summary

Modifier and Type	Method	Description
long	addTo(int k, long incr)	Adds an increment to value currently associated with a key.
void	clear()	Removes all of the mappings from this map (optional operation).
Int2LongRBTreeMap	clone()	Returns a deep copy of this tree map.
IntComparator	comparator()	Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
boolean	containsKey(int k)	Returns true if this function contains a mapping for the specified key.
boolean	containsValue(long v)	Returns true if this map maps one or more keys to the specified value.
int	firstIntKey()	Returns the first (lowest) key currently in this map.
long	get(int k)	Returns the value to which the given key is mapped.
Int2LongSortedMap	headMap(int to)	Returns a view of the portion of this sorted map whose keys are strictly less than toKey.
ObjectSortedSet<Int2LongMap.Entry>	int2LongEntrySet()	Returns a type-specific sorted-set view of the mappings contained in this map.
boolean	isEmpty()
IntSortedSet	keySet()	Returns a type-specific sorted set view of the keys contained in this map.
int	lastIntKey()	Returns the last (highest) key currently in this map.
long	put(int k, long v)	Adds a pair to the map (optional operation).
long	remove(int k)	Removes the mapping with the given key (optional operation).
int	size()	Returns the number of key/value mappings in this map.
Int2LongSortedMap	subMap(int from, int to)	Returns a view of the portion of this sorted map whose keys range from fromKey, inclusive, to toKey, exclusive.
Int2LongSortedMap	tailMap(int from)	Returns a view of the portion of this sorted map whose keys are greater than or equal to fromKey.
LongCollection	values()	Returns a type-specific collection view of the values contained in this map.

Methods inherited from class it.unimi.dsi.fastutil.ints.AbstractInt2LongMap

equals, hashCode, mergeLong, putAll, toString

Methods inherited from class it.unimi.dsi.fastutil.ints.AbstractInt2LongFunction

defaultReturnValue, defaultReturnValue

Methods inherited from class java.lang.Object

getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface it.unimi.dsi.fastutil.Function

apply

Methods inherited from interface it.unimi.dsi.fastutil.ints.Int2LongFunction

andThen, andThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, applyAsLong, compose, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShort

Methods inherited from interface it.unimi.dsi.fastutil.ints.Int2LongMap

compute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsent, computeIfAbsentNullable, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, containsValue, defaultReturnValue, defaultReturnValue, forEach, get, getOrDefault, getOrDefault, merge, merge, mergeLong, mergeLong, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replace

Methods inherited from interface it.unimi.dsi.fastutil.ints.Int2LongSortedMap

entrySet, firstKey, headMap, lastKey, subMap, tailMap

Methods inherited from interface java.util.Map

containsKey, equals, get, getOrDefault, hashCode, put, putAll, remove, replaceAll

Constructor Details

Int2LongRBTreeMap

public Int2LongRBTreeMap()

Creates a new empty tree map.

Int2LongRBTreeMap

public Int2LongRBTreeMap(Comparator<? super Integer> c)

Creates a new empty tree map with the given comparator.

Parameters:

c - a (possibly type-specific) comparator.

Int2LongRBTreeMap

public Int2LongRBTreeMap(Map<? extends Integer,? extends Long> m)

Creates a new tree map copying a given map.

Parameters:

m - a Map to be copied into the new tree map.

Int2LongRBTreeMap

public Int2LongRBTreeMap(SortedMap<Integer,Long> m)

Creates a new tree map copying a given sorted map (and its Comparator).

Parameters:

m - a SortedMap to be copied into the new tree map.

Int2LongRBTreeMap

public Int2LongRBTreeMap(Int2LongMap m)

Creates a new tree map copying a given map.

Parameters:

m - a type-specific map to be copied into the new tree map.

Int2LongRBTreeMap

public Int2LongRBTreeMap(Int2LongSortedMap m)

Creates a new tree map copying a given sorted map (and its Comparator).

Parameters:

m - a type-specific sorted map to be copied into the new tree map.

Int2LongRBTreeMap

public Int2LongRBTreeMap(int[] k,
 long[] v,
 Comparator<? super Integer> c)

Creates a new tree map using the elements of two parallel arrays and the given comparator.

Parameters:

k - the array of keys of the new tree map.

v - the array of corresponding values in the new tree map.

c - a (possibly type-specific) comparator.

Throws:

IllegalArgumentException - if k and v have different lengths.

Int2LongRBTreeMap

public Int2LongRBTreeMap(int[] k,
 long[] v)

Creates a new tree map using the elements of two parallel arrays.

Parameters:

k - the array of keys of the new tree map.

v - the array of corresponding values in the new tree map.

Throws:

IllegalArgumentException - if k and v have different lengths.

Method Details

addTo

public long addTo(int k,
 long incr)

Adds an increment to value currently associated with a key.

Note that this method respects the default return value semantics: when called with a key that does not currently appears in the map, the key will be associated with the default return value plus the given increment.

Parameters:

k - the key.

incr - the increment.

Returns:

the old value, or the default return value if no value was present for the given key.

put

public long put(int k,
 long v)

Description copied from interface: Int2LongFunction

Adds a pair to the map (optional operation).

Specified by:

put in interface Int2LongFunction

Parameters:

k - the key.

v - the value.

Returns:

the old value, or the default return value if no value was present for the given key.

See Also:

• Function.put(Object,Object)

remove

public long remove(int k)

Description copied from interface: Int2LongFunction

Removes the mapping with the given key (optional operation).

Specified by:

remove in interface Int2LongFunction

Parameters:

k - the key.

Returns:

the old value, or the default return value if no value was present for the given key.

See Also:

• Function.remove(Object)

containsValue

public boolean containsValue(long v)

Description copied from class: AbstractInt2LongMap

Returns true if this map maps one or more keys to the specified value.

Specified by:

containsValue in interface Int2LongMap

Overrides:

containsValue in class AbstractInt2LongMap

See Also:

• Map.containsValue(Object)

clear

public void clear()

Description copied from interface: Int2LongMap

Removes all of the mappings from this map (optional operation). The map will be empty after this call returns.

Specified by:

clear in interface Function<Integer,Long>

Specified by:

clear in interface Int2LongMap

Specified by:

clear in interface Map<Integer,Long>

See Also:

• Map.clear()

containsKey

public boolean containsKey(int k)

Description copied from class: AbstractInt2LongMap

Returns true if this function contains a mapping for the specified key.

Specified by:

containsKey in interface Int2LongFunction

Specified by:

containsKey in interface Int2LongMap

Overrides:

containsKey in class AbstractInt2LongMap

Parameters:

k - the key.

Returns:

true if this function associates a value to key.

See Also:

• Map.containsKey(Object)

size

public int size()

Description copied from interface: Int2LongMap

Returns the number of key/value mappings in this map. If the map contains more than Integer.MAX_VALUE elements, returns Integer.MAX_VALUE.

Specified by:

size in interface Function<Integer,Long>

Specified by:

size in interface Int2LongMap

Specified by:

size in interface Map<Integer,Long>

Returns:

the number of key-value mappings in this map.

See Also:

• Size64

isEmpty

public boolean isEmpty()

Specified by:

isEmpty in interface Map<Integer,Long>

Overrides:

isEmpty in class AbstractInt2LongMap

get

public long get(int k)

Description copied from interface: Int2LongFunction

Returns the value to which the given key is mapped.

Specified by:

get in interface Int2LongFunction

Parameters:

k - the key.

Returns:

the corresponding value, or the default return value if no value was present for the given key.

See Also:

• Function.get(Object)

firstIntKey

public int firstIntKey()

Description copied from interface: Int2LongSortedMap

Returns the first (lowest) key currently in this map.

Specified by:

firstIntKey in interface Int2LongSortedMap

See Also:

• SortedMap.firstKey()

lastIntKey

public int lastIntKey()

Description copied from interface: Int2LongSortedMap

Returns the last (highest) key currently in this map.

Specified by:

lastIntKey in interface Int2LongSortedMap

See Also:

• SortedMap.lastKey()

int2LongEntrySet

public ObjectSortedSet<Int2LongMap.Entry> int2LongEntrySet()

Description copied from interface: Int2LongSortedMap

Returns a type-specific sorted-set view of the mappings contained in this map.

Specified by:

int2LongEntrySet in interface Int2LongMap

Specified by:

int2LongEntrySet in interface Int2LongSortedMap

Returns:

a type-specific sorted-set view of the mappings contained in this map.

See Also:

• Int2LongSortedMap.entrySet()

keySet

public IntSortedSet keySet()

Returns a type-specific sorted set view of the keys contained in this map.

In addition to the semantics of Map.keySet(), you can safely cast the set returned by this call to a type-specific sorted set interface.

Specified by:

keySet in interface Int2LongMap

Specified by:

keySet in interface Int2LongSortedMap

Specified by:

keySet in interface Map<Integer,Long>

Specified by:

keySet in interface SortedMap<Integer,Long>

Overrides:

keySet in class AbstractInt2LongSortedMap

Returns:

a type-specific sorted set view of the keys contained in this map.

See Also:

• Map.keySet()

values

public LongCollection values()

Returns a type-specific collection view of the values contained in this map.

In addition to the semantics of Map.values(), you can safely cast the collection returned by this call to a type-specific collection interface.

Specified by:

values in interface Int2LongMap

Specified by:

values in interface Int2LongSortedMap

Specified by:

values in interface Map<Integer,Long>

Specified by:

values in interface SortedMap<Integer,Long>

Overrides:

values in class AbstractInt2LongSortedMap

Returns:

a type-specific collection view of the values contained in this map.

See Also:

• Map.values()

comparator

public IntComparator comparator()

Description copied from interface: Int2LongSortedMap

Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.

Specified by:

comparator in interface Int2LongSortedMap

Specified by:

comparator in interface SortedMap<Integer,Long>

See Also:

• SortedMap.comparator()

headMap

public Int2LongSortedMap headMap(int to)

Description copied from interface: Int2LongSortedMap

Returns a view of the portion of this sorted map whose keys are strictly less than toKey.

Specified by:

headMap in interface Int2LongSortedMap

See Also:

• SortedMap.headMap(Object)

tailMap

public Int2LongSortedMap tailMap(int from)

Description copied from interface: Int2LongSortedMap

Returns a view of the portion of this sorted map whose keys are greater than or equal to fromKey.

Specified by:

tailMap in interface Int2LongSortedMap

See Also:

• SortedMap.tailMap(Object)

subMap

public Int2LongSortedMap subMap(int from,
 int to)

Description copied from interface: Int2LongSortedMap

Returns a view of the portion of this sorted map whose keys range from fromKey, inclusive, to toKey, exclusive.

Specified by:

subMap in interface Int2LongSortedMap

See Also:

• SortedMap.subMap(Object,Object)

clone

public Int2LongRBTreeMap clone()

Returns a deep copy of this tree map.

This method performs a deep copy of this tree map; the data stored in the set, however, is not cloned. Note that this makes a difference only for object keys.

Returns:

a deep copy of this tree map.