mlpack  master
ra_typedef.hpp
Go to the documentation of this file.
1 
13 #ifndef MLPACK_RANN_RA_TYPEDEF_HPP
14 #define MLPACK_RANN_RA_TYPEDEF_HPP
15 
16 // In case someone included this directly.
17 #include "ra_search.hpp"
18 
19 #include <mlpack/core/metrics/lmetric.hpp>
20 
21 #include <mlpack/methods/neighbor_search/sort_policies/nearest_neighbor_sort.hpp>
22 #include <mlpack/methods/neighbor_search/sort_policies/furthest_neighbor_sort.hpp>
23 
24 namespace mlpack {
25 namespace neighbor {
26 
36 typedef RASearch<> KRANN;
37 
47 typedef RASearch<FurthestNeighborSort> KRAFN;
48 
61 typedef RASearch<> AllkRANN;
62 
76 typedef RASearch<> AllkRAFN;
77 
78 } // namespace neighbor
79 } // namespace mlpack
80 
81 #endif
ra_search.hpp
mlpack::neighbor::KRANN
RASearch KRANN
The KRANN class is the k-rank-approximate-nearest-neighbors method.
Definition: ra_typedef.hpp:36
mlpack::neighbor::AllkRANN
RASearch AllkRANN
Definition: ra_typedef.hpp:61
mlpack
Linear algebra utility functions, generally performed on matrices or vectors.
Definition: binarize.hpp:18
mlpack::neighbor::AllkRAFN
RASearch AllkRAFN
Definition: ra_typedef.hpp:76
mlpack::neighbor::KRAFN
RASearch< FurthestNeighborSort > KRAFN
The KRAFN class is the k-rank-approximate-farthest-neighbors method.
Definition: ra_typedef.hpp:47
nearest_neighbor_sort.hpp
mlpack::neighbor::RASearch
The RASearch class: This class provides a generic manner to perform rank-approximate search via rando...
Definition: ra_search.hpp:71
furthest_neighbor_sort.hpp
Generated by   doxygen 1.8.11