A B C D E F G H I K L M N O P Q R S T U V W X Y

B

BalancedBinarySearchTree<E> - Class in goldman.collection.ordered
A balanced binary search tree uses rotations to maintain balance when one path to a leaf becomes "to much longer" than another.
BalancedBinarySearchTree() - Constructor for class goldman.collection.ordered.BalancedBinarySearchTree
 
BalancedBinarySearchTree(Comparator<? super E>) - Constructor for class goldman.collection.ordered.BalancedBinarySearchTree
 
BinaryHeap<E> - Class in goldman.collection.priority
The binary heap is a very simple data structure that has worst-case logarithmic cost for add, extractMax, and update (through a locator).
BinaryHeap(int, Comparator<? super E>, boolean) - Constructor for class goldman.collection.priority.BinaryHeap
It creates an empty priority queue with the specified characteristics.
BinaryHeap() - Constructor for class goldman.collection.priority.BinaryHeap
Creates an empty priority queue that uses the default comparator
BinaryHeap(Comparator<? super E>) - Constructor for class goldman.collection.priority.BinaryHeap
Creates an untracked empty priority queue that orders the elements using the provided comparator, and has a default initial capacity
BinaryHeap(int) - Constructor for class goldman.collection.priority.BinaryHeap
Creates an empty untracked empty priority queue that uses the default comparator, and the provided initial capacity.
BinaryHeap(int, Comparator<? super E>) - Constructor for class goldman.collection.priority.BinaryHeap
Creates an untracked empty priority queue that uses the provided initial capacity and comparator.
BinaryHeap(boolean) - Constructor for class goldman.collection.priority.BinaryHeap
Creates a tracked or untracked empty priority queue depending on whether tracked is true or false.
BinaryHeap.BinaryHeapLocator - Class in goldman.collection.priority
 
BinaryHeap.BinaryHeapLocator(PositionalCollectionLocator<E>) - Constructor for class goldman.collection.priority.BinaryHeap.BinaryHeapLocator
 
BinarySearchTree<E> - Class in goldman.collection.ordered
This class implements a standard binary search tree.
BinarySearchTree() - Constructor for class goldman.collection.ordered.BinarySearchTree
 
BinarySearchTree(Comparator<? super E>) - Constructor for class goldman.collection.ordered.BinarySearchTree
 
BinarySearchTree.BSTNode - Class in goldman.collection.ordered
 
BinarySearchTree.BSTNode(E) - Constructor for class goldman.collection.ordered.BinarySearchTree.BSTNode
 
BinarySearchTree.Tracker - Class in goldman.collection.ordered
 
BitDigitizer - Class in goldman.collection
The BitDigitizer class implements the Digitizer interface for a bit string.
BitDigitizer() - Constructor for class goldman.collection.BitDigitizer
 
bp() - Method in class goldman.collection.ordered.digitized.CompressedTrie.InternalNode
 
bp() - Method in class goldman.collection.ordered.digitized.CompressedTrie.LeafNode
 
bp() - Method in interface goldman.collection.ordered.digitized.CompressedTrieNode
Returns the position of the digit used for branching at this node.
bp() - Method in class goldman.collection.ordered.digitized.PatriciaTrie.Node
 
BPlusTree<E> - Class in goldman.collection.ordered
The B+-tree is variation of a B-tree in which the internal nodes are used only for navigation.
BPlusTree() - Constructor for class goldman.collection.ordered.BPlusTree
 
BPlusTree(int) - Constructor for class goldman.collection.ordered.BPlusTree
 
BPlusTree(Comparator<? super E>, int) - Constructor for class goldman.collection.ordered.BPlusTree
 
BPlusTree.LeafNode - Class in goldman.collection.ordered
 
BPlusTree.LeafNode() - Constructor for class goldman.collection.ordered.BPlusTree.LeafNode
 
BTree<E> - Class in goldman.collection.ordered
A B-tree is a balanced binary search tree in which each node can hold between t-1 and 2t-1 elements, where integer t > 1 is provided as a parameter to the constructor.
BTree() - Constructor for class goldman.collection.ordered.BTree
 
BTree(int) - Constructor for class goldman.collection.ordered.BTree
 
BTree(Comparator<? super E>, int) - Constructor for class goldman.collection.ordered.BTree
 
BTree.Marker - Class in goldman.collection.ordered
 
BucketFactory<E> - Interface in goldman.collection.tagged.bucket
A bucket factory is used by a tagged bucket collection to create a new bucket for each newly added tag.
Bucketizer<E> - Interface in goldman.collection
The Bucketizer interface provides an application with a mechanism to specify a way to partition all possible elements in a collection into a set of groups (or buckets).
bucketSize(T) - Method in interface goldman.collection.tagged.bucket.TaggedBucketCollection
Returns the number of elements with the given tag.
bucketSize(T) - Method in class goldman.collection.tagged.bucket.TaggedBucketCollectionWrapper
 
bucketsort(Bucketizer<? super E>) - Method in class goldman.collection.positional.Array
 
bucketsort(Bucketizer<? super E>) - Method in interface goldman.collection.positional.PositionalCollection
Sorts this collection using bucket sort with the given bucketizer.
bucketsort(Bucketizer<? super E>) - Method in class goldman.collection.positional.SinglyLinkedList
 
bucketsort(Bucketizer<? super E>) - Method in class goldman.collection.positional.TrackedArray
 
bucketsortImpl(Bucketizer<? super E>) - Method in class goldman.collection.positional.Array
And sorts the array using bucket sort
Buffer<E> - Class in goldman.collection.positional
For many applications, elements need only be added or removed from the front or back end of the collection.
Buffer(int, boolean, boolean) - Constructor for class goldman.collection.positional.Buffer
Creates a buffer satisfying the specification of the given parameters
Buffer() - Constructor for class goldman.collection.positional.Buffer
Creates an unbounded, untracked buffer with a default initial capacity
Buffer(int) - Constructor for class goldman.collection.positional.Buffer
Creates an unbounded, untracked buffer with the given initial capacity
Buffer(int, boolean) - Constructor for class goldman.collection.positional.Buffer
Creates an untracked buffer with the specified parameters
buildPriorityQueue(PriorityQueue<Object>) - Method in class goldman.collection.positional.TrackedArray
 

A B C D E F G H I K L M N O P Q R S T U V W X Y