Package it.unimi.dsi.fastutil.longs

Class Long2BooleanRBTreeMap

java.lang.Object

it.unimi.dsi.fastutil.longs.AbstractLong2BooleanFunction

it.unimi.dsi.fastutil.longs.AbstractLong2BooleanMap

it.unimi.dsi.fastutil.longs.AbstractLong2BooleanSortedMap

it.unimi.dsi.fastutil.longs.Long2BooleanRBTreeMap

All Implemented Interfaces:

Function<Long,Boolean>, Long2BooleanFunction, Long2BooleanMap, Long2BooleanSortedMap, Serializable, Cloneable, Function<Long,Boolean>, LongPredicate, Map<Long,Boolean>, SortedMap<Long,Boolean>

public class Long2BooleanRBTreeMap
extends AbstractLong2BooleanSortedMap
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.longs.AbstractLong2BooleanMap

AbstractLong2BooleanMap.BasicEntry, AbstractLong2BooleanMap.BasicEntrySet

Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.longs.Long2BooleanMap

Long2BooleanMap.FastEntrySet

Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.longs.Long2BooleanSortedMap

Long2BooleanSortedMap.FastSortedEntrySet

Constructor Summary

Constructors

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

Method Summary

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

Methods inherited from class it.unimi.dsi.fastutil.longs.AbstractLong2BooleanMap

equals, hashCode, putAll, toString

Methods inherited from class it.unimi.dsi.fastutil.longs.AbstractLong2BooleanFunction

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.longs.Long2BooleanFunction

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

Methods inherited from interface it.unimi.dsi.fastutil.longs.Long2BooleanMap

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

Methods inherited from interface it.unimi.dsi.fastutil.longs.Long2BooleanSortedMap

entrySet, firstKey, headMap, lastKey, subMap, tailMap

Methods inherited from interface java.util.function.LongPredicate

and, negate, or

Methods inherited from interface java.util.Map

compute, computeIfAbsent, computeIfPresent, containsKey, equals, get, getOrDefault, hashCode, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, replaceAll

Constructor Details

Long2BooleanRBTreeMap

public Long2BooleanRBTreeMap()

Creates a new empty tree map.

Long2BooleanRBTreeMap

public Long2BooleanRBTreeMap(Comparator<? super Long> c)

Creates a new empty tree map with the given comparator.

Parameters:

c - a (possibly type-specific) comparator.

Long2BooleanRBTreeMap

public Long2BooleanRBTreeMap(Map<? extends Long,? extends Boolean> m)

Creates a new tree map copying a given map.

Parameters:

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

Long2BooleanRBTreeMap

public Long2BooleanRBTreeMap(SortedMap<Long,Boolean> 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.

Long2BooleanRBTreeMap

public Long2BooleanRBTreeMap(Long2BooleanMap m)

Creates a new tree map copying a given map.

Parameters:

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

Long2BooleanRBTreeMap

public Long2BooleanRBTreeMap(Long2BooleanSortedMap 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.

Long2BooleanRBTreeMap

public Long2BooleanRBTreeMap(long[] k,
 boolean[] v,
 Comparator<? super Long> 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.

Long2BooleanRBTreeMap

public Long2BooleanRBTreeMap(long[] k,
 boolean[] 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

put

public boolean put(long k,
 boolean v)

Description copied from interface: Long2BooleanFunction

Adds a pair to the map (optional operation).

Specified by:

put in interface Long2BooleanFunction

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 boolean remove(long k)

Description copied from interface: Long2BooleanFunction

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

Specified by:

remove in interface Long2BooleanFunction

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(boolean v)

Description copied from class: AbstractLong2BooleanMap

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

Specified by:

containsValue in interface Long2BooleanMap

Overrides:

containsValue in class AbstractLong2BooleanMap

See Also:

• Map.containsValue(Object)

clear

public void clear()

Description copied from interface: Long2BooleanMap

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<Long,Boolean>

Specified by:

clear in interface Long2BooleanMap

Specified by:

clear in interface Map<Long,Boolean>

See Also:

• Map.clear()

containsKey

public boolean containsKey(long k)

Description copied from class: AbstractLong2BooleanMap

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

Specified by:

containsKey in interface Long2BooleanFunction

Specified by:

containsKey in interface Long2BooleanMap

Overrides:

containsKey in class AbstractLong2BooleanMap

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: Long2BooleanMap

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<Long,Boolean>

Specified by:

size in interface Long2BooleanMap

Specified by:

size in interface Map<Long,Boolean>

Returns:

the number of key-value mappings in this map.

See Also:

• Size64

isEmpty

public boolean isEmpty()

Specified by:

isEmpty in interface Map<Long,Boolean>

Overrides:

isEmpty in class AbstractLong2BooleanMap

get

public boolean get(long k)

Description copied from interface: Long2BooleanFunction

Returns the value to which the given key is mapped.

Specified by:

get in interface Long2BooleanFunction

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)

firstLongKey

public long firstLongKey()

Description copied from interface: Long2BooleanSortedMap

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

Specified by:

firstLongKey in interface Long2BooleanSortedMap

See Also:

• SortedMap.firstKey()

lastLongKey

public long lastLongKey()

Description copied from interface: Long2BooleanSortedMap

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

Specified by:

lastLongKey in interface Long2BooleanSortedMap

See Also:

• SortedMap.lastKey()

long2BooleanEntrySet

public ObjectSortedSet<Long2BooleanMap.Entry> long2BooleanEntrySet()

Description copied from interface: Long2BooleanSortedMap

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

Specified by:

long2BooleanEntrySet in interface Long2BooleanMap

Specified by:

long2BooleanEntrySet in interface Long2BooleanSortedMap

Returns:

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

See Also:

• Long2BooleanSortedMap.entrySet()

keySet

public LongSortedSet 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 Long2BooleanMap

Specified by:

keySet in interface Long2BooleanSortedMap

Specified by:

keySet in interface Map<Long,Boolean>

Specified by:

keySet in interface SortedMap<Long,Boolean>

Overrides:

keySet in class AbstractLong2BooleanSortedMap

Returns:

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

See Also:

• Map.keySet()

values

public BooleanCollection 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 Long2BooleanMap

Specified by:

values in interface Long2BooleanSortedMap

Specified by:

values in interface Map<Long,Boolean>

Specified by:

values in interface SortedMap<Long,Boolean>

Overrides:

values in class AbstractLong2BooleanSortedMap

Returns:

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

See Also:

• Map.values()

comparator

public LongComparator comparator()

Description copied from interface: Long2BooleanSortedMap

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

Specified by:

comparator in interface Long2BooleanSortedMap

Specified by:

comparator in interface SortedMap<Long,Boolean>

See Also:

• SortedMap.comparator()

headMap

public Long2BooleanSortedMap headMap(long to)

Description copied from interface: Long2BooleanSortedMap

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

Specified by:

headMap in interface Long2BooleanSortedMap

See Also:

• SortedMap.headMap(Object)

tailMap

public Long2BooleanSortedMap tailMap(long from)

Description copied from interface: Long2BooleanSortedMap

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

Specified by:

tailMap in interface Long2BooleanSortedMap

See Also:

• SortedMap.tailMap(Object)

subMap

public Long2BooleanSortedMap subMap(long from,
 long to)

Description copied from interface: Long2BooleanSortedMap

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

Specified by:

subMap in interface Long2BooleanSortedMap

See Also:

• SortedMap.subMap(Object,Object)

clone

public Long2BooleanRBTreeMap 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.