A B C D E F G H I K L N P R S T V

R

RandomAccessIntPriorityQueue<E> - Class in inf.util

This class represents a priority queue, that is a queue in which elements can be held and from which they can be retrieved by priority.

RandomAccessIntPriorityQueue() - Constructor for class inf.util.RandomAccessIntPriorityQueue

This constructor creates an empty PriorityQueue.

RandomAccessIntPriorityQueue.RAIntKeyTreeEntry<E> - Class in inf.util

RandomAccessIntPriorityQueue.RAIntKeyTreeMapIterator<T> - Class in inf.util

RandomAccessIntPriorityQueue.RAIntKeyTreeMapIterator() - Constructor for class inf.util.RandomAccessIntPriorityQueue.RAIntKeyTreeMapIterator

RandomAccessIntPriorityQueue.RAIntPriorityQueueIterator<T> - Class in inf.util

This class represents an iterator for the elements in an TreeOfListsIntPriorityQueue.

RandomAccessIntPriorityQueue.RAIntPriorityQueueIterator() - Constructor for class inf.util.RandomAccessIntPriorityQueue.RAIntPriorityQueueIterator

This constructor initializes an Iterator of the elements in the given priority queue.

remove() - Method in class inf.util.ArrayOfHashedListsIntPriorityQueue.ArrayOfHashedListsIntPriorityQueueIterator

remove() - Method in class inf.util.ArrayOfListsIntPriorityQueue.ArrayOfListsIntPriorityQueueIterator

remove(double) - Method in interface inf.util.DoubleKeyMap

This function removes the mapping for this key, a double, from this DoubleKeyMap if it was present.

remove() - Method in class inf.util.DoubleKeyTreeMap.DoubleKeyTreeMapIterator

remove(Object) - Method in class inf.util.DoubleKeyTreeMap

This function removes the mapping for this key from this Map if it was present.

remove(double) - Method in class inf.util.DoubleKeyTreeMap

This function removes the mapping for this key, a double, from this DoubleKeyMap if it was present.

remove(Object) - Method in class inf.util.HashedList

This function removes the occurrence of the specified element in this list.

remove(int) - Method in class inf.util.HashedList

This class does not support index-based access to the list and an exception will be thrown if this method is called.

remove(int) - Method in interface inf.util.IntKeyMap

This function removes the mapping for this key, an int, from this IntKeyMap if it was present.

remove() - Method in class inf.util.IntKeyTreeMap.IntKeyTreeMapIterator

remove(Object) - Method in class inf.util.IntKeyTreeMap

This function removes the mapping for this key from this Map if it was present.

remove(int) - Method in class inf.util.IntKeyTreeMap

This function removes the mapping for this key, an int, from this IntKeyMap if it was present.

remove() - Method in class inf.util.RandomAccessIntPriorityQueue.RAIntKeyTreeMapIterator

remove() - Method in class inf.util.RandomAccessIntPriorityQueue.RAIntPriorityQueueIterator

remove(Object) - Method in class inf.util.SingletonSet

This function attempts to remove the given element from this Set.

remove() - Method in class inf.util.SingletonSet.SingletonSetIterator

remove() - Method in class inf.util.TreeOfListsDoublePriorityQueue.TreeOfListsDoublePriorityQueueIterator

remove() - Method in class inf.util.TupleEnumerator

This function is not supported and causes an Exception.

removeAll(Collection<?>) - Method in class inf.util.HashedList

This function removes the occurrence of all the specified elements in this list.

removeElementAt(E, Integer) - Method in class inf.util.ArrayOfHashedListsIntPriorityQueue

This function attempts to remove the given element at the given priority from this priority queue.

removeElementAt(E, int) - Method in class inf.util.ArrayOfHashedListsIntPriorityQueue

This function attempts to remove the given element at the given priority from this priority queue.

removeElementAt(E, Integer) - Method in class inf.util.ArrayOfListsIntPriorityQueue

This function throws an UnsupportedOperationException as there is no efficient implementation of this operation for this class.

removeElementAt(E, int) - Method in class inf.util.ArrayOfListsIntPriorityQueue

This function throws an UnsupportedOperationException as there is no efficient implementation of this operation for this class.

removeElementAt(E, double) - Method in interface inf.util.DoublePriorityQueue

This function attempts to remove the given element at the given priority from this priority queue.

removeElementAt(E, int) - Method in interface inf.util.IntPriorityQueue

This function attempts to remove the given element at the given priority from this priority queue.

removeElementAt(E, N) - Method in interface inf.util.PriorityQueue

This function attempts to remove the given element at the given priority from this PriorityQueue.

removeElementAt(E, Integer) - Method in class inf.util.RandomAccessIntPriorityQueue

