Uses of Class
org.javimmutable.collections.array.trie32.TrieNode

Packages that use TrieNode
org.javimmutable.collections.array.trie32   
 

Uses of TrieNode in org.javimmutable.collections.array.trie32
 

Subclasses of TrieNode in org.javimmutable.collections.array.trie32
 class EmptyTrieNode<T>
           
 class FullBranchTrieNode<T>
           
 class LeafTrieNode<T>
           
 class MultiBranchTrieNode<T>
           
 class SingleBranchTrieNode<T>
           
 

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



Copyright © 2014 Burton Computer Corporation. All rights reserved.