Package it.unimi.dsi.fastutil.chars

Class Char2BooleanRBTreeMap

java.lang.Object

it.unimi.dsi.fastutil.chars.AbstractChar2BooleanFunction

it.unimi.dsi.fastutil.chars.AbstractChar2BooleanMap

it.unimi.dsi.fastutil.chars.AbstractChar2BooleanSortedMap

it.unimi.dsi.fastutil.chars.Char2BooleanRBTreeMap

All Implemented Interfaces:

Char2BooleanFunction, Char2BooleanMap, Char2BooleanSortedMap, Function<Character,Boolean>, Serializable, Cloneable, Function<Character,Boolean>, IntPredicate, Map<Character,Boolean>, SortedMap<Character,Boolean>

public class Char2BooleanRBTreeMap
extends AbstractChar2BooleanSortedMap
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.chars.AbstractChar2BooleanMap

AbstractChar2BooleanMap.BasicEntry, AbstractChar2BooleanMap.BasicEntrySet

Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.chars.Char2BooleanMap

Char2BooleanMap.FastEntrySet

Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.chars.Char2BooleanSortedMap

Char2BooleanSortedMap.FastSortedEntrySet

Constructor Summary

Constructors

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

Method Summary

Modifier and Type	Method	Description
ObjectSortedSet<Char2BooleanMap.Entry>	char2BooleanEntrySet()	Returns a type-specific sorted-set view of the mappings contained in this map.
void	clear()	Removes all of the mappings from this map (optional operation).
Char2BooleanRBTreeMap	clone()	Returns a deep copy of this tree map.
CharComparator	comparator()	Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
boolean	containsKey(char 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.
char	firstCharKey()	Returns the first (lowest) key currently in this map.
boolean	get(char k)	Returns the value to which the given key is mapped.
Char2BooleanSortedMap	headMap(char to)	Returns a view of the portion of this sorted map whose keys are strictly less than toKey.
boolean	isEmpty()
CharSortedSet	keySet()	Returns a type-specific sorted set view of the keys contained in this map.
char	lastCharKey()	Returns the last (highest) key currently in this map.
boolean	put(char k, boolean v)	Adds a pair to the map (optional operation).
boolean	remove(char k)	Removes the mapping with the given key (optional operation).
int	size()	Returns the number of key/value mappings in this map.
Char2BooleanSortedMap	subMap(char from, char to)	Returns a view of the portion of this sorted map whose keys range from fromKey, inclusive, to toKey, exclusive.
Char2BooleanSortedMap	tailMap(char 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.chars.AbstractChar2BooleanMap

equals, hashCode, putAll, toString

Methods inherited from class it.unimi.dsi.fastutil.chars.AbstractChar2BooleanFunction

defaultReturnValue, defaultReturnValue

Methods inherited from class java.lang.Object

getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface it.unimi.dsi.fastutil.chars.Char2BooleanFunction

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.chars.Char2BooleanMap

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.chars.Char2BooleanSortedMap

entrySet, firstKey, headMap, lastKey, subMap, tailMap

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

apply

Methods inherited from interface java.util.function.IntPredicate

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

Char2BooleanRBTreeMap

public Char2BooleanRBTreeMap()

Creates a new empty tree map.

Char2BooleanRBTreeMap

public Char2BooleanRBTreeMap(Comparator<? super Character> c)

Creates a new empty tree map with the given comparator.

Parameters:

c - a (possibly type-specific) comparator.

Char2BooleanRBTreeMap

public Char2BooleanRBTreeMap(Map<? extends Character,? extends Boolean> m)

Creates a new tree map copying a given map.

Parameters:

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

Char2BooleanRBTreeMap

public Char2BooleanRBTreeMap(SortedMap<Character,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.

Char2BooleanRBTreeMap

public Char2BooleanRBTreeMap(Char2BooleanMap m)

Creates a new tree map copying a given map.

Parameters:

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

Char2BooleanRBTreeMap

public Char2BooleanRBTreeMap(Char2BooleanSortedMap 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.

Char2BooleanRBTreeMap

public Char2BooleanRBTreeMap(char[] k,
 boolean[] v,
 Comparator<? super Character> 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.

Char2BooleanRBTreeMap

public Char2BooleanRBTreeMap(char[] 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(char k,
 boolean v)

Description copied from interface: Char2BooleanFunction

Adds a pair to the map (optional operation).

Specified by:

put in interface Char2BooleanFunction

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(char k)

Description copied from interface: Char2BooleanFunction

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

Specified by:

remove in interface Char2BooleanFunction

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

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

Specified by:

containsValue in interface Char2BooleanMap

Overrides:

containsValue in class AbstractChar2BooleanMap

See Also:

• Map.containsValue(Object)

clear

public void clear()

Description copied from interface: Char2BooleanMap

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

Specified by:

clear in interface Char2BooleanMap

Specified by:

clear in interface Function<Character,Boolean>

Specified by:

clear in interface Map<Character,Boolean>

See Also:

• Map.clear()

containsKey

public boolean containsKey(char k)

Description copied from class: AbstractChar2BooleanMap

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

Specified by:

containsKey in interface Char2BooleanFunction

Specified by:

containsKey in interface Char2BooleanMap

Overrides:

containsKey in class AbstractChar2BooleanMap

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

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 Char2BooleanMap

Specified by:

size in interface Function<Character,Boolean>

Specified by:

size in interface Map<Character,Boolean>

Returns:

the number of key-value mappings in this map.

See Also:

• Size64

isEmpty

public boolean isEmpty()

Specified by:

isEmpty in interface Map<Character,Boolean>

Overrides:

isEmpty in class AbstractChar2BooleanMap

get

public boolean get(char k)

Description copied from interface: Char2BooleanFunction

Returns the value to which the given key is mapped.

Specified by:

get in interface Char2BooleanFunction

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)

firstCharKey

public char firstCharKey()

Description copied from interface: Char2BooleanSortedMap

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

Specified by:

firstCharKey in interface Char2BooleanSortedMap

See Also:

• SortedMap.firstKey()

lastCharKey

public char lastCharKey()

Description copied from interface: Char2BooleanSortedMap

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

Specified by:

lastCharKey in interface Char2BooleanSortedMap

See Also:

• SortedMap.lastKey()

char2BooleanEntrySet

public ObjectSortedSet<Char2BooleanMap.Entry> char2BooleanEntrySet()

Description copied from interface: Char2BooleanSortedMap

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

Specified by:

char2BooleanEntrySet in interface Char2BooleanMap

Specified by:

char2BooleanEntrySet in interface Char2BooleanSortedMap

Returns:

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

See Also:

• Char2BooleanSortedMap.entrySet()

keySet

public CharSortedSet 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 Char2BooleanMap

Specified by:

keySet in interface Char2BooleanSortedMap

Specified by:

keySet in interface Map<Character,Boolean>

Specified by:

keySet in interface SortedMap<Character,Boolean>

Overrides:

keySet in class AbstractChar2BooleanSortedMap

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 Char2BooleanMap

Specified by:

values in interface Char2BooleanSortedMap

Specified by:

values in interface Map<Character,Boolean>

Specified by:

values in interface SortedMap<Character,Boolean>

Overrides:

values in class AbstractChar2BooleanSortedMap

Returns:

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

See Also:

• Map.values()

comparator

public CharComparator comparator()

Description copied from interface: Char2BooleanSortedMap

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

Specified by:

comparator in interface Char2BooleanSortedMap

Specified by:

comparator in interface SortedMap<Character,Boolean>

See Also:

• SortedMap.comparator()

headMap

public Char2BooleanSortedMap headMap(char to)

Description copied from interface: Char2BooleanSortedMap

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

Specified by:

headMap in interface Char2BooleanSortedMap

See Also:

• SortedMap.headMap(Object)

tailMap

public Char2BooleanSortedMap tailMap(char from)

Description copied from interface: Char2BooleanSortedMap

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

Specified by:

tailMap in interface Char2BooleanSortedMap

See Also:

• SortedMap.tailMap(Object)

subMap

public Char2BooleanSortedMap subMap(char from,
 char to)

Description copied from interface: Char2BooleanSortedMap

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

Specified by:

subMap in interface Char2BooleanSortedMap

See Also:

• SortedMap.subMap(Object,Object)

clone

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