| /OK3568_Linux_fs/external/rknpu2/examples/3rdparty/opencv/opencv-linux-aarch64/include/opencv2/flann/ |
| H A D | all_indices.h | 49 template<typename KDTreeCapability, typename VectorSpace, typename Distance>
52 …tatic NNIndex<Distance>* create(const Matrix<typename Distance::ElementType>& dataset, const Index… in create()
56 NNIndex<Distance>* nnIndex; in create()
59 nnIndex = new LinearIndex<Distance>(dataset, params, distance); in create()
62 nnIndex = new KDTreeSingleIndex<Distance>(dataset, params, distance); in create()
65 nnIndex = new KDTreeIndex<Distance>(dataset, params, distance); in create()
68 nnIndex = new KMeansIndex<Distance>(dataset, params, distance); in create()
71 nnIndex = new CompositeIndex<Distance>(dataset, params, distance); in create()
74 nnIndex = new AutotunedIndex<Distance>(dataset, params, distance); in create()
77 nnIndex = new HierarchicalClusteringIndex<Distance>(dataset, params, distance); in create()
[all …]
|
| H A D | index_testing.h | 63 template <typename Distance>
64 typename Distance::ResultType computeDistanceRaport(const Matrix<typename Distance::ElementType>& i… in computeDistanceRaport()
65 … int* neighbors, int* groundTruth, int veclen, int n, const Distance& distance) in computeDistanceRaport() argument
67 typedef typename Distance::ResultType DistanceType; in computeDistanceRaport()
71 DistanceType den = distance(inputData[groundTruth[i]], target, veclen); in computeDistanceRaport()
72 DistanceType num = distance(inputData[neighbors[i]], target, veclen); in computeDistanceRaport()
85 template <typename Distance>
86 float search_with_ground_truth(NNIndex<Distance>& index, const Matrix<typename Distance::ElementTyp… in search_with_ground_truth()
87 …const Matrix<typename Distance::ElementType>& testData, const Matrix<int>& matches, int nn, int ch… in search_with_ground_truth()
88 … float& time, typename Distance::ResultType& dist, const Distance& distance, int skipMatches) in search_with_ground_truth() argument
[all …]
|
| H A D | flann_base.hpp | 72 template<typename Distance>
73 NNIndex<Distance>* load_saved_index(const Matrix<typename Distance::ElementType>& dataset, const cv… in load_saved_index() argument
75 typedef typename Distance::ElementType ElementType; in load_saved_index()
93 NNIndex<Distance>* nnIndex = create_index_by_type<Distance>(dataset, params, distance); in load_saved_index()
101 template<typename Distance>
102 class Index : public NNIndex<Distance>
105 typedef typename Distance::ElementType ElementType;
106 typedef typename Distance::ResultType DistanceType;
108 …ex(const Matrix<ElementType>& features, const IndexParams& params, Distance distance = Distance() ) in Index() argument
115 …nnIndex_ = load_saved_index<Distance>(features, get_param<cv::String>(params,"filename"), distance… in Index()
[all …]
|
| H A D | ground_truth.h | 41 template <typename Distance>
42 void find_nearest(const Matrix<typename Distance::ElementType>& dataset, typename Distance::Element…
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>
83 …d compute_ground_truth(const Matrix<typename Distance::ElementType>& dataset, const Matrix<typenam…
84 int skip=0, Distance d = Distance())
87 find_nearest<Distance>(dataset, testset[i], matches[i], (int)matches.cols, skip, d);
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/ |
| H A D | next_prior.hpp | 67 template< typename T, typename Distance, bool HasPlus = has_plus< T, Distance >::value >
70 template< typename T, typename Distance >
71 struct next_plus_impl< T, Distance, true >
73 static T call(T x, Distance n) in call()
79 template< typename T, typename Distance, bool HasPlusAssign = has_plus_assign< T, Distance >::value…
81 public next_plus_impl< T, Distance >
85 template< typename T, typename Distance >
86 struct next_plus_assign_impl< T, Distance, true >
88 static T call(T x, Distance n) in call()
95 template< typename T, typename Distance, bool IsIterator = is_iterator< T >::value >
[all …]
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/algorithms/ |
| H A D | buffer.hpp | 55 static inline void apply(BoxIn const& box_in, T const& distance, BoxOut& box_out) in apply()
57 coordinate_type d = distance; in apply()
59 box_loop<BoxIn, BoxOut, T, C, D + 1, N>::apply(box_in, distance, box_out); in apply()
71 inline void buffer_box(BoxIn const& box_in, T const& distance, BoxOut& box_out) in buffer_box() argument
77 box_loop<BoxIn, BoxOut, T, min_corner, 0, N>::apply(box_in, -distance, box_out); in buffer_box()
78 box_loop<BoxIn, BoxOut, T, max_corner, 0, N>::apply(box_in, distance, box_out); in buffer_box()
104 template <typename Distance>
105 static inline void apply(BoxIn const& box_in, Distance const& distance, in apply()
106 Distance const& , BoxOut& box_out) in apply()
108 detail::buffer::buffer_box(box_in, distance, box_out); in apply()
[all …]
|
| H A D | simplify.hpp | 37 #include <boost/geometry/strategies/distance.hpp>
43 #include <boost/geometry/algorithms/detail/distance/default_strategies.hpp>
54 template<typename Range, typename Strategy, typename OutputIterator, typename Distance>
56 Distance const& max_distance, Strategy const& strategy) in apply()
74 template <typename Range, typename Strategy, typename Distance>
76 Distance const& , Strategy const& ) in apply()
89 template <typename Range, typename Strategy, typename Distance>
91 Distance const& max_distance, Strategy const& strategy) in apply()
131 typename Distance,
136 Distance const& max_distance, Strategy const& strategy) in iterate()
[all …]
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/algorithms/detail/distance/ |
| H A D | backward_compatibility.hpp | 27 #include <boost/geometry/strategies/distance.hpp>
32 #include <boost/geometry/algorithms/dispatch/distance.hpp>
34 #include <boost/geometry/algorithms/detail/distance/default_strategies.hpp>
35 #include <boost/geometry/algorithms/detail/distance/point_to_geometry.hpp>
36 #include <boost/geometry/algorithms/detail/distance/multipoint_to_geometry.hpp>
44 namespace detail { namespace distance namespace
51 static inline typename strategy::distance::services::return_type
59 typename detail::distance::default_ps_strategy in apply()
74 }} // namespace detail::distance
87 struct distance struct
[all …]
|
| H A D | point_to_geometry.hpp | 38 #include <boost/geometry/strategies/distance.hpp>
47 #include <boost/geometry/algorithms/detail/distance/is_comparable.hpp>
48 #include <boost/geometry/algorithms/detail/distance/iterator_selector.hpp>
50 #include <boost/geometry/algorithms/dispatch/distance.hpp>
57 namespace detail { namespace distance namespace
65 typename strategy::distance::services::return_type<Strategy, P1, P2>::type
84 typedef typename strategy::distance::services::comparable_type
95 typedef typename strategy::distance::services::return_type
112 namespace sds = strategy::distance::services; in apply()
154 typedef typename strategy::distance::services::return_type
[all …]
|
| H A D | interface.hpp | 35 #include <boost/geometry/strategies/distance.hpp>
40 #include <boost/geometry/algorithms/detail/distance/default_strategies.hpp>
42 #include <boost/geometry/algorithms/dispatch/distance.hpp>
60 struct distance struct
66 : distance<Geometry2, Geometry1, Strategy, Tag2, Tag1, StrategyTag, false>
68 typedef typename strategy::distance::services::return_type
80 return distance in apply()
97 struct distance struct
105 return dispatch::distance in apply()
118 typedef typename detail::distance::default_strategy in apply()
[all …]
|
| H A D | multipoint_to_geometry.hpp | 18 #include <boost/geometry/strategies/distance.hpp>
23 #include <boost/geometry/algorithms/dispatch/distance.hpp>
26 #include <boost/geometry/algorithms/detail/distance/range_to_geometry_rtree.hpp>
33 namespace detail { namespace distance namespace
40 typedef typename strategy::distance::services::return_type
81 typedef typename strategy::distance::services::return_type
92 return detail::distance::point_or_segment_range_to_geometry_rtree in apply()
132 typedef typename strategy::distance::services::return_type
152 return detail::distance::point_or_segment_range_to_geometry_rtree in apply()
174 }} // namespace detail::distance
[all …]
|
| H A D | geometry_to_segment_or_box.hpp | 21 #include <boost/geometry/strategies/distance.hpp>
31 #include <boost/geometry/algorithms/dispatch/distance.hpp>
36 #include <boost/geometry/algorithms/detail/distance/is_comparable.hpp>
45 namespace detail { namespace distance namespace
85 typedef typename strategy::distance::services::comparable_type
100 typedef typename strategy::distance::services::return_type
170 typedef typename strategy::distance::services::return_type
203 strategy::distance::services::get_comparable in apply()
287 return dispatch::distance in apply()
327 typedef typename strategy::distance::services::return_type
[all …]
|
| H A D | linear_or_areal_to_areal.hpp | 15 #include <boost/geometry/strategies/distance.hpp>
19 #include <boost/geometry/algorithms/detail/distance/linear_to_linear.hpp>
26 namespace detail { namespace distance namespace
33 typedef typename strategy::distance::services::return_type
68 typedef typename strategy::distance::services::return_type
92 }} // namespace detail::distance
101 struct distance struct
107 : detail::distance::linear_to_areal
115 struct distance struct
121 : detail::distance::linear_to_areal
[all …]
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/algorithms/detail/closest_feature/ |
| H A D | point_to_range.hpp | 19 #include <boost/geometry/strategies/distance.hpp>
32 // distance of the point to the range
45 template <typename Distance>
52 Distance& dist_min) in apply()
56 Distance const zero = Distance(0); in apply()
67 // start with first segment distance in apply()
74 Distance dist = strategy.apply(point, *prev, *it); in apply()
96 template <typename Distance>
101 Distance& dist_min) in apply()
114 typename strategy::distance::services::return_type in apply()
[all …]
|
| H A D | geometry_to_range.hpp | 17 #include <boost/geometry/strategies/distance.hpp>
20 #include <boost/geometry/algorithms/dispatch/distance.hpp>
33 // distance between the geometry and the element of the range
42 typename Distance
49 Distance& dist_min) in apply()
53 Distance const zero = Distance(0); in apply()
55 // start with first distance in apply()
57 dist_min = dispatch::distance in apply()
67 Distance dist = dispatch::distance in apply()
94 typename Distance
[all …]
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/index/ |
| H A D | distance_predicates.hpp | 3 // Spatial index distance predicates, calculators and checkers used in nearest neighbor query
32 should be the distance to the nearest Indexable's point. This function may be also used
41 \param v Point or distance value.
63 \param v Point or distance value.
77 should be the distance to the furthest Indexable's point. This function may be also used
86 \param v Point or distance value.
96 // distance predicates generators
99 \brief Generate unbounded() distance predicate.
101 Generate a distance predicate. This defines distances bounds which are used by knn query.
102 This function indicates that there is no distance bounds and Values should be returned
[all …]
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/src/mbgl/renderer/buckets/ |
| H A D | line_bucket.cpp | 43 * Sharp corners cause dashed lines to tilt because the distance along the line
56 // The number of bits that is used to store the line distance in the buffer.
59 // We don't have enough bits for the line distance as we'd like to have, so
60 // use this value to scale the line distance (in tile units) down to a smaller
64 // The maximum line distance, in tile units, that fits in the buffer.
102 double distance = 0; in addGeometry() local
193 distance += util::dist<double>(newPrevVertex, *prevCoordinate); in addGeometry()
194 … addCurrentVertex(newPrevVertex, distance, *prevNormal, 0, 0, false, startVertex, triangleStore); in addGeometry()
234 distance += util::dist<double>(*currentCoordinate, *prevCoordinate); in addGeometry()
238 addCurrentVertex(*currentCoordinate, distance, joinNormal, 0, 0, false, startVertex, in addGeometry()
[all …]
|
| /OK3568_Linux_fs/external/xserver/test/ |
| H A D | fixes.c | 102 double distance; in fixes_pointer_barriers_test() local
118 assert(barrier_is_blocking(&barrier, x1, y1, x2, y2, &distance)); in fixes_pointer_barriers_test()
119 assert(distance == 1); in fixes_pointer_barriers_test()
124 assert(!barrier_is_blocking(&barrier, x1, y1, x2, y2, &distance)); in fixes_pointer_barriers_test()
131 assert(!barrier_is_blocking(&barrier, x1, y1, x2, y2, &distance)); in fixes_pointer_barriers_test()
138 assert(barrier_is_blocking(&barrier, x1, y1, x2, y2, &distance)); in fixes_pointer_barriers_test()
145 assert(!barrier_is_blocking(&barrier, x1, y1, x2, y2, &distance)); in fixes_pointer_barriers_test()
152 assert(barrier_is_blocking(&barrier, x1, y1, x2, y2, &distance)); in fixes_pointer_barriers_test()
159 assert(!barrier_is_blocking(&barrier, x1, y1, x2, y2, &distance)); in fixes_pointer_barriers_test()
166 assert(!barrier_is_blocking(&barrier, x1, y1, x2, y2, &distance)); in fixes_pointer_barriers_test()
[all …]
|
| /OK3568_Linux_fs/kernel/Documentation/staging/ |
| H A D | lzo.rst | 26 - a distance when copying data from the dictionary (past output buffer)
32 extra data can be a complement for the operand (eg: a length or a distance
66 taken from the last two bits of an extra operand (eg: distance).
68 End of stream is declared when a block copy of distance 0 is seen. Only one
69 instruction may encode this distance (0001HLLL), it takes one LE16 operand
70 for the distance, thus requiring 3 bytes.
133 the instruction's opcode or distance), the instruction is a copy of a
134 2-byte block from the dictionary within a 1kB distance. It is worth
139 0 0 0 0 D D S S (0..15) : copy 2 bytes from <= 1kB distance
143 distance = (H << 2) + D + 1
[all …]
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/location/places/ |
| H A D | qplaceresult.cpp | 44 : QPlaceSearchResultPrivate(), distance(qQNaN()), sponsored(false) in QPlaceResultPrivate()
49 : QPlaceSearchResultPrivate(other), distance(other.distance), place(other.place), in QPlaceResultPrivate()
62 && ((qIsNaN(distance) && qIsNaN(od->distance)) in compare()
63 || qFuzzyCompare(distance, od->distance)) in compare()
77 The PlaceResult holds the distance to the place from the center of the search request,
115 Returns the distance of the place to the search center. This in Q_IMPLEMENT_SEARCHRESULT_D_FUNC()
118 the distance is NaN indicating an undefined distance. The default value in Q_IMPLEMENT_SEARCHRESULT_D_FUNC()
119 for distance is NaN. in Q_IMPLEMENT_SEARCHRESULT_D_FUNC()
121 qreal QPlaceResult::distance() const in Q_IMPLEMENT_SEARCHRESULT_D_FUNC()
124 return d->distance; in Q_IMPLEMENT_SEARCHRESULT_D_FUNC()
[all …]
|
| /OK3568_Linux_fs/u-boot/fs/jffs2/ |
| H A D | mini_inflate.c | 55 stream->distance.bits = 16; in init_stream()
56 stream->distance.num_symbols = 32; in init_stream()
57 stream->distance.lengths = stream->distance_lengths; in init_stream()
58 stream->distance.symbols = stream->distance_symbols; in init_stream()
59 stream->distance.count = stream->distance_count; in init_stream()
60 stream->distance.first = stream->distance_first; in init_stream()
61 stream->distance.pos = stream->distance_pos; in init_stream()
139 /* decompress a stream of data encoded with the passed length and distance
144 struct huffman_set *distance = &(stream->distance); in decompress_huffman() local
166 if ((symbol = read_symbol(stream, distance)) < 0) in decompress_huffman()
[all …]
|
| /OK3568_Linux_fs/kernel/drivers/of/ |
| H A D | of_numa.c | 83 pr_info("parsing numa-distance-map-v1\n"); in of_numa_parse_distance_map_v1()
85 matrix = of_get_property(map, "distance-matrix", NULL); in of_numa_parse_distance_map_v1()
87 pr_err("No distance-matrix property in distance-map\n"); in of_numa_parse_distance_map_v1()
91 entry_count = of_property_count_u32_elems(map, "distance-matrix"); in of_numa_parse_distance_map_v1()
93 pr_err("Invalid distance-matrix\n"); in of_numa_parse_distance_map_v1()
98 u32 nodea, nodeb, distance; in of_numa_parse_distance_map_v1() local
104 distance = of_read_number(matrix, 1); in of_numa_parse_distance_map_v1()
107 if ((nodea == nodeb && distance != LOCAL_DISTANCE) || in of_numa_parse_distance_map_v1()
108 (nodea != nodeb && distance <= LOCAL_DISTANCE)) { in of_numa_parse_distance_map_v1()
109 pr_err("Invalid distance[node%d -> node%d] = %d\n", in of_numa_parse_distance_map_v1()
[all …]
|
| /OK3568_Linux_fs/external/rknpu2/examples/3rdparty/opencv/opencv-linux-aarch64/include/opencv2/ |
| H A D | flann.hpp | 107 template <typename Distance>
111 typedef typename Distance::ElementType ElementType;
112 typedef typename Distance::ResultType DistanceType;
121 @param distance
202 …icIndex(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, "\
246 "for example for L1 distance use: GenericIndex< L1<float> > \n"); \
250 template <typename Distance>
[all …]
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/algorithms/detail/comparable_distance/ |
| H A D | interface.hpp | 26 #include <boost/geometry/strategies/distance.hpp>
28 #include <boost/geometry/algorithms/detail/distance/interface.hpp>
47 typedef typename strategy::distance::services::comparable_type in apply()
52 return dispatch::distance in apply()
57 strategy::distance::services::get_comparable in apply()
72 typedef typename strategy::distance::services::comparable_type in apply()
74 typename detail::distance::default_strategy in apply()
80 return dispatch::distance in apply()
299 \brief \brief_calc2{comparable distance measurement} \brief_strategy
300 \ingroup distance
[all …]
|
| /OK3568_Linux_fs/external/rknpu2/examples/3rdparty/opencv/opencv-linux-aarch64/include/opencv2/shape/ |
| H A D | shape_distance.hpp | 57 An example using shape distance algorithm
59 /** @brief Abstract base class for shape distance algorithms.
64 /** @brief Compute the shape distance between two shapes defined by its contours.
117 …/** @brief Set the weight of the shape context distance in the final value of the shape distance. …
118 …context distance between two shapes is defined as the symmetric sum of shape context matching costs
119 over best matching points. The final value of the shape distance is a user-defined linear
120 combination of the shape context distance, an image appearance distance, and a bending energy.
122 @param shapeContextWeight The weight of the shape context distance in the final distance value.
127 …/** @brief Set the weight of the Image Appearance cost in the final value of the shape distance. T…
129 corresponding image points. The final value of the shape distance is a user-defined linear
[all …]
|