it.unimi.dsi.fastutil.bytes
Class Byte2ByteRBTreeMap

java.lang.Object
  it.unimi.dsi.fastutil.bytes.AbstractByte2ByteFunction
      it.unimi.dsi.fastutil.bytes.AbstractByte2ByteMap
          it.unimi.dsi.fastutil.bytes.AbstractByte2ByteSortedMap
              it.unimi.dsi.fastutil.bytes.Byte2ByteRBTreeMap

All Implemented Interfaces:

Byte2ByteFunction, Byte2ByteMap, Byte2ByteSortedMap, Function<Byte,Byte>, Serializable, Cloneable, Map<Byte,Byte>, SortedMap<Byte,Byte>

public class Byte2ByteRBTreeMap
extends AbstractByte2ByteSortedMap
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.bytes.AbstractByte2ByteMap

AbstractByte2ByteMap.BasicEntry

Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.bytes.Byte2ByteSortedMap

Byte2ByteSortedMap.FastSortedEntrySet

Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.bytes.Byte2ByteMap

Byte2ByteMap.FastEntrySet

Field Summary

static long

serialVersionUID

Constructor Summary

Byte2ByteRBTreeMap()
Creates a new empty tree map.

Byte2ByteRBTreeMap(byte[] k, byte[] v)
Creates a new tree map using the elements of two parallel arrays.

