#include <dist.h>
Public Types | |
| typedef True | is_kdtree_distance |
| typedef True | is_vector_space_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=-1) const |
| template<typename U , typename V > | |
| ResultType | accum_dist (const U &a, const V &b, int) const |
Squared Euclidean distance functor.
This is the simpler, unrolled version. This is preferable for very low dimensionality data (eg 3D points)
| typedef True cvflann::L2_Simple< T >::is_kdtree_distance |
| typedef True cvflann::L2_Simple< T >::is_vector_space_distance |
| typedef T cvflann::L2_Simple< T >::ElementType |
| typedef Accumulator<T>::Type cvflann::L2_Simple< T >::ResultType |
| ResultType cvflann::L2_Simple< T >::operator() | ( | Iterator1 | a, |
| Iterator2 | b, | ||
| size_t | size, | ||
| ResultType | = -1 |
||
| ) | const |
| ResultType cvflann::L2_Simple< T >::accum_dist | ( | const U & | a, |
| const V & | b, | ||
| int | |||
| ) | const |