it.unimi.dsi.fastutil.bytes
Class Byte2IntRBTreeMap

java.lang.Object
  it.unimi.dsi.fastutil.bytes.AbstractByte2IntMap
      it.unimi.dsi.fastutil.bytes.AbstractByte2IntSortedMap
          it.unimi.dsi.fastutil.bytes.Byte2IntRBTreeMap

All Implemented Interfaces:

Byte2IntMap, Byte2IntSortedMap, Cloneable, Map, Serializable, SortedMap

public class Byte2IntRBTreeMap

extends AbstractByte2IntSortedMap

implements Serializable, Cloneable, Byte2IntSortedMap

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.bytes.AbstractByte2IntMap

AbstractByte2IntMap.BasicEntry

Field Summary

static long

serialVersionUID

Constructor Summary

Byte2IntRBTreeMap()
Creates a new empty tree map.

Byte2IntRBTreeMap(Byte2IntMap m)
Creates a new tree map copying a given map.

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

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

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

Byte2IntRBTreeMap(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(byte k) Checks whether the given value is contained in keySet().
boolean	containsValue(int v) Checks whether the given value is contained in values().
Set	entrySet()
byte	firstByteKey()
Object	firstKey() Delegates to the corresponding type-specific method.
int	get(byte 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.
Byte2IntSortedMap	headMap(byte to)
boolean	isEmpty()
Set	keySet() Returns a type-specific sorted set view of the keys contained in this map.
byte	lastByteKey()
Object	lastKey() Delegates to the corresponding type-specific method.
int	put(byte k, int 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.
int	remove(byte 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()
Byte2IntSortedMap	subMap(byte from, byte to)
Byte2IntSortedMap	tailMap(byte from)
Collection	values() Returns a type-specific collection view of the values contained in this map.

Methods inherited from class it.unimi.dsi.fastutil.bytes.AbstractByte2IntSortedMap

headMap, subMap, tailMap

Methods inherited from class it.unimi.dsi.fastutil.bytes.AbstractByte2IntMap

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.bytes.Byte2IntMap

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

Byte2IntRBTreeMap

public Byte2IntRBTreeMap()

Creates a new empty tree map.

Byte2IntRBTreeMap

public Byte2IntRBTreeMap(Comparator c)

Creates a new empty tree map with the given comparator.

Parameters:

c - a Comparator.

Byte2IntRBTreeMap

public Byte2IntRBTreeMap(Map m)

Creates a new tree map copying a given map.

Parameters:

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

Byte2IntRBTreeMap

public Byte2IntRBTreeMap(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.

Byte2IntRBTreeMap

public Byte2IntRBTreeMap(Byte2IntMap m)

Creates a new tree map copying a given map.

Parameters:

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

Byte2IntRBTreeMap

public Byte2IntRBTreeMap(Byte2IntSortedMap 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 int put(byte k,
                     int v)

Description copied from interface: Byte2IntMap

Adds a pair to the map.

Specified by:

put in interface Byte2IntMap

Overrides:

put in class AbstractByte2IntMap

remove

public final int remove(byte k)

Description copied from interface: Byte2IntMap

Removes the mapping with the given key.

Specified by:

remove in interface Byte2IntMap

Overrides:

remove in class AbstractByte2IntMap

put

public Object put(Object ok,
                  Object ov)

Description copied from class: AbstractByte2IntMap

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 AbstractByte2IntMap

remove

public Object remove(Object ok)

Description copied from class: AbstractByte2IntMap

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 AbstractByte2IntMap

containsValue

public boolean containsValue(int v)

Description copied from class: AbstractByte2IntMap

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

Specified by:

containsValue in interface Byte2IntMap

Overrides:

containsValue in class AbstractByte2IntMap

clear

public void clear()

Specified by:

clear in interface Map

Overrides:

clear in class AbstractByte2IntMap

containsKey

public boolean containsKey(byte k)

Description copied from class: AbstractByte2IntMap

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

Specified by:

containsKey in interface Byte2IntMap

Overrides:

containsKey in class AbstractByte2IntMap

size

public int size()

Specified by:

size in interface Map

isEmpty

public boolean isEmpty()

Specified by:

isEmpty in interface Map

Overrides:

isEmpty in class AbstractByte2IntMap

get

public int get(byte k)

Description copied from interface: Byte2IntMap

Returns the value to which the given key is mapped.

Specified by:

get in interface Byte2IntMap

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

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 AbstractByte2IntMap

firstByteKey

public byte firstByteKey()

Specified by:

firstByteKey in interface Byte2IntSortedMap

See Also:

SortedMap.firstKey()

lastByteKey

public byte lastByteKey()

Specified by:

lastByteKey in interface Byte2IntSortedMap

See Also:

SortedMap.lastKey()

firstKey

public Object firstKey()

Description copied from class: AbstractByte2IntSortedMap

Delegates to the corresponding type-specific method.

Specified by:

firstKey in interface SortedMap

Overrides:

firstKey in class AbstractByte2IntSortedMap

lastKey

public Object lastKey()

Description copied from class: AbstractByte2IntSortedMap

Delegates to the corresponding type-specific method.

Specified by:

lastKey in interface SortedMap

Overrides:

lastKey in class AbstractByte2IntSortedMap

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 AbstractByte2IntSortedMap

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 AbstractByte2IntMap

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 Byte2IntSortedMap headMap(byte to)

Specified by:

headMap in interface Byte2IntSortedMap

See Also:

SortedMap.headMap(Object)

tailMap

public Byte2IntSortedMap tailMap(byte from)

Specified by:

tailMap in interface Byte2IntSortedMap

See Also:

SortedMap.tailMap(Object)

subMap

public Byte2IntSortedMap subMap(byte from,
                                byte to)

Specified by:

subMap in interface Byte2IntSortedMap

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.