Uses of Class
org.magicwerk.brownies.collections.primitive.DoubleBigList.DoubleBlockNode

Packages that use DoubleBigList.DoubleBlockNode

Package	Description
org.magicwerk.brownies.collections.primitive	This packages contains implementations of GapList and BigList for primitive data types.

Uses of DoubleBigList.DoubleBlockNode in org.magicwerk.brownies.collections.primitive

Fields in org.magicwerk.brownies.collections.primitive declared as DoubleBigList.DoubleBlockNode

Modifier and Type	Field	Description
private DoubleBigList.DoubleBlockNode	DoubleBigList.currNode	Current node
(package private) DoubleBigList.DoubleBlockNode	DoubleBigList.DoubleBlockNode.left	The left child node or the predecessor if leftIsPrevious.
(package private) DoubleBigList.DoubleBlockNode	DoubleBigList.DoubleBlockNode.parent	Pointer to parent node (null for root)
(package private) DoubleBigList.DoubleBlockNode	DoubleBigList.DoubleBlockNode.right	The right child node or the successor if rightIsNext.
private DoubleBigList.DoubleBlockNode	DoubleBigList.rootNode	The root node in the tree

Methods in org.magicwerk.brownies.collections.primitive that return DoubleBigList.DoubleBlockNode

Modifier and Type	Method	Description
private DoubleBigList.DoubleBlockNode	DoubleBigList.DoubleBlockNode.balance()	Balances according to the AVL algorithm.
private DoubleBigList.DoubleBlockNode	DoubleBigList.copy(DoubleBigList.DoubleBlockNode node)	Create a copy of the specified node.
private DoubleBigList.DoubleBlockNode	DoubleBigList.doRemove(DoubleBigList.DoubleBlockNode node)
private DoubleBigList.DoubleBlockNode	DoubleBigList.DoubleBlockNode.doRemoveSelf()
private DoubleBigList.DoubleBlockNode	DoubleBigList.DoubleBlockNode.getLeftSubTree()	Gets the left node, returning null if its a faedelung.
private DoubleBigList.DoubleBlockNode	DoubleBigList.DoubleBlockNode.getRightSubTree()	Gets the right node, returning null if its a faedelung.
private DoubleBigList.DoubleBlockNode	DoubleBigList.DoubleBlockNode.insert(int index, DoubleBigList.DoubleBlock obj)	Inserts new node holding specified block at the position index.
private DoubleBigList.DoubleBlockNode	DoubleBigList.DoubleBlockNode.insertOnLeft(int relIndex, DoubleBigList.DoubleBlock obj)	Inserts new node holding specified block on the node's left side.
private DoubleBigList.DoubleBlockNode	DoubleBigList.DoubleBlockNode.insertOnRight(int relIndex, DoubleBigList.DoubleBlock obj)	Inserts new node holding specified block on the node's right side.
private DoubleBigList.DoubleBlockNode	DoubleBigList.DoubleBlockNode.max()	Gets the rightmost child of this node.
private DoubleBigList.DoubleBlockNode	DoubleBigList.DoubleBlockNode.min()	Gets the leftmost child of this node.
private DoubleBigList.DoubleBlockNode	DoubleBigList.DoubleBlockNode.next()	Gets the next node in the list after this one.
private DoubleBigList.DoubleBlockNode	DoubleBigList.DoubleBlockNode.previous()	Gets the node in the list before this one.
private DoubleBigList.DoubleBlockNode	DoubleBigList.DoubleBlockNode.removeMax()
private DoubleBigList.DoubleBlockNode	DoubleBigList.DoubleBlockNode.removeMin(int size)
private DoubleBigList.DoubleBlockNode	DoubleBigList.DoubleBlockNode.removeSelf()	Removes this node from the tree.
private DoubleBigList.DoubleBlockNode	DoubleBigList.DoubleBlockNode.rotateLeft()	Rotate tree to the left using this node as center.
private DoubleBigList.DoubleBlockNode	DoubleBigList.DoubleBlockNode.rotateRight()	Rotate tree to the right using this node as center.

Methods in org.magicwerk.brownies.collections.primitive with parameters of type DoubleBigList.DoubleBlockNode

Modifier and Type	Method	Description
private void	DoubleBigList.checkHeight(DoubleBigList.DoubleBlockNode node)
private void	DoubleBigList.checkNode(DoubleBigList.DoubleBlockNode node)
private DoubleBigList.DoubleBlockNode	DoubleBigList.copy(DoubleBigList.DoubleBlockNode node)	Create a copy of the specified node.
private boolean	DoubleBigList.doGetDoubleBlockLeft(int modify, DoubleBigList.DoubleBlockNode nextNode, boolean wasLeft)
private boolean	DoubleBigList.doGetDoubleBlockRight(int modify, DoubleBigList.DoubleBlockNode nextNode, boolean wasLeft)
private DoubleBigList.DoubleBlockNode	DoubleBigList.doRemove(DoubleBigList.DoubleBlockNode node)
private void	DoubleBigList.doRemoveAll2(int index, int len, int startPos, DoubleBigList.DoubleBlockNode startNode, DoubleBigList.DoubleBlockNode endNode)
private int	DoubleBigList.DoubleBlockNode.getHeight(DoubleBigList.DoubleBlockNode node)	Returns the height of the node or -1 if the node is null.
private int	DoubleBigList.DoubleBlockNode.getOffset(DoubleBigList.DoubleBlockNode node)	Gets the relative position.
private void	DoubleBigList.merge(DoubleBigList.DoubleBlockNode node)	Merge the specified node with the left or right neighbor if possible.
private void	DoubleBigList.modify(DoubleBigList.DoubleBlockNode node, int modify)	Modify relativePosition of all nodes starting from the specified node.
private void	DoubleBigList.modifyLeftNode(DoubleBigList.DoubleBlockNode node, int modify)
private void	DoubleBigList.modifyRightNode(DoubleBigList.DoubleBlockNode node, int modify)
private void	DoubleBigList.DoubleBlockNode.setLeft(DoubleBigList.DoubleBlockNode node, DoubleBigList.DoubleBlockNode previous)	Sets the left field to the node, or the previous node if that is null
private int	DoubleBigList.DoubleBlockNode.setOffset(DoubleBigList.DoubleBlockNode node, int newOffest)	Sets the relative position.
private void	DoubleBigList.DoubleBlockNode.setRight(DoubleBigList.DoubleBlockNode node, DoubleBigList.DoubleBlockNode next)	Sets the right field to the node, or the next node if that is null

Constructors in org.magicwerk.brownies.collections.primitive with parameters of type DoubleBigList.DoubleBlockNode

Constructor	Description
DoubleBlockNode(DoubleBigList.DoubleBlockNode parent, int relPos, DoubleBigList.DoubleBlock block, DoubleBigList.DoubleBlockNode rightFollower, DoubleBigList.DoubleBlockNode leftFollower)	Constructs a new node.