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

R

radixsort(Digitizer<? super E>) - Method in class goldman.collection.positional.Array
And sorts the collection with radix sort.
radixsort(Digitizer<? super E>) - Method in interface goldman.collection.positional.PositionalCollection
Sorts this collection using radix sort with the provided digitizer.
radixsort(Digitizer<? super E>) - Method in class goldman.collection.positional.SinglyLinkedList
 
radixsort(Digitizer<? super E>) - Method in class goldman.collection.positional.TrackedArray
 
radixsortImpl(Digitizer<? super E>) - Method in class goldman.collection.positional.Array
Is the complete implementation of radix sort
read(int) - Method in class goldman.collection.positional.Array
 
readElement(int) - Method in class goldman.collection.positional.TrackedArray
 
RedBlackTree<E> - Class in goldman.collection.ordered
The red-black tree is a balanced binary search tree in which a single bit (a color of red or black) associated with each tree node is used to ensure that the number of comparisons made when searching for any element is at most 2 log2 n.
RedBlackTree() - Constructor for class goldman.collection.ordered.RedBlackTree
 
RedBlackTree(Comparator<? super E>) - Constructor for class goldman.collection.ordered.RedBlackTree
 
RedBlackTree.RBNode - Class in goldman.collection.ordered
 
release(T) - Method in class goldman.Pool
Moves the given object to the pool of available objects for reuse.
remove() - Method in class goldman.collection.AbstractCollection.VisitingIterator
 
remove(E) - Method in interface goldman.collection.Collection
Removes from this collection an arbitrary element equivalent to target, if such an element exists in the collection.
remove(AbstractSearchTree<E>.TreeNode) - Method in class goldman.collection.ordered.AbstractSearchTree
Removes the given node.
remove(E) - Method in class goldman.collection.ordered.AbstractSearchTree
Removes an arbitrary element in the collection equivalent to element, if any
remove(AbstractSearchTree<E>.TreeNode) - Method in class goldman.collection.ordered.BinarySearchTree
 
remove() - Method in class goldman.collection.ordered.BinarySearchTree.Tracker
Removes the tracked element and implicitly updates the tracker to be between the predecessor and the successor in the iteration order.
remove() - Method in class goldman.collection.ordered.BTree.Marker
 
remove(AbstractSearchTree<E>.TreeNode) - Method in class goldman.collection.ordered.BTree
Removes the element at curIndex of x
remove() - Method in class goldman.collection.ordered.digitized.AbstractTrieLeafNode
Removes this leaf node from the ordered leaf chain and marks the removed trie leaf node as deleted.
remove(TrieNode<E>) - Method in class goldman.collection.ordered.digitized.CompressedTrie
 
remove(TrieNode<E>) - Method in class goldman.collection.ordered.digitized.PatriciaTrie
 
remove(TrieNode<E>, PatriciaTrie<E>.Node) - Method in class goldman.collection.ordered.digitized.PatriciaTrie
 
remove(E) - Method in class goldman.collection.ordered.digitized.Trie
Removes from the collection the element (if any) equivalent to element.
remove() - Method in class goldman.collection.ordered.digitized.Trie.Tracker
Removes the tracked element, leaving the tracker logically between the elements in the iteration order that preceded and followed the one removed.
remove() - Method in interface goldman.collection.ordered.digitized.TrieLeafNode
Removes this trie leaf node from the ordered leaf chain.
remove(E) - Method in class goldman.collection.ordered.SkipList
Removes the first occurrence of the target from the collection, if an equivalent element exists in the collection.
remove() - Method in class goldman.collection.ordered.SkipList.Tracker
Removes the tracked element and updates the tracker to be at the element in the iteration order that preceded the one removed.
remove(E) - Method in class goldman.collection.ordered.SortedArray
Removes an arbitrary element from the collection equivalent to element, if such an element exists in the collection.
remove(int) - Method in class goldman.collection.ordered.SortedArray
 
remove(AbstractSearchTree<E>.TreeNode) - Method in class goldman.collection.ordered.SplayTree
Uses splay to both bring the successor of x (if x has two children) to be a child of x, and then also uses splay to bring x's parent to the root.
remove(E) - Method in class goldman.collection.ordered.TopDownBTree
 
