#include <eckit/container/KDTree.h>

template<class Traits>

eckit::KDTreeMemory class

Base classes

template<class Traits>

class KDTreeX<TT<Traits, KDMemory>>

Derived classes

template<class Traits>

class atlas::interpolation::method::Point2KdTree

template<class Traits>

class atlas::interpolation::method::PointKdTree

struct SearchLonLat

Public types

using KDTree = KDTreeX<TT<Traits, KDMemory>>

using Value = KDTree::Value

using Point = KDTree::Point

using Payload = KDTree::Payload

using Node = KDNode<TT<Traits, KDMemory>>

using SPTreeType = SPTree<TT<Traits, KDMemory>, Node>

using Alloc = Traits::Alloc

using Ptr = Alloc::Ptr

using ID = Alloc::Ptr

using Metadata = SPMetadata<Traits>

using PointType = Point

using PayloadType = Payload

using NodeList = Node::NodeList

using NodeInfo = SPNodeInfo<Traits, NodeType>

using iterator = SPIterator<Traits, NodeType>

using value_type = std::pair<Point, Payload>

Constructors, destructors, conversion operators

KDTreeMemory()

Public functions

void build(ITER begin, ITER end)

void build(Container& c)

void insert(const Value& value)

void setMetadata(const Point& offset, const Point& scale)

auto nodeByID(ID id) -> NodeInfo

void getMetadata(Point& offset, Point& scale)

auto nearestNeighbour(const Point& p) -> NodeInfo

auto findInSphere(const Point& p, double radius) -> NodeList

auto kNearestNeighbours(const Point& p, size_t k) -> NodeList

auto nearestNeighbourBruteForce(const Point& p) -> NodeInfo

auto findInSphereBruteForce(const Point& p, double radius) -> NodeList

auto kNearestNeighboursBruteForce(const Point& p, size_t k) -> NodeList

template<class Visitor>

void visit(Visitor& v)

void statsReset()

void statsPrint(std::ostream& o, bool fancy) const

void print(std::ostream& o) const

auto begin() -> iterator

auto end() -> iterator

auto empty() const -> bool

auto size() const -> size_t

Public variables

Ptr root_

Metadata meta_

Typedef documentation

Function documentation

Variable documentation