-
Notifications
You must be signed in to change notification settings - Fork 1
/
node.h
40 lines (30 loc) · 1.09 KB
/
node.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
#ifndef NODE_H
#define NODE_H
#include <iostream>
#include "Buffer_Manager.h"
#include "keytype.h"
#include "indexhead.h"
using namespace std;
struct Node{
int blockNum; //块编号
bool leafNode; //是否是叶节点
int fanout; //扇出
int numOfKeys; //已有key的数量
KeyType* key; //key数组
int* pointer; //非叶节点pointer数组
int* index; //叶节点pointer数组
int next; //叶节点最后一位pointer
Buffer_Manager* buffer;
Node(int fanout, bool leafNode, Buffer_Manager* buffer);
~Node();
int FindPointer(KeyType V); //非叶节点中查找V的位置
int FindIndex(KeyType V); //叶节点中查找V的位置
int FindPosition(KeyType V); //找到V应该插入位置
void InsertInLeaf(KeyType V, int P); //叶节点插入新key
void InsertInNoLeaf(KeyType V, int N); //非叶节点插入新key
void Delete(KeyType K); //删除叶节点中的索引
void WriteNodeToBlock(string dbName, string fileName, IndexHead* head, int blockNum);
void ReadNodeFromBlock(string dbName, string fileName, IndexHead* head, int blockNum);
void ClearBlock(string dbName, string fileName, IndexHead* head, int blockNum);
};
#endif