| /external/opencv3/3rdparty/openexr/Imath/ |
| ImathPlane.h | 48 // plane. Any function which computes a distance will return
49 // either negative or positive values for the distance indicating
67 T distance; member in class:Imath::Plane3
70 Plane3(const Vec3<T> &normal, T distance);
81 T distance);
146 distance = normal ^ point1;
154 distance = normal ^ point;
162 distance = d;
168 return (point ^ normal) - distance;
190 T t = - ((normal ^ line.pos) - distance) / d
[all...] |
| /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/include/opencv2/flann/ |
| dist.h | 97 * Squared Euclidean distance functor.
133 * Squared Euclidean distance functor, optimized version
145 * Compute the squared Euclidean distance between two vectors.
184 * Partial euclidean distance, using just one dimension. This is used by the
198 * Manhattan distance functor, optimized version
210 * Compute the Manhattan (L_1) distance between two vectors.
246 * Partial distance, used by the kd-tree.
271 * Compute the Minkowsky (L_p) distance between two vectors.
310 * Partial distance, used by the kd-tree.
331 * Compute the max distance (L_infinity) between two vectors
[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/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.cnstr/ |
| move_alloc.pass.cpp | 61 assert(std::distance(eq.first, eq.second) == 2);
69 assert(std::distance(eq.first, eq.second) == 2);
78 assert(std::distance(eq.first, eq.second) == 1);
83 assert(std::distance(eq.first, eq.second) == 1);
87 assert(std::distance(c.begin(), c.end()) == c.size());
88 assert(std::distance(c.cbegin(), c.cend()) == c.size());
125 assert(std::distance(eq.first, eq.second) == 2);
133 assert(std::distance(eq.first, eq.second) == 2);
142 assert(std::distance(eq.first, eq.second) == 1);
147 assert(std::distance(eq.first, eq.second) == 1)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/unord.multimap.cnstr/ |
| move_alloc.pass.cpp | 61 assert(std::distance(eq.first, eq.second) == 2);
69 assert(std::distance(eq.first, eq.second) == 2);
78 assert(std::distance(eq.first, eq.second) == 1);
83 assert(std::distance(eq.first, eq.second) == 1);
87 assert(std::distance(c.begin(), c.end()) == c.size());
88 assert(std::distance(c.cbegin(), c.cend()) == c.size());
125 assert(std::distance(eq.first, eq.second) == 2);
133 assert(std::distance(eq.first, eq.second) == 2);
142 assert(std::distance(eq.first, eq.second) == 1);
147 assert(std::distance(eq.first, eq.second) == 1)
[all...] |
| /external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.iter/ |
| before_begin.pass.cpp | 29 assert(std::distance(i, c.end()) == 1);
36 assert(std::distance(i, c.end()) == 1);
43 assert(std::distance(i, c.end()) == 1);
52 assert(std::distance(i, c.end()) == 11);
61 assert(std::distance(i, c.end()) == 11);
69 assert(std::distance(i, c.end()) == 1);
76 assert(std::distance(i, c.end()) == 1);
83 assert(std::distance(i, c.end()) == 1);
92 assert(std::distance(i, c.end()) == 11);
101 assert(std::distance(i, c.end()) == 11)
[all...] |
| /external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.modifiers/ |
| erase_after_one.pass.cpp | 29 assert(distance(c.begin(), c.end()) == 4);
37 assert(distance(c.begin(), c.end()) == 3);
44 assert(distance(c.begin(), c.end()) == 2);
50 assert(distance(c.begin(), c.end()) == 1);
56 assert(distance(c.begin(), c.end()) == 0);
67 assert(distance(c.begin(), c.end()) == 4);
75 assert(distance(c.begin(), c.end()) == 3);
82 assert(distance(c.begin(), c.end()) == 2);
88 assert(distance(c.begin(), c.end()) == 1);
94 assert(distance(c.begin(), c.end()) == 0)
[all...] |
| insert_after_init.pass.cpp | 29 assert(distance(c.begin(), c.end()) == 0);
33 assert(distance(c.begin(), c.end()) == 3);
40 assert(distance(c.begin(), c.end()) == 5);
55 assert(distance(c.begin(), c.end()) == 0);
59 assert(distance(c.begin(), c.end()) == 3);
66 assert(distance(c.begin(), c.end()) == 5);
|
| insert_after_range.pass.cpp | 33 assert(distance(c.begin(), c.end()) == 0);
37 assert(distance(c.begin(), c.end()) == 3);
44 assert(distance(c.begin(), c.end()) == 5);
61 assert(distance(c.begin(), c.end()) == 0);
65 assert(distance(c.begin(), c.end()) == 3);
72 assert(distance(c.begin(), c.end()) == 5);
|
| /external/libgdx/gdx/src/com/badlogic/gdx/math/ |
| Plane.java | 21 /** A plane defined via a unit length normal and the distance from the origin, as you learned in your math class.
45 /** Constructs a new plane based on the normal and distance to the origin.
48 * @param d The distance to the origin */
73 /** Sets the plane normal and distance to the origin based on the three given points which are considered to be on the plane.
84 /** Sets the plane normal and distance
89 * @param d distance to origin */
95 /** Calculates the shortest signed distance between the plane and the given point.
98 * @return the shortest signed distance between the plane and the point */
99 public float distance (Vector3 point) {
method in class:Plane
152 /** @return The distance to the origin */
[all...] |
| /external/skia/tests/ |
| PathCoverageTest.cpp | 48 static inline uint32_t estimate_pointCount(int distance) {
50 int shift = 30 - SkCLZ(distance);
70 int distance = estimate_distance(points); local
71 return estimate_pointCount(distance);
75 int distance = estimate_distance(points); local
76 return compute_pointCount(SkIntToScalar(distance), tol);
80 SkScalar distance = compute_distance(points); local
81 return estimate_pointCount(SkScalarRoundToInt(distance));
85 SkScalar distance = compute_distance(points); local
86 return compute_pointCount(distance, tol)
[all...] |
| /external/webp/src/enc/ |
| near_lossless.c | 26 // Computes quantized pixel value and distance from original value.
28 int* const val, int* const distance) {
31 *distance = 2 * abs(a - *val);
47 int candidate, distance; local
49 GetValAndDistance(a, val, bits, &candidate, &distance);
51 ++distance;
53 // Smallest distance but favor i == 0 over i == -1 and i == 1
56 if (distance < min_distance) {
57 min_distance = distance;
73 // Checks if distance between corresponding channel values of pixels a and
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.iter/ |
| before_begin.pass.cpp | 29 assert(std::distance(i, c.end()) == 1);
36 assert(std::distance(i, c.end()) == 1);
43 assert(std::distance(i, c.end()) == 1);
52 assert(std::distance(i, c.end()) == 11);
61 assert(std::distance(i, c.end()) == 11);
69 assert(std::distance(i, c.end()) == 1);
76 assert(std::distance(i, c.end()) == 1);
83 assert(std::distance(i, c.end()) == 1);
92 assert(std::distance(i, c.end()) == 11);
101 assert(std::distance(i, c.end()) == 11)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.modifiers/ |
| erase_after_one.pass.cpp | 29 assert(distance(c.begin(), c.end()) == 4);
37 assert(distance(c.begin(), c.end()) == 3);
44 assert(distance(c.begin(), c.end()) == 2);
50 assert(distance(c.begin(), c.end()) == 1);
56 assert(distance(c.begin(), c.end()) == 0);
67 assert(distance(c.begin(), c.end()) == 4);
75 assert(distance(c.begin(), c.end()) == 3);
82 assert(distance(c.begin(), c.end()) == 2);
88 assert(distance(c.begin(), c.end()) == 1);
94 assert(distance(c.begin(), c.end()) == 0)
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/grid/ |
| GridDropHandler.java | 93 // offset by the top left corner distance
125 // be considered and subtracted from the overall proposed distance!
264 int distance = abs(columnX - x1); local
265 if (distance <= max) {
266 columnMatches.add(new GridMatch(SegmentType.LEFT, distance, columnX, column,
297 int distance = abs((x1 + x2) / 2 - matchedLine); local
298 if (distance <= 2 * max) {
300 columnMatches.add(new GridMatch(SegmentType.CENTER_HORIZONTAL, distance,
310 int distance = mGrid.getRowDistance(row, y1); local
311 if (distance <= max)
322 int distance = mGrid.getRowDistance(rowBottom, y2); local
341 int distance = abs(dragBaselineY - rowBaselineY); local
357 int distance = abs(matchedLine - x1); local
365 int distance = abs(matchedLine - x2); local
376 int distance = abs(matchedLine - x1); local
418 int distance = abs(matchedLine - y1); local
426 int distance = abs(matchedLine - y2); local
437 int distance = abs(matchedLine - y1); local
616 int distance = abs(mColumnMatch.matchedLine - (maxX + mColumnMatch.margin)); local
[all...] |
| /external/opencv3/3rdparty/zlib/ |
| inffast.c | 33 Decode literal, length, and distance codes and write out the resulting
56 - The maximum input bits used by a length/distance pair is 15 bits for the
57 length code, 5 bits for the length extra, 15 bits for the distance code,
58 and 13 bits for the distance extra. This totals 48 bits, or six bytes.
62 - The maximum bytes that a single length/distance pair can output is 258
78 unsigned dmax; /* maximum distance from zlib header */
89 unsigned dmask; /* mask for first level of distance codes */
94 unsigned dist; /* match distance */
164 if (op & 16) { /* distance base */
178 strm->msg = (char *)"invalid distance too far back"
[all...] |
| /external/pdfium/third_party/zlib_v128/ |
| inffast.c | 33 Decode literal, length, and distance codes and write out the resulting
56 - The maximum input bits used by a length/distance pair is 15 bits for the
57 length code, 5 bits for the length extra, 15 bits for the distance code,
58 and 13 bits for the distance extra. This totals 48 bits, or six bytes.
62 - The maximum bytes that a single length/distance pair can output is 258
78 unsigned dmax; /* maximum distance from zlib header */
89 unsigned dmask; /* mask for first level of distance codes */
94 unsigned dist; /* match distance */
164 if (op & 16) { /* distance base */
178 strm->msg = (char *)"invalid distance too far back"
[all...] |
| /external/zlib/src/ |
| inffast.c | 33 Decode literal, length, and distance codes and write out the resulting
56 - The maximum input bits used by a length/distance pair is 15 bits for the
57 length code, 5 bits for the length extra, 15 bits for the distance code,
58 and 13 bits for the distance extra. This totals 48 bits, or six bytes.
62 - The maximum bytes that a single length/distance pair can output is 258
78 unsigned dmax; /* maximum distance from zlib header */
89 unsigned dmask; /* mask for first level of distance codes */
94 unsigned dist; /* match distance */
164 if (op & 16) { /* distance base */
178 strm->msg = (char *)"invalid distance too far back"
[all...] |
| /frameworks/rs/scriptc/ |
| rs_vector_math.rsh | 63 * distance: Distance between two points
65 * Compute the distance between two points.
70 distance(float left_vector, float right_vector);
73 distance(float2 left_vector, float2 right_vector);
76 distance(float3 left_vector, float3 right_vector);
79 distance(float4 left_vector, float4 right_vector);
83 distance(half left_vector, half right_vector);
88 distance(half2 left_vector, half2 right_vector);
93 distance(half3 left_vector, half3 right_vector)
[all...] |
| /prebuilts/sdk/renderscript/include/ |
| rs_vector_math.rsh | 63 * distance: Distance between two points
65 * Compute the distance between two points.
70 distance(float left_vector, float right_vector);
73 distance(float2 left_vector, float2 right_vector);
76 distance(float3 left_vector, float3 right_vector);
79 distance(float4 left_vector, float4 right_vector);
83 distance(half left_vector, half right_vector);
88 distance(half2 left_vector, half2 right_vector);
93 distance(half3 left_vector, half3 right_vector)
[all...] |
| /art/test/542-bitfield-rotates/src/ |
| Main.java | 53 public static int $noinline$rotate_int_right_reg_v_csubv(int value, int distance) {
57 return (value >>> distance) | (value << (32 - distance));
76 public static long $noinline$rotate_long_right_reg_v_csubv(long value, int distance) {
80 return (value >>> distance) | (value << (64 - distance));
99 public static int $noinline$rotate_int_left_reg_csubv_v(int value, int distance) {
103 return (value >>> (32 - distance)) | (value << distance);
122 public static long $noinline$rotate_long_left_reg_csubv_v(long value, int distance) {
[all...] |
| /external/eigen/test/ |
| geo_parametrizedline.cpp | 39 VERIFY_IS_MUCH_SMALLER_THAN( l0.distance(p0), RealScalar(1) );
40 VERIFY_IS_MUCH_SMALLER_THAN( l0.distance(p0+s0*d0), RealScalar(1) );
41 VERIFY_IS_APPROX( (l0.projection(p1)-p1).norm(), l0.distance(p1) );
42 VERIFY_IS_MUCH_SMALLER_THAN( l0.distance(l0.projection(p1)), RealScalar(1) );
43 VERIFY_IS_APPROX( Scalar(l0.distance((p0+s0*d0) + d0.unitOrthogonal() * s1)), s1 );
60 VERIFY_IS_MUCH_SMALLER_THAN(l0.distance(pi), RealScalar(1));
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.partitions/ |
| is_partitioned.pass.cpp | 35 assert(pred.count() <= std::distance(std::begin(ia), std::end(ia)));
43 assert(pred.count() <= std::distance(std::begin(ia), std::end(ia)));
51 assert(pred.count() <= std::distance(std::begin(ia), std::end(ia)));
59 assert(pred.count() <= std::distance(std::begin(ia), std::end(ia)));
67 assert(pred.count() <= std::distance(std::begin(ia), std::begin(ia)));
75 assert(pred.count() <= std::distance(std::begin(ia), std::end(ia)));
|
| /external/libcxx/test/std/containers/associative/set/set.cons/ |
| move.pass.cpp | 35 assert(distance(m.begin(), m.end()) == 0);
40 assert(distance(mo.begin(), mo.end()) == 0);
63 assert(distance(m.begin(), m.end()) == 3);
71 assert(distance(mo.begin(), mo.end()) == 0);
95 assert(distance(m.begin(), m.end()) == 3);
103 assert(distance(mo.begin(), mo.end()) == 0);
|
