-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathAPI.cpp
428 lines (414 loc) · 12.8 KB
/
API.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
#include<iostream>
#include<string>
#include<time.h>
#include"buffer.h"
#include"catalog.h"
#include"common.h"
#include"Interpreter.h"
#include"Recorder Manger.h"
#include"IndexManager.h"
using namespace std;
catalog cata;
Interpreter parsetree;
RecorderManager recorder;
IndexManager indexM;
buffer Buffer;
Index checkifindex(Conditiondata checkC, vector<Index> chechI, int &num) {
int i, j;
Index tempindex;
for (i = 0; i < checkC.conds.size(); i++) {
for (j = 0; j < chechI.size(); j++) {
if (checkC.conds[i].column_name.compare(chechI[j].attribute_name) == 0)
break;
}
if (j != chechI.size())
break;
}
if (i == checkC.conds.size())
return tempindex;
num = i;
return chechI[j];
}
Data DoSelect(Conditiondata &conditions){
Index indexinfor;
Data results;
IndexColumn indexdata;
IndexColumn tempinddata;
vector<Index> whatindex;
Row temprow;
int i = 0;
int num, breakflag = 0;
whatindex.clear();
whatindex = cata.check_index(parsetree.tableInfo);
indexinfor.columnLength = 0;
indexinfor = checkifindex(conditions, whatindex, num);//conditionÐèÒªÊÇÒýÓÃ
temprow.isDelete = 0;
if (indexinfor.type == INT)
indexinfor.columnLength = 4;
if (indexinfor.columnLength != 0) {
switch (conditions.conds[num].op) {
case Lt:
case Gt:
case LtLt:
indexdata.rows.clear();
indexdata = indexM.selectBetween(indexinfor, conditions.conds[num].minValue, conditions.conds[num].maxValue);
results.rows.clear();
if (indexdata.rows[0].key == ""){
temprow.isDelete = 2;
results.rows.push_back(temprow);
}
else
results = recorder.SelectIndex(parsetree.tableInfo, indexdata, conditions);
break;
case Le:
case Ge:
case LtLe:
indexdata.rows.clear();
indexdata = indexM.selectBetween(indexinfor, conditions.conds[num].minValue, conditions.conds[num].maxValue);
tempinddata = indexM.selectEqual(indexinfor, conditions.conds[num].eqValue);
for (int i = 0; i < tempinddata.rows.size(); i++)
indexdata.rows.push_back(tempinddata.rows[i]);
results.rows.clear();
if (indexdata.rows[0].key == ""){
temprow.isDelete = 2;
results.rows.push_back(temprow);
}
else
results = recorder.SelectIndex(parsetree.tableInfo, indexdata, conditions);
break;
case LeLt:
indexdata.rows.clear();
indexdata = indexM.selectBetween(indexinfor, conditions.conds[num].minValue, conditions.conds[num].maxValue);
tempinddata = indexM.selectEqual(indexinfor, conditions.conds[num].eqValue2);
for (int i = 0; i < tempinddata.rows.size(); i++)
indexdata.rows.push_back(tempinddata.rows[i]);
results.rows.clear();
if (indexdata.rows[0].key == ""){
temprow.isDelete = 2;
results.rows.push_back(temprow);
}
else
results = recorder.SelectIndex(parsetree.tableInfo, indexdata, conditions);
break;
case LeLe:
indexdata.rows.clear();
indexdata = indexM.selectBetween(indexinfor, conditions.conds[num].minValue, conditions.conds[num].maxValue);
tempinddata = indexM.selectEqual(indexinfor, conditions.conds[num].eqValue);
for (int i = 0; i < tempinddata.rows.size(); i++)
indexdata.rows.push_back(tempinddata.rows[i]);
tempinddata.rows.clear();
tempinddata = indexM.selectEqual(indexinfor, conditions.conds[num].eqValue);
for (int i = 0; i < tempinddata.rows.size(); i++)
indexdata.rows.push_back(tempinddata.rows[i]);
results.rows.clear();
if (indexdata.rows[0].key == ""){
temprow.isDelete = 2;
results.rows.push_back(temprow);
}
else
results = recorder.SelectIndex(parsetree.tableInfo, indexdata, conditions);;
break;
case Eq:
indexdata.rows.clear();
indexdata = indexM.selectEqual(indexinfor, conditions.conds[0].eqValue);
results.rows.clear();
if (indexdata.rows[0].key == ""){
temprow.isDelete = 2;
results.rows.push_back(temprow);
}
else
results = recorder.SelectIndex(parsetree.tableInfo, indexdata, conditions);
break;
case Ne:
results.rows.clear();
results = recorder.SelectNoIndex(parsetree.tableInfo, conditions);
break;
}
}
else {
results.rows.clear();
results = recorder.SelectNoIndex(parsetree.tableInfo, conditions);
}
return results;
}
void AddSeperator(char *command)
{
unsigned len = strlen(command);
command[len] = ' ';
command[len + 1] = '\0';
}
short int IsComEnd(char *input)
{
unsigned int next = strlen(input) - 1;
char prev = ' ';
while (next >= 0 && (prev == '\t' || prev == ' '))
{
prev = input[next];
next--;
}
if (prev == ';')
{
input[next + 1] = '\0';
return 1;
}
return 0;
}
void Print(const Table &tableInfo, const Data &results)
{
if (results.rows[0].isDelete == 2)
cout << "Not Found!" << endl;
else{
cout << tableInfo.attributes[0].name << "\t\t";
for (int i = 1; i < tableInfo.attributes.size(); i++)
cout << tableInfo.attributes[i].name << "\t";
cout << endl;
for (int i = 0; i < results.rows.size(); i++){
for (int j = 0; j < results.rows[i].columns.size(); j++){
cout << results.rows[i].columns[j] << "\t";
}
cout << endl;
}
}
}
int count1 = 0;
int main()
{
Conditiondata conditions;
Table tableinfor;
Attribute tempattri;
Index indexinfor;
Row insertvalue;
Row temprow;
Data datas;
Data results;
string column;
Table tableinf;
IndexColumn indexdata;
IndexColumn tempinddata;
vector<Index> whatindex;
int i = 0;
int count = 0;
int num, breakflag = 0;
char command[COMLEN] = "";
char input[INPUTLEN] = "";
char word[WORDLEN] = "";
short int ComEnd = 0;
time_t t;
tm *lt;
t = time(NULL);
lt = localtime(&t);
cout << "****************************************************************" << endl;
cout << "Welcome to MiniSQL!" << endl;
cout << lt->tm_year + 1900 << "-" << lt->tm_mon + 1 << "-" << lt->tm_mday << " " << lt->tm_hour << ":" << lt->tm_min << ":" << lt->tm_sec << endl;
cout << "****************************************************************" << endl;
while (1){
clock_t start1,end1;
count1++;
cout << "->";
strcpy(command, "");
ComEnd = 0;
while (!ComEnd)
{
cin.getline(input, 200);
if (IsComEnd(input))
ComEnd = 1;
strcat(command, input);
AddSeperator(command);
}
parsetree.MakeInitial();
parsetree.Parse(command);
if (parsetree.error_info != UNKNOW){
parsetree.error_info = UNKNOW;
continue;
}
switch (parsetree.operation_type) {
case SEL_NOWHERE:
results = recorder.SelectNoIndex(parsetree.tableInfo, parsetree.conditions);
Print(parsetree.tableInfo, results);
break;
case SEL_WHERE:
start1 = clock();
results.rows.clear();
results = DoSelect(parsetree.conditions);
Print(parsetree.tableInfo, results);
end1 = clock();
//cout << (double)(start1 - end1) / CLOCKS_PER_SEC<<endl;
break;
case CRETAB:
cata.CreateTable_catalog(parsetree.tableInfo);
cata.CreateIndex_catalog(parsetree.indexInfo);
tableinf = parsetree.tableInfo;
tableinf.name = tableinf.name.insert(0, "z", 1);
cata.CreateTable_catalog(tableinf);
break;
case CREIND:
cata.CreateIndex_catalog(parsetree.indexInfo);
parsetree.tableInfo = cata.get_table_info(parsetree.tableInfo);
indexdata = recorder.CreateIndexData(parsetree.tableInfo, parsetree.indexInfo);
whatindex = cata.check_index(parsetree.tableInfo);
for (i = 0; i < whatindex.size(); i++) {
if (whatindex[i].index_name.compare(parsetree.indexInfo.index_name) == 0)
break;
}
if (whatindex[i].type == INT)
whatindex[i].columnLength = 4;
indexM.createIndex(whatindex[i], indexdata);
break;
case DRPTAB:
cata.DropTable_catalog(parsetree.tableInfo);
tableinf = parsetree.tableInfo;
tableinf.name = tableinf.name.insert(0, "z", 1);
cata.DropTable_catalog(tableinf);
break;
case DRPIND:
cata.Dropindex_catalog(parsetree.indexInfo);
break;
case DELETE:
whatindex.clear();
whatindex = cata.check_index(parsetree.tableInfo);
indexinfor.columnLength = 0;
indexinfor = checkifindex(parsetree.conditions, whatindex, num);//conditionÐèÒªÊÇÒýÓÃ
temprow.isDelete = 0;
if (indexinfor.type == INT)
indexinfor.columnLength = 4;
conditions = parsetree.conditions;
if (indexinfor.columnLength != 0) {
switch (conditions.conds[num].op) {
case Lt:
case Gt:
case LtLt:
indexdata.rows.clear();
indexdata = indexM.selectBetween(indexinfor, conditions.conds[num].minValue, conditions.conds[num].maxValue);
if (indexdata.rows[0].key == ""){
temprow.isDelete = 2;
results.rows.push_back(temprow);
}
else
results = recorder.SelectIndex(parsetree.tableInfo, indexdata, conditions);
break;
case Le:
case Ge:
case LtLe:
indexdata.rows.clear();
indexdata = indexM.selectBetween(indexinfor, conditions.conds[num].minValue, conditions.conds[num].maxValue);
tempinddata = indexM.selectEqual(indexinfor, conditions.conds[num].eqValue);
for (int i = 0; i < tempinddata.rows.size(); i++)
indexdata.rows.push_back(tempinddata.rows[i]);
results.rows.clear();
if (indexdata.rows[0].key == ""){
temprow.isDelete = 2;
results.rows.push_back(temprow);
}
else
results = recorder.SelectIndex(parsetree.tableInfo, indexdata, conditions);
break;
case LeLt:
indexdata.rows.clear();
indexdata = indexM.selectBetween(indexinfor, conditions.conds[num].minValue, conditions.conds[num].maxValue);
tempinddata = indexM.selectEqual(indexinfor, conditions.conds[num].eqValue2);
for (int i = 0; i < tempinddata.rows.size(); i++)
indexdata.rows.push_back(tempinddata.rows[i]);
results.rows.clear();
if (indexdata.rows[0].key == ""){
temprow.isDelete = 2;
results.rows.push_back(temprow);
}
else
results = recorder.SelectIndex(parsetree.tableInfo, indexdata, conditions);
break;
case LeLe:
indexdata.rows.clear();
indexdata = indexM.selectBetween(indexinfor, conditions.conds[num].minValue, conditions.conds[num].maxValue);
tempinddata = indexM.selectEqual(indexinfor, conditions.conds[num].eqValue);
for (int i = 0; i < tempinddata.rows.size(); i++)
indexdata.rows.push_back(tempinddata.rows[i]);
tempinddata.rows.clear();
tempinddata = indexM.selectEqual(indexinfor, conditions.conds[num].eqValue);
for (int i = 0; i < tempinddata.rows.size(); i++)
indexdata.rows.push_back(tempinddata.rows[i]);
results.rows.clear();
if (indexdata.rows[0].key == ""){
temprow.isDelete = 2;
results.rows.push_back(temprow);
}
else
results = recorder.SelectIndex(parsetree.tableInfo, indexdata, conditions);
break;
case Eq:
indexdata.rows.clear();
indexdata = indexM.selectEqual(indexinfor, conditions.conds[0].eqValue);
results.rows.clear();
if (indexdata.rows[0].key == ""){
temprow.isDelete = 2;
results.rows.push_back(temprow);
}
else
results = recorder.SelectIndex(parsetree.tableInfo, indexdata, conditions);
break;
case Ne:
results.rows.clear();
results = recorder.SelectNoIndex(parsetree.tableInfo, conditions);
break;
}
if (conditions.conds[num].op != Ne) {
results.rows.clear();
results = recorder.DeleteIndex(parsetree.tableInfo, indexdata, conditions);
}
}
if (indexinfor.columnLength == 0||conditions.conds[num].op == Ne) {
results.rows.clear();
results = recorder.DeleteNoIndex(parsetree.tableInfo, conditions);
}
indexdata.rows.clear();
tempinddata.rows.clear();
whatindex = cata.check_index(parsetree.tableInfo);
for (int i = 0; i < whatindex.size(); i++) {
if (whatindex[i].type == INT)
whatindex[i].columnLength = 4;
indexdata = recorder.GetIndexData(parsetree.tableInfo, whatindex[i], results);
//indexM.deleteValue(whatindex[i], indexdata);
}
tableinf = parsetree.tableInfo;
tableinf.name = tableinf.name.insert(0, "z", 1);
recorder.InsertDelValue(tableinf, results);
break;
case INSERT:
if (count >= 10000){
for (int i = 0; i < parsetree.Uniqueconditions.conds.size(); i++){
results.rows.clear();
conditions.conds.clear();
conditions.conds.push_back(parsetree.Uniqueconditions.conds[i]);
results = DoSelect(conditions);
if (results.rows[0].isDelete != 2){
if (i == 0)
cout << "Primary Key exists!" << endl;
else
cout << "Unique attribute error!" << endl;
break;
}
}
}
if (count<10000 || results.rows[0].isDelete == 2){
datas = recorder.InsertValue(parsetree.tableInfo, parsetree.value);
whatindex = cata.check_index(parsetree.tableInfo);
while (whatindex.size() > 0) {
indexdata.rows.clear();
indexdata = recorder.GetIndexData(parsetree.tableInfo, whatindex[whatindex.size() - 1], datas);
if (whatindex[whatindex.size() - 1].type == INT)
whatindex[whatindex.size() - 1].columnLength = 4;
indexM.index_insertValue(whatindex[whatindex.size() - 1], indexdata);
whatindex.pop_back();
}
count++;
}
break;
case QUIT:
breakflag = 1;
break;
}
if (breakflag)
break;
}
//getchar();
return 0;
}