public class Long2BooleanRBTreeMap extends AbstractLong2BooleanSortedMap implements java.io.Serializable, java.lang.Cloneable
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.
AbstractLong2BooleanMap.BasicEntry
Long2BooleanSortedMap.FastSortedEntrySet
Long2BooleanMap.FastEntrySet
Constructor and Description |
---|
Long2BooleanRBTreeMap()
Creates a new empty tree map.
|
Long2BooleanRBTreeMap(java.util.Comparator<? super java.lang.Long> c)
Creates a new empty tree map with the given comparator.
|
Long2BooleanRBTreeMap(long[] k,
boolean[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Long2BooleanRBTreeMap(long[] k,
boolean[] v,
java.util.Comparator<? super java.lang.Long> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Long2BooleanRBTreeMap(Long2BooleanMap m)
Creates a new tree map copying a given map.
|
Long2BooleanRBTreeMap(Long2BooleanSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Long2BooleanRBTreeMap(java.util.Map<? extends java.lang.Long,? extends java.lang.Boolean> m)
Creates a new tree map copying a given map.
|
Long2BooleanRBTreeMap(java.util.SortedMap<java.lang.Long,java.lang.Boolean> m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Modifier and Type | Method and Description |
---|---|
void |
clear()
Removes all associations from this function (optional operation).
|
Long2BooleanRBTreeMap |
clone()
Returns a deep copy of this tree map.
|
LongComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
boolean |
containsKey(long k)
Checks whether the given value is contained in
AbstractLong2BooleanMap.keySet() . |
boolean |
containsValue(boolean v)
Checks whether the given value is contained in
AbstractLong2BooleanMap.values() . |
long |
firstLongKey() |
boolean |
get(long k)
Returns the value to which the given key is mapped.
|
Long2BooleanSortedMap |
headMap(long to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey . |
boolean |
isEmpty() |
LongSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this map.
|
long |
lastLongKey() |
ObjectSortedSet<Long2BooleanMap.Entry> |
long2BooleanEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
boolean |
put(long k,
boolean v)
Adds a pair to the map.
|
java.lang.Boolean |
put(java.lang.Long ok,
java.lang.Boolean ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
boolean |
remove(long k)
Removes the mapping with the given key.
|
java.lang.Boolean |
remove(java.lang.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.
|
Long2BooleanSortedMap |
subMap(long from,
long to)
Returns a view of the portion of this sorted map whose keys range from
fromKey , inclusive, to toKey , exclusive. |
Long2BooleanSortedMap |
tailMap(long 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.
|
entrySet, firstKey, headMap, lastKey, subMap, tailMap
containsValue, equals, hashCode, putAll, toString
containsKey, defaultReturnValue, defaultReturnValue, get
defaultReturnValue, defaultReturnValue
containsKey, get
public Long2BooleanRBTreeMap()
public Long2BooleanRBTreeMap(java.util.Comparator<? super java.lang.Long> c)
c
- a (possibly type-specific) comparator.public Long2BooleanRBTreeMap(java.util.Map<? extends java.lang.Long,? extends java.lang.Boolean> m)
m
- a Map
to be copied into the new tree map.public Long2BooleanRBTreeMap(java.util.SortedMap<java.lang.Long,java.lang.Boolean> m)
Comparator
).m
- a SortedMap
to be copied into the new tree map.public Long2BooleanRBTreeMap(Long2BooleanMap m)
m
- a type-specific map to be copied into the new tree map.public Long2BooleanRBTreeMap(Long2BooleanSortedMap m)
Comparator
).m
- a type-specific sorted map to be copied into the new tree map.public Long2BooleanRBTreeMap(long[] k, boolean[] v, java.util.Comparator<? super java.lang.Long> 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.java.lang.IllegalArgumentException
- if k
and v
have different lengths.public Long2BooleanRBTreeMap(long[] k, boolean[] v)
k
- the array of keys of the new tree map.v
- the array of corresponding values in the new tree map.java.lang.IllegalArgumentException
- if k
and v
have different lengths.public boolean put(long k, boolean v)
Long2BooleanFunction
put
in interface Long2BooleanFunction
put
in class AbstractLong2BooleanFunction
k
- the key.v
- the value.Function.put(Object,Object)
public boolean remove(long k)
Long2BooleanFunction
remove
in interface Long2BooleanFunction
remove
in class AbstractLong2BooleanFunction
k
- the key.Function.remove(Object)
public java.lang.Boolean put(java.lang.Long ok, java.lang.Boolean ov)
AbstractLong2BooleanFunction
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<java.lang.Long,java.lang.Boolean>
put
in interface java.util.Map<java.lang.Long,java.lang.Boolean>
put
in class AbstractLong2BooleanFunction
ok
- the key.ov
- the value.null
if no value was present for the given key.Map.put(Object,Object)
public java.lang.Boolean remove(java.lang.Object ok)
AbstractLong2BooleanFunction
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<java.lang.Long,java.lang.Boolean>
remove
in interface java.util.Map<java.lang.Long,java.lang.Boolean>
remove
in class AbstractLong2BooleanFunction
ok
- the key.null
if no value was present for the given key.Map.remove(Object)
public boolean containsValue(boolean v)
AbstractLong2BooleanMap
AbstractLong2BooleanMap.values()
.containsValue
in interface Long2BooleanMap
containsValue
in class AbstractLong2BooleanMap
Map.containsValue(Object)
public void clear()
Function
clear
in interface Function<java.lang.Long,java.lang.Boolean>
clear
in interface java.util.Map<java.lang.Long,java.lang.Boolean>
clear
in class AbstractLong2BooleanFunction
Map.clear()
public boolean containsKey(long k)
AbstractLong2BooleanMap
AbstractLong2BooleanMap.keySet()
.containsKey
in interface Long2BooleanFunction
containsKey
in class AbstractLong2BooleanMap
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.
public boolean isEmpty()
isEmpty
in interface java.util.Map<java.lang.Long,java.lang.Boolean>
isEmpty
in class AbstractLong2BooleanMap
public boolean get(long k)
Long2BooleanFunction
get
in interface Long2BooleanFunction
k
- the key.Function.get(Object)
public long firstLongKey()
firstLongKey
in interface Long2BooleanSortedMap
SortedMap.firstKey()
public long lastLongKey()
lastLongKey
in interface Long2BooleanSortedMap
SortedMap.lastKey()
public ObjectSortedSet<Long2BooleanMap.Entry> long2BooleanEntrySet()
Long2BooleanSortedMap
long2BooleanEntrySet
in interface Long2BooleanMap
long2BooleanEntrySet
in interface Long2BooleanSortedMap
Long2BooleanSortedMap.entrySet()
public LongSortedSet 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 Long2BooleanMap
keySet
in interface Long2BooleanSortedMap
keySet
in interface java.util.Map<java.lang.Long,java.lang.Boolean>
keySet
in interface java.util.SortedMap<java.lang.Long,java.lang.Boolean>
keySet
in class AbstractLong2BooleanSortedMap
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 Long2BooleanMap
values
in interface Long2BooleanSortedMap
values
in interface java.util.Map<java.lang.Long,java.lang.Boolean>
values
in interface java.util.SortedMap<java.lang.Long,java.lang.Boolean>
values
in class AbstractLong2BooleanSortedMap
Map.values()
public LongComparator comparator()
Long2BooleanSortedMap
Note that this specification strengthens the one given in SortedMap.comparator()
.
comparator
in interface Long2BooleanSortedMap
comparator
in interface java.util.SortedMap<java.lang.Long,java.lang.Boolean>
SortedMap.comparator()
public Long2BooleanSortedMap headMap(long to)
Long2BooleanSortedMap
toKey
.headMap
in interface Long2BooleanSortedMap
SortedMap.headMap(Object)
public Long2BooleanSortedMap tailMap(long from)
Long2BooleanSortedMap
fromKey
.tailMap
in interface Long2BooleanSortedMap
SortedMap.tailMap(Object)
public Long2BooleanSortedMap subMap(long from, long to)
Long2BooleanSortedMap
fromKey
, inclusive, to toKey
, exclusive.subMap
in interface Long2BooleanSortedMap
SortedMap.subMap(Object,Object)
public Long2BooleanRBTreeMap 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 java.lang.Object