- hasDecoration(K) - Method in interface support.graph.CS16Decorator
-
Checks whether there is a decoration assigned for the given key.
- hashCode() - Method in class support.graph.GraphEdge
-
- HashEntry(K, V) - Constructor for class net.datastructures.HashTableMap.HashEntry
-
- HashTableMap<K,V> - Class in net.datastructures
-
A hash table data structure that uses linear probing to handle
collisions.
- HashTableMap() - Constructor for class net.datastructures.HashTableMap
-
Creates a hash table with prime factor 109345121 and capacity 1000.
- HashTableMap(int) - Constructor for class net.datastructures.HashTableMap
-
Creates a hash table with prime factor 109345121 and given capacity.
- HashTableMap(int, int) - Constructor for class net.datastructures.HashTableMap
-
Creates a hash table with the given prime factor and capacity.
- HashTableMap.HashEntry<K,V> - Class in net.datastructures
-
Nested class for an entry in a hash table.
- hashValue(K) - Method in class net.datastructures.HashTableMap
-
Hash function applying MAD method to default hash code.
- hasLeft(Position<E>) - Method in class net.datastructures.ArrayListCompleteBinaryTree
-
Returns whether v has a left child.
- hasLeft(Position<E>) - Method in interface net.datastructures.BinaryTree
-
Returns whether a node has a left child.
- hasLeft(Position<E>) - Method in class net.datastructures.LinkedBinaryTree
-
Returns whether a node has a left child.
- hasNext() - Method in class net.datastructures.ElementIterator
-
Returns whether the iterator has a next object.
- hasRight(Position<E>) - Method in class net.datastructures.ArrayListCompleteBinaryTree
-
Returns whether v has a right child.
- hasRight(Position<E>) - Method in interface net.datastructures.BinaryTree
-
Returns whether a node has a right child.
- hasRight(Position<E>) - Method in class net.datastructures.LinkedBinaryTree
-
Returns whether a node has a right child.
- HeapAdaptablePriorityQueue<K,V> - Class in net.datastructures
-
Realization of an adaptable priority queue by means of a heap.
- HeapAdaptablePriorityQueue() - Constructor for class net.datastructures.HeapAdaptablePriorityQueue
-
Creates an empty heap with a default comparator.
- HeapAdaptablePriorityQueue(Comparator) - Constructor for class net.datastructures.HeapAdaptablePriorityQueue
-
Creates an empty heap with the given comparator.
- HeapPriorityQueue<K,V> - Class in net.datastructures
-
Realization of a priority queue by means of a heap.
- HeapPriorityQueue() - Constructor for class net.datastructures.HeapPriorityQueue
-
Creates an empty heap with the default comparator
- HeapPriorityQueue(Comparator<K>) - Constructor for class net.datastructures.HeapPriorityQueue
-
Creates an empty heap with the given comparator