-
Notifications
You must be signed in to change notification settings - Fork 2
/
rbtree.cpp
491 lines (414 loc) · 11.1 KB
/
rbtree.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
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
#include<iostream>
#include<bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include<thread>
#include <fstream>
#include <string.h>
#include "rbtree.h"
using namespace std;
#define block_size 100
struct node {
string key;
int value;
int color;
struct node* parent;
struct node* right;
struct node* left;
};
struct llnode {
string key[block_size];
int value[block_size];
struct llnode* next;
} *llist, *ltemp, *lroot;
// global root for the entire tree
struct node* root = NULL;
// function to perform BST insertion of a node
struct node* bst(struct node* trav,
struct node* temp)
{
// If the tree is empty,
// return a new node
if (trav == NULL)
return temp;
// Otherwise recur down the tree
if (temp->key < trav->key)
{
trav->left = bst(trav->left, temp);
trav->left->parent = trav;
}
else if (temp->key > trav->key)
{
trav->right = bst(trav->right, temp);
trav->right->parent = trav;
}
// Return the (unchanged) node pointer
return trav;
}
// Function performing right rotation
// of the passed node
void rightrotate(struct node* temp)
{
struct node* left = temp->left;
temp->left = left->right;
if (temp->left)
temp->left->parent = temp;
left->parent = temp->parent;
if (!temp->parent)
root = left;
else if (temp == temp->parent->left)
temp->parent->left = left;
else
temp->parent->right = left;
left->right = temp;
temp->parent = left;
}
// Function performing left rotation
// of the passed node
void leftrotate(struct node* temp)
{
struct node* right = temp->right;
temp->right = right->left;
if (temp->right)
temp->right->parent = temp;
right->parent = temp->parent;
if (!temp->parent)
root = right;
else if (temp == temp->parent->left)
temp->parent->left = right;
else
temp->parent->right = right;
right->left = temp;
temp->parent = right;
}
// This function fixes violations
// caused by BST insertion
void fixup(struct node* root, struct node* pt)
{
struct node* parent_pt = NULL;
struct node* grand_parent_pt = NULL;
while ((pt != root) && (pt->color != 0)
&& (pt->parent->color == 1))
{
parent_pt = pt->parent;
grand_parent_pt = pt->parent->parent;
/* Case : A
Parent of pt is left child
of Grand-parent of
pt */
if (parent_pt == grand_parent_pt->left)
{
struct node* uncle_pt = grand_parent_pt->right;
/* Case : 1
The uncle of pt is also red
Only Recoloring required */
if (uncle_pt != NULL && uncle_pt->color == 1)
{
grand_parent_pt->color = 1;
parent_pt->color = 0;
uncle_pt->color = 0;
pt = grand_parent_pt;
}
else {
/* Case : 2
pt is right child of its parent
Left-rotation required */
if (pt == parent_pt->right) {
leftrotate(parent_pt);
pt = parent_pt;
parent_pt = pt->parent;
}
/* Case : 3
pt is left child of its parent
Right-rotation required */
rightrotate(grand_parent_pt);
int t = parent_pt->color;
parent_pt->color = grand_parent_pt->color;
grand_parent_pt->color = t;
pt = parent_pt;
}
}
/* Case : B
Parent of pt is right
child of Grand-parent of
pt */
else {
struct node* uncle_pt = grand_parent_pt->left;
/* Case : 1
The uncle of pt is also red
Only Recoloring required */
if ((uncle_pt != NULL) && (uncle_pt->color == 1))
{
grand_parent_pt->color = 1;
parent_pt->color = 0;
uncle_pt->color = 0;
pt = grand_parent_pt;
}
else {
/* Case : 2
pt is left child of its parent
Right-rotation required */
if (pt == parent_pt->left) {
rightrotate(parent_pt);
pt = parent_pt;
parent_pt = pt->parent;
}
/* Case : 3
pt is right child of its parent
Left-rotation required */
leftrotate(grand_parent_pt);
int t = parent_pt->color;
parent_pt->color = grand_parent_pt->color;
grand_parent_pt->color = t;
pt = parent_pt;
}
}
}
root->color = 0;
}
int counter = 0;
string arr_key[block_size];
int arr_val[block_size];
void inorder(struct node* trav)
{
if (trav == NULL)
return;
inorder(trav->left);
arr_key[counter] = trav->key;
arr_val[counter] = trav->value;
counter++;
//cout << trav->key << " " << trav->value << endl;
inorder(trav->right);
}
void free_inorder(struct node* trav)
{
if (trav == NULL)
return;
//cout<<"HEllo\n"<<endl;
inorder(trav->left);
//free(trav->left);
//cout << trav->key << " " << trav->value << endl;
inorder(trav->right);
free(trav);
//free(trav->right);
}
void insert_into_rbtree(string name, int val)
{
struct node* temp = (struct node*)malloc(sizeof(struct node));
temp->right = NULL;
temp->left = NULL;
temp->parent = NULL;
temp->key = name;
temp->value = val;
temp->color = 1;
// calling function that performs bst insertion of
// this newly created node
root = bst(root, temp);
// calling function to preserve properties of rb
// tree
fixup(root, temp);
}
int file_counter = 0;
bool flag = true;
//ofstream MyFileIndex("index.db");
int ParseCharToIntRB(const char c){
return int(c)-97;
}
void ssflush()
{
//cout << "g" << endl;
ofstream MyFileIndex("index.db");
while(1)
{
if(lroot->next != NULL)
{
int bloom[26];
for (int i = 0; i < 26; i++)
{
bloom[i]=-1;
}
string fileName = "table/ss_";
string fileNameIndex = "ss_";
fileName += to_string(file_counter);
fileName+= ".db";
fileNameIndex += to_string(file_counter);
MyFileIndex << fileNameIndex << " " << block_size << endl;
//cout << fileName << endl;
file_counter++;
ofstream MyFile(fileName);
// Bloom filter
for (int idx = 0; idx < block_size; idx++)
{
if(bloom[ParseCharToIntRB(lroot->key[idx][0])] == -1){
bloom[ParseCharToIntRB(lroot->key[idx][0])] = idx;
}
}
for (int i = 0; i < 26; i++)
{
MyFile<<bloom[i]<<" ";
}
MyFile<<"\n";
// Bloom filter ends
for(int i=0;i<block_size;i++)
{
MyFile << lroot->key[i] << " " << lroot->value[i] << " 0" << endl;
}
MyFile.close();
lroot = lroot->next;
flag = true;
}
else
{
flag = false;
}
//cout << "abc" << endl;
}
MyFileIndex.close();
/*
string fileName = "SS/ss_10_"+file_counter;
file_counter++;
ofstream MyFile(fileName);
for(int i=0;i<block_size;i++)
{
MyFile << arr_key[i] << " " << arr_val[i] << endl;
}
MyFile.close();
*/
}
int mainInsert()
{
time_t start, end;
time(&start);
//thread t1;
// detach t1 from main thread
// Create a text string, which is used to output the text file
string myText;
ifstream MyReadFile("TestCase.txt");
int ct = 0;
//Initialize linked list
llist = ltemp = lroot = NULL;
while (getline (MyReadFile, myText)) {
//cout << "e f" << endl;
// Output the text from the file
//cout << myText << endl;
string word = "";
string name = "";
for (auto x : myText)
{
if (x == ' ')
{
//cout << word << endl;
name = word;
word = "";
}
else {
word = word + x;
}
}
insert_into_rbtree(name,stoi(word));
ct++;
if(ct == block_size)
{
inorder(root);
if(llist == NULL)
{
ltemp = (struct llnode*)malloc(sizeof(struct llnode));
//memcpy(ltemp->key, , block_size);
for(int i=0;i<block_size;i++)
{
ltemp->key[i] = arr_key[i];
//cout<<arr_key[i]<<endl;
ltemp->value[i] = arr_val[i];
}
ltemp->next = NULL;
llist = ltemp;
lroot = ltemp;
//cout << "d" << endl;
//free_inorder(root);
//delete root;
counter = 0;
root = NULL;
ct = 0;
//async(launch::async, ssflush);
thread t1(ssflush);
t1.detach();
}
else
{
ltemp = (struct llnode*)malloc(sizeof(struct llnode));
for(int i=0;i<block_size;i++)
{
//ltemp->key[i] = arr_key[i];
ltemp->key[i] = arr_key[i];
//cout<<arr_key[i]<<endl;
ltemp->value[i] = arr_val[i];
}
ltemp->next = NULL;
llist->next = ltemp;
llist = ltemp;
//cout << "c" << endl;
//delete root;
//free_inorder(root);
root = NULL;
ct = 0;
counter = 0;
//cout << lroot << " " << lroot -> next << endl;
}
}
}
time(&end);
double time_taken = double(end - start);
cout << "Time taken by program is : " << fixed
<< time_taken << setprecision(5);
cout << " sec " << endl;
while(flag);
ofstream MyFileIndex("index.db", ios::out | ios::app);
string fileName = "table/ss_";
string fileNameIndex = "ss_";
fileName += to_string(file_counter);
fileName+= ".db";
fileNameIndex += to_string(file_counter);
MyFileIndex << fileNameIndex << " " << block_size << endl;
//cout << fileName << endl;
file_counter++;
ofstream MyFile(fileName);
// Bloom filter
int bloom[26];
for (int i = 0; i < 26; i++)
{
bloom[i]=-1;
}
int idx = 0;
for (int i = 0; i < block_size; i++)
{
if(bloom[ParseCharToIntRB(lroot->key[i][0])] == -1){
bloom[ParseCharToIntRB(lroot->key[i][0])] = i;
}
// MyFile<< bloom[idx] <<" ";
}
for (int i = 0; i < 26; i++)
{
MyFile<<bloom[i]<<" ";
}
MyFile<<"\n";
// Bloom filter ends
for(int i=0;i<block_size;i++)
{
MyFile << lroot->key[i] << " " << lroot->value[i] << " 0" << endl;
}
MyFile.close();
//lroot = lroot->next;
//Write last ss table
// Close the file
MyReadFile.close();
/*
printf("Inorder Traversal of Created Tree\n");
inorder(root);
for(int i=0;i<block_size;i++)
{
cout << arr_key[i] << " " << arr_val[i] << endl;
}
*/
MyFileIndex.close();
return 0;
}