| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/list_update_map_/ |
| info_fn_imps.hpp | 45 { return std::distance(begin(), end()); }
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/list_update_map_/ |
| info_fn_imps.hpp | 45 { return std::distance(begin(), end()); }
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/ext/pb_ds/detail/list_update_map_/ |
| info_fn_imps.hpp | 45 { return std::distance(begin(), end()); }
|
| /external/javassist/src/main/javassist/bytecode/ |
| LineNumberAttribute.java | 131 int distance = 0; local
133 distance = lineNumber(0) - line;
139 if ((d < 0 && d > distance)
140 || (d >= 0 && (d < distance || distance < 0))) {
141 distance = d;
148 res.line = line + distance;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/ |
| local_iterators.fail.cpp | 47 assert(std::distance(i, j) == 0);
52 assert(std::distance(i, j) == 2);
63 assert(std::distance(i, j) == 2);
73 assert(std::distance(i, j) == 1);
80 assert(std::distance(i, j) == 1);
87 assert(std::distance(i, j) == 0);
92 assert(std::distance(i, j) == 0);
112 assert(std::distance(i, j) == 0);
117 assert(std::distance(i, j) == 2);
127 assert(std::distance(i, j) == 2)
[all...] |
| local_iterators.pass.cpp | 49 assert(std::distance(i, j) == 0);
54 assert(std::distance(i, j) == 2);
64 assert(std::distance(i, j) == 2);
74 assert(std::distance(i, j) == 1);
81 assert(std::distance(i, j) == 1);
88 assert(std::distance(i, j) == 0);
93 assert(std::distance(i, j) == 0);
113 assert(std::distance(i, j) == 0);
118 assert(std::distance(i, j) == 2);
128 assert(std::distance(i, j) == 2)
[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(SkScalarRound(distance));
85 SkScalar distance = compute_distance(points); local
86 return compute_pointCount(distance, tol)
[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...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/ |
| local_iterators.pass.cpp | 49 assert(std::distance(i, j) == 0);
54 assert(std::distance(i, j) == 1);
61 assert(std::distance(i, j) == 1);
68 assert(std::distance(i, j) == 1);
75 assert(std::distance(i, j) == 1);
97 assert(std::distance(i, j) == 0);
102 assert(std::distance(i, j) == 1);
109 assert(std::distance(i, j) == 1);
116 assert(std::distance(i, j) == 1);
123 assert(std::distance(i, j) == 1)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/ |
| local_iterators.pass.cpp | 48 assert(std::distance(i, j) == 0);
53 assert(std::distance(i, j) == 1);
59 assert(std::distance(i, j) == 1);
65 assert(std::distance(i, j) == 1);
71 assert(std::distance(i, j) == 1);
92 assert(std::distance(i, j) == 0);
97 assert(std::distance(i, j) == 1);
103 assert(std::distance(i, j) == 1);
109 assert(std::distance(i, j) == 1);
115 assert(std::distance(i, j) == 1)
[all...] |
| /external/chromium_org/third_party/skia/src/effects/ |
| SkDiscretePathEffect.cpp | 47 SkScalar distance = 0; local
51 distance += delta/2;
54 if (meas.getPosTan(distance, &p, &v)) {
59 distance += delta;
60 if (meas.getPosTan(distance, &p, &v)) {
|
| /external/eigen/test/eigen2/ |
| eigen2_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 );
|
| /external/openfst/src/bin/ |
| fstshortestdistance.cc | 26 #include <fst/script/shortest-distance.h>
39 string usage = "Finds shortest distance(s) in an FST.\n\n Usage: ";
41 usage += " [in.fst [distance.txt]]\n";
56 vector<s::WeightClass> distance;
83 s::ShortestDistance(*ifst, &distance, FLAGS_reverse, FLAGS_delta);
87 s::ShortestDistance(*ifst, &distance, opts);
90 s::WritePotentials(out_fname, distance);
|
| /external/skia/src/effects/ |
| SkDiscretePathEffect.cpp | 47 SkScalar distance = 0; local
51 distance += delta/2;
54 if (meas.getPosTan(distance, &p, &v)) {
59 distance += delta;
60 if (meas.getPosTan(distance, &p, &v)) {
|
| /frameworks/base/core/java/android/gesture/ |
| InstanceLearner.java | 54 double distance; local
56 distance = GestureUtils.minimumCosineDistance(sample.vector, vector, orientationType);
58 distance = GestureUtils.squaredEuclideanDistance(sample.vector, vector);
61 if (distance == 0) {
64 weight = 1 / distance;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.cons/ |
| size_value_alloc.pass.cpp | 25 assert(std::distance(l.begin(), l.end()) == 3);
36 assert(std::distance(l.begin(), l.end()) == 3);
47 assert(std::distance(l.begin(), l.end()) == 3);
59 assert(std::distance(l.begin(), l.end()) == 3);
70 assert(std::distance(l.begin(), l.end()) == 3);
|
| /external/chromium-trace/trace-viewer/third_party/closure_linter/closure_linter/ |
| tokenutil.py | 98 def CustomSearch(start_token, func, end_func=None, distance=None,
100 """Returns the first token where func is True within distance of this token.
107 distance: The number of tokens to look through before failing search. Must
114 The first token matching func within distance of this token, or None if no
119 while token and (distance is None or distance > 0):
128 if distance is not None:
129 distance -= 1
132 while token and (distance is None or distance > 0)
[all...] |
| /external/chromium_org/third_party/closure_linter/closure_linter/ |
| tokenutil.py | 98 def CustomSearch(start_token, func, end_func=None, distance=None,
100 """Returns the first token where func is True within distance of this token.
107 distance: The number of tokens to look through before failing search. Must
114 The first token matching func within distance of this token, or None if no
119 while token and (distance is None or distance > 0):
128 if distance is not None:
129 distance -= 1
132 while token and (distance is None or distance > 0)
[all...] |
| /external/openfst/src/include/fst/script/ |
| rmepsilon.h | 26 #include <fst/script/shortest-distance.h> // for ShortestDistanceOptions
33 %include "nlp/fst/script/shortest-distance.h"
66 vector<typename Arc::Weight> *distance,
76 AutoQueue<StateId> queue(*fst, distance, EpsilonArcFilter<Arc>());
80 RmEpsilon(fst, distance, ropts);
88 RmEpsilon(fst, distance, ropts);
96 RmEpsilon(fst, distance, ropts);
100 NaturalShortestFirstQueue<StateId, Weight> queue(*distance);
105 RmEpsilon(fst, distance, ropts);
113 RmEpsilon(fst, distance, ropts)
138 vector<typename Arc::Weight> distance; local
[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/openfst/src/include/fst/ |
| shortest-path.h | 33 #include <fst/shortest-distance.h>
46 bool has_distance; // distance vector already contains the
47 // shortest distance from the initial state
68 // 'ifst'. 'distance' returns the shortest distances from the source
80 vector<typename Arc::Weight> *distance,
103 distance->clear();
125 while (distance->size() < source) {
126 distance->push_back(Weight::Zero());
131 distance->push_back(Weight::One());
141 Weight sd = (*distance)[s]
489 vector<typename Arc::Weight> distance; local
[all...] |
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkLineParameters.h | 18 // The distance to the line for (x, y) is d(x,y) = ax + by + c
21 // distance, it's necessary to either call normalize() after xxxEndPoints(), or
78 void cubicDistanceY(const SkDCubic& pts, SkDCubic& distance) const {
81 distance[index].fX = index * oneThird;
82 distance[index].fY = a * pts[index].fX + b * pts[index].fY + c;
86 void quadDistanceY(const SkDQuad& pts, SkDQuad& distance) const {
89 distance[index].fX = index * oneHalf;
90 distance[index].fY = a * pts[index].fX + b * pts[index].fY + c;
|
| /external/skia/src/pathops/ |
| SkLineParameters.h | 18 // The distance to the line for (x, y) is d(x,y) = ax + by + c
21 // distance, it's necessary to either call normalize() after xxxEndPoints(), or
78 void cubicDistanceY(const SkDCubic& pts, SkDCubic& distance) const {
81 distance[index].fX = index * oneThird;
82 distance[index].fY = a * pts[index].fX + b * pts[index].fY + c;
86 void quadDistanceY(const SkDQuad& pts, SkDQuad& distance) const {
89 distance[index].fX = index * oneHalf;
90 distance[index].fY = a * pts[index].fX + b * pts[index].fY + c;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/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);
|
