Package | Description |
---|---|
net.datastructures | |
support.graph |
Modifier and Type | Method and Description |
---|---|
Entry<K,V> |
Dictionary.remove(Entry<K,V> e)
Removes and returns the given entry from the dictionary.
|
Entry<K,V> |
HeapAdaptablePriorityQueue.remove(Entry<K,V> entry)
Removes and returns the given entry from the heap.
|
Entry<K,V> |
RBTree.remove(Entry<K,V> ent)
Removes and returns the given entry from the dictionary.
|
Entry<K,V> |
BinarySearchTree.remove(Entry<K,V> ent)
Removes and returns a given entry.
|
Entry<K,V> |
AVLTree.remove(Entry<K,V> ent)
Removes and returns an entry from the dictionary.
|
K |
HeapAdaptablePriorityQueue.replaceKey(Entry<K,V> entry,
K k)
Replaces the key of the given entry.
|
V |
HeapAdaptablePriorityQueue.replaceValue(Entry<K,V> e,
V value)
Replaces the value of the given entry.
|
Modifier and Type | Method and Description |
---|---|
Entry<K,V> |
CS16AdaptableHeapPriorityQueue.remove(Entry<K,V> entry)
Removes and returns the given entry from the heap.
|
K |
CS16AdaptableHeapPriorityQueue.replaceKey(Entry<K,V> entry,
K key)
Replaces the key of the given entry.
|
V |
CS16AdaptableHeapPriorityQueue.replaceValue(Entry<K,V> entry,
V value)
Replaces the value of the given entry.
|