C++ class MinSG::Nodes::RTree
RTree

public

Inheritance Graph

graph BT
	RTree
	RTree --> ListNode
	click RTree "classMinSG_1_1RTree"
	click ListNode "classMinSG_1_1ListNode"

Description

Node which can be an internal or a leaf node of a R-tree.

Author: Benjamin Eikel

Date: 2010-05-03

See also: Antonin Guttman. R-trees: a dynamic index structure for spatial searching. In SIGMOD ’84: Proceedings of the 1984 ACM SIGMOD international conference on Management of data, pages 47–57, New York, NY, USA, 1984.

See also: http://doi.acm.org/10.1145/602259.602266

Public Functions

	RTree(uint16_t minEntries, uint16_t maxEntries)
void	doAddChild( Util::Reference < Node > child)
bool	doRemoveChild( Util::Reference < Node > child)
std::string	toString() const Return a string representation describing this node.

---

Documentation

function
MinSG::RTree::RTree

public

RTree(	uint16_t	minEntries,
	uint16_t	maxEntries
)

Create a new RTree node. The node is set to be a leaf node and the root node of a tree.

Parameters

minEntries

Minimum number of nodes in a node of the tree. This has to be at most half of the maximum number.

maxEntries

Maximum number of nodes in a node of the tree.

_{Defined in MinSG/Ext/RTree/RTree.h:42}

---

function
MinSG::RTree::doAddChild

public

virtual

void doAddChild(	Util::Reference < Node >	child )

Insert a new node into the tree.

Parameters

child

New node to add to the tree.

See also: Algorithm Insert

_{Defined in MinSG/Ext/RTree/RTree.h:50}

---

function
MinSG::RTree::doRemoveChild

public

virtual

bool doRemoveChild(	Util::Reference < Node >	child )

Remove a node from the tree.

Parameters

child

Node which should be searched and removed.

Returns

trueif child was removed andfalseif the child was not found in the tree.

See also: Algorithm Delete

_{Defined in MinSG/Ext/RTree/RTree.h:59}

---

function
MinSG::RTree::toString

public

const

std::string toString(	) const

Return a string representation describing this node.

_{Defined in MinSG/Ext/RTree/RTree.h:62}

---