Uses of Interface
net.datastructures.Entry

Packages that use Entry

Package	Description
net.datastructures
support.graph

Uses of Entry in net.datastructures

Classes in net.datastructures that implement Entry

Modifier and Type	Class and Description
static class	HashTableMap.HashEntry<K,V> Nested class for an entry in a hash table.

Methods in net.datastructures that return Entry

Modifier and Type	Method and Description
Entry<K,V>	Dictionary.find(K key) Returns an entry containing the given key, or null if no such entry exists.
Entry<K,V>	BinarySearchTree.find(K key) Returns an entry containing the given key.
Entry<K,V>	Dictionary.insert(K key, V value) Inserts an item into the dictionary.
Entry<K,V>	HeapAdaptablePriorityQueue.insert(K k, V v) Inserts a key-value pair and returns the entry created.
Entry<K,V>	HeapPriorityQueue.insert(K k, V x) Inserts a key-value pair and returns the entry created
Entry<K,V>	PriorityQueue.insert(K key, V value) Inserts a key-value pair and return the entry created.
Entry<K,V>	RBTree.insert(K k, V x) Inserts an item into the dictionary and returns the newly created entry.
Entry<K,V>	SortedListAdaptablePriorityQueue.insert(K k, V v) Inserts a key-value pair and returns the entry created
Entry<K,V>	SortedListPriorityQueue.insert(K k, V v) Inserts a key-value pair and return the entry created.
Entry<K,V>	BinarySearchTree.insert(K k, V x) Inserts an entry into the tree and returns the newly created entry.
Entry<K,V>	AVLTree.insert(K k, V v) Inserts an item into the dictionary and returns the newly created entry.
Entry<K,V>	HeapPriorityQueue.min() Returns but does not remove an entry with minimum key
Entry<K,V>	PriorityQueue.min() Returns but does not remove an entry with minimum key.
Entry<K,V>	SortedListPriorityQueue.min() Returns but does not remove an entry with minimum key.
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>	SortedListAdaptablePriorityQueue.remove(Entry<K,V> entry) Removes and returns the given entry
Entry<K,V>	AdaptablePriorityQueue.remove(Entry<K,V> e) Removes and returns an entry from the priority queue.
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.
Entry<K,V>	HeapPriorityQueue.removeMin() Removes and returns an entry with minimum key
Entry<K,V>	PriorityQueue.removeMin() Removes and returns an entry with minimum key.
Entry<K,V>	SortedListPriorityQueue.removeMin() Removes and returns an entry with minimum key.

Methods in net.datastructures that return types with arguments of type Entry

Modifier and Type	Method and Description
java.lang.Iterable<Entry<K,V>>	Dictionary.entries() Returns an iterator containing all the entries in the dictionary.
java.lang.Iterable<Entry<K,V>>	HashTableMap.entries() Returns an iterable object containing all of the entries.
java.lang.Iterable<Entry<K,V>>	Map.entries() Returns an iterable object containing all the entries in the map.
java.lang.Iterable<Entry<K,V>>	BinarySearchTree.entries() Returns an iterator containing all entries in the tree.
java.lang.Iterable<Entry<K,V>>	Dictionary.findAll(K key) Returns an iterator containing all the entries containing the given key, or an empty iterator if no such entries exist.
java.lang.Iterable<Entry<K,V>>	BinarySearchTree.findAll(K key) Returns an iterable collection of all the entries containing the given key.

Methods in net.datastructures with parameters of type Entry

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>	SortedListAdaptablePriorityQueue.remove(Entry<K,V> entry) Removes and returns the given entry
Entry<K,V>	AdaptablePriorityQueue.remove(Entry<K,V> e) Removes and returns an entry from the priority queue.
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.
K	SortedListAdaptablePriorityQueue.replaceKey(Entry<K,V> entry, K k) Replaces the key of the given entry
K	AdaptablePriorityQueue.replaceKey(Entry<K,V> e, K key) Replaces the key of an entry and returns the old key.
V	HeapAdaptablePriorityQueue.replaceValue(Entry<K,V> e, V value) Replaces the value of the given entry.
V	SortedListAdaptablePriorityQueue.replaceValue(Entry<K,V> e, V value) Replaces the value of the given entry
V	AdaptablePriorityQueue.replaceValue(Entry<K,V> e, V value) Replaces the value of an entry and returns the old value.

Constructor parameters in net.datastructures with type arguments of type Entry

Constructor and Description
SortedListAdaptablePriorityQueue(PositionList<Entry<K,V>> list, java.util.Comparator<K> comp) Creates the priority queue with the given comparator and list.
SortedListPriorityQueue(PositionList<Entry<K,V>> list, java.util.Comparator<K> comp) Creates the priority queue with the given comparator and list.

Uses of Entry in support.graph

Methods in support.graph that return Entry

Modifier and Type	Method and Description
Entry<K,V>	CS16AdaptableHeapPriorityQueue.insert(K key, V value) Inserts a key-value pair and returns the entry created.
Entry<K,V>	CS16AdaptableHeapPriorityQueue.min() Returns but does not remove an entry with minimum key.
Entry<K,V>	CS16AdaptableHeapPriorityQueue.remove(Entry<K,V> entry) Removes and returns the given entry from the heap.
Entry<K,V>	CS16AdaptableHeapPriorityQueue.removeMin() Removes and returns an entry with minimum key.

Methods in support.graph that return types with arguments of type Entry

Modifier and Type	Method and Description
CompleteBinaryTree<Entry<K,V>>	CS16AdaptableHeapPriorityQueue.getTree() Returns a CompleteBinaryTree that will allow the visualizer access to private members, shattering encapsulation, but allowing visualization of the heap.

Methods in support.graph with parameters of type 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.