|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.chars.AbstractChar2BooleanMap
it.unimi.dsi.fastutil.chars.AbstractChar2BooleanSortedMap
it.unimi.dsi.fastutil.chars.Char2BooleanRBTreeMap
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.
Nested Class Summary |
Nested classes inherited from class it.unimi.dsi.fastutil.chars.AbstractChar2BooleanMap |
AbstractChar2BooleanMap.BasicEntry |
Field Summary | |
static long |
serialVersionUID
|
Constructor Summary | |
Char2BooleanRBTreeMap()
Creates a new empty tree map. |
|
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 c)
Creates a new empty tree map with the given comparator. |
|
Char2BooleanRBTreeMap(Map m)
Creates a new tree map copying a given map. |
|
Char2BooleanRBTreeMap(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(boolean v)
Checks whether the given value is contained in values() . |
Set |
entrySet()
|
char |
firstCharKey()
|
Object |
firstKey()
Delegates to the corresponding type-specific method. |
boolean |
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.
|
Char2BooleanSortedMap |
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. |
boolean |
put(char k,
boolean 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.
|
boolean |
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()
|
Char2BooleanSortedMap |
subMap(char from,
char to)
|
Char2BooleanSortedMap |
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.AbstractChar2BooleanSortedMap |
headMap, subMap, tailMap |
Methods inherited from class it.unimi.dsi.fastutil.chars.AbstractChar2BooleanMap |
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.Char2BooleanMap |
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 |
public static final long serialVersionUID
Constructor Detail |
public Char2BooleanRBTreeMap()
public Char2BooleanRBTreeMap(Comparator c)
c
- a Comparator
.public Char2BooleanRBTreeMap(Map m)
m
- a Map
to be copied into the new tree map.public Char2BooleanRBTreeMap(SortedMap m)
Comparator
).
m
- a SortedMap
to be copied into the new tree map.public Char2BooleanRBTreeMap(Char2BooleanMap m)
m
- a type-specific map to be copied into the new tree map.public Char2BooleanRBTreeMap(Char2BooleanSortedMap m)
Comparator
).
m
- a type-specific sorted map to be copied into the new tree map.Method Detail |
public boolean put(char k, boolean v)
Char2BooleanMap
put
in interface Char2BooleanMap
put
in class AbstractChar2BooleanMap
public boolean remove(char k)
Char2BooleanMap
remove
in interface Char2BooleanMap
remove
in class AbstractChar2BooleanMap
public Object put(Object ok, Object ov)
AbstractChar2BooleanMap
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.
put
in interface Map
put
in class AbstractChar2BooleanMap
public Object remove(Object ok)
AbstractChar2BooleanMap
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.
remove
in interface Map
remove
in class AbstractChar2BooleanMap
public boolean containsValue(boolean v)
AbstractChar2BooleanMap
AbstractChar2BooleanMap.values()
.
containsValue
in interface Char2BooleanMap
containsValue
in class AbstractChar2BooleanMap
public void clear()
clear
in interface Map
clear
in class AbstractChar2BooleanMap
public boolean containsKey(char k)
AbstractChar2BooleanMap
AbstractChar2BooleanMap.keySet()
.
containsKey
in interface Char2BooleanMap
containsKey
in class AbstractChar2BooleanMap
public int size()
size
in interface Map
public boolean isEmpty()
isEmpty
in interface Map
isEmpty
in class AbstractChar2BooleanMap
public boolean get(char k)
Char2BooleanMap
get
in interface Char2BooleanMap
k
- the key.
Map.get(Object)
public Object get(Object ok)
AbstractChar2BooleanMap
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.
get
in interface Map
get
in class AbstractChar2BooleanMap
public char firstCharKey()
firstCharKey
in interface Char2BooleanSortedMap
SortedMap.firstKey()
public char lastCharKey()
lastCharKey
in interface Char2BooleanSortedMap
SortedMap.lastKey()
public Object firstKey()
AbstractChar2BooleanSortedMap
firstKey
in interface SortedMap
firstKey
in class AbstractChar2BooleanSortedMap
public Object lastKey()
AbstractChar2BooleanSortedMap
lastKey
in interface SortedMap
lastKey
in class AbstractChar2BooleanSortedMap
public Set entrySet()
entrySet
in interface Map
public Set keySet()
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.
keySet
in interface Map
keySet
in class AbstractChar2BooleanSortedMap
public Collection values()
In addition to the semantics of Map.values()
, you can
safely cast the collection returned by this call to a type-specific collection
interface.
values
in interface Map
values
in class AbstractChar2BooleanMap
public Comparator comparator()
comparator
in interface SortedMap
public Char2BooleanSortedMap headMap(char to)
headMap
in interface Char2BooleanSortedMap
SortedMap.headMap(Object)
public Char2BooleanSortedMap tailMap(char from)
tailMap
in interface Char2BooleanSortedMap
SortedMap.tailMap(Object)
public Char2BooleanSortedMap subMap(char from, char to)
subMap
in interface Char2BooleanSortedMap
SortedMap.subMap(Object,Object)
public Object clone()
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.
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |