Home
last modified time | relevance | path

Searched full:nearest (Results 1 – 25 of 642) sorted by relevance

12345678910>>...26

/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/index/
H A Ddistance_predicates.hpp3 // Spatial index distance predicates, calculators and checkers used in nearest neighbor query
17 \defgroup nearest_relations Nearest relations (boost::geometry::index::)
29 Generate a nearest query Point and Value's Indexable relationship while calculating
32 should be the distance to the nearest Indexable's point. This function may be also used
33 to define distances bounds which indicates that Indexable's nearest point should be
52 Generate a nearest query Point and Value's Indexable relationship while calculating
74 Generate a nearest query Point and Value's Indexable relationship while calculating
104 by PointRelation. This is default nearest predicate.
127 Point but only if nearest points are further than some distance.
153 Point but only if nearest points are closer than some distance.
[all …]
H A Dpredicates.hpp305 \brief Generate nearest() predicate.
307 When nearest predicate is passed to the query, k-nearest neighbour search will be performed.
308 \c nearest() predicate takes a \c Geometry from which distances to \c Values are calculated
314 bgi::query(spatial_index, bgi::nearest(pt, 5), std::back_inserter(result));
315 bgi::query(spatial_index, bgi::nearest(pt, 5) && bgi::intersects(box), std::back_inserter(result));
316 bgi::query(spatial_index, bgi::nearest(box, 5), std::back_inserter(result));
320 Only one \c nearest() predicate may be used in a query.
328 detail::predicates::nearest<Geometry>
329 nearest(Geometry const& geometry, unsigned k) in nearest() function
331 return detail::predicates::nearest<Geometry>(geometry, k); in nearest()
[all …]
H A Drtree.hpp740 …\brief Finds values meeting passed predicates e.g. nearest to some Point and/or intersecting some …
742 …This query function performs spatial and k-nearest neighbor searches. It allows to pass a set of p…
771 <b>Nearest predicate</b>
773 …If the nearest predicate is passed a k-nearest neighbor search will be performed. This query will …
774 …in returning k values to the output iterator. Only one nearest predicate may be passed to the quer…
776 \li \c boost::geometry::index::nearest().
790 // return 5 elements nearest to pt and elements are intersecting box
791 tree.query(bgi::nearest(pt, 5) && bgi::intersects(box), std::back_inserter(result));
820 …Only one \c nearest() perdicate may be passed to the query. Passing more of them results in compil…
848 for ( Rtree::const_query_iterator it = tree.qbegin(bgi::nearest(pt, 10000)) ;
[all …]
/OK3568_Linux_fs/external/xserver/randr/
H A Drrpointer.c52 * Find the CRTC nearest the specified position, ignoring 'skip'
60 RRCrtcPtr nearest = NULL; in RRPointerToNearestCrtc() local
91 if (!nearest || dist < best) { in RRPointerToNearestCrtc()
92 nearest = crtc; in RRPointerToNearestCrtc()
101 pScrPriv->pointerCrtc = nearest; in RRPointerToNearestCrtc()
126 /* None contain pointer, find nearest */ in RRPointerMoved()
132 * When the screen is reconfigured, move all pointers to the nearest
/OK3568_Linux_fs/external/rknpu2/examples/3rdparty/opencv/opencv-linux-aarch64/include/opencv2/flann/
H A Dnn_index.h43 * Nearest-neighbour index base class
61 * \brief Perform k-nearest neighbor search
62 * \param[in] queries The query points for which to find the nearest neighbors
63 * \param[out] indices The indices of the nearest neighbors found
64 * \param[out] dists Distances to the nearest neighbors found
65 * \param[in] knn Number of nearest neighbors to return
97 * \param[out] dists The distances to the nearest neighbors found
170 * \brief Method that searches for nearest-neighbours
H A Dlsh_index.h75 * for nearest-neighbor matching.
183 * \brief Perform k-nearest neighbor search
184 * \param[in] queries The query points for which to find the nearest neighbors
185 * \param[out] indices The indices of the nearest neighbors found
186 * \param[out] dists Distances to the nearest neighbors found
187 * \param[in] knn Number of nearest neighbors to return
212 * Find set of nearest neighbors to vec. Their indices are stored inside
216 * result = the result object in which the indices of the nearest-neighbors are stored
217 * vec = the vector for which to search the nearest neighbors
255 /** Performs the approximate nearest-neighbor search.
[all …]
H A Dflann_base.hpp209 * \brief Perform k-nearest neighbor search
210 * \param[in] queries The query points for which to find the nearest neighbors
211 * \param[out] indices The indices of the nearest neighbors found
212 * \param[out] dists Distances to the nearest neighbors found
213 * \param[in] knn Number of nearest neighbors to return
225 * \param[out] dists The distances to the nearest neighbors found
236 * \brief Method that searches for nearest-neighbours
H A Dkdtree_single_index.h67 * for nearest-neighbor matching.
206 * \brief Perform k-nearest neighbor search
207 * \param[in] queries The query points for which to find the nearest neighbors
208 * \param[out] indices The indices of the nearest neighbors found
209 * \param[out] dists Distances to the nearest neighbors found
210 * \param[in] knn Number of nearest neighbors to return
234 * Find set of nearest neighbors to vec. Their indices are stored inside
238 * result = the result object in which the indices of the nearest-neighbors are stored
239 * vec = the vector for which to search the nearest neighbors
H A Dkdtree_index.h67 * for nearest-neighbor matching.
196 * Find set of nearest neighbors to vec. Their indices are stored inside
200 * result = the result object in which the indices of the nearest-neighbors are stored
201 * vec = the vector for which to search the nearest neighbors
421 * Performs an exact nearest neighbor search. The exact search performs a full
438 * Performs the approximate nearest-neighbor search. The search is approximate
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/index/detail/
H A Ddistance_predicates.hpp4 // used in nearest query - specialized for envelopes
105 // this handles nearest() with default Point parameter, to_nearest() and bounds
107 struct calculate_distance< predicates::nearest<PointRelation>, Indexable, Tag >
113 …static inline bool apply(predicates::nearest<PointRelation> const& p, Indexable const& i, result_t… in apply()
121 struct calculate_distance< predicates::nearest< to_centroid<Point> >, Indexable, value_tag>
126 …static inline bool apply(predicates::nearest< to_centroid<Point> > const& p, Indexable const& i, r… in apply()
134 struct calculate_distance< predicates::nearest< to_furthest<Point> >, Indexable, value_tag>
139 …static inline bool apply(predicates::nearest< to_furthest<Point> > const& p, Indexable const& i, r… in apply()
H A Dpredicates.hpp77 // CONSIDER: separated nearest<> and path<> may be replaced by
80 // IMPROVEMENT: user-defined nearest predicate allowing to define
84 struct nearest struct
86 nearest() in nearest() function
89 nearest(PointOrRelation const& por, unsigned k) in nearest() function
267 struct predicate_check<predicates::nearest<DistancePredicates>, value_tag>
270 … static inline bool apply(predicates::nearest<DistancePredicates> const&, Value const&, Box const&) in apply()
459 struct predicate_check<predicates::nearest<DistancePredicates>, bounds_tag>
462 … static inline bool apply(predicates::nearest<DistancePredicates> const&, Value const&, Box const&) in apply()
706 // nearest predicate helpers
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/libc/usr/include/bits/
H A Dmathcalls.h156 /* Nearest integer, absolute value, and remainder functions. */
257 /* Return the integer nearest X in the direction of the
299 /* Round X to nearest integral value, rounding halfway cases away from
303 /* Round X to the integral value in floating-point format nearest but
315 /* Round X to nearest integral value according to current rounding
321 /* Round X to nearest integral value, rounding halfway cases away from
342 /* Round X to nearest integer value, rounding halfway cases to even. */
345 /* Round X to nearest signed integer value, not raising inexact, with
350 /* Round X to nearest unsigned integer value, not raising inexact,
355 /* Round X to nearest signed integer value, raising inexact for
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/libc/usr/include/bits/
H A Dmathcalls.h156 /* Nearest integer, absolute value, and remainder functions. */
257 /* Return the integer nearest X in the direction of the
299 /* Round X to nearest integral value, rounding halfway cases away from
303 /* Round X to the integral value in floating-point format nearest but
315 /* Round X to nearest integral value according to current rounding
321 /* Round X to nearest integral value, rounding halfway cases away from
342 /* Round X to nearest integer value, rounding halfway cases to even. */
345 /* Round X to nearest signed integer value, not raising inexact, with
350 /* Round X to nearest unsigned integer value, not raising inexact,
355 /* Round X to nearest signed integer value, raising inexact for
[all …]
/OK3568_Linux_fs/kernel/tools/include/linux/
H A Dlog2.h44 * round up to nearest power of two
53 * round down to nearest power of two
144 * roundup_pow_of_two - round the given value up to nearest power of two
147 * round the given value up to the nearest power of two
161 * rounddown_pow_of_two - round the given value down to nearest power of two
164 * round the given value down to the nearest power of two
/OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm64/include/
H A Dmath_config.h36 /* Correct special case results in non-nearest rounding modes. */
95 /* Round x to nearest int in all rounding modes, ties have to be rounded
104 /* Convert x to nearest int in all rounding modes, ties have to be rounded
276 /* The result underflows to 0 in nearest rounding mode. */
284 /* The result underflows to 0 in nearest rounding mode. */
375 needed for good precision in non-nearest rounding and !TOINT_INTRINSICS. */
377 /* Use close to nearest rounding toint when !TOINT_INTRINSICS. This may be
378 needed for good precision in non-nearest rouning and !EXP_POLY_WIDE. */
/OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm32/include/
H A Dmath_config.h36 /* Correct special case results in non-nearest rounding modes. */
95 /* Round x to nearest int in all rounding modes, ties have to be rounded
104 /* Convert x to nearest int in all rounding modes, ties have to be rounded
276 /* The result underflows to 0 in nearest rounding mode. */
284 /* The result underflows to 0 in nearest rounding mode. */
375 needed for good precision in non-nearest rounding and !TOINT_INTRINSICS. */
377 /* Use close to nearest rounding toint when !TOINT_INTRINSICS. This may be
378 needed for good precision in non-nearest rouning and !EXP_POLY_WIDE. */
/OK3568_Linux_fs/u-boot/include/linux/
H A Dlog2.h56 * __roundup_pow_of_two() - round up to nearest power of two
66 * __rounddown_pow_of_two() - round down to nearest power of two
158 * roundup_pow_of_two - round the given value up to nearest power of two
161 * round the given value up to the nearest power of two
175 * rounddown_pow_of_two - round the given value down to nearest power of two
178 * round the given value down to the nearest power of two
/OK3568_Linux_fs/kernel/include/linux/
H A Dlog2.h51 * __roundup_pow_of_two() - round up to nearest power of two
61 * __rounddown_pow_of_two() - round down to nearest power of two
166 * roundup_pow_of_two - round the given value up to nearest power of two
169 * round the given value up to the nearest power of two
183 * rounddown_pow_of_two - round the given value down to nearest power of two
186 * round the given value down to the nearest power of two
H A Dmath64.h272 * DIV64_U64_ROUND_CLOSEST - unsigned 64bit divide with 64bit divisor rounded to nearest integer
279 * Return: dividend / divisor rounded to nearest integer
285 * DIV_S64_ROUND_CLOSEST - signed 64bit divide with 32bit divisor rounded to nearest integer
292 * Return: dividend / divisor rounded to nearest integer
/OK3568_Linux_fs/external/xserver/Xi/
H A Dxibarriers.c317 * Find the nearest barrier client that is blocking movement from x1/y1 to x2/y2.
324 * @return The barrier nearest to the movement origin that blocks this movement.
331 struct PointerBarrierClient *c, *nearest = NULL; in barrier_find_nearest() local
352 nearest = c; in barrier_find_nearest()
357 return nearest; in barrier_find_nearest()
398 struct PointerBarrier *nearest = NULL; in input_constrain_cursor() local
429 * Given the origin and the movement vector, get the nearest barrier in input_constrain_cursor()
433 * destination, again finding the nearest barrier and clamping. in input_constrain_cursor()
445 nearest = &c->barrier; in input_constrain_cursor()
457 barrier_clamp_to_barrier(nearest, dir, &x, &y); in input_constrain_cursor()
[all …]
/OK3568_Linux_fs/kernel/arch/m68k/fpsp040/
H A Dslog2.S34 | Notes: Default means round-to-nearest mode, no floating-point
49 | Notes: Default means round-to-nearest mode, no floating-point
63 | Notes: Default means round-to-nearest mode, no floating-point
78 | Notes: Default means round-to-nearest mode, no floating-point
/OK3568_Linux_fs/buildroot/package/flann/
H A DConfig.in6 FLANN is a library for performing fast approximate nearest
8 collection of algorithms we found to work best for nearest
/OK3568_Linux_fs/buildroot/package/libspatialindex/
H A DConfig.in12 location, nearest neighbor and k-nearest neighbor as well
/OK3568_Linux_fs/external/rknpu2/examples/3rdparty/opencv/opencv-linux-aarch64/include/opencv2/
H A Dflann.hpp54 Nearest Neighbors) is a library that contains a collection of algorithms optimized for fast nearest
104 /** @brief The FLANN nearest neighbor index class. This class is templated with the type of element…
114 /** @brief Constructs a nearest neighbor search index for a given dataset.
206 /** @brief Performs a K-nearest neighbor search for a given query point using the index.
209 … @param indices Vector that will contain the indices of the K-nearest neighbors found. It must have
211 … @param dists Vector that will contain the distances to the K-nearest neighbors found. It must have
213 @param knn Number of nearest neighbors to search for.
/OK3568_Linux_fs/kernel/arch/m68k/math-emu/
H A Dfp_util.S238 jne fp_e2e_roundother | %d2 == 0, round to nearest
462 jne fp_ne_roundother | %d2 == 0, round to nearest
645 | 0: Round to nearest
686 | from the shift above, it is needed for round to nearest.
691 jne 2f | %d2 == 0, round to nearest
818 jne 3f | %d2 = 0 round to nearest
889 jne 2f | %d2 == 0, round to nearest
960 jne 3f | %d2 = 0 round to nearest
1049 jne 2f | %d2 == 0, round to nearest
1090 jne 3f | %d2 = 0 round to nearest
[all …]

12345678910>>...26