typedef.hpp
Go to the documentation of this file.
1 
14 #ifndef MLPACK_NEIGHBOR_SEARCH_TYPEDEF_H
15 #define MLPACK_NEIGHBOR_SEARCH_TYPEDEF_H
16 
17 // In case someone included this directly.
18 #include "neighbor_search.hpp"
19 
21 
24 
25 namespace mlpack {
26 namespace neighbor {
27 
33 
39 
47 template<template<typename TreeMetricType,
48  typename TreeStatType,
49  typename TreeMatType> class TreeType = tree::SPTree>
53  arma::mat,
54  TreeType,
57  arma::mat>::template DefeatistDualTreeTraverser,
59  NeighborSearchStat<NearestNeighborSort>,
60  arma::mat>::template DefeatistSingleTreeTraverser>;
61 
68 
69 } // namespace neighbor
70 } // namespace mlpack
71 
72 #endif
DefeatistKNN< tree::SPTree > SpillKNN
The SpillKNN class is the k-nearest-neighbors method considering defeatist search on SPTree...
Definition: typedef.hpp:67
Linear algebra utility functions, generally performed on matrices or vectors.
Extra data for each node in the tree.
The NeighborSearch class is a template class for performing distance-based neighbor searches...
A hybrid spill tree is a variant of binary space trees in which the children of a node can "spill ove...
Definition: spill_tree.hpp:73
NeighborSearch< NearestNeighborSort, metric::EuclideanDistance > KNN
The KNN class is the k-nearest-neighbors method.
Definition: typedef.hpp:32
LMetric< 2, true > EuclideanDistance
The Euclidean (L2) distance.
Definition: lmetric.hpp:112
NeighborSearch< FurthestNeighborSort, metric::EuclideanDistance > KFN
The KFN class is the k-furthest-neighbors method.
Definition: typedef.hpp:38