Byte2ByteRBTreeMap(byte[] k, byte[] v, Comparator<? super Byte> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.

Byte2ByteRBTreeMap(Byte2ByteMap m)
Creates a new tree map copying a given map.

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

Byte2ByteRBTreeMap(Comparator<? super Byte> c)
Creates a new empty tree map with the given comparator.

Byte2ByteRBTreeMap(Map<? extends Byte,? extends Byte> m)
Creates a new tree map copying a given map.

Byte2ByteRBTreeMap(SortedMap<Byte,Byte> m)
Creates a new tree map copying a given sorted map (and its Comparator).

Method Summary

ObjectSortedSet<Byte2ByteMap.Entry>	byte2ByteEntrySet() Returns a type-specific set view of the mappings contained in this map.
void	clear() Removes all associations from this function (optional operation).
Object	clone() Returns a deep copy of this tree map.
ByteComparator	comparator() Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
boolean	containsKey(byte k) Checks whether the given value is contained in AbstractByte2ByteMap.keySet().
boolean	containsValue(byte v) Checks whether the given value is contained in AbstractByte2ByteMap.values().
byte	firstByteKey()
byte	get(byte k) Returns the value to which the given key is mapped.
Byte2ByteSortedMap	headMap(byte to) Returns a view of the portion of this sorted map whose keys are strictly less than toKey.
boolean	isEmpty()
ByteSortedSet	keySet() Returns a type-specific sorted set view of the keys contained in this map.
byte	lastByteKey()
byte	put(byte k, byte v) Adds a pair to the map.
Byte	put(Byte ok, Byte ov) Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
byte	remove(byte k) Removes the mapping with the given key.
Byte	remove(Object ok) Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
int	size() Returns the intended number of keys in this function, or -1 if no such number exists.
Byte2ByteSortedMap	subMap(byte from, byte to) Returns a view of the portion of this sorted map whose keys range from fromKey, inclusive, to toKey, exclusive.
Byte2ByteSortedMap	tailMap(byte from) Returns a view of the portion of this sorted map whose keys are greater than or equal to fromKey.
ByteCollection	values() Returns a type-specific collection view of the values contained in this map.

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

entrySet, firstKey, headMap, lastKey, subMap, tailMap

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

containsValue, equals, hashCode, putAll, toString

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

containsKey, defaultReturnValue, defaultReturnValue, get

Methods inherited from class java.lang.Object

getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface it.unimi.dsi.fastutil.bytes.Byte2ByteFunction

defaultReturnValue, defaultReturnValue

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

containsKey, get

Methods inherited from interface java.util.Map

containsKey, containsValue, equals, get, hashCode, putAll

Methods inherited from interface java.util.Map

containsKey, containsValue, equals, get, hashCode, putAll

Field Detail

serialVersionUID

public static final long serialVersionUID

See Also:

Constant Field Values

Constructor Detail

Byte2ByteRBTreeMap

public Byte2ByteRBTreeMap()

Creates a new empty tree map.

Byte2ByteRBTreeMap

public Byte2ByteRBTreeMap(Comparator<? super Byte> c)

Creates a new empty tree map with the given comparator.

Parameters:

c - a (possibly type-specific) comparator.

Byte2ByteRBTreeMap

public Byte2ByteRBTreeMap(Map<? extends Byte,? extends Byte> m)

Creates a new tree map copying a given map.

Parameters:

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

Byte2ByteRBTreeMap

public Byte2ByteRBTreeMap(SortedMap<Byte,Byte> 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.

Byte2ByteRBTreeMap

public Byte2ByteRBTreeMap(Byte2ByteMap m)

Creates a new tree map copying a given map.

Parameters:

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

Byte2ByteRBTreeMap

public Byte2ByteRBTreeMap(Byte2ByteSortedMap 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.

Byte2ByteRBTreeMap

public Byte2ByteRBTreeMap(byte[] k,
                          byte[] v,
                          Comparator<? super Byte> 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.

Byte2ByteRBTreeMap

public Byte2ByteRBTreeMap(byte[] k,
                          byte[] 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 Detail

put

public byte put(byte k,
                byte v)

Description copied from interface: Byte2ByteFunction

Adds a pair to the map.

Specified by:

put in interface Byte2ByteFunction

Overrides:

put in class AbstractByte2ByteFunction

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

Description copied from interface: Byte2ByteFunction

Removes the mapping with the given key.

Specified by:

remove in interface Byte2ByteFunction

Overrides:

remove in class AbstractByte2ByteFunction

Returns:

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

See Also:

Function.remove(Object)

put

public Byte put(Byte ok,
                Byte ov)

Description copied from class: AbstractByte2ByteFunction

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 Function<Byte,Byte>

Specified by:

put in interface Map<Byte,Byte>

Overrides:

put in class AbstractByte2ByteFunction

Parameters:

ok - the key.

ov - the value.

Returns:

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

See Also:

Map.put(Object,Object)

remove

public Byte remove(Object ok)

Description copied from class: AbstractByte2ByteFunction

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 Function<Byte,Byte>

Specified by:

remove in interface Map<Byte,Byte>

Overrides:

remove in class AbstractByte2ByteFunction

Returns:

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

See Also:

Map.remove(Object)

containsValue

public boolean containsValue(byte v)

Description copied from class: AbstractByte2ByteMap

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

Specified by:

containsValue in interface Byte2ByteMap

Overrides:

containsValue in class AbstractByte2ByteMap

See Also:

Map.containsValue(Object)

clear

public void clear()

Description copied from interface: Function

Removes all associations from this function (optional operation).

Specified by:

clear in interface Function<Byte,Byte>

Specified by:

clear in interface Map<Byte,Byte>

Overrides:

clear in class AbstractByte2ByteFunction

See Also:

Map.clear()

containsKey

public boolean containsKey(byte k)

Description copied from class: AbstractByte2ByteMap

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

Specified by:

containsKey in interface Byte2ByteFunction

Overrides:

containsKey in class AbstractByte2ByteMap

See Also:

Function.containsKey(Object)

size

public int size()

Description copied from interface: Function

Returns the intended number of keys in this function, or -1 if no such number exists.

Most function implementations will have some knowledge of the intended number of keys in their domain. In some cases, however, this might not be possible.

Specified by:

size in interface Function<Byte,Byte>

Specified by:

size in interface Map<Byte,Byte>

Returns:

the intended number of keys in this function, or -1 if that number is not available.

isEmpty

public boolean isEmpty()

Specified by:

isEmpty in interface Map<Byte,Byte>

Overrides:

isEmpty in class AbstractByte2ByteMap

get

public byte get(byte k)

Description copied from interface: Byte2ByteFunction

Returns the value to which the given key is mapped.

Specified by:

get in interface Byte2ByteFunction

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)

firstByteKey

public byte firstByteKey()

Specified by:

firstByteKey in interface Byte2ByteSortedMap

See Also:

SortedMap.firstKey()

lastByteKey

public byte lastByteKey()

Specified by:

lastByteKey in interface Byte2ByteSortedMap

See Also:

SortedMap.lastKey()

byte2ByteEntrySet

public ObjectSortedSet<Byte2ByteMap.Entry> byte2ByteEntrySet()

Description copied from interface: Byte2ByteMap

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

This method is necessary because there is no inheritance along type parameters: it is thus impossible to strengthen Byte2ByteMap.entrySet() so that it returns an ObjectSet of objects of type Byte2ByteMap.Entry (the latter makes it possible to access keys and values with type-specific methods).

Specified by:

byte2ByteEntrySet in interface Byte2ByteMap

Specified by:

byte2ByteEntrySet in interface Byte2ByteSortedMap

Returns:

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

See Also:

Byte2ByteMap.entrySet()

keySet

public ByteSortedSet 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 Byte2ByteMap

Specified by:

keySet in interface Byte2ByteSortedMap

Specified by:

keySet in interface Map<Byte,Byte>

Overrides:

keySet in class AbstractByte2ByteSortedMap

Returns:

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

See Also:

Map.keySet()

values

public ByteCollection 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 Byte2ByteMap

Specified by:

values in interface Byte2ByteSortedMap

Specified by:

values in interface Map<Byte,Byte>

Overrides:

values in class AbstractByte2ByteSortedMap

Returns:

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

See Also:

Map.values()

comparator

public ByteComparator comparator()

Description copied from interface: Byte2ByteSortedMap

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

Note that this specification strengthens the one given in SortedMap.comparator().

Specified by:

comparator in interface Byte2ByteSortedMap

Specified by:

comparator in interface SortedMap<Byte,Byte>

See Also:

SortedMap.comparator()

headMap

public Byte2ByteSortedMap headMap(byte to)

Description copied from interface: Byte2ByteSortedMap

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

Specified by:

headMap in interface Byte2ByteSortedMap

See Also:

SortedMap.headMap(Object)

tailMap

public Byte2ByteSortedMap tailMap(byte from)

Description copied from interface: Byte2ByteSortedMap

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

Specified by:

tailMap in interface Byte2ByteSortedMap

See Also:

SortedMap.tailMap(Object)

subMap

public Byte2ByteSortedMap subMap(byte from,
                                 byte to)

Description copied from interface: Byte2ByteSortedMap

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

Specified by:

subMap in interface Byte2ByteSortedMap

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.

Overrides:

clone in class Object

Returns:

a deep copy of this tree map.