Data Structures and Algorithm Analysis - Computer Science at ...

136 Chap. 4 Lists, Stacks, and Queues/** Dictionary implemented by unsorted array-based list. */class UALdictionary implements Dictionary {private static final int defaultSize = 10; // Default sizeprivate AList list; // To store dictionary/** Constructors */UALdictionary() { this(defaultSize); }UALdictionary(int sz){ list = new AList(sz); }/** Reinitialize */public void clear() { list.clear(); }/** Insert an element: append to list */public void insert(Key k, E e) {KVpair temp = new KVpair(k, e);list.append(temp);}/** Use sequential search to find the element to remove */public E remove(Key k) {E temp = find(k);if (temp != null) list.remove();return temp;}/** Remove the last element */public E removeAny() {if (size() != 0) {list.moveToEnd();list.prev();KVpair e = list.remove();return e.value();}else return null;}/** Find k using sequential search@return Record with key value k */public E find(Key k) {for(list.moveToStart(); list.currPos() < list.length();list.next()) {KVpair temp = list.getValue();if (k == temp.key())return temp.value();}return null; // "k" does not appear in dictionary}Figure 4.33 A dictionary implemented with an unsorted array-based list.