Index

B D E G I L M O P R S T 
All Classes|All Packages

S

search(K) - Method in class dictionary.BinaryTreeDictionary
 
search(K) - Method in interface dictionary.Dictionary
Returns the value to which the specified key is mapped, or null if this map contains no mapping for the key.
search(K) - Method in class dictionary.LinkedHashDictionary
 
search(K) - Method in class dictionary.OpenHashDictionary
 
search(K) - Method in class dictionary.SortedArrayDictionary
 
setValue(V) - Method in class dictionary.Dictionary.Entry
Replaces the value corresponding to this entry with the specified value.
size() - Method in class dictionary.BinaryTreeDictionary
 
size() - Method in interface dictionary.Dictionary
Returns the number of elements in this dictionary.
size() - Method in class dictionary.LinkedHashDictionary
 
size() - Method in class dictionary.OpenHashDictionary
 
size() - Method in class dictionary.SortedArrayDictionary
 
SortedArrayDictionary<K,​V> - Class in dictionary
Implementation of the Dictionary interface as sorted array.
SortedArrayDictionary() - Constructor for class dictionary.SortedArrayDictionary
Constructs an empty array with an initial capacity sufficient to hold 32 entries.
SortedArrayDictionary(Comparator<? super K>) - Constructor for class dictionary.SortedArrayDictionary
Constructs an empty array with an initial capacity sufficient to hold 32 entries.
B D E G I L M O P R S T 
All Classes|All Packages