remove() - Method in class goldman.collection.positional.Array.BasicMarker
Removes the element at the locator and updates the locator to be at the element in the collection preceding the one deleted.
remove(int) - Method in class goldman.collection.positional.Array
Removes the element at position p and shifts elements u_{p+1}, ..., u_{size-1} left by one position.
remove(E) - Method in class goldman.collection.positional.Array
Removes the first element in the collection equivalent to value
remove(int) - Method in interface goldman.collection.positional.PositionalCollection
Removes the element at position p and returns it.
remove(int) - Method in class goldman.collection.positional.SinglyLinkedList
Removes the element at position p and decrements the positions of u_{p+1}, ..., u_{size-1} by one.
remove(E) - Method in class goldman.collection.positional.SinglyLinkedList
Removes the first element in the collection equivalent to value
remove() - Method in class goldman.collection.positional.SinglyLinkedList.Tracker
Removes the tracked element from the collection.
remove() - Method in class goldman.collection.positional.TrackedArray.Tracker
Removes the element at the tracker and updates the tracker to be between its current position and the one before it.
remove() - Method in class goldman.collection.priority.BinaryHeap.BinaryHeapLocator
Removes the element at the locator position, and updates the locator to be at the element in the iteration order that preceded the one removed.
remove(int) - Method in class goldman.collection.priority.BinaryHeap
 
remove(E) - Method in class goldman.collection.priority.BinaryHeap
Removes from the collection an arbitrary element (if any) equivalent to the target.
remove(E) - Method in class goldman.collection.priority.LeftistHeap
Removes an equivalent element from the collection
remove() - Method in class goldman.collection.priority.LeftistHeap.Tracker
Removes the tracked element from the collection
remove(E) - Method in class goldman.collection.priority.PairingHeap
Removes an equivalent element from the collection
remove() - Method in class goldman.collection.priority.PairingHeap.Tracker
Removes the tracked element and updates the tracker to be at the element in the iteration order that preceded the one removed.
remove() - Method in class goldman.collection.set.DirectAddressing.Marker
Removes the element at the marker, and updates the marker to be at the element in the iteration order that preceded the one removed.
remove(E) - Method in class goldman.collection.set.DirectAddressing
 
remove(E) - Method in class goldman.collection.set.OpenAddressing
Removes an equivalent element (if one exists) from the set
remove() - Method in class goldman.collection.set.SeparateChaining.Marker
Removes the item at the marker
remove(E) - Method in class goldman.collection.set.SeparateChaining
Removes an equivalent element (if one exists) from the set
remove(E) - Method in class goldman.collection.spatial.KDTree
Removes from the collection an arbitrary element (if any) equivalent to element.
remove(E) - Method in class goldman.collection.spatial.QuadTree
Removes the given element from the collection
remove(AbstractSearchTree<E>.TreeNode) - Method in class goldman.collection.spatial.QuadTree
 
remove(T) - Method in interface goldman.collection.tagged.bucket.TaggedBucketCollection
Removes from this tagged collection an arbitrary element with the given tag.
remove(T, E) - Method in interface goldman.collection.tagged.bucket.TaggedBucketCollection
Removes from this tagged collection an element equivalent to the given element with the given tag.
remove(T) - Method in class goldman.collection.tagged.bucket.TaggedBucketCollectionWrapper
Removes the first element in the bucket for that tag, according to the iteration order
remove(T, E) - Method in class goldman.collection.tagged.bucket.TaggedBucketCollectionWrapper
Removes the specified element from the bucket associated with the given tag (if it exists in that bucket).
remove(T) - Method in class goldman.collection.tagged.ordered.TaggedBPlusTree
 
remove(T) - Method in class goldman.collection.tagged.ordered.TaggedBTree
 
remove(T) - Method in interface goldman.collection.tagged.TaggedCollection
Removes, from this tagged collection, a tagged element with the given tag.
remove(T) - Method in class goldman.collection.tagged.TaggedCollectionWrapper
Removes some tagged element in this collection with an tag equivalent to the given tag
remove() - Method in class goldman.NonMutatingIterator
 
removeBucket(T) - Method in interface goldman.collection.tagged.bucket.TaggedBucketCollection
Removes and returns the bucket associated with the given tag.
removeBucket(T) - Method in class goldman.collection.tagged.bucket.TaggedBucketCollectionWrapper
Removes all elements from this tagged bucket collection that are associated with the given tag.
removeEdge(E) - Method in class goldman.graph.AbstractGraph
 
