it.unimi.dsi.fastutil.chars
Class Char2ByteRBTreeMap

java.lang.Object
  it.unimi.dsi.fastutil.chars.AbstractChar2ByteMap
      it.unimi.dsi.fastutil.chars.AbstractChar2ByteSortedMap
          it.unimi.dsi.fastutil.chars.Char2ByteRBTreeMap

All Implemented Interfaces:

Char2ByteMap, Char2ByteSortedMap, Cloneable, Map, Serializable, SortedMap

public class Char2ByteRBTreeMap

extends AbstractChar2ByteSortedMap

implements Serializable, Cloneable, Char2ByteSortedMap

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 inherited from class it.unimi.dsi.fastutil.chars.AbstractChar2ByteMap

AbstractChar2ByteMap.BasicEntry

Field Summary

static long

serialVersionUID

Constructor Summary

Char2ByteRBTreeMap()
Creates a new empty tree map.

Char2ByteRBTreeMap(Char2ByteMap m)
Creates a new tree map copying a given map.

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

Char2ByteRBTreeMap(Comparator c)
Creates a new empty tree map with the given comparator.

Char2ByteRBTreeMap(Map m)
Creates a new tree map copying a given map.

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

Method Summary

void	clear()
Object	clone() Returns a deep copy of this tree map.
Comparator	comparator()
boolean	containsKey(char k) Checks whether the given value is contained in keySet().
boolean	containsValue(byte v) Checks whether the given value is contained in values().
Set	entrySet()
char	firstCharKey()
Object	firstKey() Delegates to the corresponding type-specific method.
byte	get(char k) Returns the value to which the given key is mapped.
Object	get(Object ok) Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
Char2ByteSortedMap	headMap(char to)
boolean	isEmpty()
Set	keySet() Returns a type-specific sorted set view of the keys contained in this map.
char	lastCharKey()
Object	lastKey() Delegates to the corresponding type-specific method.
byte	put(char k, byte v) Adds a pair to the map.
Object	put(Object ok, Object ov) Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
byte	remove(char k) Removes the mapping with the given key.
Object	remove(Object ok) Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
int	size()
Char2ByteSortedMap	subMap(char from, char to)
Char2ByteSortedMap	tailMap(char from)
Collection	values() Returns a type-specific collection view of the values contained in this map.

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

headMap, subMap, tailMap

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

containsKey, containsValue, defaultReturnValue, defaultReturnValue, equals, getDefRetValue, hashCode, putAll, setDefRetValue, toString

Methods inherited from class java.lang.Object

getClass, notify, notifyAll, wait, wait, wait

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

defaultReturnValue, defaultReturnValue, getDefRetValue, setDefRetValue

Methods inherited from interface java.util.Map

containsKey, containsValue, equals, hashCode, putAll

Methods inherited from interface java.util.SortedMap

headMap, subMap, tailMap

Field Detail

serialVersionUID

public static final long serialVersionUID

See Also:

Constant Field Values

Constructor Detail

Char2ByteRBTreeMap

public Char2ByteRBTreeMap()

Creates a new empty tree map.

Char2ByteRBTreeMap

public Char2ByteRBTreeMap(Comparator c)

Creates a new empty tree map with the given comparator.

Parameters:

c - a Comparator.

Char2ByteRBTreeMap

public Char2ByteRBTreeMap(Map m)

Creates a new tree map copying a given map.

Parameters:

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

Char2ByteRBTreeMap

