| /external/pdfium/third_party/freetype/src/base/ |
| ftapi.c | 65 FT_Long distance )
67 return FT_Stream_Skip( stream, distance );
|
| /external/pdfium/third_party/zlib_v128/ |
| inflate.h | 39 CODELENS, /* i: waiting for length/lit and distance code lengths */
43 DIST, /* i: waiting for distance code */
44 DISTEXT, /* i: waiting for distance extra bits */
87 unsigned dmax; /* zlib header max distance (INFLATE_STRICT) */
102 unsigned offset; /* distance back to copy string from */
107 code const FAR *distcode; /* starting table for distance codes */
113 unsigned ndist; /* number of distance code lengths */
119 int sane; /* if false, allow invalid distance too far */
|
| /external/skia/src/effects/ |
| Sk1DPathEffect.cpp | 21 SkScalar distance = this->begin(length); local
22 while (distance < length) {
23 SkScalar delta = this->next(dst, distance, meas);
27 distance += delta;
170 SkScalar SkPath1DPathEffect::next(SkPath* dst, SkScalar distance,
175 if (meas.getPosTan(distance, &pos, nullptr)) {
181 if (meas.getMatrix(distance, &matrix)) {
186 morphpath(dst, fPath, meas, distance);
|
| /external/skia/src/pathops/ |
| SkLineParameters.h | 22 // The distance to the line for (x, y) is d(x,y) = ax + by + c
25 // distance, it's necessary to either call normalize() after xxxEndPoints(), or
138 void cubicDistanceY(const SkDCubic& pts, SkDCubic& distance) const {
141 distance[index].fX = index * oneThird;
142 distance[index].fY = fA * pts[index].fX + fB * pts[index].fY + fC;
146 void quadDistanceY(const SkDQuad& pts, SkDQuad& distance) const {
149 distance[index].fX = index * oneHalf;
150 distance[index].fY = fA * pts[index].fX + fB * pts[index].fY + fC;
|
| /external/zlib/src/ |
| inflate.h | 39 CODELENS, /* i: waiting for length/lit and distance code lengths */
43 DIST, /* i: waiting for distance code */
44 DISTEXT, /* i: waiting for distance extra bits */
87 unsigned dmax; /* zlib header max distance (INFLATE_STRICT) */
102 unsigned offset; /* distance back to copy string from */
107 code const FAR *distcode; /* starting table for distance codes */
113 unsigned ndist; /* number of distance code lengths */
119 int sane; /* if false, allow invalid distance too far */
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.cons/ |
| move.pass.cpp | 35 assert(distance(m.begin(), m.end()) == 0);
40 assert(distance(mo.begin(), mo.end()) == 0);
62 assert(distance(m.begin(), m.end()) == 3);
70 assert(distance(mo.begin(), mo.end()) == 0);
81 assert(distance(m.begin(), m.end()) == 0);
86 assert(distance(mo.begin(), mo.end()) == 0);
108 assert(distance(m.begin(), m.end()) == 3);
116 assert(distance(mo.begin(), mo.end()) == 0);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/multimap.cons/ |
| move.pass.cpp | 35 assert(distance(m.begin(), m.end()) == 0);
40 assert(distance(mo.begin(), mo.end()) == 0);
62 assert(distance(m.begin(), m.end()) == 9);
76 assert(distance(mo.begin(), mo.end()) == 0);
87 assert(distance(m.begin(), m.end()) == 0);
92 assert(distance(mo.begin(), mo.end()) == 0);
114 assert(distance(m.begin(), m.end()) == 9);
128 assert(distance(mo.begin(), mo.end()) == 0);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/dynarray/dynarray.overview/ |
| begin_end.pass.cpp | 50 assert ( dyn.size () == std::distance ( dyn.begin(), dyn.end()));
51 assert ( dyn.size () == std::distance ( dyn.cbegin(), dyn.cend()));
52 assert ( dyn.size () == std::distance ( dyn.rbegin(), dyn.rend()));
53 assert ( dyn.size () == std::distance ( dyn.crbegin(), dyn.crend()));
72 assert ( dyn.size () == std::distance ( dyn.begin(), dyn.end()));
73 assert ( dyn.size () == std::distance ( dyn.cbegin(), dyn.cend()));
74 assert ( dyn.size () == std::distance ( dyn.rbegin(), dyn.rend()));
75 assert ( dyn.size () == std::distance ( dyn.crbegin(), dyn.crend()));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.iter/ |
| iterators.pass.cpp | 33 assert(std::distance(i, j) == 0);
42 assert(std::distance(i, j) == 0);
51 assert(std::distance(i, j) == 0);
66 assert(std::distance(c.begin(), c.end()) == 10);
81 assert(std::distance(i, j) == 0);
90 assert(std::distance(i, j) == 0);
99 assert(std::distance(i, j) == 0);
114 assert(std::distance(c.begin(), c.end()) == 10);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.modifiers/ |
| emplace_after.pass.cpp | 32 assert(distance(c.begin(), c.end()) == 1);
38 assert(distance(c.begin(), c.end()) == 2);
45 assert(distance(c.begin(), c.end()) == 3);
53 assert(distance(c.begin(), c.end()) == 4);
64 assert(distance(c.begin(), c.end()) == 1);
70 assert(distance(c.begin(), c.end()) == 2);
77 assert(distance(c.begin(), c.end()) == 3);
85 assert(distance(c.begin(), c.end()) == 4);
|
| insert_after_rv.pass.cpp | 32 assert(distance(c.begin(), c.end()) == 1);
38 assert(distance(c.begin(), c.end()) == 2);
45 assert(distance(c.begin(), c.end()) == 3);
53 assert(distance(c.begin(), c.end()) == 4);
65 assert(distance(c.begin(), c.end()) == 1);
71 assert(distance(c.begin(), c.end()) == 2);
78 assert(distance(c.begin(), c.end()) == 3);
86 assert(distance(c.begin(), c.end()) == 4);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/ |
| iterators.pass.cpp | 39 assert(std::distance(i, j) == 0);
48 assert(std::distance(i, j) == 0);
57 assert(std::distance(i, j) == 0);
72 assert(std::distance(c.begin(), c.end()) == 10);
87 assert(std::distance(i, j) == 0);
96 assert(std::distance(i, j) == 0);
105 assert(std::distance(i, j) == 0);
120 assert(std::distance(c.begin(), c.end()) == 10);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.modifiers/ |
| erase_iter_iter.pass.cpp | 26 assert(distance(l1.cbegin(), l1.cend()) == 3);
33 assert(distance(l1.cbegin(), l1.cend()) == 2);
41 assert(distance(l1.cbegin(), l1.cend()) == 1);
49 assert(distance(l1.cbegin(), l1.cend()) == 0);
57 assert(distance(l1.cbegin(), l1.cend()) == 3);
64 assert(distance(l1.cbegin(), l1.cend()) == 2);
72 assert(distance(l1.cbegin(), l1.cend()) == 1);
80 assert(distance(l1.cbegin(), l1.cend()) == 0);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/ |
| iterators.pass.cpp | 39 assert(std::distance(i, j) == 0);
48 assert(std::distance(i, j) == 0);
57 assert(std::distance(i, j) == 0);
72 assert(std::distance(c.begin(), c.end()) == 10);
87 assert(std::distance(i, j) == 0);
96 assert(std::distance(i, j) == 0);
105 assert(std::distance(i, j) == 0);
120 assert(std::distance(c.begin(), c.end()) == 10);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.modifiers/ |
| erase_iter_iter.pass.cpp | 28 assert(distance(l1.cbegin(), l1.cend()) == 3);
37 assert(distance(l1.cbegin(), l1.cend()) == 2);
47 assert(distance(l1.cbegin(), l1.cend()) == 1);
57 assert(distance(l1.cbegin(), l1.cend()) == 0);
80 assert(distance(l1.cbegin(), l1.cend()) == 3);
89 assert(distance(l1.cbegin(), l1.cend()) == 2);
99 assert(distance(l1.cbegin(), l1.cend()) == 1);
109 assert(distance(l1.cbegin(), l1.cend()) == 0);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector.bool/ |
| erase_iter_iter.pass.cpp | 27 assert(distance(l1.cbegin(), l1.cend()) == 3);
34 assert(distance(l1.cbegin(), l1.cend()) == 2);
42 assert(distance(l1.cbegin(), l1.cend()) == 1);
50 assert(distance(l1.cbegin(), l1.cend()) == 0);
58 assert(distance(l1.cbegin(), l1.cend()) == 3);
65 assert(distance(l1.cbegin(), l1.cend()) == 2);
73 assert(distance(l1.cbegin(), l1.cend()) == 1);
81 assert(distance(l1.cbegin(), l1.cend()) == 0);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/ |
| iterators.pass.cpp | 46 assert(std::distance(c.begin(), c.end()) == c.size());
47 assert(std::distance(c.cbegin(), c.cend()) == c.size());
65 assert(std::distance(c.begin(), c.end()) == c.size());
66 assert(std::distance(c.cbegin(), c.cend()) == c.size());
86 assert(std::distance(c.begin(), c.end()) == c.size());
87 assert(std::distance(c.cbegin(), c.cend()) == c.size());
106 assert(std::distance(c.begin(), c.end()) == c.size());
107 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/ |
| iterators.pass.cpp | 46 assert(std::distance(c.begin(), c.end()) == c.size());
47 assert(std::distance(c.cbegin(), c.cend()) == c.size());
68 assert(std::distance(c.begin(), c.end()) == c.size());
69 assert(std::distance(c.cbegin(), c.cend()) == c.size());
89 assert(std::distance(c.begin(), c.end()) == c.size());
90 assert(std::distance(c.cbegin(), c.cend()) == c.size());
112 assert(std::distance(c.begin(), c.end()) == c.size());
113 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/ |
| iterators.pass.cpp | 45 assert(std::distance(c.begin(), c.end()) == c.size());
46 assert(std::distance(c.cbegin(), c.cend()) == c.size());
64 assert(std::distance(c.begin(), c.end()) == c.size());
65 assert(std::distance(c.cbegin(), c.cend()) == c.size());
85 assert(std::distance(c.begin(), c.end()) == c.size());
86 assert(std::distance(c.cbegin(), c.cend()) == c.size());
105 assert(std::distance(c.begin(), c.end()) == c.size());
106 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/unord.multiset.cnstr/ |
| init.pass.cpp | 55 assert(std::distance(c.begin(), c.end()) == c.size());
56 assert(std::distance(c.cbegin(), c.cend()) == c.size());
86 assert(std::distance(c.begin(), c.end()) == c.size());
87 assert(std::distance(c.cbegin(), c.cend()) == c.size());
120 assert(std::distance(c.begin(), c.end()) == c.size());
121 assert(std::distance(c.cbegin(), c.cend()) == c.size());
155 assert(std::distance(c.begin(), c.end()) == c.size());
156 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/ |
| iterators.pass.cpp | 45 assert(std::distance(c.begin(), c.end()) == c.size());
46 assert(std::distance(c.cbegin(), c.cend()) == c.size());
64 assert(std::distance(c.begin(), c.end()) == c.size());
65 assert(std::distance(c.cbegin(), c.cend()) == c.size());
85 assert(std::distance(c.begin(), c.end()) == c.size());
86 assert(std::distance(c.cbegin(), c.cend()) == c.size());
105 assert(std::distance(c.begin(), c.end()) == c.size());
106 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/unord.set.cnstr/ |
| init.pass.cpp | 55 assert(std::distance(c.begin(), c.end()) == c.size());
56 assert(std::distance(c.cbegin(), c.cend()) == c.size());
86 assert(std::distance(c.begin(), c.end()) == c.size());
87 assert(std::distance(c.cbegin(), c.cend()) == c.size());
120 assert(std::distance(c.begin(), c.end()) == c.size());
121 assert(std::distance(c.cbegin(), c.cend()) == c.size());
155 assert(std::distance(c.begin(), c.end()) == c.size());
156 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/NarrowPhaseCollision/ |
| btGjkPairDetector.cpp | 88 btScalar distance=btScalar(0.); local
292 distance = ((btScalar(1.)/rlen) - margin);
303 (m_catchDegeneracies && m_penetrationDepthSolver && m_degenerateSimplex && ((distance+margin) < 0.01));
343 if (!isValid || (distance2 < distance))
345 distance = distance2;
365 ///reports a valid positive distance. Use the results of the second GJK instead of failing.
373 //only replace valid distances when the distance is less
374 if (!isValid || (distance2 < distance))
376 distance = distance2;
400 if (isValid && ((distance < 0) || (distance*distance < input.m_maximumDistanceSquared))
[all...] |
| /external/opencv3/doc/py_tutorials/py_feature2d/py_matcher/ |
| py_matcher.markdown | 15 with all other features in second set using some distance calculation. And the closest one is
19 optional params. First one is normType. It specifies the distance measurement to be used. By
22 Hamming distance as measurement. If ORB is using WTA_K == 3 or 4, cv2.NORM_HAMMING2 should be
41 Let's see one example for each of SURF and ORB (Both use different distance measurements).
66 Next we create a BFMatcher object with distance measurement cv2.NORM_HAMMING (since we are using
69 (with low distance) come to front. Then we draw only first 10 matches (Just for sake of visibility.
78 # Sort them in the order of their distance.
79 matches = sorted(matches, key = lambda x:x.distance)
95 - DMatch.distance - Distance between descriptors. The lower, the better it is
[all...] |
| /external/chromium-trace/catapult/telemetry/telemetry/page/ |
| action_runner.py | 328 direction='down', distance=None, distance_expr=None,
333 You may specify distance or distance_expr, but not both. If
334 neither is specified, the default scroll distance is variable
346 distance: The distance to scroll (in pixel).
348 evaluated to compute scroll distance. Example:
358 direction=direction, distance=distance, distance_expr=distance_expr,
389 direction='down', distance=None, distance_expr=None,
397 You may specify distance or distance_expr, but not both. I
[all...] |
