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

H

hasCycle() - Method in class goldman.graph.AbstractGraph
 
hasCycle() - Method in interface goldman.graph.Graph
Returns true if and only this graph has a cycle.
hash(int) - Method in class goldman.collection.set.OpenAddressing
 
hashCode() - Method in class goldman.collection.tagged.TaggedElement
 
Hasher<E> - Interface in goldman.collection.set
The Hasher interface provides the application program the flexibility to specify how the hash codes are to be computed over the elements of the set.
hasNegativeWeightCycle() - Method in class goldman.graph.ShortestPathMatrix
 
hasNegativeWeightCycleReachableFromSource() - Method in class goldman.graph.InTree
 
hasNext() - Method in class goldman.collection.AbstractCollection.VisitingIterator
 
hasNext() - Method in class goldman.collection.ordered.BinarySearchTree.Tracker
 
hasNext() - Method in class goldman.collection.ordered.BTree.Marker
 
hasNext() - Method in class goldman.collection.ordered.digitized.Trie.Tracker
 
hasNext() - Method in class goldman.collection.ordered.SkipList.Tracker
 
hasNext() - Method in class goldman.collection.positional.Array.BasicMarker
 
hasNext() - Method in class goldman.collection.positional.SinglyLinkedList.Tracker
 
hasNext() - Method in class goldman.collection.positional.TrackedArray.Tracker
 
hasNext() - Method in class goldman.collection.priority.BinaryHeap.BinaryHeapLocator
 
hasNext() - Method in class goldman.collection.priority.LeftistHeap.Tracker
 
hasNext() - Method in class goldman.collection.priority.PairingHeap.Tracker
 
hasNext() - Method in class goldman.collection.set.DirectAddressing.Marker
 
hasNext() - Method in class goldman.collection.set.SeparateChaining.Marker
 
hasNext() - Method in class goldman.NonMutatingIterator
 
head - Variable in class goldman.collection.positional.SinglyLinkedList
 
heapsort() - Method in class goldman.collection.positional.Array
Sorts this collection with heap sort using the default comparator
heapsort(Comparator<? super E>) - Method in class goldman.collection.positional.Array
Sorts this collection with heap sort using the provided comparator
heapsort() - Method in interface goldman.collection.positional.PositionalCollection
Sorts this collection with heap sort using the default comparator.
heapsort(Comparator<? super E>) - Method in interface goldman.collection.positional.PositionalCollection
Sorts this collection with heap sort using the provided comparator.
heapsort() - Method in class goldman.collection.positional.SinglyLinkedList
Uses the default comparator to order the elements
heapsort(Comparator<? super E>) - Method in class goldman.collection.positional.SinglyLinkedList
 
heapsort(Comparator<? super E>) - Method in class goldman.collection.positional.TrackedArray
 
heapsortImpl(Comparator) - Method in class goldman.collection.positional.SinglyLinkedList
Is the implementation of heap sort

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