- RBTree<K,V> - Class in net.datastructures
-
Realization of a dictionary by means of a red-black tree.
- RBTree() - Constructor for class net.datastructures.RBTree
-
- RBTree(Comparator<K>) - Constructor for class net.datastructures.RBTree
-
- remove(Entry<K, V>) - Method in interface net.datastructures.AdaptablePriorityQueue
-
Removes and returns an entry from the priority queue.
- remove(int) - Method in class net.datastructures.ArrayIndexList
-
Removes the element stored at the given index.
- remove() - Method in class net.datastructures.ArrayListCompleteBinaryTree
-
Removes and returns the element at the last node.
- remove(Entry<K, V>) - Method in class net.datastructures.AVLTree
-
Removes and returns an entry from the dictionary.
- remove(Entry<K, V>) - Method in class net.datastructures.BinarySearchTree
-
Removes and returns a given entry.
- remove() - Method in interface net.datastructures.CompleteBinaryTree
-
Removes and returns the element stored in the last node of the
tree.
- remove(Entry<K, V>) - Method in interface net.datastructures.Dictionary
-
Removes and returns the given entry from the dictionary.
- remove() - Method in class net.datastructures.ElementIterator
-
Throws an UnsupportedOperationException in all cases,
because removal is not a supported operation in this iterator.
- remove(K) - Method in class net.datastructures.HashTableMap
-
Removes the key-value pair with a specified key.
- remove(Entry<K, V>) - Method in class net.datastructures.HeapAdaptablePriorityQueue
-
Removes and returns the given entry from the heap.
- remove(int) - Method in interface net.datastructures.IndexList
-
Removes and returns the element at index i, shifting the elements after this.
- remove(Position<E>) - Method in class net.datastructures.LinkedBinaryTree
-
Removes a node with zero or one child.
- remove(K) - Method in interface net.datastructures.Map
-
Removes the key-value pair with a given key.
- remove(Position<E>) - Method in class net.datastructures.NodePositionList
-
Remove the given position from the list; O(1) time
- remove(Position<E>) - Method in interface net.datastructures.PositionList
-
Removes a node from the list, returning the element stored there.
- remove(Entry<K, V>) - Method in class net.datastructures.RBTree
-
Removes and returns the given entry from the dictionary.
- remove(Entry<K, V>) - Method in class net.datastructures.SortedListAdaptablePriorityQueue
-
Removes and returns the given entry
- remove(Entry<K, V>) - Method in class support.graph.CS16AdaptableHeapPriorityQueue
-
Removes and returns the given entry from the heap.
- remove(int) - Method in class support.graph.NodeSequence
-
- remove(Position<E>) - Method in class support.graph.NodeSequence
-
- removeAboveExternal(Position<E>) - Method in class net.datastructures.LinkedBinaryTree
-
Remove an external node v and replace its parent with v's
sibling
- removeDecoration(K) - Method in interface support.graph.CS16Decorator
-
Removes the decoration that may have previously been set for the given key.
- removeEdge(Edge<E>) - Method in class net.datastructures.AdjacencyListGraph
-
Remove an edge and return its element
- removeEdge(Edge<E>) - Method in interface net.datastructures.Graph
-
Removes an edge and return its element
- removeEdge(CS16Edge<V>) - Method in interface support.graph.Graph
-
Removes an Edge from your Graph.
- removeFirst() - Method in interface net.datastructures.Deque
-
Removes the first element; an exception is thrown if deque is empty.
- removeFirst() - Method in class net.datastructures.NodeDeque
-
- removeFirst() - Method in class support.graph.NodeSequence
-
- removeLast() - Method in interface net.datastructures.Deque
-
Removes the last element; an exception is thrown if deque is empty.
- removeLast() - Method in class net.datastructures.NodeDeque
-
- removeLast() - Method in class support.graph.NodeSequence
-
- removeMin() - Method in class net.datastructures.HeapPriorityQueue
-
Removes and returns an entry with minimum key
- removeMin() - Method in interface net.datastructures.PriorityQueue
-
Removes and returns an entry with minimum key.
- removeMin() - Method in class net.datastructures.SortedListPriorityQueue
-
Removes and returns an entry with minimum key.
- removeMin() - Method in class support.graph.CS16AdaptableHeapPriorityQueue
-
Removes and returns an entry with minimum key.
- removeVertex(Vertex<V>) - Method in class net.datastructures.AdjacencyListGraph
-
Remove a vertex and all its incident edges and return the
element stored at the removed vertex
- removeVertex(Vertex<V>) - Method in interface net.datastructures.Graph
-
Removes a vertex and all its incident edges and returns the
element stored at the removed vertex
- removeVertex(CS16Vertex<V>) - Method in interface support.graph.Graph
-
Removes a Vertex from your graph.
- replace(Position, Object) - Method in class net.datastructures.AdjacencyListGraph
-
Replace the element a given position (vertex or edge) with a new
element and return the old element
- replace(Vertex<V>, V) - Method in class net.datastructures.AdjacencyListGraph
-
- replace(Edge<E>, E) - Method in class net.datastructures.AdjacencyListGraph
-
- replace(Position<E>, E) - Method in class net.datastructures.ArrayListCompleteBinaryTree
-
Replaces the element at v.
- replace(Vertex<V>, V) - Method in interface net.datastructures.Graph
-
Replaces the element of a given vertex with a new element and
returns the old element
- replace(Edge<E>, E) - Method in interface net.datastructures.Graph
-
Replaces the element of a given edge with a new element and
returns the old element
- replace(Position<E>, E) - Method in class net.datastructures.LinkedBinaryTree
-
Replaces the element at a node.
- replace(Position<E>, E) - Method in class net.datastructures.LinkedTree
-
Replaces the element at a node.
- replace(Position<E>, E) - Method in interface net.datastructures.Tree
-
Replaces the element stored at a given node.
- replaceKey(Entry<K, V>, K) - Method in interface net.datastructures.AdaptablePriorityQueue
-
Replaces the key of an entry and returns the old key.
- replaceKey(Entry<K, V>, K) - Method in class net.datastructures.HeapAdaptablePriorityQueue
-
Replaces the key of the given entry.
- replaceKey(Entry<K, V>, K) - Method in class net.datastructures.SortedListAdaptablePriorityQueue
-
Replaces the key of the given entry
- replaceKey(Entry<K, V>, K) - Method in class support.graph.CS16AdaptableHeapPriorityQueue
-
Replaces the key of the given entry.
- replaceValue(Entry<K, V>, V) - Method in interface net.datastructures.AdaptablePriorityQueue
-
Replaces the value of an entry and returns the old value.
- replaceValue(Entry<K, V>, V) - Method in class net.datastructures.HeapAdaptablePriorityQueue
-
Replaces the value of the given entry.
- replaceValue(Entry<K, V>, V) - Method in class net.datastructures.SortedListAdaptablePriorityQueue
-
Replaces the value of the given entry
- replaceValue(Entry<K, V>, V) - Method in class support.graph.CS16AdaptableHeapPriorityQueue
-
Replaces the value of the given entry.
- right(Position<E>) - Method in class net.datastructures.ArrayListCompleteBinaryTree
-
Returns the right child of v.
- right(Position<E>) - Method in interface net.datastructures.BinaryTree
-
Returns the right child of a node.
- right - Variable in class net.datastructures.EulerTour.TourResult
-
- right(Position<E>) - Method in class net.datastructures.LinkedBinaryTree
-
Returns the right child of a node.
- root() - Method in class net.datastructures.ArrayListCompleteBinaryTree
-
Returns the root of the tree.
- root() - Method in class net.datastructures.LinkedBinaryTree
-
Returns the root of the tree.
- root() - Method in class net.datastructures.LinkedTree
-
Returns the root of the tree.
- root() - Method in interface net.datastructures.Tree
-
Returns the root of the tree.