4 /* LinkedHashNode *****************************************************/
12 LinkedHashNode(int key, int data, LinkedHashNode *next);
17 /* SimpleList *********************************************************/
26 int contains(int data);
28 int hasMoreElements();
33 /* SimpleIterator *****************************************************/
35 class SimpleIterator {
43 inline SimpleIterator(LinkedHashNode *start) {
47 inline int hasNext() {
48 return (int)cur->next == 0 ? 0 : 1;
71 /* SimpleHash *********************************************************/
79 LinkedHashNode *bucket;
84 SimpleHash* parents[10];
94 int add(int key, int data);
96 bool contains(int key);
98 bool contains(int key, int data);
100 int get(int key, int& data);
102 int countdata(int data);
104 void addParent(SimpleHash* parent);
106 inline SimpleIterator* iterator() {
107 return new SimpleIterator(&all);
118 /* SimpleHashExcepion *************************************************/
120 class SimpleHashException {
122 SimpleHashException();