range-tree/rtfc_eqkey.h at master · mocherson/range-tree · GitHub

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
/***************************************/
/* author: Chengsheng Mao	           */
/* version: 1.2	                       */
/***************************************/

#pragma once
#include<vector>
#include<deque>
#include "point.h"

class rtfc_eqkey
{
	// constructor
public:
	rtfc_eqkey(void);
	rtfc_eqkey(vector<size_t>& index);
	rtfc_eqkey(vector<Point>& indata);
	//destructor
public:
	~rtfc_eqkey(void);
	// member variable
public:
	size_t keypos;

	rtfc_eqkey* lchild;
	rtfc_eqkey* rchild;
	vector<size_t> lindex;   // data index in the left child data
	vector<size_t> rindex;   // data index in the righ child data
	vector<size_t> dataindex;   //the difference to rangetreeFC,  y order index
	vector<size_t> eqidx;  // index to the points that have equal begin value.

	static	vector<Point>  data;  //
								  // member function
public:
	//	void sortdata(int d);
	//	size_t getsize();
	bool buildtree();
	void rangequery(Point from, Point to, vector<Point>& result);
	rtfc_eqkey* find_split(Point& low, Point& high);
	void printtree();
	static void fcset(vector<size_t>& A1, vector<size_t>& A2, vector<size_t>& index, CompFun less);   // set the index for fractional cascading
	static void intervalquery(vector<Point>& data, Point from, Point to, size_t& lo, size_t& hi);  // interval query from the current node
	static size_t bsearch(Point& P, vector<size_t>& V);
	static void inserttoresult(rtfc_eqkey* datanode, size_t lo, Point& to, vector<Point>& result);
	bool isleaf();  //whether this node is a leaf node
	static void indextransfer(vector<size_t>& index, size_t low, size_t high, size_t& newlow, size_t& newhigh);
	unsigned long long size();
	//	vector<Point> indextodata(vector<size_t> index);

};