flann::L1< T > Struct Template Reference

#include <dist.h>

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

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

Detailed Description

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

Definition at line 197 of file dist.h.

Member Typedef Documentation

ElementType

template<class T >

typedef T flann::L1< T >::ElementType

Definition at line 201 of file dist.h.

is_kdtree_distance

template<class T >

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

Definition at line 199 of file dist.h.

ResultType

template<class T >

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

Definition at line 202 of file dist.h.

Member Function Documentation

accum_dist()

template<class T >

template<typename U , typename V >

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

inline

Partial distance, used by the kd-tree.

Definition at line 244 of file dist.h.

References abs().

operator()()

template<class T >

template<typename Iterator1 , typename Iterator2 >

ResultType flann::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 211 of file dist.h.

References abs(), result, and size.

---

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

• /root/ACloudViewer/libs/Reconstruction/lib/FLANN/algorithms/dist.h