public Char2ByteRBTreeMap(SortedMap 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.

Char2ByteRBTreeMap

public Char2ByteRBTreeMap(Char2ByteMap m)

Creates a new tree map copying a given map.

Parameters:

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

Char2ByteRBTreeMap

public Char2ByteRBTreeMap(Char2ByteSortedMap 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.

Method Detail

put

public final byte put(char k,
                      byte v)

Description copied from interface: Char2ByteMap

Adds a pair to the map.

Specified by:

put in interface Char2ByteMap

Overrides:

put in class AbstractChar2ByteMap

remove

public final byte remove(char k)

Description copied from interface: Char2ByteMap

Removes the mapping with the given key.

Specified by:

remove in interface Char2ByteMap

Overrides:

remove in class AbstractChar2ByteMap

put

public Object put(Object ok,
                  Object ov)

Description copied from class: AbstractChar2ByteMap

Delegates to the corresponding type-specific method, taking care of returning null on a missing key.

This method must check whether the provided key is in the map using containsKey(). Thus, it probes the map twice. Implementors of subclasses should override it with a more efficient method.

Specified by:

put in interface Map

Overrides:

put in class AbstractChar2ByteMap

remove

public Object remove(Object ok)

Description copied from class: AbstractChar2ByteMap

Delegates to the corresponding type-specific method, taking care of returning null on a missing key.

This method must check whether the provided key is in the map using containsKey(). Thus, it probes the map twice. Implementors of subclasses should override it with a more efficient method.

Specified by:

remove in interface Map

Overrides:

remove in class AbstractChar2ByteMap

containsValue

public boolean containsValue(byte v)

Description copied from class: AbstractChar2ByteMap

Checks whether the given value is contained in AbstractChar2ByteMap.values().

Specified by:

containsValue in interface Char2ByteMap

Overrides:

containsValue in class AbstractChar2ByteMap

clear

public void clear()

Specified by:

clear in interface Map

Overrides:

clear in class AbstractChar2ByteMap

containsKey

public boolean containsKey(char k)

Description copied from class: AbstractChar2ByteMap

Checks whether the given value is contained in AbstractChar2ByteMap.keySet().

Specified by:

containsKey in interface Char2ByteMap

Overrides:

containsKey in class AbstractChar2ByteMap

size

public int size()

Specified by:

size in interface Map

isEmpty

public boolean isEmpty()

Specified by:

isEmpty in interface Map

Overrides:

isEmpty in class AbstractChar2ByteMap

get

public byte get(char k)

Description copied from interface: Char2ByteMap

Returns the value to which the given key is mapped.

Specified by:

get in interface Char2ByteMap

Parameters:

k - the key.

Returns:

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

See Also:

Map.get(Object)

get

public Object get(Object ok)

Description copied from class: AbstractChar2ByteMap

Delegates to the corresponding type-specific method, taking care of returning null on a missing key.

This method must check whether the provided key is in the map using containsKey(). Thus, it probes the map twice. Implementors of subclasses should override it with a more efficient method.

Specified by:

get in interface Map

Overrides:

get in class AbstractChar2ByteMap

firstCharKey

public char firstCharKey()

Specified by:

firstCharKey in interface Char2ByteSortedMap

See Also:

SortedMap.firstKey()

lastCharKey

public char lastCharKey()

Specified by:

lastCharKey in interface Char2ByteSortedMap

See Also:

SortedMap.lastKey()

firstKey

public Object firstKey()

Description copied from class: AbstractChar2ByteSortedMap

Delegates to the corresponding type-specific method.

Specified by:

firstKey in interface SortedMap

Overrides:

firstKey in class AbstractChar2ByteSortedMap

lastKey

public Object lastKey()

Description copied from class: AbstractChar2ByteSortedMap

Delegates to the corresponding type-specific method.

Specified by:

lastKey in interface SortedMap

Overrides:

lastKey in class AbstractChar2ByteSortedMap

entrySet

public Set entrySet()

Specified by:

entrySet in interface Map

keySet

public Set 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 Map

Overrides:

keySet in class AbstractChar2ByteSortedMap

Returns:

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

values

public Collection 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 Map

Overrides:

values in class AbstractChar2ByteMap

Returns:

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

comparator

public Comparator comparator()

Specified by:

comparator in interface SortedMap

headMap

public Char2ByteSortedMap headMap(char to)

Specified by:

headMap in interface Char2ByteSortedMap

See Also:

SortedMap.headMap(Object)

tailMap

public Char2ByteSortedMap tailMap(char from)

Specified by:

tailMap in interface Char2ByteSortedMap

See Also:

SortedMap.tailMap(Object)

subMap

public Char2ByteSortedMap subMap(char from,
                                 char to)

Specified by:

subMap in interface Char2ByteSortedMap

See Also:

SortedMap.subMap(Object,Object)

clone

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