-
Notifications
You must be signed in to change notification settings - Fork 2
/
patr.cpp
272 lines (228 loc) · 8.9 KB
/
patr.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
#include "patr.hpp"
#include <iostream>
struct Patricia::Node{
std::string key;
int value;
size_t index;
Node *right, *left;
//Node *right = nullptr, *left = nullptr;
Node(const std::string& key, const int& value, const int& index)
: key(key), value(value), index(index), left(nullptr), right(nullptr) {
// Debug
//std::cout << "[" << this << "] Created with key \"" + key + "\" and value \"" << value << "\"\n";
}
~Node(){
// Debug
//std::cout << "[" << this << "] Deleted with key \"" + key + "\" and value \"" << value << "\"\n";
}
};
void Patricia::Print(Node* node, bool isLeft, int offset, const size_t& prevIndex) const{
if(node->index <= prevIndex)
return;
std::cout << '\t';
for(int i = 0; i < offset; ++i)
std::cout << ' ';
std::cout << (isLeft ? "- " : "+ ") << node->index << ' ' << node->key
<< ' ' << node->value << '\n';
Print(node->left, true, offset + 1, node->index);
Print(node->right, false, offset + 1, node->index);
}
void Patricia::Print() const{
if(!root)
return;
std::cout << '\t' << root->index << ' ' << root->key
<< ' ' << root->value << '\n';
Print(root->left, true, 1, root->index);
}
int& Patricia::At(const std::string& findKey) const{
if(!root)
throw std::runtime_error("\t\"" + findKey + "\" hadn't found!\n");
Node* get = Search(findKey);
if(get->key == findKey)
return get->value;
throw std::runtime_error("\t\"" + findKey + "\" hadn't found!\n");
}
void Patricia::Add(const std::string& key, int value){
if(!root){
root = new Node(key, value, 0);
root->left = root;
return;
}
Node *foundNode = Search(key);
if(foundNode->key == key)
throw std::runtime_error("\t\"" + key + "\" already exist!\n");
bool run = true;
size_t charIndex = 0;
while(run){
char foundedKey = (foundNode->key.size() > charIndex ? foundNode->key[charIndex] : '\0');
char inputKey = (key.size() > charIndex ? key[charIndex] : '\0');
for(size_t i = 0; i < BIT_COUNT; ++i){
bool foundedKeyBit = foundedKey >> (BIT_COUNT - 1 - i) & 1;
bool inputKeyBit = inputKey >> (BIT_COUNT - 1 - i) & 1;
if(foundedKeyBit != inputKeyBit){
Insert(key, value, charIndex * BIT_COUNT + i + 1);
run = false;
break;
}
}
++charIndex;
}
}
void Patricia::Erase(const std::string& key){
if(!root)
throw std::runtime_error("\t\"" + key + "\" hadn't found!\n");
// Get delete node, owner delete node and parent owner
std::tuple<Node*, Node*, Node*> delOwnerParentTuple = SearchE(key);
Node *deleteNode = std::get<0>(delOwnerParentTuple);
Node *ownerDeleteNode = std::get<1>(delOwnerParentTuple);
Node *parentOwnerDeleteNode = std::get<2>(delOwnerParentTuple);
if(deleteNode->key != key)
throw std::runtime_error("\t\"" + key + "\" hadn't found!\n");
// If delete node is root and it's one
if(deleteNode == root && root->left == root){
delete root;
root = nullptr;
return;
}
// If delete node is leaf
if(ownerDeleteNode == deleteNode){
//std::cout << "[Erase] DeleteNode is leaf\n";
if(parentOwnerDeleteNode->right == deleteNode)
if(deleteNode->right == deleteNode)
parentOwnerDeleteNode->right = deleteNode->left;
else
parentOwnerDeleteNode->right = deleteNode->right;
else
if(deleteNode->right == deleteNode)
parentOwnerDeleteNode->left = deleteNode->left;
else
parentOwnerDeleteNode->left = deleteNode->right;
delete deleteNode;
return;
}
// Get owner owner delete node
std::tuple<Node*, Node*, Node*> ownerOwnerTuple = SearchE(ownerDeleteNode->key);
Node *ownerOwnerDelNode = std::get<1>(ownerOwnerTuple);
// Change item from owner delete node to delete node
deleteNode->key = ownerDeleteNode->key;
deleteNode->value = ownerDeleteNode->value;
// If owner delete node is leaf
if(ownerOwnerDelNode == ownerDeleteNode){
if(parentOwnerDeleteNode->right == ownerDeleteNode)
parentOwnerDeleteNode->right = deleteNode;
else
parentOwnerDeleteNode->left = deleteNode;
}
else{
// Tie parent owner delete node with child
if(parentOwnerDeleteNode->right == ownerDeleteNode)
if(ownerDeleteNode->right == deleteNode)
parentOwnerDeleteNode->right = ownerDeleteNode->left;
else
parentOwnerDeleteNode->right = ownerDeleteNode->right;
else
if(ownerDeleteNode->right == deleteNode)
parentOwnerDeleteNode->left = ownerDeleteNode->left;
else
parentOwnerDeleteNode->left = ownerDeleteNode->right;
if(ownerOwnerDelNode->right == ownerDeleteNode)
ownerOwnerDelNode->right = deleteNode;
else
ownerOwnerDelNode->left = deleteNode;
}
delete ownerDeleteNode;
}
void Patricia::Clear(){
if(!root)
return;
if(root != root->left)
ClearNode(root->left);
delete root;
root = nullptr;
std::cout << "kek!\n";
}
std::tuple<Patricia::Node*, Patricia::Node*, Patricia::Node*> Patricia::SearchE(const std::string& findKey) const{
Node *currentNode = root->left, *prevNode = root, *prevPrevNode = root;
while(currentNode->index > prevNode->index){
size_t charIndex = (currentNode->index - 1) / BIT_COUNT;
// FindKey is less than need char
if(charIndex >= findKey.size()){
prevPrevNode = prevNode;
prevNode = currentNode;
// Only '0'
currentNode = currentNode->left;
continue;
}
char currentChar = findKey[charIndex]; // If findkey.size less than currentNode->index
int offset = (BIT_COUNT - 1 - ((currentNode->index - 1) % BIT_COUNT));
bool currentBit = (currentChar >> offset) & 1;
// Remember prevNode & prevPrevNove
prevPrevNode = prevNode;
prevNode = currentNode;
// If '1' go right, '0' go left
currentBit ? currentNode = currentNode->right
: currentNode = currentNode->left;
}
return std::make_tuple(currentNode, prevNode, prevPrevNode);
}
Patricia::Node* Patricia::Search(const std::string& findKey) const{
Node *currentNode = root->left, *prevNode = root;
while(currentNode->index > prevNode->index){
size_t charIndex = (currentNode->index - 1) / BIT_COUNT;
// FindKey is less than need char
if(charIndex >= findKey.size()){
prevNode = currentNode;
// Only '0'
currentNode = currentNode->left;
continue;
}
char currentChar = findKey[charIndex]; // If findkey.size less than currentNode->index
int offset = (BIT_COUNT - 1 - ((currentNode->index - 1) % BIT_COUNT));
bool currentBit = (currentChar >> offset) & 1;
// Remember prevNode
prevNode = currentNode;
// If '1' go right, '0' go left
currentBit ? currentNode = currentNode->right
: currentNode = currentNode->left;
}
return currentNode;
}
void Patricia::Insert(const std::string& key, const int& value, const size_t& index){
Node *currentNode = root->left, *prevNode = root;
while(currentNode->index > prevNode->index){
if(currentNode->index > index)
break;
size_t charIndex = (currentNode->index - 1) / BIT_COUNT;
// FindKey is less than need char
if(charIndex >= key.size()){
prevNode = currentNode;
// Only '0'
currentNode = currentNode->left;
continue;
}
char currentChar = key[charIndex]; // If findkey.size less than currentNode->index
int offset = (BIT_COUNT - 1 - ((currentNode->index - 1) % BIT_COUNT));
bool currentBit = (currentChar >> offset) & 1;
// Remember prevNode
prevNode = currentNode;
// If '1' go right, '0' go left
currentBit ? currentNode = currentNode->right
: currentNode = currentNode->left;
}
char getCharFromKey = key[(index - 1) / BIT_COUNT];
bool getBit = getCharFromKey >> (BIT_COUNT - 1 - (index - 1) % BIT_COUNT) & 1;
Node *newNode = new Node(key, value, index);
if(prevNode->left == currentNode)
prevNode->left = newNode;
else
prevNode->right = newNode;
getBit ? (newNode->right = newNode, newNode->left = currentNode)
: (newNode->left = newNode, newNode->right = currentNode);
}
void Patricia::ClearNode(Node *node){
if(node->left->index > node->index)
ClearNode(node->left);
if(node->right->index > node->index)
ClearNode(node->right);
delete node;
}