cheshirekow
v0.1.0
|
#include <mpblocks/kd2/BinaryKey.h>
Go to the source code of this file.
Namespaces | |
mpblocks | |
mpblocks::kd2 | |
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 | 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 in file findNearest.h.