removeEdge(E) - Method in class goldman.graph.AdjacencyListRepresentation
 
removeEdge(E) - Method in class goldman.graph.AdjacencyMatrixRepresentation
 
removeEdge(E) - Method in interface goldman.graph.Graph
Removes the given edge from this graph.
removeEdge(E) - Method in interface goldman.graph.GraphRepresentation
Returns true when the given edge is successfully removed, and false, if the edge did not exist.
removeFirst() - Method in class goldman.collection.positional.Array
Removes the element at position 0 and decrements the position for the elements that were at positions 1 to size-1.
removeFirst() - Method in class goldman.collection.positional.Buffer
Removes the first element in the buffer,
removeFirst() - Method in interface goldman.collection.positional.PositionalCollection
Removes the element at the front (position 0) of this collection and returns it.
removeFirst() - Method in class goldman.collection.positional.SinglyLinkedList
Removes the element at position 0 and decrements the position for the elements that were at positions 1 to size-1.
removeImpl(Trie<E>.SearchData) - Method in class goldman.collection.ordered.digitized.PatriciaTrie
Call an internal remove method that takes a reference to the node to remove and its leaf parent
removeImpl(Trie<E>.SearchData) - Method in class goldman.collection.ordered.digitized.Trie
It calls an internal method that removes sd.ptr from the trie.
removeLast() - Method in class goldman.collection.positional.Array
Removes the element at position size-1
removeLast() - Method in class goldman.collection.positional.Buffer
Removes the last element in the buffer
removeLast() - Method in interface goldman.collection.positional.PositionalCollection
Removes the element at the end (position n-1) of this collection and returns it.
removeLast() - Method in class goldman.collection.positional.SinglyLinkedList
Removes the element at position size-1
removeNext(SinglyLinkedList.ListItem<E>) - Method in class goldman.collection.positional.SinglyLinkedList
 
removeNextElement() - Method in class goldman.collection.positional.SinglyLinkedList.Tracker
Removes the element that follows the tracked element
removeRange(int, int) - Method in class goldman.collection.positional.Array
Requires 0 ≤ fromPostoPos < size.
removeRange(int, int) - Method in class goldman.collection.positional.DynamicArray
Requires 0 ≤ fromPostoPos < size.
removeRange(int, int) - Method in class goldman.collection.positional.DynamicCircularArray
 
removeRange(int, int) - Method in interface goldman.collection.positional.PositionalCollection
Removes the elements from position fromPosition to position toPosition, inclusive.
removeRange(int, int) - Method in class goldman.collection.positional.SinglyLinkedList
Requires 0 ≤ fromPostoPos < size.
removeRange(int, int) - Method in class goldman.collection.positional.TrackedArray
Removes a[i]...a[j] from the collection moving the elements at positions j+1 to size-1 to the left by j-1+1 positions.
removeVertex(V) - Method in class goldman.graph.AbstractGraph
 
removeVertex(V) - Method in class goldman.graph.AdjacencyListRepresentation
 
removeVertex(V) - Method in class goldman.graph.AdjacencyMatrixRepresentation
Removing a vertex implicitly removes all of its incident edges.
removeVertex(V) - Method in interface goldman.graph.Graph
Removes the given vertex from this graph.
removeVertex(V) - Method in interface goldman.graph.GraphRepresentation
Returns true if and only if the given vertex existed and was removed.
replaceSubtreeBy(BinarySearchTree<E>.BSTNode) - Method in class goldman.collection.ordered.BinarySearchTree.BSTNode
Replaces T(this) by T(x)
repositionElementByRank(int) - Method in class goldman.collection.positional.Array
 
repositionElementByRank(int, Comparator<? super E>) - Method in class goldman.collection.positional.Array
 
repositionElementByRank(int) - Method in interface goldman.collection.positional.PositionalCollection
Modifies the positional collection so element in position r is in its proper sorted order when using the default comparator, and returns that element.
repositionElementByRank(int, Comparator<? super E>) - Method in interface goldman.collection.positional.PositionalCollection
Modifies the positional collection so element in position r is in its proper sorted order when using the provided comparator, and returns this element.
repositionElementByRank(int) - Method in class goldman.collection.positional.SinglyLinkedList
 
repositionElementByRank(int, Comparator<? super E>) - Method in class goldman.collection.positional.SinglyLinkedList
 
