rtflann::L1< T > Struct Template Reference

#include <dist.h>

Public Types
typedef T	ElementType
typedef bool	is_kdtree_distance
typedef Accumulator< T >::Type	ResultType

Public Member Functions
template<typename U , typename V >
ResultType	accum_dist (const U &a, const V &b, int) const
template<typename Iterator1 , typename Iterator2 >
ResultType	operator() (Iterator1 a, Iterator2 b, size_t size, ResultType worst_dist=-1) const

Detailed Description

template<class T>
struct rtflann::L1< T >

Definition at line 225 of file dist.h.

Member Typedef Documentation

ElementType

template<class T >

typedef T rtflann::L1< T >::ElementType

Definition at line 229 of file dist.h.

is_kdtree_distance

template<class T >

typedef bool rtflann::L1< T >::is_kdtree_distance

Definition at line 227 of file dist.h.

ResultType

template<class T >

typedef Accumulator<T>::Type rtflann::L1< T >::ResultType

Definition at line 230 of file dist.h.

Member Function Documentation

accum_dist()

template<class T >

template<typename U , typename V >

ResultType rtflann::L1< T >::accum_dist ( const U &  a, const V &  b, int    ) const

inline

Partial distance, used by the kd-tree.

Definition at line 272 of file dist.h.

operator()()

template<class T >

template<typename Iterator1 , typename Iterator2 >

ResultType rtflann::L1< T >::operator() ( Iterator1  a, Iterator2  b, size_t  size, ResultType  worst_dist = -1  ) const

inline

Compute the Manhattan (L_1) distance between two vectors.

This is highly optimised, with loop unrolling, as it is one of the most expensive inner loops.

Definition at line 239 of file dist.h.

---

The documentation for this struct was generated from the following file:

• dist.h