| /external/opencv3/modules/flann/include/opencv2/flann/ |
| all_indices.h | 49 template<typename KDTreeCapability, typename VectorSpace, typename Distance>
52 static NNIndex<Distance>* create(const Matrix<typename Distance::ElementType>& dataset, const IndexParams& params, const Distance& distance)
56 NNIndex<Distance>* nnIndex;
59 nnIndex = new LinearIndex<Distance>(dataset, params, distance);
62 nnIndex = new KDTreeSingleIndex<Distance>(dataset, params, distance);
[all...] |
| ground_truth.h | 41 template <typename Distance>
42 void find_nearest(const Matrix<typename Distance::ElementType>& dataset, typename Distance::ElementType* query, int* matches, int nn,
43 int skip = 0, Distance distance = Distance())
45 typedef typename Distance::ResultType DistanceType;
51 dists[0] = distance(dataset[0], query, dataset.cols);
56 DistanceType tmp = distance(dataset[i], query, dataset.cols);
82 template <typename Distance>
[all...] |
| flann_base.hpp | 72 template<typename Distance>
73 NNIndex<Distance>* load_saved_index(const Matrix<typename Distance::ElementType>& dataset, const cv::String& filename, Distance distance)
75 typedef typename Distance::ElementType ElementType;
91 NNIndex<Distance>* nnIndex = create_index_by_type<Distance>(dataset, params, distance);
99 template<typename Distance>
[all...] |
| composite_index.h | 70 template <typename Distance>
71 class CompositeIndex : public NNIndex<Distance>
74 typedef typename Distance::ElementType ElementType;
75 typedef typename Distance::ResultType DistanceType;
81 * @param d Distance functor
85 Distance d = Distance()) : index_params_(params)
87 kdtree_index_ = new KDTreeIndex<Distance>(inputData, params, d);
88 kmeans_index_ = new KMeansIndex<Distance>(inputData, params, d);
183 KMeansIndex<Distance>* kmeans_index_
[all...] |
| linear_index.h | 48 template <typename Distance>
49 class LinearIndex : public NNIndex<Distance>
53 typedef typename Distance::ElementType ElementType;
54 typedef typename Distance::ResultType DistanceType;
58 Distance d = Distance()) :
125 /** Index distance */
126 Distance distance_;
|
| index_testing.h | 63 template <typename Distance>
64 typename Distance::ResultType computeDistanceRaport(const Matrix<typename Distance::ElementType>& inputData, typename Distance::ElementType* target,
65 int* neighbors, int* groundTruth, int veclen, int n, const Distance& distance)
67 typedef typename Distance::ResultType DistanceType;
71 DistanceType den = distance(inputData[groundTruth[i]], target, veclen);
72 DistanceType num = distance(inputData[neighbors[i]], target, veclen);
85 template <typename Distance>
[all...] |
| autotuned_index.h | 48 template<typename Distance>
49 NNIndex<Distance>* create_index_by_type(const Matrix<typename Distance::ElementType>& dataset, const IndexParams& params, const Distance& distance);
69 template <typename Distance>
70 class AutotunedIndex : public NNIndex<Distance>
73 typedef typename Distance::ElementType ElementType;
74 typedef typename Distance::ResultType DistanceType;
76 AutotunedIndex(const Matrix<ElementType>& inputData, const IndexParams& params = AutotunedIndexParams(), Distance d = Distance())
[all...] |
| nn_index.h | 45 template <typename Distance>
48 typedef typename Distance::ElementType ElementType;
49 typedef typename Distance::ResultType DistanceType;
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/ |
| iterator.hpp | 25 class Distance = std::ptrdiff_t,
30 typedef Distance difference_type;
40 template <class Category, class T, class Distance, class Pointer, class Reference>
42 struct iterator_base : std::iterator<Category, T, Distance, Pointer, Reference> {};
44 struct iterator_base : std::iterator<Category, T, Distance>
48 typedef Distance difference_type;
53 template <class Category, class T, class Distance = std::ptrdiff_t,
55 struct iterator : boost::detail::iterator_base<Category, T, Distance, Pointer, Reference> {};
|
| next_prior.hpp | 32 template <class T, class Distance>
33 inline T next(T x, Distance n)
42 template <class T, class Distance>
43 inline T prior(T x, Distance n)
|
| /external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/collision/ |
| DistanceInput.java | 26 import org.jbox2d.collision.Distance.DistanceProxy;
30 * Input for Distance.
|
| /external/vulkan-validation-layers/libs/glm/gtc/ |
| ulp.hpp | 66 /// Return the value(s) ULP distance after the input value(s).
69 GLM_FUNC_DECL genType next_float(genType const & x, uint const & Distance);
71 /// Return the value(s) ULP distance before the input value(s).
74 GLM_FUNC_DECL genType prev_float(genType const & x, uint const & Distance);
76 /// Return the distance in the number of ULP between 2 scalars.
81 /// Return the distance in the number of ULP between 2 vectors.
|
| /external/opencv3/modules/flann/include/opencv2/ |
| flann.hpp | 107 template <typename Distance>
111 typedef typename Distance::ElementType ElementType;
112 typedef typename Distance::ResultType DistanceType;
121 @param distance
202 GenericIndex(const Mat& features, const ::cvflann::IndexParams& params, Distance distance = Distance());
236 ::cvflann::Index<Distance>* nnIndex;
244 "the distance using cvflann::set_distance_type. This is no longer working as expected "\
245 "(cv::flann::Index always uses L2). You should create the index templated on the distance, "\
[all...] |
| /external/opencv3/modules/flann/src/ |
| miniflann.cpp | 305 // only for radius search, require neighbours sorted by distance (default: true)
310 template<typename Distance, typename IndexType> void
311 buildIndex_(void*& index, const Mat& data, const IndexParams& params, const Distance& dist = Distance())
313 typedef typename Distance::ElementType ElementType;
325 template<typename Distance> void
326 buildIndex(void*& index, const Mat& data, const IndexParams& params, const Distance& dist = Distance())
328 buildIndex_<Distance, ::cvflann::Index<Distance> >(index, data, params, dist)
[all...] |
| /external/clang/unittests/AST/ |
| ASTTypeTraitsTest.cpp | 44 unsigned Distance = 1;
45 EXPECT_TRUE(DNT<Expr>().isBaseOf(DNT<Expr>(), &Distance));
46 EXPECT_EQ(0u, Distance);
48 EXPECT_TRUE(DNT<Stmt>().isBaseOf(DNT<IfStmt>(), &Distance));
49 EXPECT_EQ(1u, Distance);
51 Distance = 3;
52 EXPECT_TRUE(DNT<DeclaratorDecl>().isBaseOf(DNT<ParmVarDecl>(), &Distance));
53 EXPECT_EQ(2u, Distance);
|
| /external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/pooling/ |
| IWorldPool.java | 28 import org.jbox2d.collision.Distance;
94 public Distance getDistance();
|
| /external/clang/lib/AST/ |
| ASTTypeTraits.cpp | 42 bool ASTNodeKind::isBaseOf(ASTNodeKind Other, unsigned *Distance) const {
43 return isBaseOf(KindId, Other.KindId, Distance);
51 unsigned *Distance) {
58 if (Distance)
59 *Distance = Dist;
|
| /external/jhead/ |
| makernote.c | 138 if (Components > 19 && ImageInfo.Distance <= 0) {
139 // Inidcates the distance the autofocus camera is focused to.
140 // Tends to be less accurate as distance increases.
144 ImageInfo.Distance = (float)temp_dist/100;
146 ImageInfo.Distance = -1 /* infinity */;
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/vector/aux_/ |
| iterator.hpp | 82 , typename Distance
84 struct advance< v_iter<Vector,n_>,Distance>
88 , (n_ + BOOST_MPL_AUX_NESTED_VALUE_WKND(long, Distance))
97 struct distance< v_iter<Vector,n_>, v_iter<Vector,m_> > struct in namespace:boost::mpl
|
| /external/v8/src/x64/ |
| macro-assembler-x64.h | 152 Label::Distance if_equal_distance = Label::kFar) {
158 Label::Distance if_equal_distance = Label::kFar) {
166 Label::Distance if_not_equal_distance = Label::kFar) {
172 Label::Distance if_not_equal_distance = Label::kFar) {
212 Label::Distance condition_met_distance = Label::kFar);
219 Label::Distance distance = Label::kFar) {
220 InNewSpace(object, scratch, not_equal, branch, distance);
228 Label::Distance distance = Label::kFar)
[all...] |
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/NarrowPhaseCollision/ |
| btGjkEpa2.h | 44 btScalar distance; member in struct:btGjkEpaSolver2::sResults
49 static bool Distance( const btConvexShape* shape0,const btTransform& wtrs0,
|
| btGjkEpaPenetrationDepthSolver.cpp | 54 if(btGjkEpaSolver2::Distance(pConvexA,transformA,pConvexB,transformB,guessVector,results))
|
| /prebuilts/misc/common/swig/include/2.0.11/std/ |
| std_common.i | 50 template <class Iterator, class Category,class T, class Reference, class Pointer, class Distance>
51 struct iterator_traits<__reverse_bi_iterator<Iterator,Category,T,Reference,Pointer,Distance> > {
52 typedef Distance difference_type;
64 distance(_InputIterator __first, _InputIterator __last)
|
| /external/v8/src/ia32/ |
| macro-assembler-ia32.h | 84 Label::Distance if_equal_distance = Label::kFar) {
90 Label::Distance if_equal_distance = Label::kFar) {
98 Label::Distance if_not_equal_distance = Label::kFar) {
104 Label::Distance if_not_equal_distance = Label::kFar) {
123 Label::Distance condition_met_distance = Label::kFar);
127 Label::Distance condition_met_distance = Label::kFar);
132 Label::Distance distance = Label::kFar) {
133 InNewSpace(object, scratch, zero, branch, distance);
139 Label::Distance distance = Label::kFar)
849 JumpIfNotUniqueNameInstanceType(Operand(reg), not_unique_name, distance); local
[all...] |
| /external/v8/src/x87/ |
| macro-assembler-x87.h | 84 Label::Distance if_equal_distance = Label::kFar) {
90 Label::Distance if_equal_distance = Label::kFar) {
98 Label::Distance if_not_equal_distance = Label::kFar) {
104 Label::Distance if_not_equal_distance = Label::kFar) {
123 Label::Distance condition_met_distance = Label::kFar);
127 Label::Distance condition_met_distance = Label::kFar);
132 Label::Distance distance = Label::kFar) {
133 InNewSpace(object, scratch, zero, branch, distance);
139 Label::Distance distance = Label::kFar)
829 JumpIfNotUniqueNameInstanceType(Operand(reg), not_unique_name, distance); local
[all...] |
