Methods in org.javimmutable.collections.array.trie32 with parameters of type Transforms |
abstract
|
TrieNode.anyOrderEntryCursor(Transforms<T,K,V> transforms)
|
|
SingleBranchTrieNode.anyOrderEntryCursor(Transforms<T,K,V> transforms)
|
|
MultiBranchTrieNode.anyOrderEntryCursor(Transforms<T,K,V> transforms)
|
|
LeafTrieNode.anyOrderEntryCursor(Transforms<T,K,V> transforms)
|
|
FullBranchTrieNode.anyOrderEntryCursor(Transforms<T,K,V> transforms)
|
|
EmptyTrieNode.anyOrderEntryCursor(Transforms<T,K,V> transforms)
|
abstract
|
TrieNode.assign(int shift,
int index,
K key,
V value,
Transforms<T,K,V> transforms,
MutableDelta sizeDelta)
|
|
SingleBranchTrieNode.assign(int shift,
int index,
K key,
V value,
Transforms<T,K,V> transforms,
MutableDelta sizeDelta)
|
|
MultiBranchTrieNode.assign(int shift,
int index,
K key,
V value,
Transforms<T,K,V> transforms,
MutableDelta sizeDelta)
|
|
LeafTrieNode.assign(int shift,
int index,
K key,
V value,
Transforms<T,K,V> transforms,
MutableDelta sizeDelta)
|
|
FullBranchTrieNode.assign(int shift,
int index,
K key,
V value,
Transforms<T,K,V> transforms,
MutableDelta sizeDelta)
|
|
EmptyTrieNode.assign(int shift,
int index,
K key,
V value,
Transforms<T,K,V> transforms,
MutableDelta sizeDelta)
|
abstract
|
TrieNode.delete(int shift,
int index,
K key,
Transforms<T,K,V> transforms,
MutableDelta sizeDelta)
|
|
SingleBranchTrieNode.delete(int shift,
int index,
K key,
Transforms<T,K,V> transforms,
MutableDelta sizeDelta)
|
|
MultiBranchTrieNode.delete(int shift,
int index,
K key,
Transforms<T,K,V> transforms,
MutableDelta sizeDelta)
|
|
LeafTrieNode.delete(int shift,
int index,
K key,
Transforms<T,K,V> transforms,
MutableDelta sizeDelta)
|
|
FullBranchTrieNode.delete(int shift,
int index,
K key,
Transforms<T,K,V> transforms,
MutableDelta sizeDelta)
|
|
EmptyTrieNode.delete(int shift,
int index,
K key,
Transforms<T,K,V> transforms,
MutableDelta sizeDelta)
|
abstract
|
TrieNode.find(int shift,
int index,
K key,
Transforms<T,K,V> transforms)
|
|
SingleBranchTrieNode.find(int shift,
int index,
K key,
Transforms<T,K,V> transforms)
|
|
MultiBranchTrieNode.find(int shift,
int index,
K key,
Transforms<T,K,V> transforms)
|
|
LeafTrieNode.find(int shift,
int index,
K key,
Transforms<T,K,V> transforms)
|
|
FullBranchTrieNode.find(int shift,
int index,
K key,
Transforms<T,K,V> transforms)
|
|
EmptyTrieNode.find(int shift,
int index,
K key,
Transforms<T,K,V> transforms)
|
abstract
|
TrieNode.getValueOr(int shift,
int index,
K key,
Transforms<T,K,V> transforms,
V defaultValue)
|
|
SingleBranchTrieNode.getValueOr(int shift,
int index,
K key,
Transforms<T,K,V> transforms,
V defaultValue)
|
|
MultiBranchTrieNode.getValueOr(int shift,
int index,
K key,
Transforms<T,K,V> transforms,
V defaultValue)
|
|
LeafTrieNode.getValueOr(int shift,
int index,
K key,
Transforms<T,K,V> transforms,
V defaultValue)
|
|
FullBranchTrieNode.getValueOr(int shift,
int index,
K key,
Transforms<T,K,V> transforms,
V defaultValue)
|
|
EmptyTrieNode.getValueOr(int shift,
int index,
K key,
Transforms<T,K,V> transforms,
V defaultValue)
|
|
TrieNode.signedOrderEntryCursor(Transforms<T,K,V> transforms)
|
|
MultiBranchTrieNode.signedOrderEntryCursor(Transforms<T,K,V> transforms)
|