public class BinaryRadixTree extends Object implements BinaryLongMap
BinaryLongMap.Entry, BinaryLongMap.EntryVisitor, BinaryLongMap.SimpleMapImpl
Constructor and Description |
---|
BinaryRadixTree()
Construct an empty BinaryRadixTree.
|
Modifier and Type | Method and Description |
---|---|
void |
clear()
Initialize the map to an empty state.
|
long |
get(Binary binKey)
Find the specified key in the map and return the value associated with it.
|
void |
internKeys(Object o)
Internal opaque method: De-duplicate keys.
|
Iterator<Binary> |
keys()
Obtain an iterator of the keys stored in the map.
|
Iterator<Binary> |
keys(Predicate<BinaryLongMap.Entry> predicate)
Obtain an iterator of the keys stored in the map whose corresponding
Entry matches the passed Predicate<Entry> . |
void |
put(Binary binKey, long lValue)
Blindly store the passed value for the specified key, adding the key if it is not already in the map, or replacing the current value if the key is in the map.
|
boolean |
putIfAbsent(Binary binKey, long lValue)
Store the passed value for the specified key, only if the key does not currently exist in the map.
|
void |
remove(Binary binKey)
Blindly remove the specified Binary key from the map.
|
boolean |
remove(Binary binKey, long lValue)
Remove the specified Binary key from the map iff it exists in the map and is associated with the specified value.
|
boolean |
replace(Binary binKey, long lValueOld, long lValueNew)
Store the passed "new" value for the specified key, only if the current value associated with the specified key is the same as the specified "old" value.
|
int |
size()
Determine the size of the map.
|
protected long |
sizeof()
Return the number of bytes retained by this BinaryLongMap.
|
void |
visit(Binary binKey, BinaryLongMap.EntryVisitor visitor)
Apply the specified visitor to the entry associated with the specified key, if the entry exists or may be added.
|
void |
visitAll(BinaryLongMap.EntryVisitor visitor)
Apply the specified visitor to all entries in the BinaryLongMap.
|
public long get(Binary binKey)
get
in interface BinaryLongMap
binKey
- a Binary keypublic void put(Binary binKey, long lValue)
Note that associating the value zero with a key is analogous to removing the key.
put
in interface BinaryLongMap
binKey
- the Binary key to add or updatelValue
- the value to associate with the keypublic boolean putIfAbsent(Binary binKey, long lValue)
Note that associating the value zero with a key using this method will have no effect, since were that key already present, there would be no change, and were it not present, the value zero is analogous to removing the key, which again is no change (since it is not present).
putIfAbsent
in interface BinaryLongMap
binKey
- a Binary keylValue
- the new value to associate with the passed keypublic boolean replace(Binary binKey, long lValueOld, long lValueNew)
Note that replacing the value of zero is analogous to putIfAbsent
, and associating the value zero with a key using this method is the same as remove
passing the old value to match.
replace
in interface BinaryLongMap
binKey
- a Binary keylValueOld
- the assumed old value to replacelValueNew
- the new value to associate with the passed keypublic void remove(Binary binKey)
remove
in interface BinaryLongMap
binKey
- a Binary keypublic boolean remove(Binary binKey, long lValue)
Note that removing an association whose value is zero has no effect.
remove
in interface BinaryLongMap
binKey
- a Binary keylValue
- the value that the key must have in order to be removedpublic void clear()
clear
in interface BinaryLongMap
public int size()
size
in interface BinaryLongMap
public Iterator<Binary> keys()
keys
in interface BinaryLongMap
public Iterator<Binary> keys(Predicate<BinaryLongMap.Entry> predicate)
Entry
matches the passed Predicate<Entry>
.
The entry passed to the predicate should be treated as read-only, and any attempt to modify the entry may have undefined behavior and/or throw an Exception. Modifications to entries should instead be performed using an BinaryLongMap.EntryVisitor
via the BinaryLongMap.visit(com.tangosol.util.Binary, com.tangosol.util.BinaryLongMap.EntryVisitor)
or BinaryLongMap.visitAll(com.tangosol.util.BinaryLongMap.EntryVisitor)
methods.
keys
in interface BinaryLongMap
predicate
- a Predicate<Entry> to apply to each Entrypublic void visit(Binary binKey, BinaryLongMap.EntryVisitor visitor)
BinaryLongMap.Entry.setValue(long)
).visit
in interface BinaryLongMap
binKey
- the key to visitvisitor
- the visitor to applypublic void visitAll(BinaryLongMap.EntryVisitor visitor)
visitAll
in interface BinaryLongMap
visitor
- the visitor to applypublic void internKeys(Object o)
To reduce memory footprint, the tree supports de-duplication of byte[] values used internally by the tree. To execute the de-duping process, create an empty byte[][] of a prime size, and pass it to the internKeys() method of each available BinaryRadixTree.
Do not pre-populate the byte[][] or modify any of its contents.
Note: This method does not require external synchronization.
internKeys
in interface BinaryLongMap
o
- an opaque byte[][] used to accumulate "intern()" byte[] valuesprotected long sizeof()