-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathClassInvertedIndex.cpp
More file actions
180 lines (157 loc) · 3.38 KB
/
Copy pathClassInvertedIndex.cpp
File metadata and controls
180 lines (157 loc) · 3.38 KB
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
#include "ClassInvertedIndex.h"
#include <iostream>
#include <fstream>
#include <cstring>
#include<cstdlib>
using namespace std;
ifstream f;
ClassInvertedIndex::ClassInvertedIndex()
{
myAvl = new Avl;
fi=NULL;
}
ClassInvertedIndex::ClassInvertedIndex(char *name)
{
fi=name;
myAvl = new Avl;
f.open(fi);
}
void ClassInvertedIndex::commands_file()
{
if (f.is_open())
{
while (!f.eof())
{
switch (cmdtype())
{
case 1:
{
is_read();
break;
}
case 2:
{
is_write();
break;
}
case 3:
{
is_insert();
break;
}
case 4:
{
is_delete();
break;
}
case 0:
{
cout<<"False Command in Commands.txt\n";
continue;
}
}
}
}
f.close();
}
int ClassInvertedIndex::cmdtype()
{
char B[100];
f.clear();
f>>B;
if (!strcmp(B,"READ_DATA"))
return 1;
else
{
if (!strcmp(B,"WRITE_INDEX"))
return 2;
else
{
if (!strcmp(B,"INSERT_LINK"))
return 3;
else
{
if (!strcmp(B,"DELETE_LINK"))
return 4;
else
return 0;
}
}
}
}
void ClassInvertedIndex::is_read()
{
node *result=NULL;//pointer to num
int num=-1;//the previus number which we add to the avl
char s[100];
f.clear();
f>>s;
ifstream fl;
fl.open(s);
int l1,l2;
cout<<"please wait until the file load\n";
while(!fl.eof())
{
fl>>l1>>l2;
if(num!=l1)//chech if the previus number is same with the number which we try to add now
{
result = myAvl->search(l1);//if the numbers arent the same then update
num=l1;
}
if (result == NULL)
{
myAvl->insert(l1);
result = myAvl->search(l1);
}
if (result->subAvl == NULL)
{
result->subAvl = new Avl;
}
if (result->subAvl->search(l2) == NULL)
result->subAvl->insert(l2);
}
cout<<"file loaded\n";
}
void ClassInvertedIndex::is_write()
{
char s[100];
f>>s;
myAvl->inorder(myAvl->root,s);
myAvl->closeEverything();
f.close();
exit(1);
}
void ClassInvertedIndex::is_insert()
{
node* result;
int a1,a2;
f.clear();
f>>a1>>a2;
result = myAvl->search(a1);
if (result == NULL)
{
myAvl->insert(a1);
result = myAvl->search(a1);
}
if (result->subAvl == NULL)
result->subAvl = new Avl;
if (result->subAvl->search(a2) == NULL)
result->subAvl->insert(a2);
}
void ClassInvertedIndex::is_delete()
{
int a1,a2;
f.clear();
f>>a1>>a2;
node *tmp;
tmp=myAvl->search(a1);
if(tmp!=NULL)
{
tmp->subAvl->remove(a2);
if(tmp->subAvl->root==NULL)
{
delete tmp->subAvl;
myAvl->remove(a1);
}
}
}