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