Uses of Class
net.datastructures.InvalidKeyException

Uses of InvalidKeyException in net.datastructures

Methods in net.datastructures that throw InvalidKeyException

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.
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.
V	Map.get(K key) Returns the value associated with a key.
V	HashTableMap.get(K key) Returns the value associated with a key.
Entry<K,V>	SortedListPriorityQueue.insert(K k, V v) Inserts a key-value pair and return the entry created.
Entry<K,V>	SortedListAdaptablePriorityQueue.insert(K k, V v) Inserts a key-value pair and returns 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>	PriorityQueue.insert(K key, V value) Inserts a key-value pair and return 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>	HeapAdaptablePriorityQueue.insert(K k, V v) Inserts a key-value pair and returns the entry created.
Entry<K,V>	Dictionary.insert(K key, V value) Inserts an item into the dictionary.
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.
V	Map.put(K key, V value) Puts a given key-value pair in the map, replacing a previous one, if any, and returns the old value.
V	HashTableMap.put(K key, V value) Put a key-value pair in the map, replacing previous one if it exists.
V	Map.remove(K key) Removes the key-value pair with a given key.
V	HashTableMap.remove(K key) Removes the key-value pair with a specified key.
K	AdaptablePriorityQueue.replaceKey(Entry<K,V> e, K key) Replaces the key of an entry and returns the old key.