- before(Entry<K, V>) - Method in class support.convexhull.CircularTree
-
This takes an Entry and returns the 'previous' Entry
- before(K) - Method in class support.convexhull.CircularTree
-
This takes in a key and will return the first Entry with a smaller key.
- BinarySearchTree<K,V> - Class in net.datastructures
-
Realization of a dictionary by means of a binary search tree.
- BinarySearchTree() - Constructor for class net.datastructures.BinarySearchTree
-
Creates a BinarySearchTree with a default comparator.
- BinarySearchTree(Comparator<K>) - Constructor for class net.datastructures.BinarySearchTree
-
Creates a BinarySearchTree with the given comparator.
- BinaryTree<E> - Interface in net.datastructures
-
An interface for a binary tree, where each node can have zero, one,
or two children.
- BOUNDARY_VIOLATION - Static variable in class support.convexhull.CircularTree
-
BOUNDARY_VIOLATION is returned when boundary is violated.
- BoundaryViolationException - Exception in net.datastructures
-
Signals that the boundaries of a data structure have been illegally
traversed (e.g.
- BoundaryViolationException(String) - Constructor for exception net.datastructures.BoundaryViolationException
-
- BOX_HEIGHT - Static variable in class support.convexhull.Constants
-
The height of the stage
- BOX_WIDTH - Static variable in class support.convexhull.Constants
-
The width of the stage
- BTNode<E> - Class in net.datastructures
-
Class implementing a node of a binary tree by storing references to
an element, a parent node, a left node, and a right node.
- BTNode() - Constructor for class net.datastructures.BTNode
-
Default constructor
- BTNode(E, BTPosition<E>, BTPosition<E>, BTPosition<E>) - Constructor for class net.datastructures.BTNode
-
Main constructor
- BTPosition<E> - Interface in net.datastructures
-
Interface for a node of a binary tree.