Class ByteBigList.ByteBlockNode
- java.lang.Object
-
- org.magicwerk.brownies.collections.primitive.ByteBigList.ByteBlockNode
-
- Enclosing class:
- ByteBigList
static class ByteBigList.ByteBlockNode extends java.lang.Object
Implements an AVLNode storing a ByteBlock. The nodes don't know the index of the object they are holding. They do know however their position relative to their parent node. This allows to calculate the index of a node while traversing the tree. There is a faedelung flag for both the left and right child to indicate if they are a child (false) or a link as in linked list (true).
-
-
Field Summary
Fields Modifier and Type Field Description (package private) ByteBigList.ByteBlock
block
The stored block(package private) int
height
How many levels of left/right are below this one.(package private) ByteBigList.ByteBlockNode
left
The left child node or the predecessor ifleftIsPrevious
.(package private) boolean
leftIsPrevious
Flag indicating that left reference is not a subtree but the predecessor.(package private) ByteBigList.ByteBlockNode
parent
Pointer to parent node (null for root)(package private) int
relPos
Relative position of node relative to its parent, root holds absolute position.(package private) ByteBigList.ByteBlockNode
right
The right child node or the successor ifrightIsNext
.(package private) boolean
rightIsNext
Flag indicating that right reference is not a subtree but the successor.
-
Constructor Summary
Constructors Modifier Constructor Description private
ByteBlockNode(ByteBigList.ByteBlockNode parent, int relPos, ByteBigList.ByteBlock block, ByteBigList.ByteBlockNode rightFollower, ByteBigList.ByteBlockNode leftFollower)
Constructs a new node.
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description private ByteBigList.ByteBlockNode
balance()
Balances according to the AVL algorithm.private ByteBigList.ByteBlockNode
doRemoveSelf()
private ByteBigList.ByteBlock
getByteBlock()
Gets the block stored by this node.private int
getHeight(ByteBigList.ByteBlockNode node)
Returns the height of the node or -1 if the node is null.private ByteBigList.ByteBlockNode
getLeftSubTree()
Gets the left node, returning null if its a faedelung.private int
getOffset(ByteBigList.ByteBlockNode node)
Gets the relative position.private ByteBigList.ByteBlockNode
getRightSubTree()
Gets the right node, returning null if its a faedelung.private int
heightRightMinusLeft()
Returns the height difference right - leftprivate ByteBigList.ByteBlockNode
insert(int index, ByteBigList.ByteBlock obj)
Inserts new node holding specified block at the position index.private ByteBigList.ByteBlockNode
insertOnLeft(int relIndex, ByteBigList.ByteBlock obj)
Inserts new node holding specified block on the node's left side.private ByteBigList.ByteBlockNode
insertOnRight(int relIndex, ByteBigList.ByteBlock obj)
Inserts new node holding specified block on the node's right side.private ByteBigList.ByteBlockNode
max()
Gets the rightmost child of this node.private ByteBigList.ByteBlockNode
min()
Gets the leftmost child of this node.private ByteBigList.ByteBlockNode
next()
Gets the next node in the list after this one.private ByteBigList.ByteBlockNode
previous()
Gets the node in the list before this one.private void
recalcHeight()
Sets the height by calculation.private ByteBigList.ByteBlockNode
removeMax()
private ByteBigList.ByteBlockNode
removeMin(int size)
private ByteBigList.ByteBlockNode
removeSelf()
Removes this node from the tree.private ByteBigList.ByteBlockNode
rotateLeft()
Rotate tree to the left using this node as center.private ByteBigList.ByteBlockNode
rotateRight()
Rotate tree to the right using this node as center.private void
setByteBlock(ByteBigList.ByteBlock block)
Sets block to store by this node.private void
setLeft(ByteBigList.ByteBlockNode node, ByteBigList.ByteBlockNode previous)
Sets the left field to the node, or the previous node if that is nullprivate int
setOffset(ByteBigList.ByteBlockNode node, int newOffest)
Sets the relative position.private void
setRight(ByteBigList.ByteBlockNode node, ByteBigList.ByteBlockNode next)
Sets the right field to the node, or the next node if that is nulljava.lang.String
toString()
Used for debugging.
-
-
-
Field Detail
-
parent
ByteBigList.ByteBlockNode parent
Pointer to parent node (null for root)
-
left
ByteBigList.ByteBlockNode left
The left child node or the predecessor ifleftIsPrevious
.
-
leftIsPrevious
boolean leftIsPrevious
Flag indicating that left reference is not a subtree but the predecessor.
-
right
ByteBigList.ByteBlockNode right
The right child node or the successor ifrightIsNext
.
-
rightIsNext
boolean rightIsNext
Flag indicating that right reference is not a subtree but the successor.
-
height
int height
How many levels of left/right are below this one.
-
relPos
int relPos
Relative position of node relative to its parent, root holds absolute position.
-
block
ByteBigList.ByteBlock block
The stored block
-
-
Constructor Detail
-
ByteBlockNode
private ByteBlockNode(ByteBigList.ByteBlockNode parent, int relPos, ByteBigList.ByteBlock block, ByteBigList.ByteBlockNode rightFollower, ByteBigList.ByteBlockNode leftFollower)
Constructs a new node.- Parameters:
parent
- parent node (null for root)relativePosition
- the relative position of the node (absolute position for root)block
- the block to storerightFollower
- the node following this oneleftFollower
- the node leading this one
-
-
Method Detail
-
getByteBlock
private ByteBigList.ByteBlock getByteBlock()
Gets the block stored by this node.- Returns:
- block stored by this node
-
setByteBlock
private void setByteBlock(ByteBigList.ByteBlock block)
Sets block to store by this node.- Parameters:
block
- the block to store
-
next
private ByteBigList.ByteBlockNode next()
Gets the next node in the list after this one.- Returns:
- the next node
-
previous
private ByteBigList.ByteBlockNode previous()
Gets the node in the list before this one.- Returns:
- the previous node
-
insert
private ByteBigList.ByteBlockNode insert(int index, ByteBigList.ByteBlock obj)
Inserts new node holding specified block at the position index.- Parameters:
index
- index of the position relative to the position of the parent nodeobj
- object to store in the position- Returns:
- this node or node replacing this node in the tree (if tree must be rebalanced)
-
insertOnLeft
private ByteBigList.ByteBlockNode insertOnLeft(int relIndex, ByteBigList.ByteBlock obj)
Inserts new node holding specified block on the node's left side.- Parameters:
index
- index of the position relative to the position of the parent nodeobj
- object to store in the position- Returns:
- this node or node replacing this node in the tree (if tree must be rebalanced)
-
insertOnRight
private ByteBigList.ByteBlockNode insertOnRight(int relIndex, ByteBigList.ByteBlock obj)
Inserts new node holding specified block on the node's right side.- Parameters:
index
- index of the position relative to the position of the parent nodeobj
- object to store in the position- Returns:
- this node or node replacing this node in the tree (if tree must be rebalanced)
-
getLeftSubTree
private ByteBigList.ByteBlockNode getLeftSubTree()
Gets the left node, returning null if its a faedelung.
-
getRightSubTree
private ByteBigList.ByteBlockNode getRightSubTree()
Gets the right node, returning null if its a faedelung.
-
max
private ByteBigList.ByteBlockNode max()
Gets the rightmost child of this node.- Returns:
- the rightmost child (greatest index)
-
min
private ByteBigList.ByteBlockNode min()
Gets the leftmost child of this node.- Returns:
- the leftmost child (smallest index)
-
removeMax
private ByteBigList.ByteBlockNode removeMax()
-
removeMin
private ByteBigList.ByteBlockNode removeMin(int size)
-
removeSelf
private ByteBigList.ByteBlockNode removeSelf()
Removes this node from the tree.- Returns:
- the node that replaces this one in the parent (can be null)
-
doRemoveSelf
private ByteBigList.ByteBlockNode doRemoveSelf()
-
balance
private ByteBigList.ByteBlockNode balance()
Balances according to the AVL algorithm.
-
getOffset
private int getOffset(ByteBigList.ByteBlockNode node)
Gets the relative position.
-
setOffset
private int setOffset(ByteBigList.ByteBlockNode node, int newOffest)
Sets the relative position.
-
recalcHeight
private void recalcHeight()
Sets the height by calculation.
-
getHeight
private int getHeight(ByteBigList.ByteBlockNode node)
Returns the height of the node or -1 if the node is null.
-
heightRightMinusLeft
private int heightRightMinusLeft()
Returns the height difference right - left
-
rotateLeft
private ByteBigList.ByteBlockNode rotateLeft()
Rotate tree to the left using this node as center.- Returns:
- node which will take the place of this node
-
rotateRight
private ByteBigList.ByteBlockNode rotateRight()
Rotate tree to the right using this node as center.- Returns:
- node which will take the place of this node
-
setLeft
private void setLeft(ByteBigList.ByteBlockNode node, ByteBigList.ByteBlockNode previous)
Sets the left field to the node, or the previous node if that is null- Parameters:
node
- the new left subtree nodeprevious
- the previous node in the linked list
-
setRight
private void setRight(ByteBigList.ByteBlockNode node, ByteBigList.ByteBlockNode next)
Sets the right field to the node, or the next node if that is null- Parameters:
node
- the new right subtree nodenext
- the next node in the linked list
-
toString
public java.lang.String toString()
Used for debugging.- Overrides:
toString
in classjava.lang.Object
-
-