Methods in org.javimmutable.collections.array.trie32 that return TrieNode |
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<T> |
TrieNode.assign(int shift,
int index,
T value,
MutableDelta sizeDelta)
|
TrieNode<T> |
SingleBranchTrieNode.assign(int shift,
int index,
T value,
MutableDelta sizeDelta)
|
TrieNode<T> |
MultiBranchTrieNode.assign(int shift,
int index,
T value,
MutableDelta sizeDelta)
|
TrieNode<T> |
LeafTrieNode.assign(int shift,
int index,
T value,
MutableDelta sizeDelta)
|
TrieNode<T> |
FullBranchTrieNode.assign(int shift,
int index,
T value,
MutableDelta sizeDelta)
|
TrieNode<T> |
EmptyTrieNode.assign(int shift,
int index,
T value,
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<T> |
TrieNode.delete(int shift,
int index,
MutableDelta sizeDelta)
|
TrieNode<T> |
SingleBranchTrieNode.delete(int shift,
int index,
MutableDelta sizeDelta)
|
TrieNode<T> |
MultiBranchTrieNode.delete(int shift,
int index,
MutableDelta sizeDelta)
|
TrieNode<T> |
LeafTrieNode.delete(int shift,
int index,
MutableDelta sizeDelta)
|
TrieNode<T> |
FullBranchTrieNode.delete(int shift,
int index,
MutableDelta sizeDelta)
|
TrieNode<T> |
EmptyTrieNode.delete(int shift,
int index,
MutableDelta sizeDelta)
|
static
|
TrieNode.fromSource(int index,
Indexed<? extends T> source,
int offset,
int limit)
|
static
|
TrieNode.of()
|
TrieNode<T> |
TrieNode.paddedToMinimumDepthForShift(int shift)
|
TrieNode<T> |
LeafTrieNode.paddedToMinimumDepthForShift(int shift)
|
TrieNode<T> |
EmptyTrieNode.paddedToMinimumDepthForShift(int shift)
|
TrieNode<T> |
TrieNode.trimmedToMinimumDepth()
|
TrieNode<T> |
SingleBranchTrieNode.trimmedToMinimumDepth()
|
TrieNode<T> |
MultiBranchTrieNode.trimmedToMinimumDepth()
|