This function attempts to remove the given element at the given priority from this priority queue.

removeElementAt(E, int) - Method in class inf.util.RandomAccessIntPriorityQueue

This function attempts to remove the given element at the given priority from this priority queue.

removeElementAt(E, Double) - Method in class inf.util.TreeOfListsDoublePriorityQueue

This function attempts to remove the given element at the given priority from this priority queue.

removeElementAt(E, double) - Method in class inf.util.TreeOfListsDoublePriorityQueue

This function attempts to remove the given element at the given priority from this priority queue.

removeFirst() - Method in class inf.util.HashedList

This function removes and returns the first element from this list.

removeFirstAt(int) - Method in class inf.util.RandomAccessIntPriorityQueue

This function removes and returns the element that is at the front of the queue at the given priority.

removeHighestFirst() - Method in class inf.util.ArrayOfHashedListsIntPriorityQueue

This function removes and returns the element in this priority queue that has the highest priority.

removeHighestFirst() - Method in class inf.util.ArrayOfListsIntPriorityQueue

This function removes and returns the element in this priority queue that has the highest priority.

removeHighestFirst() - Method in interface inf.util.PriorityQueue

This function removes and returns the element in this PriorityQueue that has the highest priority.

removeHighestFirst() - Method in class inf.util.RandomAccessIntPriorityQueue

This function removes and returns the element in this priority queue that has the highest priority.

removeHighestFirst() - Method in class inf.util.TreeOfListsDoublePriorityQueue

This function removes and returns the element in this priority queue that has the highest priority.

removeHighestLast() - Method in class inf.util.ArrayOfHashedListsIntPriorityQueue

This function removes and returns the element in this priority queue that has the highest priority.

removeHighestLast() - Method in class inf.util.ArrayOfListsIntPriorityQueue

This function removes and returns the element in this priority queue that has the highest priority.

removeHighestLast() - Method in interface inf.util.PriorityQueue

This function removes and returns the element in this PriorityQueue that has the highest priority.

removeHighestLast() - Method in class inf.util.RandomAccessIntPriorityQueue

This function removes and returns the element in this priority queue that has the highest priority.

removeHighestLast() - Method in class inf.util.TreeOfListsDoublePriorityQueue

This function removes and returns the element in this priority queue that has the highest priority.

removeLast() - Method in class inf.util.HashedList

This function removes and returns the last element from this list.

removeLastAt(int) - Method in class inf.util.RandomAccessIntPriorityQueue

This function removes and returns the element that is at the end of the queue at the given priority.

removeLowestFirst() - Method in class inf.util.ArrayOfHashedListsIntPriorityQueue

This function removes and returns the element in this priority queue that has the lowest priority.

removeLowestFirst() - Method in class inf.util.ArrayOfListsIntPriorityQueue

This function removes and returns the element in this priority queue that has the lowest priority.

removeLowestFirst() - Method in interface inf.util.PriorityQueue

This function removes and returns the element in this PriorityQueue that has the lowest priority.

removeLowestFirst() - Method in class inf.util.RandomAccessIntPriorityQueue

This function removes and returns the element in this priority queue that has the lowest priority.

removeLowestFirst() - Method in class inf.util.TreeOfListsDoublePriorityQueue

This function removes and returns the element in this priority queue that has the lowest priority.

removeLowestLast() - Method in class inf.util.ArrayOfHashedListsIntPriorityQueue

This function removes and returns the element in this priority queue that has the lowest priority.

removeLowestLast() - Method in class inf.util.ArrayOfListsIntPriorityQueue

This function removes and returns the element in this priority queue that has the lowest priority.

removeLowestLast() - Method in interface inf.util.PriorityQueue

This function removes and returns the element in this PriorityQueue that has the lowest priority.

removeLowestLast() - Method in class inf.util.RandomAccessIntPriorityQueue

This function removes and returns the element in this priority queue that has the lowest priority.

removeLowestLast() - Method in class inf.util.TreeOfListsDoublePriorityQueue

This function removes and returns the element in this priority queue that has the lowest priority.

removeNthAt(int, int) - Method in class inf.util.RandomAccessIntPriorityQueue

This function removes and returns the nth element at the given priority in this queue.

removeNthElement(int) - Method in class inf.util.RandomAccessIntPriorityQueue

This function removes and returns the nth element in this queue.

retainAll(Collection<?>) - Method in class inf.util.HashedList

This function removes the occurrence of all the elements in this list that are not in the given Collection.

root - Variable in class inf.util.DoubleKeyTreeMap

the root of the tree

root - Variable in class inf.util.IntKeyTreeMap

the root of the tree

root - Variable in class inf.util.RandomAccessIntPriorityQueue

the root of the tree