|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.shorts.AbstractShort2BooleanFunction
it.unimi.dsi.fastutil.shorts.AbstractShort2BooleanMap
it.unimi.dsi.fastutil.shorts.AbstractShort2BooleanSortedMap
it.unimi.dsi.fastutil.shorts.Short2BooleanRBTreeMap
public class Short2BooleanRBTreeMap
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/interfaces inherited from class it.unimi.dsi.fastutil.shorts.AbstractShort2BooleanSortedMap |
---|
AbstractShort2BooleanSortedMap.KeySetIterator, AbstractShort2BooleanSortedMap.ValuesCollection, AbstractShort2BooleanSortedMap.ValuesIterator |
Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.shorts.AbstractShort2BooleanMap |
---|
AbstractShort2BooleanMap.BasicEntry |
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.shorts.Short2BooleanSortedMap |
---|
Short2BooleanSortedMap.FastSortedEntrySet |
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.shorts.Short2BooleanMap |
---|
Short2BooleanMap.FastEntrySet |
Field Summary | |
---|---|
protected ShortComparator |
actualComparator
This map's actual comparator; it may differ from storedComparator because it is
always a type-specific comparator, so it could be derived from the former by wrapping. |
protected int |
count
Number of entries in this map. |
protected ObjectSortedSet<Short2BooleanMap.Entry> |
entries
Cached set of entries. |
protected it.unimi.dsi.fastutil.shorts.Short2BooleanRBTreeMap.Entry |
firstEntry
The first key in this map. |
protected ShortSortedSet |
keys
Cached set of keys. |
protected it.unimi.dsi.fastutil.shorts.Short2BooleanRBTreeMap.Entry |
lastEntry
The last key in this map. |
protected boolean |
modified
The value of this variable remembers, after a put()
or a remove() , whether the domain of the map
has been modified. |
static long |
serialVersionUID
|
protected Comparator<? super Short> |
storedComparator
This map's comparator, as provided in the constructor. |
protected it.unimi.dsi.fastutil.shorts.Short2BooleanRBTreeMap.Entry |
tree
A reference to the root entry. |
protected BooleanCollection |
values
Cached collection of values. |
Fields inherited from class it.unimi.dsi.fastutil.shorts.AbstractShort2BooleanFunction |
---|
defRetValue |
Constructor Summary | |
---|---|
Short2BooleanRBTreeMap()
Creates a new empty tree map. |
|
Short2BooleanRBTreeMap(Comparator<? super Short> c)
Creates a new empty tree map with the given comparator. |
|
Short2BooleanRBTreeMap(Map<? extends Short,? extends Boolean> m)
Creates a new tree map copying a given map. |
|
Short2BooleanRBTreeMap(short[] k,
boolean[] v)
Creates a new tree map using the elements of two parallel arrays. |
|
Short2BooleanRBTreeMap(short[] k,
boolean[] v,
Comparator<? super Short> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator. |
|
Short2BooleanRBTreeMap(Short2BooleanMap m)
Creates a new tree map copying a given map. |
|
Short2BooleanRBTreeMap(Short2BooleanSortedMap m)
Creates a new tree map copying a given sorted map (and its Comparator ). |
|
Short2BooleanRBTreeMap(SortedMap<Short,Boolean> m)
Creates a new tree map copying a given sorted map (and its Comparator ). |
Method Summary | |
---|---|
void |
clear()
Removes all associations from this function (optional operation). |
Short2BooleanRBTreeMap |
clone()
Returns a deep copy of this tree map. |
ShortComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering. |
boolean |
containsKey(short k)
Checks whether the given value is contained in AbstractShort2BooleanMap.keySet() . |
boolean |
containsValue(boolean v)
Checks whether the given value is contained in AbstractShort2BooleanMap.values() . |
short |
firstShortKey()
|
boolean |
get(short k)
Returns the value to which the given key is mapped. |
Short2BooleanSortedMap |
headMap(short to)
Returns a view of the portion of this sorted map whose keys are strictly less than toKey . |
boolean |
isEmpty()
|
ShortSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this map. |
short |
lastShortKey()
|
boolean |
put(short k,
boolean v)
Adds a pair to the map. |
Boolean |
put(Short ok,
Boolean ov)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
Boolean |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
boolean |
remove(short k)
Removes the mapping with the given key. |
ObjectSortedSet<Short2BooleanMap.Entry> |
short2BooleanEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map. |
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists. |
Short2BooleanSortedMap |
subMap(short from,
short to)
Returns a view of the portion of this sorted map whose keys range from fromKey , inclusive, to toKey , exclusive. |
Short2BooleanSortedMap |
tailMap(short from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to fromKey . |
BooleanCollection |
values()
Returns a type-specific collection view of the values contained in this map. |
Methods inherited from class it.unimi.dsi.fastutil.shorts.AbstractShort2BooleanSortedMap |
---|
entrySet, firstKey, headMap, lastKey, subMap, tailMap |
Methods inherited from class it.unimi.dsi.fastutil.shorts.AbstractShort2BooleanMap |
---|
containsValue, equals, hashCode, putAll, toString |
Methods inherited from class it.unimi.dsi.fastutil.shorts.AbstractShort2BooleanFunction |
---|
containsKey, defaultReturnValue, defaultReturnValue, get |
Methods inherited from class java.lang.Object |
---|
finalize, getClass, notify, notifyAll, wait, wait, wait |
Methods inherited from interface it.unimi.dsi.fastutil.shorts.Short2BooleanFunction |
---|
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 |
Field Detail |
---|
protected transient it.unimi.dsi.fastutil.shorts.Short2BooleanRBTreeMap.Entry tree
protected int count
protected transient it.unimi.dsi.fastutil.shorts.Short2BooleanRBTreeMap.Entry firstEntry
protected transient it.unimi.dsi.fastutil.shorts.Short2BooleanRBTreeMap.Entry lastEntry
protected transient volatile ObjectSortedSet<Short2BooleanMap.Entry> entries
protected transient volatile ShortSortedSet keys
protected transient volatile BooleanCollection values
protected transient boolean modified
put()
or a remove()
, whether the domain of the map
has been modified.
protected Comparator<? super Short> storedComparator
protected transient ShortComparator actualComparator
storedComparator
because it is
always a type-specific comparator, so it could be derived from the former by wrapping.
public static final long serialVersionUID
Constructor Detail |
---|
public Short2BooleanRBTreeMap()
public Short2BooleanRBTreeMap(Comparator<? super Short> c)
c
- a (possibly type-specific) comparator.public Short2BooleanRBTreeMap(Map<? extends Short,? extends Boolean> m)
m
- a Map
to be copied into the new tree map.public Short2BooleanRBTreeMap(SortedMap<Short,Boolean> m)
Comparator
).
m
- a SortedMap
to be copied into the new tree map.public Short2BooleanRBTreeMap(Short2BooleanMap m)
m
- a type-specific map to be copied into the new tree map.public Short2BooleanRBTreeMap(Short2BooleanSortedMap m)
Comparator
).
m
- a type-specific sorted map to be copied into the new tree map.public Short2BooleanRBTreeMap(short[] k, boolean[] v, Comparator<? super Short> c)
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.
IllegalArgumentException
- if k
and v
have different lengths.public Short2BooleanRBTreeMap(short[] k, boolean[] v)
k
- the array of keys of the new tree map.v
- the array of corresponding values in the new tree map.
IllegalArgumentException
- if k
and v
have different lengths.Method Detail |
---|
public boolean put(short k, boolean v)
Short2BooleanFunction
put
in interface Short2BooleanFunction
put
in class AbstractShort2BooleanFunction
k
- the key.v
- the value.
Function.put(Object,Object)
public boolean remove(short k)
Short2BooleanFunction
remove
in interface Short2BooleanFunction
remove
in class AbstractShort2BooleanFunction
Function.remove(Object)
public Boolean put(Short ok, Boolean ov)
AbstractShort2BooleanFunction
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 Function<Short,Boolean>
put
in interface Map<Short,Boolean>
put
in class AbstractShort2BooleanFunction
ok
- the key.ov
- the value.
null
if no value was present for the given key.Map.put(Object,Object)
public Boolean remove(Object ok)
AbstractShort2BooleanFunction
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 Function<Short,Boolean>
remove
in interface Map<Short,Boolean>
remove
in class AbstractShort2BooleanFunction
null
if no value was present for the given key.Map.remove(Object)
public boolean containsValue(boolean v)
AbstractShort2BooleanMap
AbstractShort2BooleanMap.values()
.
containsValue
in interface Short2BooleanMap
containsValue
in class AbstractShort2BooleanMap
Map.containsValue(Object)
public void clear()
Function
clear
in interface Function<Short,Boolean>
clear
in interface Map<Short,Boolean>
clear
in class AbstractShort2BooleanFunction
Map.clear()
public boolean containsKey(short k)
AbstractShort2BooleanMap
AbstractShort2BooleanMap.keySet()
.
containsKey
in interface Short2BooleanFunction
containsKey
in class AbstractShort2BooleanMap
Function.containsKey(Object)
public int size()
Function
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.
size
in interface Function<Short,Boolean>
size
in interface Map<Short,Boolean>
public boolean isEmpty()
isEmpty
in interface Map<Short,Boolean>
isEmpty
in class AbstractShort2BooleanMap
public boolean get(short k)
Short2BooleanFunction
get
in interface Short2BooleanFunction
k
- the key.
Function.get(Object)
public short firstShortKey()
firstShortKey
in interface Short2BooleanSortedMap
SortedMap.firstKey()
public short lastShortKey()
lastShortKey
in interface Short2BooleanSortedMap
SortedMap.lastKey()
public ObjectSortedSet<Short2BooleanMap.Entry> short2BooleanEntrySet()
Short2BooleanSortedMap
short2BooleanEntrySet
in interface Short2BooleanMap
short2BooleanEntrySet
in interface Short2BooleanSortedMap
Short2BooleanSortedMap.entrySet()
public ShortSortedSet 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 Short2BooleanMap
keySet
in interface Short2BooleanSortedMap
keySet
in interface Map<Short,Boolean>
keySet
in interface SortedMap<Short,Boolean>
keySet
in class AbstractShort2BooleanSortedMap
Map.keySet()
public BooleanCollection 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 Short2BooleanMap
values
in interface Short2BooleanSortedMap
values
in interface Map<Short,Boolean>
values
in interface SortedMap<Short,Boolean>
values
in class AbstractShort2BooleanSortedMap
Map.values()
public ShortComparator comparator()
Short2BooleanSortedMap
Note that this specification strengthens the one given in SortedMap.comparator()
.
comparator
in interface Short2BooleanSortedMap
comparator
in interface SortedMap<Short,Boolean>
SortedMap.comparator()
public Short2BooleanSortedMap headMap(short to)
Short2BooleanSortedMap
toKey
.
headMap
in interface Short2BooleanSortedMap
SortedMap.headMap(Object)
public Short2BooleanSortedMap tailMap(short from)
Short2BooleanSortedMap
fromKey
.
tailMap
in interface Short2BooleanSortedMap
SortedMap.tailMap(Object)
public Short2BooleanSortedMap subMap(short from, short to)
Short2BooleanSortedMap
fromKey
, inclusive, to toKey
, exclusive.
subMap
in interface Short2BooleanSortedMap
SortedMap.subMap(Object,Object)
public Short2BooleanRBTreeMap 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.
clone
in class Object
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |