1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
|
-ArrayMap.h
[code]#ifndef ARRAYMAP_H_
#define ARRAYMAP_H_
#include <iostream>
using namespace std;
#include "Entry.h"
template<class K, class T>
class ArrayMap
{
private:
Entry<K, T>** entries;
int length;
int maxLength;
public:
ArrayMap();
~ArrayMap();
unsigned int size();
bool add(K* searchKey, T* element);
T* get(K* searchKey);
T* remove(K* searchKey);
};
template<class K, class T>
ArrayMap<K, T>::ArrayMap()
{
entries = new Entry*[length];
for(int i =0; i<length; i++)
{
entries[i]=NULL;
}
//TODO
}
template<class K, class T>
ArrayMap<K, T>::~ArrayMap()
{
for(int i=0; i<length; i++)
{
Entry* prev = entry;
entry = entry->next;
delete prev;
}
delete[] entry;
//TODO
}
template<class K, class T>
unsigned int ArrayMap<K, T>::size()
{
return length;
//TODO
}
template<class K, class T>
bool ArrayMap<K, T>::add(K* searchKey, T* element)
{
//TODO
return false;
}
template<class K, class T>
T* ArrayMap<K, T>::get(K* searchKey)
{
//TODO
return NULL;
}
template<class K, class T>
T* ArrayMap<K, T>::remove(K* searchKey)
{
//TODO
return NULL;
}
#endif /* ARRAYMAP_H_ */
[code]-Entry.h
#ifndef ENTRY_H_
#define ENTRY_H_
#include <iostream>
using namespace std;
template<class K, class T>
class Entry {
private:
K* searchKey;
T* element;
public:
Entry();
Entry(K* newSearchKey, T* newElement);
T* getElement();
void setElement(T* element);
K* getSearchKey();
int compare(const Entry& person) const;
bool operator ==(const Entry& d) const;
bool operator <(const Entry& d) const;
};
template<class K, class T>
Entry<K, T>::Entry() {
searchKey = NULL;
element = NULL;
}
template<class K, class T>
Entry<K, T>::Entry(K* newSearchKey, T* newElement) {
searchKey = newSearchKey;
element = newElement;
}
template<class K, class T>
T* Entry<K, T>::getElement() {
return element;
}
template<class K, class T>
void Entry<K, T>::setElement(T* element) {
this->element = element;
}
template<class K, class T>
K* Entry<K, T>::getSearchKey() {
return searchKey;
}
template<class K, class T>
int Entry<K, T>::compare(const Entry& entry) const {
if (*searchKey < *(entry.searchKey)) {
return -1;
} else if (*searchKey > *(entry.searchKey)) {
return 1;
}
return 0;
}
template<class K, class T>
bool Entry<K, T>::operator ==(const Entry& d) const {
return !compare(d);
}
template<class K, class T>
bool Entry<K, T>::operator <(const Entry& d) const {
return compare(d) < 0;
}
#endif /* ENTRY_H_ */
|
