-
Notifications
You must be signed in to change notification settings - Fork 0
/
tree.h
51 lines (35 loc) · 2.47 KB
/
tree.h
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
#ifndef __TREE_H_
#define __TREE_H_
#include<string>
#include "datatype.h"
//#include"buffer.h"
blockInfo *get_file_block(const std::string& database, const std::string& table_name, int fileType, int blockNum);
void writeRootBlock(const std::string& database, const std::string& table_name, blockInfo *block);
void deleteBlock(const std::string& database, const std::string& table_name, blockInfo *block);
blockInfo *get_new_block(const std::string& database, const std::string& table_name);
class Tree {
private:
int N; // number of pointers in each node
int StrLen;
int LeafLeast;
int InnodeLeast;
void setN(int n);
int search_leaf(const std::string& database, const std::string& table_name, const index_info& inform);
int findNextLeafSibling(const std::string& database, const std::string& table_name, int blocknum);
int findLeftMostSibling(const std::string& database, const std::string& table_name);
int findPrevLeafSibling(const std::string& database, const std::string& table_name, int blocknum);
int findParent(const std::string& database, const std::string& table_name, const index_info& inform, int blocknum);
int getoffset(const std::string& database, const std::string& table_name, const index_info& inform, int type, int blocknum);
void insert_divide(const std::string& database, const std::string& table_name, struct index_info& inform, int leaf1, int leaf2, char* leafpoint2);
void write(blockInfo *const node, const std::string& s);
void delete_entry(const std::string& database, const std::string& table_name, struct index_info& inform, int n, const std::string& K, int nod);
void insert_leaf(const std::string& database, const std::string& table_name, struct index_info& inform, int Node);
void insert_parent(const std::string& database, const std::string& table_name, struct index_info& inform, int Node, const std::string& K, int n);
public:
Tree();
int search_one(const std::string& database, const std::string& table_name, struct index_info& inform);
void search_many(const std::string& database, const std::string& table_name, int& start, int& end, int type, struct index_info& inform);
void insert_one(const std::string& database, const std::string& table_name, struct index_info& inform);
void delete_one(const std::string& database, const std::string& table_name, struct index_info& inform);
};
#endif