11 #ifndef _JL_COVERTREE_POINT_H_
12 #define _JL_COVERTREE_POINT_H_
23 namespace tapkee_internal
71 v[v.
index++] = new_ele;
100 return stack[--stack.index];
110 template <
class RandomAccessIterator>
121 RandomAccessIterator
iter_;
125 template <
class Type,
class RandomAccessIterator,
class Callback>
130 template <
class RandomAccessIterator,
class Callback>
144 template <
class RandomAccessIterator,
class Callback>
156 template <
class RandomAccessIterator,
class Callback>
167 template <
class RandomAccessIterator>
ScalarType distance(Callback &cb, const CoverTreePoint< RandomAccessIterator > &l, const CoverTreePoint< RandomAccessIterator > &r, ScalarType upper_bound)
ScalarType operator()(Callback &cb, const CoverTreePoint< RandomAccessIterator > &l, const CoverTreePoint< RandomAccessIterator > &r, ScalarType)
ScalarType operator()(Callback &cb, const CoverTreePoint< RandomAccessIterator > &l, const CoverTreePoint< RandomAccessIterator > &r, ScalarType)
Class v_array taken directly from JL's implementation.
double ScalarType
default scalar value (can be overrided with TAPKEE_CUSTOM_INTERNAL_NUMTYPE define) ...
void alloc(v_array< T > &v, int length)
int IndexType
indexing type (non-overridable) set to int for compatibility with OpenMP 2.0
RandomAccessIterator iter_
void print(int depth, node< P > &top_node)
void push(v_array< T > &v, const T &new_ele)
T & operator[](IndexType i)
Class Point to use with John Langford's CoverTree. This class must have some associated functions def...
v_array< T > pop(v_array< v_array< T > > &stack)
CoverTreePoint(const RandomAccessIterator &iter, ScalarType norm)