-
Notifications
You must be signed in to change notification settings - Fork 0
/
main.cpp
288 lines (234 loc) · 6.34 KB
/
main.cpp
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
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
/*
=== OPERATIONS PLAN ===
||| DEV
* bucket optimal constants, whatever
* md5 / hashcalc method
* bucket dispatch logic
* alloc corner cases and problems: the test code in the task should not meet the RAM limits, I guess :)
+ explore some RTTI in the context of templates : hmm, not relevant to the problems
* tried to use conversion to double for both int and double (optional) - the if (data) cast to bool does not work, I'm drowning and drowning
- implement the std::optional<V> so the thing compiles (without functionality for now)
+ reduce to the most simple thing possible using the class to help gcc deduce the types
+ optional works with int
- make it work with strings : no results
- use the CeTu/std instead of std in the HashMap
- build and run, so that there is no normal std stuff
- proceed with the hashing logic
||| MISC
- readme.md : build&run instructions
- merge dev --> main
=== === === === === === */
// TODO: move the include to the right with tabs so nobody sees it, so that everything works according to specifications
#include "CeTu.h";
// === optional test ===
// class nullopt { /* overload dereferencing? (ret nullptr) */ };
template<typename V>
class optional
{
public:
bool isEmty = true;
V val;
double td;
optional(V _val)
{
val = _val;
isEmty = false;
}
optional()
{
isEmty = true;
}
operator bool() const {
return !isEmty;
}
operator int*() const {
return ((int*)(&val));
}
operator double*() {
td = (double)val;
//double d = (double)val;
return ((double*)(&val));
//return ((double*)(&d));
}
V* operator->() const
{
if (isEmty) {
return nullptr;
} else {
return val;
}
}
};
// simple adhoc int/double
// template<typename K, typename V>
// class OpTestClass
// {
// public:
// OpTestClass() { }
//
// // Lookup the given key in the map, if the key is not found return nullptr
// optional<V> lookup(K key)
// {
// // return 123;
// //
// // optional<V> opt;
// // opt.isEmty = true;
// //
// // return opt;
//
//
// return 123.456;
//
// optional<V> opt;
// opt.isEmty = true;
//
// return opt;
// }
//
// V storedValue;
// };
template<typename K, typename V>
class OpTestClass
{
public:
OpTestClass() { }
// Lookup the given key in the map, if the key is not found return nullptr
optional<V> lookup(K key)
{
return storedValue;
//optional<V> opt;
//opt.isEmty = true;
//
//return opt;
}
V storedValue;
};
// ====================== ====================== ======================
// my RTTI using sizeof?
//template<typename T>
//class rttic
//{
//public:
// rttic() { }
//
// void foo(T val)
// {
//
//
// int sz = sizeof(T);
// cout << sz;
// }
//
// // V storedValue;
//};
int main() {
// ====================== ====================== ======================
//rttic<>
//dynamic_cast<>
// ====================== ====================== ======================
// === string/double k:v ===
OpTestClass<string, double> stringMap;
stringMap.storedValue = 123.456;
auto piValue = stringMap.lookup("pi");
// cout << *piValue;
if (piValue) {
cout << "pi: " << *piValue << endl;
} else {
cout << "Key 'pi' not found." << endl;
}
// === int/int k:v ===
OpTestClass<int, int> otc;
otc.storedValue = 123;
auto data = otc.lookup(1);
if (data) {
cout << "data: " << *data << endl;
} else {
cout << "Key not found." << endl;
}
// ====================== ====================== ======================
// ======================
//optional<int> opt = tlookup(123);
// optional<int> data = tlookup(123);
// cout << "data: " << data << endl;
// auto data = tlookup(123);
//
// if (data) {
// cout << "data: " << *data << endl;
// } else {
// cout << "Key not found." << endl;
// }
// =====================================================
// =====================================================
// =====================================================
// Test with int as both key and value
// CeTuHashMap<int, int> intMap;
// intMap.insert(1, 2);
// auto data = intMap.lookup(1);
//
// if (data) {
// cout << "data: " << *data << endl;
// } else {
// cout << "Key not found." << endl;
// }
//
//// =====================================================
// // Attempt to lookup a key that doesn't exist
// auto missingData = intMap.lookup(3);
// if (missingData) {
// cout << "Missing data: " << *missingData << endl;
// } else {
// cout << "Key 3 not found." << endl;
// }
//
//// =====================================================
//
// intMap.print();
//
// // Erase a key and then attempt to look it up
// intMap.erase(1);
//
// intMap.print();
//
// auto erasedData = intMap.lookup(1);
// if (erasedData) {
// cout << "Erased data: " << *erasedData << endl;
// } else {
// cout << "Key 1 not found after erase." << endl;
// }
//
// =====================================================
// // Test with std::string as key and double as value
// CeTuHashMap<string, double> stringMap;
// stringMap.insert("pi", 3.14159);
// auto piValue = stringMap.lookup("pi");
// if (piValue) {
// cout << "pi: " << *piValue << endl;
// } else {
// cout << "Key 'pi' not found." << endl;
// }
//
// stringMap.print();
// =====================================================
// // Insert additional values and demonstrate lookup
// stringMap.insert("e", 2.71828);
// auto eValue = stringMap.lookup("e");
// if (eValue) {
// cout << "e: " << *eValue << endl;
// } else {
// cout << "Key 'e' not found." << endl;
// }
//
// stringMap.print();
//// =====================================================
// // Erase a key and then attempt to look it up
// stringMap.erase("pi");
// auto erasedPiValue = stringMap.lookup("pi");
// if (erasedPiValue) {
// cout << "Erased pi value: " << *erasedPiValue << endl;
// } else {
// cout << "Key 'pi' not found after erase." << endl;
// }
//
// stringMap.print();
return 0;
}