it.unimi.dsi.fastutil.ints
Class Int2ByteRBTreeMap

java.lang.Object
  extended byit.unimi.dsi.fastutil.ints.AbstractInt2ByteMap
      extended byit.unimi.dsi.fastutil.ints.Int2ByteRBTreeMap
All Implemented Interfaces:
Cloneable, Int2ByteMap, Int2ByteSortedMap, Map, Serializable, SortedMap

public class Int2ByteRBTreeMap
extends AbstractInt2ByteMap
implements Serializable, Cloneable, Int2ByteSortedMap

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

Field Summary
static long serialVersionUID
           
 
Constructor Summary
Int2ByteRBTreeMap()
          Creates a new empty tree map.
Int2ByteRBTreeMap(Comparator c)
          Creates a new empty tree map with the given comparator.
Int2ByteRBTreeMap(Int2ByteMap m)
          Creates a new tree map copying a given map.
Int2ByteRBTreeMap(Int2ByteSortedMap m)
          Creates a new tree map copying a given sorted map (and its Comparator).
Int2ByteRBTreeMap(Map m)
          Creates a new tree map copying a given map.
Int2ByteRBTreeMap(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(int k)
           
 boolean containsValue(byte v)
           
 Set entrySet()
           
 int firstIntKey()
           
 Object firstKey()
           
 byte get(int k)
          Returns the value to which the given key is mapped.
 Object get(Object ok)
           
 Int2ByteSortedMap headMap(int to)
           
 SortedMap headMap(Object to)
           
 boolean isEmpty()
           
 Set keySet()
          Returns a type-specific sorted set view of the keys contained in this map.
 int lastIntKey()
           
 Object lastKey()
           
 byte put(int k, byte v)
          Adds a pair to the map.
 Object put(Object ok, Object ov)
           
 byte remove(int k)
          Removes the mapping with the given key.
 Object remove(Object ok)
           
 int size()
           
 Int2ByteSortedMap subMap(int from, int to)
           
 SortedMap subMap(Object from, Object to)
           
 Int2ByteSortedMap tailMap(int from)
           
 SortedMap tailMap(Object from)
           
 Collection values()
          Returns a type-specific collection view of the values contained in this map.
 
Methods inherited from class it.unimi.dsi.fastutil.ints.AbstractInt2ByteMap
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.ints.Int2ByteMap
defaultReturnValue, defaultReturnValue, getDefRetValue, setDefRetValue
 
Methods inherited from interface java.util.Map
containsKey, containsValue, equals, hashCode, putAll
 

Field Detail

serialVersionUID

public static final long serialVersionUID
See Also:
Constant Field Values
Constructor Detail

Int2ByteRBTreeMap

public Int2ByteRBTreeMap()
Creates a new empty tree map.


Int2ByteRBTreeMap

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


Int2ByteRBTreeMap

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

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

Int2ByteRBTreeMap

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

Int2ByteRBTreeMap

public Int2ByteRBTreeMap(Int2ByteMap m)
Creates a new tree map copying a given map.

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

Int2ByteRBTreeMap

public Int2ByteRBTreeMap(Int2ByteSortedMap 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(int k,
                      byte v)
Description copied from interface: Int2ByteMap
Adds a pair to the map.

Specified by:
put in interface Int2ByteMap
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:
Map.put(Object,Object)

remove

public final byte remove(int k)
Description copied from interface: Int2ByteMap
Removes the mapping with the given key.

Specified by:
remove in interface Int2ByteMap
Parameters:
k -
Returns:
the old value, or the default return value if no value was present for the given key.
See Also:
Map.remove(Object)

put

public Object put(Object ok,
                  Object ov)
Specified by:
put in interface Map

remove

public Object remove(Object ok)
Specified by:
remove in interface Map

containsValue

public boolean containsValue(byte v)
Specified by:
containsValue in interface Int2ByteMap
See Also:
Map.containsValue(Object)

clear

public void clear()
Specified by:
clear in interface Map

containsKey

public boolean containsKey(int k)
Specified by:
containsKey in interface Int2ByteMap
See Also:
Map.containsKey(Object)

size

public int size()
Specified by:
size in interface Map

isEmpty

public boolean isEmpty()
Specified by:
isEmpty in interface Map

get

public Object get(Object ok)
Specified by:
get in interface Map

get

public byte get(int k)
Description copied from interface: Int2ByteMap
Returns the value to which the given key is mapped.

Specified by:
get in interface Int2ByteMap
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)

firstIntKey

public int firstIntKey()
Specified by:
firstIntKey in interface Int2ByteSortedMap
See Also:
SortedMap.firstKey()

lastIntKey

public int lastIntKey()
Specified by:
lastIntKey in interface Int2ByteSortedMap
See Also:
SortedMap.lastKey()

firstKey

public Object firstKey()
Specified by:
firstKey in interface SortedMap

lastKey

public Object lastKey()
Specified by:
lastKey in interface SortedMap

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
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
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 SortedMap headMap(Object to)
Specified by:
headMap in interface SortedMap

tailMap

public SortedMap tailMap(Object from)
Specified by:
tailMap in interface SortedMap

subMap

public SortedMap subMap(Object from,
                        Object to)
Specified by:
subMap in interface SortedMap

headMap

public Int2ByteSortedMap headMap(int to)
Specified by:
headMap in interface Int2ByteSortedMap
See Also:
SortedMap.headMap(Object)

tailMap

public Int2ByteSortedMap tailMap(int from)
Specified by:
tailMap in interface Int2ByteSortedMap
See Also:
SortedMap.tailMap(Object)

subMap

public Int2ByteSortedMap subMap(int from,
                                int to)
Specified by:
subMap in interface Int2ByteSortedMap
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.