repositionElementByRank(int, Comparator<? super E>) - Method in class goldman.collection.positional.TrackedArray
 
reset() - Method in class goldman.collection.spatial.AlternatingComparator
Returns the comparator to the beginning of the cycle of dimensions, so that the next dimension used for unqualified comparison will be dimension 0.
resetList() - Method in class goldman.collection.positional.SinglyLinkedList
Update the list to be empty without changing the value of size
resizeArray(int) - Method in class goldman.collection.positional.DynamicArray
Changes the capacity of the underlying array to desiredCapacity while maintaining the same positional collection.
resizeArray(int) - Method in class goldman.collection.positional.DynamicCircularArray
 
resizeArray(int) - Method in class goldman.collection.positional.TrackedArray
Changes the size of the underlying array to desiredCapacity while maintaining the same positional collection.
resizeTableAsNeeded() - Method in class goldman.collection.set.SeparateChaining
 
restoreCount(int) - Method in class goldman.collection.Version
 
retainAll(Collection<E>) - Method in class goldman.collection.AbstractCollection
Updates the current collection to contain only elements that are also in c
retainAll(Collection<E>) - Method in interface goldman.collection.Collection
Removes from this collection all elements for which there is no equivalent element in c.
retainAll(Collection<E>) - Method in class goldman.collection.ordered.SkipList
Updates the current collection to contain only elements that are also in c.
retainAll(Collection<E>) - Method in class goldman.collection.ordered.SortedArray
Updates the current collection to contain only elements that are also in c
retainAll(Collection<E>) - Method in class goldman.collection.priority.BinaryHeap
Updates the current collection to contain only elements that are also in c
retraceToLastLeftFork(E) - Method in class goldman.collection.ordered.digitized.PatriciaTrie.PatriciaSearchData
Moves the search location to the root of the left fork (if it exists) on the search path defined by x.
retraceToLastLeftFork(E) - Method in class goldman.collection.ordered.digitized.Trie.SearchData
Moves the search data position to the left fork root for x
retreat() - Method in class goldman.collection.AbstractCollection.VisitingIterator
 
retreat() - Method in interface goldman.collection.Locator
Retreats to the previous element in the collection (if there is one) and returns true.
retreat() - Method in class goldman.collection.ordered.BinarySearchTree.Tracker
Moves the tracker to the previous element in the iteration order, or FORE if the first element is currently tracked.
retreat() - Method in class goldman.collection.ordered.BTree.Marker
Moves the tracker to the previous element in the iteration order, or FORE if the first element is currently tracked.
retreat() - Method in class goldman.collection.ordered.digitized.Trie.Tracker
Moves this tracker to the previous element in the iteration order (or FORE if the tracker is currently at the first element).
retreat() - Method in class goldman.collection.ordered.SkipList.Tracker
Moves the tracker to the previous element in the iteration order (or head if the first element is currently tracked).
retreat() - Method in class goldman.collection.positional.Array.BasicMarker
Moves the locator to the previous position
retreat() - Method in class goldman.collection.positional.SinglyLinkedList.Tracker
Updates the tracker to the previous element in the collection
retreat() - Method in class goldman.collection.positional.TrackedArray.Tracker
Moves the tracker to the previous position
retreat() - Method in class goldman.collection.priority.BinaryHeap.BinaryHeapLocator
Moves the locator to the previous element in the iteration order (or FORE if it is currently at the first element).
retreat() - Method in class goldman.collection.priority.LeftistHeap.Tracker
 
retreat() - Method in class goldman.collection.priority.PairingHeap.Tracker
Moves the tracker to the previous element in the iteration order (or FORE if the first element is currently tracked).
retreat() - Method in class goldman.collection.set.DirectAddressing.Marker
Moves the marker to the previous slot in use, or to FORE if there is no such slot.
retreat() - Method in class goldman.collection.set.SeparateChaining.Marker
Moves the marker to the previous location
ReverseComparator<T> - Class in goldman
The ReverseComparator class wraps a provided comparator, reversing the sign of the output.
ReverseComparator(Comparator<? super T>) - Constructor for class goldman.ReverseComparator
 
right - Variable in class goldman.collection.ordered.BinarySearchTree.BSTNode
 
root - Variable in class goldman.collection.ordered.AbstractSearchTree
 
run() - Method in class goldman.collection.AbstractCollection.VisitingIterator
Calls the accept method on the collection provided to the constructor

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