Uses of Class
org.magicwerk.brownies.collections.primitive.IntBigList.IntBlockNode
Packages that use IntBigList.IntBlockNode
Package
Description
This packages contains implementations of GapList and BigList for primitive data types.
-
Uses of IntBigList.IntBlockNode in org.magicwerk.brownies.collections.primitive
Fields in org.magicwerk.brownies.collections.primitive declared as IntBigList.IntBlockNodeModifier and TypeFieldDescriptionprivate IntBigList.IntBlockNodeIntBigList.currNodeCurrent node(package private) IntBigList.IntBlockNodeIntBigList.IntBlockNode.leftThe left child node or the predecessor ifleftIsPrevious.(package private) IntBigList.IntBlockNodeIntBigList.IntBlockNode.parentPointer to parent node (null for root)(package private) IntBigList.IntBlockNodeIntBigList.IntBlockNode.rightThe right child node or the successor ifrightIsNext.private IntBigList.IntBlockNodeIntBigList.rootNodeThe root node in the treeMethods in org.magicwerk.brownies.collections.primitive that return IntBigList.IntBlockNodeModifier and TypeMethodDescriptionprivate IntBigList.IntBlockNodeIntBigList.IntBlockNode.balance()Balances according to the AVL algorithm.private IntBigList.IntBlockNodeIntBigList.copy(IntBigList.IntBlockNode node) Create a copy of the specified node.private IntBigList.IntBlockNodeIntBigList.doRemove(IntBigList.IntBlockNode node) private IntBigList.IntBlockNodeIntBigList.IntBlockNode.doRemoveSelf()private IntBigList.IntBlockNodeIntBigList.IntBlockNode.getLeftSubTree()Gets the left node, returning null if its a faedelung.private IntBigList.IntBlockNodeIntBigList.IntBlockNode.getRightSubTree()Gets the right node, returning null if its a faedelung.private IntBigList.IntBlockNodeIntBigList.IntBlockNode.insert(int index, IntBigList.IntBlock obj) Inserts new node holding specified block at the position index.private IntBigList.IntBlockNodeIntBigList.IntBlockNode.insertOnLeft(int relIndex, IntBigList.IntBlock obj) Inserts new node holding specified block on the node's left side.private IntBigList.IntBlockNodeIntBigList.IntBlockNode.insertOnRight(int relIndex, IntBigList.IntBlock obj) Inserts new node holding specified block on the node's right side.private IntBigList.IntBlockNodeIntBigList.IntBlockNode.max()Gets the rightmost child of this node.private IntBigList.IntBlockNodeIntBigList.IntBlockNode.min()Gets the leftmost child of this node.private IntBigList.IntBlockNodeIntBigList.IntBlockNode.next()Gets the next node in the list after this one.private IntBigList.IntBlockNodeIntBigList.IntBlockNode.previous()Gets the node in the list before this one.private IntBigList.IntBlockNodeIntBigList.IntBlockNode.removeMax()private IntBigList.IntBlockNodeIntBigList.IntBlockNode.removeMin(int size) private IntBigList.IntBlockNodeIntBigList.IntBlockNode.removeSelf()Removes this node from the tree.private IntBigList.IntBlockNodeIntBigList.IntBlockNode.rotateLeft()Rotate tree to the left using this node as center.private IntBigList.IntBlockNodeIntBigList.IntBlockNode.rotateRight()Rotate tree to the right using this node as center.Methods in org.magicwerk.brownies.collections.primitive with parameters of type IntBigList.IntBlockNodeModifier and TypeMethodDescriptionprivate voidIntBigList.checkHeight(IntBigList.IntBlockNode node) private voidIntBigList.checkNode(IntBigList.IntBlockNode node) private IntBigList.IntBlockNodeIntBigList.copy(IntBigList.IntBlockNode node) Create a copy of the specified node.private booleanIntBigList.doGetIntBlockLeft(int modify, IntBigList.IntBlockNode nextNode, boolean wasLeft) private booleanIntBigList.doGetIntBlockRight(int modify, IntBigList.IntBlockNode nextNode, boolean wasLeft) private IntBigList.IntBlockNodeIntBigList.doRemove(IntBigList.IntBlockNode node) private voidIntBigList.doRemoveAll2(int index, int len, int startPos, IntBigList.IntBlockNode startNode, IntBigList.IntBlockNode endNode) private intIntBigList.IntBlockNode.getHeight(IntBigList.IntBlockNode node) Returns the height of the node or -1 if the node is null.private intIntBigList.IntBlockNode.getOffset(IntBigList.IntBlockNode node) Gets the relative position.private voidIntBigList.merge(IntBigList.IntBlockNode node) Merge the specified node with the left or right neighbor if possible.private voidIntBigList.modify(IntBigList.IntBlockNode node, int modify) Modify relativePosition of all nodes starting from the specified node.private voidIntBigList.modifyLeftNode(IntBigList.IntBlockNode node, int modify) private voidIntBigList.modifyRightNode(IntBigList.IntBlockNode node, int modify) private voidIntBigList.IntBlockNode.setLeft(IntBigList.IntBlockNode node, IntBigList.IntBlockNode previous) Sets the left field to the node, or the previous node if that is nullprivate intIntBigList.IntBlockNode.setOffset(IntBigList.IntBlockNode node, int newOffest) Sets the relative position.private voidIntBigList.IntBlockNode.setRight(IntBigList.IntBlockNode node, IntBigList.IntBlockNode next) Sets the right field to the node, or the next node if that is nullConstructors in org.magicwerk.brownies.collections.primitive with parameters of type IntBigList.IntBlockNodeModifierConstructorDescriptionprivateIntBlockNode(IntBigList.IntBlockNode parent, int relPos, IntBigList.IntBlock block, IntBigList.IntBlockNode rightFollower, IntBigList.IntBlockNode leftFollower) Constructs a new node.