mpblocks::kd2 Namespace Reference

Enumerations
enum	BinaryKey { MIN = 0, MAX = 1 }

Functions
template<class Point , class SearchQueue , class ResultSet , class QueueMinKeyFn , class QueuePopMinFn , class QueueInsertFn , class QueueSizeFn , class SetMaxKeyFn , class SetPopMaxFn , class SetInsertFn , class SetSizeFn , class PointDistanceFn , class CellDistanceFn , class IsLeafFn , class ChildrenFn , class SitesFn , class CellFn , class NodeFn >
void	findNearest (const Point &query, int k, SearchQueue &q, ResultSet &r, const QueueMinKeyFn &minKey, const QueuePopMinFn &popMin, const QueueInsertFn &enqueue, const QueueSizeFn &queueSize, const SetMaxKeyFn &maxKey, const SetPopMaxFn &popMax, const SetInsertFn &insert, const SetSizeFn &size, const PointDistanceFn &pointDist, const CellDistanceFn &cellDist, const IsLeafFn &isLeaf, const ChildrenFn &children, const SitesFn &sites, const CellFn &getCell, const NodeFn &getNode)
template<class NodeRef , class PointRef , class IsLeafFn , class LeafInsertFn , class IdxFn , class ValueFn , class ChildFn , class PointGetFn >
void	insert (NodeRef node, PointRef point, const IsLeafFn &isLeaf, const LeafInsertFn &leafInsert, const IdxFn &idx, const ValueFn &value, const ChildFn &child, const PointGetFn &pointGet)
template<class HyperRect , class NodeRef , class PointRef , class IsLeafFn , class LeafInsertFn , class IdxFn , class ValueFn , class ChildFn , class PointGetFn , class HyperSetFn >
void	insert (HyperRect &cell, NodeRef node, PointRef point, const IsLeafFn &isLeaf, const LeafInsertFn &leafInsert, const IdxFn &idx, const ValueFn &value, const ChildFn &child, const PointGetFn &pointGet, const HyperSetFn &hyperSet)
BinaryKey	other (const BinaryKey &key)

Enumeration Type Documentation

enum mpblocks::kd2::BinaryKey

Enumerator
MIN
MAX

Definition at line 38 of file BinaryKey.h.

Function Documentation

template<class Point , class SearchQueue , class ResultSet , class QueueMinKeyFn , class QueuePopMinFn , class QueueInsertFn , class QueueSizeFn , class SetMaxKeyFn , class SetPopMaxFn , class SetInsertFn , class SetSizeFn , class PointDistanceFn , class CellDistanceFn , class IsLeafFn , class ChildrenFn , class SitesFn , class CellFn , class NodeFn >

void mpblocks::kd2::findNearest	(	const Point &	query,
		int	k,
		SearchQueue &	q,
		ResultSet &	r,
		const QueueMinKeyFn &	minKey,
		const QueuePopMinFn &	popMin,
		const QueueInsertFn &	enqueue,
		const QueueSizeFn &	queueSize,
		const SetMaxKeyFn &	maxKey,
		const SetPopMaxFn &	popMax,
		const SetInsertFn &	insert,
		const SetSizeFn &	size,
		const PointDistanceFn &	pointDist,
		const CellDistanceFn &	cellDist,
		const IsLeafFn &	isLeaf,
		const ChildrenFn &	children,
		const SitesFn &	sites,
		const CellFn &	getCell,
		const NodeFn &	getNode
	)

Definition at line 62 of file findNearest.h.

template<class NodeRef , class PointRef , class IsLeafFn , class LeafInsertFn , class IdxFn , class ValueFn , class ChildFn , class PointGetFn >

void mpblocks::kd2::insert	(	NodeRef	node,
		PointRef	point,
		const IsLeafFn &	isLeaf,
		const LeafInsertFn &	leafInsert,
		const IdxFn &	idx,
		const ValueFn &	value,
		const ChildFn &	child,
		const PointGetFn &	pointGet
	)

Parameters

node	the current node
point	the point to be inserted
isLeaf	returns true if node is a leaf
leafInsert	inserts point into a leaf node's store
idx	returns the split index of a node
value	returns the split value of a node
child	returns the children of a node
pointGet	returns the i'th value of a point

Definition at line 46 of file insert.h.

template<class HyperRect , class NodeRef , class PointRef , class IsLeafFn , class LeafInsertFn , class IdxFn , class ValueFn , class ChildFn , class PointGetFn , class HyperSetFn >

void mpblocks::kd2::insert	(	HyperRect &	cell,
		NodeRef	node,
		PointRef	point,
		const IsLeafFn &	isLeaf,
		const LeafInsertFn &	leafInsert,
		const IdxFn &	idx,
		const ValueFn &	value,
		const ChildFn &	child,
		const PointGetFn &	pointGet,
		const HyperSetFn &	hyperSet
	)

Parameters

cell	hyper rectangle of node
node	the current node
point	the point to be inserted
isLeaf	returns true if node is a leaf
leafInsert	inserts point into a leaf node's store
idx	returns the split index of a node
value	returns the split value of a node
child	returns the children of a node
pointGet	returns the i'th value of a point

Definition at line 83 of file insert.h.

BinaryKey mpblocks::kd2::other ( const BinaryKey &  key )

inline

Definition at line 44 of file BinaryKey.h.