HMLP: High-performance Machine Learning Primitives
|
Data and setup that are shared with all nodes. More...
#include <tree.hpp>
Public Types | |
typedef DATATYPE | T |
Public Member Functions | |
vector< size_t > | ContainAny (vector< size_t > &queries, size_t target) |
Check if this node contain any query using morton. Notice that queries[] contains gids; thus, morton[] needs to be accessed using gids. More... | |
Public Attributes | |
size_t | m = 0 |
size_t | max_depth = 15 |
Data< pair< T, size_t > > * | NN = NULL |
vector< size_t > | morton |
SPLITTER | splitter |
Data and setup that are shared with all nodes.
end class Node
|
inline |
Check if this node contain any query using morton. Notice that queries[] contains gids; thus, morton[] needs to be accessed using gids.
notice that setup->morton only contains local morton ids
size_t hmlp::tree::Setup< SPLITTER, DATATYPE >::m = 0 |
maximum leaf node size
size_t hmlp::tree::Setup< SPLITTER, DATATYPE >::max_depth = 15 |
by default we use 4 bits = 0-15 levels
vector<size_t> hmlp::tree::Setup< SPLITTER, DATATYPE >::morton |
MortonIDs of all indices.
Data<pair<T, size_t> >* hmlp::tree::Setup< SPLITTER, DATATYPE >::NN = NULL |
Coordinates (accessed with gids) neighbors<distance, gid> (accessed with gids)
SPLITTER hmlp::tree::Setup< SPLITTER, DATATYPE >::splitter |
Tree splitter