Uses of Class
net.datastructures.BoundaryViolationException

Packages that use BoundaryViolationException

Package	Description
net.datastructures
support.graph

Uses of BoundaryViolationException in net.datastructures

Methods in net.datastructures that throw BoundaryViolationException

Modifier and Type	Method and Description
Position<E>	Sequence.atIndex(int r) Returns the position containing the element at the given index.
Position<E>	LinkedBinaryTree.left(Position<E> v) Returns the left child of a node.
Position<E>	ArrayListCompleteBinaryTree.left(Position<E> v) Returns the left child of v.
Position<E>	BinaryTree.left(Position<E> v) Returns the left child of a node.
Position<E>	NodePositionList.next(Position<E> p) Returns the position after the given one; O(1) time
Position<E>	PositionList.next(Position<E> p) Returns the node after a given node in the list.
Position<E>	LinkedBinaryTree.parent(Position<E> v) Returns the parent of a node.
Position<E>	LinkedTree.parent(Position<E> v) Returns the parent of a node.
Position<E>	Tree.parent(Position<E> v) Returns the parent of a given node.
Position<E>	ArrayListCompleteBinaryTree.parent(Position<E> v) Returns the parent of v.
Position<E>	NodePositionList.prev(Position<E> p) Returns the position before the given one; O(1) time
Position<E>	PositionList.prev(Position<E> p) Returns the node before a given node in the list.
Position<E>	LinkedBinaryTree.right(Position<E> v) Returns the right child of a node.
Position<E>	BinaryTree.right(Position<E> v) Returns the right child of a node.
Position<E>	LinkedBinaryTree.sibling(Position<E> v) Return the sibling of a node
Position<E>	ArrayListCompleteBinaryTree.sibling(Position<E> v) Returns the sibling of v.

Uses of BoundaryViolationException in support.graph

Methods in support.graph that throw BoundaryViolationException

Modifier and Type	Method and Description
Position<E>	NodeSequence.atIndex(int index)
Position<E>	NodeSequence.next(Position<E> pos)
Position<E>	NodeSequence.prev(Position<E> pos)