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
|
// Spatial Index Library
//
// Copyright (C) 2002 Navel Ltd.
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License as published by the Free Software Foundation; either
// version 2.1 of the License, or (at your option) any later version.
//
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
//
// Email:
// mhadji@gmail.com
#pragma once
namespace SpatialIndex
{
namespace MVRTree
{
class Index : public Node
{
public:
virtual ~Index();
private:
Index(MVRTree* pTree, id_type id, uint32_t level);
virtual NodePtr chooseSubtree(const TimeRegion& mbr, uint32_t level, std::stack<id_type>& pathBuffer);
virtual NodePtr findLeaf(const TimeRegion& mbr, id_type id, std::stack<id_type>& pathBuffer);
virtual void split(
uint32_t dataLength, byte* pData, TimeRegion& mbr, id_type id, NodePtr& left, NodePtr& right,
TimeRegion& mbr2, id_type id2, bool bInsertMbr2 = false);
uint32_t findLeastEnlargement(const TimeRegion&) const;
uint32_t findLeastOverlap(const TimeRegion&) const;
void adjustTree(Node*, std::stack<id_type>&);
void adjustTree(Node* n, Node* nn, std::stack<id_type>& pathBuffer);
class OverlapEntry
{
public:
uint32_t m_index;
double m_enlargement;
TimeRegionPtr m_original;
TimeRegionPtr m_combined;
double m_oa;
double m_ca;
static int compareEntries(const void* pv1, const void* pv2)
{
OverlapEntry* pe1 = * (OverlapEntry**) pv1;
OverlapEntry* pe2 = * (OverlapEntry**) pv2;
if (pe1->m_enlargement < pe2->m_enlargement) return -1;
if (pe1->m_enlargement > pe2->m_enlargement) return 1;
return 0;
}
}; // OverlapEntry
friend class MVRTree;
friend class Node;
}; // Index
}
}
|
GitWeb
