Uses of Class
org.javimmutable.collections.tree.TreeNode

Packages that use TreeNode
org.javimmutable.collections.tree   
 

Uses of TreeNode in org.javimmutable.collections.tree
 

Subclasses of TreeNode in org.javimmutable.collections.tree
 class EmptyNode<K,V>
           
 class LeafNode<K,V>
           
 class ThreeNode<K,V>
           
 class TwoNode<K,V>
           
 

Fields in org.javimmutable.collections.tree declared as TreeNode
 TreeNode<K,V> UpdateResult.extraNode
           
 TreeNode<K,V> DeleteMergeResult.left
           
 TreeNode<K,V> UpdateResult.newNode
           
 TreeNode<K,V> DeleteResult.node
           
 TreeNode<K,V> DeleteMergeResult.right
           
 

Methods in org.javimmutable.collections.tree that return TreeNode
 TreeNode<K,V> TreeNode.assign(Comparator<K> comparator, K key, V value, MutableDelta sizeDelta)
          Assign the specified value to the specified key.
 TreeNode<K,V> UpdateResult.createLeftThreeNode(TreeNode<K,V> right, K rightMax)
           
 TreeNode<K,V> DeleteMergeResult.createLeftThreeNode(TreeNode<K,V> callerRight, K callerRightMax)
           
 TreeNode<K,V> UpdateResult.createLeftTwoNode(TreeNode<K,V> right, K rightMax)
           
 TreeNode<K,V> DeleteMergeResult.createLeftTwoNode(TreeNode<K,V> callerRight, K callerRightMax)
           
 TreeNode<K,V> UpdateResult.createRightThreeNode(TreeNode<K,V> left, K leftMax)
           
 TreeNode<K,V> DeleteMergeResult.createRightThreeNode(TreeNode<K,V> callerLeft, K callerLeftMax)
           
 TreeNode<K,V> UpdateResult.createRightTwoNode(TreeNode<K,V> left, K leftMax)
           
 TreeNode<K,V> DeleteMergeResult.createRightTwoNode(TreeNode<K,V> callerLeft, K callerLeftMax)
           
 TreeNode<K,V> UpdateResult.createTwoNode()
           
 TreeNode<K,V> DeleteMergeResult.createTwoNode()
           
 TreeNode<K,V> TreeNode.delete(Comparator<K> comparator, K key, MutableDelta sizeDelta)
          Deletes the specified key.
 TreeNode<K,V> TwoNode.getLeft()
           
 TreeNode<K,V> ThreeNode.getLeft()
           
 TreeNode<K,V> ThreeNode.getMiddle()
           
 TreeNode<K,V> TwoNode.getRight()
           
 TreeNode<K,V> ThreeNode.getRight()
           
static
<K,V> TreeNode<K,V>
TreeNode.of()
           
 

Methods in org.javimmutable.collections.tree with parameters of type TreeNode
static
<K,V> DeleteResult<K,V>
DeleteResult.createInPlace(TreeNode<K,V> node)
           
static
<K,V> UpdateResult<K,V>
UpdateResult.createInPlace(TreeNode<K,V> newNode, int sizeDelta)
           
 TreeNode<K,V> UpdateResult.createLeftThreeNode(TreeNode<K,V> right, K rightMax)
           
 TreeNode<K,V> DeleteMergeResult.createLeftThreeNode(TreeNode<K,V> callerRight, K callerRightMax)
           
 TreeNode<K,V> UpdateResult.createLeftTwoNode(TreeNode<K,V> right, K rightMax)
           
 TreeNode<K,V> DeleteMergeResult.createLeftTwoNode(TreeNode<K,V> callerRight, K callerRightMax)
           
static
<K,V> DeleteResult<K,V>
DeleteResult.createRemnant(TreeNode<K,V> node)
           
 TreeNode<K,V> UpdateResult.createRightThreeNode(TreeNode<K,V> left, K leftMax)
           
 TreeNode<K,V> DeleteMergeResult.createRightThreeNode(TreeNode<K,V> callerLeft, K callerLeftMax)
           
 TreeNode<K,V> UpdateResult.createRightTwoNode(TreeNode<K,V> left, K leftMax)
           
 TreeNode<K,V> DeleteMergeResult.createRightTwoNode(TreeNode<K,V> callerLeft, K callerLeftMax)
           
static
<K,V> UpdateResult<K,V>
UpdateResult.createSplit(TreeNode<K,V> newNode, TreeNode<K,V> extraNode, int sizeDelta)
           
static
<K,V> UpdateResult<K,V>
UpdateResult.createSplit(TreeNode<K,V> newNode, TreeNode<K,V> extraNode, int sizeDelta)
           
 

Constructors in org.javimmutable.collections.tree with parameters of type TreeNode
DeleteMergeResult(TreeNode<K,V> left)
           
DeleteMergeResult(TreeNode<K,V> left, TreeNode<K,V> right)
           
DeleteMergeResult(TreeNode<K,V> left, TreeNode<K,V> right)
           
ThreeNode(TreeNode<K,V> left, TreeNode<K,V> middle, TreeNode<K,V> right, K leftMaxKey, K middleMaxKey, K rightMaxKey)
           
ThreeNode(TreeNode<K,V> left, TreeNode<K,V> middle, TreeNode<K,V> right, K leftMaxKey, K middleMaxKey, K rightMaxKey)
           
ThreeNode(TreeNode<K,V> left, TreeNode<K,V> middle, TreeNode<K,V> right, K leftMaxKey, K middleMaxKey, K rightMaxKey)
           
TwoNode(TreeNode<K,V> left, TreeNode<K,V> right, K leftMaxKey, K rightMaxKey)
           
TwoNode(TreeNode<K,V> left, TreeNode<K,V> right, K leftMaxKey, K rightMaxKey)
           
 



Copyright © 2014 Burton Computer Corporation. All rights reserved.