-
Notifications
You must be signed in to change notification settings - Fork 1
/
indexManager.cpp
77 lines (64 loc) · 1.91 KB
/
indexManager.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
#include "indexManager.h"
IndexManager::IndexManager(buffer& bm){
bufferMax = 200;
bfm = &bm;
}
IndexManager::IndexManager(buffer& bm, int max){
bufferMax = max;
if(bufferMax<1)
bufferMax = 1;
bfm = &bm;
}
void IndexManager::setBufferSize(int max){
bufferMax = max;
if(bufferMax<1)
bufferMax = 1;
}
std::vector<unsigned int> IndexManager::find(string indexName,Index ind){
bTree t = findTree(indexName);
return t.findAll(ind);
}
std::vector<unsigned int> IndexManager::findGreater(string indexName,Index ind,bool equal){
bTree t = findTree(indexName);
return t.findGreater(ind,equal);
}
std::vector<unsigned int> IndexManager::findLess(string indexName,Index ind,bool equal){
bTree t = findTree(indexName);
return t.findLess(ind,equal);
}
void IndexManager::insert(string indexName,Index ind){
bTree t = findTree(indexName);
t.insertIndex(ind);
}
void IndexManager::del(string indexName,Index ind){
bTree t = findTree(indexName);
t.deleteIndex(ind);
}
void IndexManager::create(string indexName, indexType it, int length){
bTreeBuffer.push_back(bTree(indexName, it, length, bfm));
if(bTreeBuffer.size()>bufferMax)
bTreeBuffer.erase(bTreeBuffer.begin());
}
void IndexManager::drop(string indexName){
bfm->deleteFile(indexName);
}
bTree& IndexManager::findTree(string indexName){
std::vector<bTree>::iterator iter;
for (iter = bTreeBuffer.begin(); iter < bTreeBuffer.end(); ++iter)
{
if(iter->getName()==indexName)
return *iter;
}
bTreeBuffer.push_back(bTree(indexName,bfm,type,charLength));
if(bTreeBuffer.size()>bufferMax)
bTreeBuffer.erase(bTreeBuffer.begin());
return bTreeBuffer.back();
}
void IndexManager::setIndex(indexType it, int length){
type = it;
charLength = length;
}
void IndexManager::print(string name){
bTree t = findTree(name);
t.printTree();
}