/external/autotest/client/site_tests/firmware_TouchMTB/geometry/ |
H A D | two_farthest_clusters.py | 30 dist = p1.distance(p2) 59 (cluster1 if p.distance(fp1) <= p.distance(fp2) else cluster2).append(p)
|
/external/libcxx/test/std/containers/associative/multiset/ |
H A D | iterator.pass.cpp | 68 assert(static_cast<std::size_t>(std::distance(m.begin(), m.end())) == m.size()); 69 assert(static_cast<std::size_t>(std::distance(m.rbegin(), m.rend())) == m.size()); 108 assert(static_cast<std::size_t>(std::distance(m.begin(), m.end())) == m.size()); 109 assert(static_cast<std::size_t>(std::distance(m.cbegin(), m.cend())) == m.size()); 110 assert(static_cast<std::size_t>(std::distance(m.rbegin(), m.rend())) == m.size()); 111 assert(static_cast<std::size_t>(std::distance(m.crbegin(), m.crend())) == m.size()); 149 assert(static_cast<std::size_t>(std::distance(m.begin(), m.end())) == m.size()); 150 assert(static_cast<std::size_t>(std::distance(m.rbegin(), m.rend())) == m.size()); 189 assert(static_cast<std::size_t>(std::distance(m.begin(), m.end())) == m.size()); 190 assert(static_cast<std::size_t>(std::distance( [all...] |
/external/libcxx/test/std/containers/associative/set/ |
H A D | iterator.pass.cpp | 68 assert(static_cast<std::size_t>(std::distance(m.begin(), m.end())) == m.size()); 69 assert(static_cast<std::size_t>(std::distance(m.rbegin(), m.rend())) == m.size()); 107 assert(static_cast<std::size_t>(std::distance(m.begin(), m.end())) == m.size()); 108 assert(static_cast<std::size_t>(std::distance(m.cbegin(), m.cend())) == m.size()); 109 assert(static_cast<std::size_t>(std::distance(m.rbegin(), m.rend())) == m.size()); 110 assert(static_cast<std::size_t>(std::distance(m.crbegin(), m.crend())) == m.size()); 147 assert(static_cast<std::size_t>(std::distance(m.begin(), m.end())) == m.size()); 148 assert(static_cast<std::size_t>(std::distance(m.rbegin(), m.rend())) == m.size()); 186 assert(static_cast<std::size_t>(std::distance(m.begin(), m.end())) == m.size()); 187 assert(static_cast<std::size_t>(std::distance( [all...] |
/external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.modifiers/ |
H A D | insert_init.pass.cpp | 47 assert(std::distance(eq.first, eq.second) == 2); 55 assert(std::distance(eq.first, eq.second) == 2); 63 assert(std::distance(eq.first, eq.second) == 1); 68 assert(std::distance(eq.first, eq.second) == 1); 72 assert(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size()); 73 assert(static_cast<std::size_t>(std::distance(c.cbegin(), c.cend())) == c.size()); 93 assert(std::distance(eq.first, eq.second) == 2); 101 assert(std::distance(eq.first, eq.second) == 2); 109 assert(std::distance(eq.first, eq.second) == 1); 114 assert(std::distance(e [all...] |
H A D | insert_range.pass.cpp | 46 assert(std::distance(eq.first, eq.second) == 2); 54 assert(std::distance(eq.first, eq.second) == 2); 62 assert(std::distance(eq.first, eq.second) == 1); 67 assert(std::distance(eq.first, eq.second) == 1); 71 assert(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size()); 72 assert(static_cast<std::size_t>(std::distance(c.cbegin(), c.cend())) == c.size()); 93 assert(std::distance(eq.first, eq.second) == 2); 101 assert(std::distance(eq.first, eq.second) == 2); 109 assert(std::distance(eq.first, eq.second) == 1); 114 assert(std::distance(e [all...] |
H A D | erase_key.pass.cpp | 60 assert(std::distance(eq.first, eq.second) == 2); 68 assert(std::distance(eq.first, eq.second) == 2); 76 assert(std::distance(eq.first, eq.second) == 1); 81 assert(std::distance(eq.first, eq.second) == 1); 85 assert(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size()); 86 assert(static_cast<std::size_t>(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); 108 assert(static_cast<std::size_t>(std::distance( [all...] |
H A D | erase_range.pass.cpp | 47 assert(std::distance(eq.first, eq.second) == 2); 55 assert(std::distance(eq.first, eq.second) == 2); 63 assert(std::distance(eq.first, eq.second) == 1); 68 assert(std::distance(eq.first, eq.second) == 1); 72 assert(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size()); 73 assert(static_cast<std::size_t>(std::distance(c.cbegin(), c.cend())) == c.size()); 78 assert(std::distance(eq.first, eq.second) == 2); 86 assert(std::distance(eq.first, eq.second) == 1); 91 assert(std::distance(eq.first, eq.second) == 1); 95 assert(static_cast<std::size_t>(std::distance( [all...] |
/external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.modifiers/ |
H A D | emplace_front.pass.cpp | 35 assert(distance(c.begin(), c.end()) == 1); 42 assert(distance(c.begin(), c.end()) == 1); 47 assert(distance(c.begin(), c.end()) == 2); 57 assert(distance(c.begin(), c.end()) == 1); 64 assert(distance(c.begin(), c.end()) == 1); 69 assert(distance(c.begin(), c.end()) == 2);
|
/external/libcxx/test/std/containers/sequences/list/list.modifiers/ |
H A D | 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);
|
/external/libcxx/test/std/containers/sequences/vector.bool/ |
H A D | 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);
|
/external/libcxx/test/std/containers/unord/unord.multiset/ |
H A D | 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);
|
H A D | 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);
|
H A D | iterators.fail.cpp | 45 assert(std::distance(c.begin(), c.end()) == c.size()); 46 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 66 assert(std::distance(c.begin(), c.end()) == c.size()); 67 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
/external/libcxx/test/std/containers/unord/unord.set/ |
H A D | 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);
|
H A D | 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);
|
H A D | iterators.fail.cpp | 43 assert(std::distance(c.begin(), c.end()) == c.size()); 44 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());
|
/external/skia/include/core/ |
H A D | SkPathMeasure.h | 42 /** Pins distance to 0 <= distance <= getLength(), and then computes 47 bool SK_WARN_UNUSED_RESULT getPosTan(SkScalar distance, SkPoint* position, 56 /** Pins distance to 0 <= distance <= getLength(), and then computes 61 bool SK_WARN_UNUSED_RESULT getMatrix(SkScalar distance, SkMatrix* matrix, 64 /** Given a start and stop distance, return in dst the intervening segment(s). 95 SkScalar fDistance; // total distance up to this point 109 SkScalar compute_quad_segs(const SkPoint pts[3], SkScalar distance, 111 SkScalar compute_conic_segs(const SkConic&, SkScalar distance, [all...] |
/external/skqp/include/core/ |
H A D | SkPathMeasure.h | 42 /** Pins distance to 0 <= distance <= getLength(), and then computes 47 bool SK_WARN_UNUSED_RESULT getPosTan(SkScalar distance, SkPoint* position, 56 /** Pins distance to 0 <= distance <= getLength(), and then computes 61 bool SK_WARN_UNUSED_RESULT getMatrix(SkScalar distance, SkMatrix* matrix, 64 /** Given a start and stop distance, return in dst the intervening segment(s). 95 SkScalar fDistance; // total distance up to this point 109 SkScalar compute_quad_segs(const SkPoint pts[3], SkScalar distance, 111 SkScalar compute_conic_segs(const SkConic&, SkScalar distance, [all...] |
/external/brotli/c/enc/ |
H A D | backward_references.c | 24 static BROTLI_INLINE size_t ComputeDistanceCode(size_t distance, argument 27 if (distance <= max_distance) { 28 size_t distance_plus_3 = distance + 3; 31 if (distance == (size_t)dist_cache[0]) { 33 } else if (distance == (size_t)dist_cache[1]) { 39 } else if (distance == (size_t)dist_cache[2]) { 41 } else if (distance == (size_t)dist_cache[3]) { 45 return distance + BROTLI_NUM_DISTANCE_SHORT_CODES - 1;
|
/external/robolectric-shadows/shadows/framework/src/main/java/org/robolectric/shadows/ |
H A D | ShadowAbsListView.java | 25 public void smoothScrollBy(int distance, int duration) { argument 26 this.lastSmoothScrollByDistance = distance; 49 * Robolectric accessor for the last smoothScrollBy distance 51 * @return int distance
|
/external/skia/src/core/ |
H A D | SkPathMeasure.cpp | 231 SkScalar distance, int mint, int maxt, int ptIndex) { 237 distance = this->compute_quad_segs(tmp, distance, mint, halft, ptIndex); 238 distance = this->compute_quad_segs(&tmp[2], distance, halft, maxt, ptIndex); 241 SkScalar prevD = distance; 242 distance += d; 243 if (distance > prevD) { 245 seg->fDistance = distance; 251 return distance; 230 compute_quad_segs(const SkPoint pts[3], SkScalar distance, int mint, int maxt, int ptIndex) argument 254 compute_conic_segs(const SkConic& conic, SkScalar distance, int mint, const SkPoint& minPt, int maxt, const SkPoint& maxPt, int ptIndex) argument 277 compute_cubic_segs(const SkPoint pts[4], SkScalar distance, int mint, int maxt, int ptIndex) argument 304 SkScalar distance = 0; local [all...] |
/external/skqp/src/core/ |
H A D | SkPathMeasure.cpp | 231 SkScalar distance, int mint, int maxt, int ptIndex) { 237 distance = this->compute_quad_segs(tmp, distance, mint, halft, ptIndex); 238 distance = this->compute_quad_segs(&tmp[2], distance, halft, maxt, ptIndex); 241 SkScalar prevD = distance; 242 distance += d; 243 if (distance > prevD) { 245 seg->fDistance = distance; 251 return distance; 230 compute_quad_segs(const SkPoint pts[3], SkScalar distance, int mint, int maxt, int ptIndex) argument 254 compute_conic_segs(const SkConic& conic, SkScalar distance, int mint, const SkPoint& minPt, int maxt, const SkPoint& maxPt, int ptIndex) argument 277 compute_cubic_segs(const SkPoint pts[4], SkScalar distance, int mint, int maxt, int ptIndex) argument 304 SkScalar distance = 0; local [all...] |
/external/libcxx/test/std/containers/sequences/list/list.ops/ |
H A D | splice_pos_list_iter.pass.cpp | 29 assert(distance(l1.begin(), l1.end()) == 1); 31 assert(distance(l2.begin(), l2.end()) == 0); 40 assert(distance(l1.begin(), l1.end()) == 1); 42 assert(distance(l2.begin(), l2.end()) == 1); 53 assert(distance(l1.begin(), l1.end()) == 1); 55 assert(distance(l2.begin(), l2.end()) == 1); 66 assert(distance(l1.begin(), l1.end()) == 1); 68 assert(distance(l2.begin(), l2.end()) == 2); 81 assert(distance(l1.begin(), l1.end()) == 1); 83 assert(distance(l [all...] |
/external/libcxx/test/std/containers/sequences/list/list.capacity/ |
H A D | resize_size_value.pass.cpp | 25 assert(std::distance(l.begin(), l.end()) == 2); 32 assert(std::distance(l.begin(), l.end()) == 10); 41 assert(std::distance(l.begin(), l.end()) == 2); 48 assert(std::distance(l.begin(), l.end()) == 10);
|
/external/libcxx/test/std/containers/unord/unord.multimap/ |
H A D | iterators.fail.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());
|