| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/ |
| local_iterators.fail.cpp | 46 assert(std::distance(i, j) == 0);
51 assert(std::distance(i, j) == 2);
60 assert(std::distance(i, j) == 2);
68 assert(std::distance(i, j) == 1);
74 assert(std::distance(i, j) == 1);
80 assert(std::distance(i, j) == 0);
85 assert(std::distance(i, j) == 0);
105 assert(std::distance(i, j) == 0);
110 assert(std::distance(i, j) == 2);
118 assert(std::distance(i, j) == 2)
[all...] |
| equal_range_const.pass.cpp | 44 assert(std::distance(r.first, r.second) == 1);
47 assert(std::distance(r.first, r.second) == 0);
49 assert(std::distance(r.first, r.second) == 1);
72 assert(std::distance(r.first, r.second) == 1);
75 assert(std::distance(r.first, r.second) == 0);
77 assert(std::distance(r.first, r.second) == 1);
|
| equal_range_non_const.pass.cpp | 44 assert(std::distance(r.first, r.second) == 1);
47 assert(std::distance(r.first, r.second) == 0);
49 assert(std::distance(r.first, r.second) == 1);
72 assert(std::distance(r.first, r.second) == 1);
75 assert(std::distance(r.first, r.second) == 0);
77 assert(std::distance(r.first, r.second) == 1);
|
| /external/chromium_org/third_party/skia/include/core/ |
| SkPathMeasure.h | 37 /** Pins distance to 0 <= distance <= getLength(), and then computes
42 bool SK_WARN_UNUSED_RESULT getPosTan(SkScalar distance, SkPoint* position,
51 /** Pins distance to 0 <= distance <= getLength(), and then computes
56 bool SK_WARN_UNUSED_RESULT getMatrix(SkScalar distance, SkMatrix* matrix,
59 /** Given a start and stop distance, return in dst the intervening segment(s).
89 SkScalar fDistance; // total distance up to this point
102 SkScalar compute_quad_segs(const SkPoint pts[3], SkScalar distance,
104 SkScalar compute_cubic_segs(const SkPoint pts[3], SkScalar distance,
[all...] |
| /external/openfst/src/script/ |
| shortest-distance.cc | 19 #include <fst/script/shortest-distance.h>
25 void ShortestDistance(const FstClass &fst, vector<WeightClass> *distance,
27 ShortestDistanceArgs1 args(fst, distance, opts);
34 void ShortestDistance(const FstClass &ifst, vector<WeightClass> *distance,
36 ShortestDistanceArgs2 args(ifst, distance, reverse, delta);
|
| /external/skia/include/core/ |
| SkPathMeasure.h | 37 /** Pins distance to 0 <= distance <= getLength(), and then computes
42 bool SK_WARN_UNUSED_RESULT getPosTan(SkScalar distance, SkPoint* position,
51 /** Pins distance to 0 <= distance <= getLength(), and then computes
56 bool SK_WARN_UNUSED_RESULT getMatrix(SkScalar distance, SkMatrix* matrix,
59 /** Given a start and stop distance, return in dst the intervening segment(s).
89 SkScalar fDistance; // total distance up to this point
102 SkScalar compute_quad_segs(const SkPoint pts[3], SkScalar distance,
104 SkScalar compute_cubic_segs(const SkPoint pts[3], SkScalar distance,
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.cons/ |
| size_type.pass.cpp | 25 assert(std::distance(l.begin(), l.end()) == 3);
36 assert(std::distance(l.begin(), l.end()) == 3);
48 assert(std::distance(l.begin(), l.end()) == 3);
55 assert(std::distance(l.begin(), l.end()) == 3);
67 assert(std::distance(l.begin(), l.end()) == 3);
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
| SelectionHandle.java | 107 * Determines whether the given {@link LayoutPoint} is within the given distance in
108 * layout coordinates. The distance should incorporate at least the equivalent
109 * distance to the control coordinate space {@link #PIXEL_RADIUS}, but usually with a
113 * @param distance the distance from the center of the handle to check whether the
115 * @return true if the given point is within the given distance of this handle
117 public boolean contains(LayoutPoint point, int distance) {
118 return (point.x >= centerX - distance
119 && point.x <= centerX + distance
120 && point.y >= centerY - distance
[all...] |
| /external/chromium_org/third_party/skia/src/core/ |
| SkPathMeasure.cpp | 89 SkScalar distance, int mint, int maxt, int ptIndex) {
95 distance = this->compute_quad_segs(tmp, distance, mint, halft, ptIndex);
96 distance = this->compute_quad_segs(&tmp[2], distance, halft, maxt, ptIndex);
98 SkScalar d = SkPoint::Distance(pts[0], pts[2]);
99 SkScalar prevD = distance;
100 distance += d;
101 if (distance > prevD) {
103 seg->fDistance = distance;
139 SkScalar distance = 0; local
[all...] |
| /external/skia/src/core/ |
| SkPathMeasure.cpp | 89 SkScalar distance, int mint, int maxt, int ptIndex) {
95 distance = this->compute_quad_segs(tmp, distance, mint, halft, ptIndex);
96 distance = this->compute_quad_segs(&tmp[2], distance, halft, maxt, ptIndex);
98 SkScalar d = SkPoint::Distance(pts[0], pts[2]);
99 SkScalar prevD = distance;
100 distance += d;
101 if (distance > prevD) {
103 seg->fDistance = distance;
139 SkScalar distance = 0; local
[all...] |
| /external/openfst/src/include/fst/ |
| shortest-distance.h | 1 // shortest-distance.h
19 // Functions and classes to find shortest distance in an FST.
63 // Computation state of the shortest-distance algorithm. Reusable
68 // may not be freed before this class. Vector 'distance' should not be
79 vector<Weight> *distance,
82 : fst_(fst), distance_(distance), state_queue_(opts.state_queue),
104 vector<Weight> rdistance_; // Relaxation distance.
113 // Compute the shortest distance. If 'source' is kNoStateId, use
223 // Shortest-distance algorithm: this version allows fine control
226 // This computes the shortest distance from the 'opts.source' state t
326 vector<Weight> distance; local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.ops/ |
| splice_pos_list.pass.cpp | 32 assert(distance(l1.begin(), l1.end()) == 0);
34 assert(distance(l2.begin(), l2.end()) == 0);
41 assert(distance(l1.begin(), l1.end()) == 1);
43 assert(distance(l2.begin(), l2.end()) == 0);
52 assert(distance(l1.begin(), l1.end()) == 2);
54 assert(distance(l2.begin(), l2.end()) == 0);
65 assert(distance(l1.begin(), l1.end()) == 3);
67 assert(distance(l2.begin(), l2.end()) == 0);
80 assert(distance(l1.begin(), l1.end()) == 1);
82 assert(distance(l2.begin(), l2.end()) == 0)
[all...] |
| /external/chromium_org/native_client_sdk/src/examples/demo/flock/ |
| goose.h | 74 // @param distance The distance from this goose to the neighbouring goose.
84 int32_t AccumulateSeparation(double distance,
93 // @param distance The distance from this goose to the neighbouring goose.
101 int32_t AccumulateAlignment(double distance,
110 // @param {!number} distance The distance from this goose to the neighbouring
120 int32_t AccumulateCohesion(double distance,
|
| /external/openfst/src/include/fst/script/ |
| prune.h | 35 const vector<WeightClass> *distance; member in struct:fst::script::PruneOptions
42 distance(d),
50 // If the original opts.distance is not NULL, a new distance will be
61 vector<Weight> *distance = 0; local
63 if (opts.distance) {
64 distance = new vector<Weight>(opts.distance->size());
65 for (unsigned i = 0; i < opts.distance->size(); ++i) {
66 (*distance)[i] = *((*opts.distance)[i].GetWeight<Weight>())
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/ |
| iterator.pass.cpp | 66 assert(std::distance(m.begin(), m.end()) == m.size());
67 assert(std::distance(m.rbegin(), m.rend()) == m.size());
106 assert(std::distance(m.begin(), m.end()) == m.size());
107 assert(std::distance(m.cbegin(), m.cend()) == m.size());
108 assert(std::distance(m.rbegin(), m.rend()) == m.size());
109 assert(std::distance(m.crbegin(), m.crend()) == m.size());
147 assert(std::distance(m.begin(), m.end()) == m.size());
148 assert(std::distance(m.rbegin(), m.rend()) == m.size());
187 assert(std::distance(m.begin(), m.end()) == m.size());
188 assert(std::distance(m.cbegin(), m.cend()) == m.size())
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/ |
| iterator.pass.cpp | 66 assert(std::distance(m.begin(), m.end()) == m.size());
67 assert(std::distance(m.rbegin(), m.rend()) == m.size());
105 assert(std::distance(m.begin(), m.end()) == m.size());
106 assert(std::distance(m.cbegin(), m.cend()) == m.size());
107 assert(std::distance(m.rbegin(), m.rend()) == m.size());
108 assert(std::distance(m.crbegin(), m.crend()) == m.size());
145 assert(std::distance(m.begin(), m.end()) == m.size());
146 assert(std::distance(m.rbegin(), m.rend()) == m.size());
184 assert(std::distance(m.begin(), m.end()) == m.size());
185 assert(std::distance(m.cbegin(), m.cend()) == m.size())
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/unord.multimap.modifiers/ |
| erase_const_iter.pass.cpp | 45 assert(std::distance(eq.first, eq.second) == 2);
53 assert(std::distance(eq.first, eq.second) == 1);
58 assert(std::distance(eq.first, eq.second) == 1);
63 assert(std::distance(eq.first, eq.second) == 1);
67 assert(std::distance(c.begin(), c.end()) == c.size());
68 assert(std::distance(c.cbegin(), c.cend()) == c.size());
91 assert(std::distance(eq.first, eq.second) == 2);
99 assert(std::distance(eq.first, eq.second) == 1);
104 assert(std::distance(eq.first, eq.second) == 1);
109 assert(std::distance(eq.first, eq.second) == 1)
[all...] |
| insert_init.pass.cpp | 45 assert(std::distance(eq.first, eq.second) == 2);
53 assert(std::distance(eq.first, eq.second) == 2);
61 assert(std::distance(eq.first, eq.second) == 1);
66 assert(std::distance(eq.first, eq.second) == 1);
70 assert(std::distance(c.begin(), c.end()) == c.size());
71 assert(std::distance(c.cbegin(), c.cend()) == c.size());
92 assert(std::distance(eq.first, eq.second) == 2);
100 assert(std::distance(eq.first, eq.second) == 2);
108 assert(std::distance(eq.first, eq.second) == 1);
113 assert(std::distance(eq.first, eq.second) == 1)
[all...] |
| insert_range.pass.cpp | 45 assert(std::distance(eq.first, eq.second) == 2);
53 assert(std::distance(eq.first, eq.second) == 2);
61 assert(std::distance(eq.first, eq.second) == 1);
66 assert(std::distance(eq.first, eq.second) == 1);
70 assert(std::distance(c.begin(), c.end()) == c.size());
71 assert(std::distance(c.cbegin(), c.cend()) == c.size());
92 assert(std::distance(eq.first, eq.second) == 2);
100 assert(std::distance(eq.first, eq.second) == 2);
108 assert(std::distance(eq.first, eq.second) == 1);
113 assert(std::distance(eq.first, eq.second) == 1)
[all...] |
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/aux_/ |
| size_impl.hpp | 19 #include <boost/mpl/distance.hpp>
33 : distance<
40 typedef typename distance<
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.modifiers/ |
| erase_iter.pass.cpp | 28 assert(distance(l1.begin(), l1.end()) == 2);
35 assert(distance(l1.begin(), l1.end()) == 1);
40 assert(distance(l1.begin(), l1.end()) == 0);
50 assert(distance(l1.begin(), l1.end()) == 2);
57 assert(distance(l1.begin(), l1.end()) == 1);
62 assert(distance(l1.begin(), l1.end()) == 0);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.modifiers/ |
| erase_iter.pass.cpp | 28 assert(distance(l1.begin(), l1.end()) == 2);
35 assert(distance(l1.begin(), l1.end()) == 1);
40 assert(distance(l1.begin(), l1.end()) == 0);
50 assert(distance(l1.begin(), l1.end()) == 2);
57 assert(distance(l1.begin(), l1.end()) == 1);
62 assert(distance(l1.begin(), l1.end()) == 0);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector.bool/ |
| erase_iter.pass.cpp | 29 assert(distance(l1.begin(), l1.end()) == 2);
36 assert(distance(l1.begin(), l1.end()) == 1);
41 assert(distance(l1.begin(), l1.end()) == 0);
50 assert(distance(l1.begin(), l1.end()) == 2);
57 assert(distance(l1.begin(), l1.end()) == 1);
62 assert(distance(l1.begin(), l1.end()) == 0);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/ |
| equal_range_const.pass.cpp | 44 assert(std::distance(r.first, r.second) == 1);
47 assert(std::distance(r.first, r.second) == 0);
49 assert(std::distance(r.first, r.second) == 3);
77 assert(std::distance(r.first, r.second) == 1);
80 assert(std::distance(r.first, r.second) == 0);
82 assert(std::distance(r.first, r.second) == 3);
|
| equal_range_non_const.pass.cpp | 44 assert(std::distance(r.first, r.second) == 1);
47 assert(std::distance(r.first, r.second) == 0);
49 assert(std::distance(r.first, r.second) == 3);
77 assert(std::distance(r.first, r.second) == 1);
80 assert(std::distance(r.first, r.second) == 0);
82 assert(std::distance(r.first, r.second) == 3);
|
