Uses of Interface
org.javimmutable.collections.array.trie32.Transforms

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

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

Methods in org.javimmutable.collections.array.trie32 with parameters of type Transforms
abstract
<K,V> Cursor<JImmutableMap.Entry<K,V>>
TrieNode.anyOrderEntryCursor(Transforms<T,K,V> transforms)
           
<K,V> Cursor<JImmutableMap.Entry<K,V>>
SingleBranchTrieNode.anyOrderEntryCursor(Transforms<T,K,V> transforms)
           
<K,V> Cursor<JImmutableMap.Entry<K,V>>
MultiBranchTrieNode.anyOrderEntryCursor(Transforms<T,K,V> transforms)
           
<K,V> Cursor<JImmutableMap.Entry<K,V>>
LeafTrieNode.anyOrderEntryCursor(Transforms<T,K,V> transforms)
           
<K,V> Cursor<JImmutableMap.Entry<K,V>>
FullBranchTrieNode.anyOrderEntryCursor(Transforms<T,K,V> transforms)
           
<K,V> Cursor<JImmutableMap.Entry<K,V>>
EmptyTrieNode.anyOrderEntryCursor(Transforms<T,K,V> transforms)
           
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
<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
<K,V> Holder<V>
TrieNode.find(int shift, int index, K key, Transforms<T,K,V> transforms)
           
<K,V> Holder<V>
SingleBranchTrieNode.find(int shift, int index, K key, Transforms<T,K,V> transforms)
           
<K,V> Holder<V>
MultiBranchTrieNode.find(int shift, int index, K key, Transforms<T,K,V> transforms)
           
<K,V> Holder<V>
LeafTrieNode.find(int shift, int index, K key, Transforms<T,K,V> transforms)
           
<K,V> Holder<V>
FullBranchTrieNode.find(int shift, int index, K key, Transforms<T,K,V> transforms)
           
<K,V> Holder<V>
EmptyTrieNode.find(int shift, int index, K key, Transforms<T,K,V> transforms)
           
abstract
<K,V> V
TrieNode.getValueOr(int shift, int index, K key, Transforms<T,K,V> transforms, V defaultValue)
           
<K,V> V
SingleBranchTrieNode.getValueOr(int shift, int index, K key, Transforms<T,K,V> transforms, V defaultValue)
           
<K,V> V
MultiBranchTrieNode.getValueOr(int shift, int index, K key, Transforms<T,K,V> transforms, V defaultValue)
           
<K,V> V
LeafTrieNode.getValueOr(int shift, int index, K key, Transforms<T,K,V> transforms, V defaultValue)
           
<K,V> V
FullBranchTrieNode.getValueOr(int shift, int index, K key, Transforms<T,K,V> transforms, V defaultValue)
           
<K,V> V
EmptyTrieNode.getValueOr(int shift, int index, K key, Transforms<T,K,V> transforms, V defaultValue)
           
<K,V> Cursor<JImmutableMap.Entry<K,V>>
TrieNode.signedOrderEntryCursor(Transforms<T,K,V> transforms)
           
<K,V> Cursor<JImmutableMap.Entry<K,V>>
MultiBranchTrieNode.signedOrderEntryCursor(Transforms<T,K,V> transforms)
           
 



Copyright © 2014 Burton Computer Corporation. All rights reserved.