/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/unord.multimap.cnstr/ |
init.pass.cpp | 50 assert(std::distance(eq.first, eq.second) == 2); 58 assert(std::distance(eq.first, eq.second) == 2); 67 assert(std::distance(eq.first, eq.second) == 1); 72 assert(std::distance(eq.first, eq.second) == 1); 76 assert(std::distance(c.begin(), c.end()) == c.size()); 77 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 104 assert(std::distance(eq.first, eq.second) == 2); 112 assert(std::distance(eq.first, eq.second) == 2); 121 assert(std::distance(eq.first, eq.second) == 1); 126 assert(std::distance(eq.first, eq.second) == 1) [all...] |
init_size.pass.cpp | 52 assert(std::distance(eq.first, eq.second) == 2); 60 assert(std::distance(eq.first, eq.second) == 2); 69 assert(std::distance(eq.first, eq.second) == 1); 74 assert(std::distance(eq.first, eq.second) == 1); 78 assert(std::distance(c.begin(), c.end()) == c.size()); 79 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 108 assert(std::distance(eq.first, eq.second) == 2); 116 assert(std::distance(eq.first, eq.second) == 2); 125 assert(std::distance(eq.first, eq.second) == 1); 130 assert(std::distance(eq.first, eq.second) == 1) [all...] |
init_size_hash.pass.cpp | 53 assert(std::distance(eq.first, eq.second) == 2); 61 assert(std::distance(eq.first, eq.second) == 2); 70 assert(std::distance(eq.first, eq.second) == 1); 75 assert(std::distance(eq.first, eq.second) == 1); 79 assert(std::distance(c.begin(), c.end()) == c.size()); 80 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 110 assert(std::distance(eq.first, eq.second) == 2); 118 assert(std::distance(eq.first, eq.second) == 2); 127 assert(std::distance(eq.first, eq.second) == 1); 132 assert(std::distance(eq.first, eq.second) == 1) [all...] |
init_size_hash_equal.pass.cpp | 55 assert(std::distance(eq.first, eq.second) == 2); 63 assert(std::distance(eq.first, eq.second) == 2); 72 assert(std::distance(eq.first, eq.second) == 1); 77 assert(std::distance(eq.first, eq.second) == 1); 81 assert(std::distance(c.begin(), c.end()) == c.size()); 82 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 113 assert(std::distance(eq.first, eq.second) == 2); 121 assert(std::distance(eq.first, eq.second) == 2); 130 assert(std::distance(eq.first, eq.second) == 1); 135 assert(std::distance(eq.first, eq.second) == 1) [all...] |
init_size_hash_equal_allocator.pass.cpp | 56 assert(std::distance(eq.first, eq.second) == 2); 64 assert(std::distance(eq.first, eq.second) == 2); 73 assert(std::distance(eq.first, eq.second) == 1); 78 assert(std::distance(eq.first, eq.second) == 1); 82 assert(std::distance(c.begin(), c.end()) == c.size()); 83 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 115 assert(std::distance(eq.first, eq.second) == 2); 123 assert(std::distance(eq.first, eq.second) == 2); 132 assert(std::distance(eq.first, eq.second) == 1); 137 assert(std::distance(eq.first, eq.second) == 1) [all...] |
range.pass.cpp | 54 assert(std::distance(eq.first, eq.second) == 2); 62 assert(std::distance(eq.first, eq.second) == 2); 71 assert(std::distance(eq.first, eq.second) == 1); 76 assert(std::distance(eq.first, eq.second) == 1); 80 assert(std::distance(c.begin(), c.end()) == c.size()); 81 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 110 assert(std::distance(eq.first, eq.second) == 2); 118 assert(std::distance(eq.first, eq.second) == 2); 127 assert(std::distance(eq.first, eq.second) == 1); 132 assert(std::distance(eq.first, eq.second) == 1) [all...] |
range_size.pass.cpp | 56 assert(std::distance(eq.first, eq.second) == 2); 64 assert(std::distance(eq.first, eq.second) == 2); 73 assert(std::distance(eq.first, eq.second) == 1); 78 assert(std::distance(eq.first, eq.second) == 1); 82 assert(std::distance(c.begin(), c.end()) == c.size()); 83 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 114 assert(std::distance(eq.first, eq.second) == 2); 122 assert(std::distance(eq.first, eq.second) == 2); 131 assert(std::distance(eq.first, eq.second) == 1); 136 assert(std::distance(eq.first, eq.second) == 1) [all...] |
range_size_hash.pass.cpp | 58 assert(std::distance(eq.first, eq.second) == 2); 66 assert(std::distance(eq.first, eq.second) == 2); 75 assert(std::distance(eq.first, eq.second) == 1); 80 assert(std::distance(eq.first, eq.second) == 1); 84 assert(std::distance(c.begin(), c.end()) == c.size()); 85 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 117 assert(std::distance(eq.first, eq.second) == 2); 125 assert(std::distance(eq.first, eq.second) == 2); 134 assert(std::distance(eq.first, eq.second) == 1); 139 assert(std::distance(eq.first, eq.second) == 1) [all...] |
range_size_hash_equal.pass.cpp | 59 assert(std::distance(eq.first, eq.second) == 2); 67 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(std::distance(c.begin(), c.end()) == c.size()); 86 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 119 assert(std::distance(eq.first, eq.second) == 2); 127 assert(std::distance(eq.first, eq.second) == 2); 136 assert(std::distance(eq.first, eq.second) == 1); 141 assert(std::distance(eq.first, eq.second) == 1) [all...] |
range_size_hash_equal_allocator.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()); 122 assert(std::distance(eq.first, eq.second) == 2); 130 assert(std::distance(eq.first, eq.second) == 2); 139 assert(std::distance(eq.first, eq.second) == 1); 144 assert(std::distance(eq.first, eq.second) == 1) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/unord.multimap.swap/ |
swap_non_member.pass.cpp | 45 assert(std::distance(c1.begin(), c1.end()) == c1.size()); 46 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size()); 54 assert(std::distance(c2.begin(), c2.end()) == c2.size()); 55 assert(std::distance(c2.cbegin(), c2.cend()) == c2.size()); 93 assert(std::distance(c1.begin(), c1.end()) == c1.size()); 94 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size()); 102 assert(std::distance(c2.begin(), c2.end()) == c2.size()); 103 assert(std::distance(c2.cbegin(), c2.cend()) == c2.size()); 131 assert(std::distance(c1.begin(), c1.end()) == c1.size()); 132 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size()) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/ |
swap_member.pass.cpp | 44 assert(std::distance(c1.begin(), c1.end()) == c1.size()); 45 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size()); 53 assert(std::distance(c2.begin(), c2.end()) == c2.size()); 54 assert(std::distance(c2.cbegin(), c2.cend()) == c2.size()); 92 assert(std::distance(c1.begin(), c1.end()) == c1.size()); 93 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size()); 101 assert(std::distance(c2.begin(), c2.end()) == c2.size()); 102 assert(std::distance(c2.cbegin(), c2.cend()) == c2.size()); 130 assert(std::distance(c1.begin(), c1.end()) == c1.size()); 131 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size()) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/unord.multiset.swap/ |
swap_non_member.pass.cpp | 44 assert(std::distance(c1.begin(), c1.end()) == c1.size()); 45 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size()); 53 assert(std::distance(c2.begin(), c2.end()) == c2.size()); 54 assert(std::distance(c2.cbegin(), c2.cend()) == c2.size()); 92 assert(std::distance(c1.begin(), c1.end()) == c1.size()); 93 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size()); 101 assert(std::distance(c2.begin(), c2.end()) == c2.size()); 102 assert(std::distance(c2.cbegin(), c2.cend()) == c2.size()); 130 assert(std::distance(c1.begin(), c1.end()) == c1.size()); 131 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size()) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/ |
swap_member.pass.cpp | 44 assert(std::distance(c1.begin(), c1.end()) == c1.size()); 45 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size()); 53 assert(std::distance(c2.begin(), c2.end()) == c2.size()); 54 assert(std::distance(c2.cbegin(), c2.cend()) == c2.size()); 92 assert(std::distance(c1.begin(), c1.end()) == c1.size()); 93 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size()); 101 assert(std::distance(c2.begin(), c2.end()) == c2.size()); 102 assert(std::distance(c2.cbegin(), c2.cend()) == c2.size()); 130 assert(std::distance(c1.begin(), c1.end()) == c1.size()); 131 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size()) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/unord.set.swap/ |
swap_non_member.pass.cpp | 44 assert(std::distance(c1.begin(), c1.end()) == c1.size()); 45 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size()); 53 assert(std::distance(c2.begin(), c2.end()) == c2.size()); 54 assert(std::distance(c2.cbegin(), c2.cend()) == c2.size()); 92 assert(std::distance(c1.begin(), c1.end()) == c1.size()); 93 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size()); 101 assert(std::distance(c2.begin(), c2.end()) == c2.size()); 102 assert(std::distance(c2.cbegin(), c2.cend()) == c2.size()); 130 assert(std::distance(c1.begin(), c1.end()) == c1.size()); 131 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size()) [all...] |
/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/ |
distance.hpp | 13 // $Id: distance.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ 67 struct distance struct in namespace:boost::mpl 71 BOOST_MPL_AUX_LAMBDA_SUPPORT(2, distance, (First, Last)) 74 BOOST_MPL_AUX_NA_SPEC(2, distance)
|
/packages/apps/Gallery2/src/com/android/gallery3d/ui/ |
ScrollerHelper.java | 84 // Returns the distance that over the scroll limit. 85 public int startScroll(int distance, int min, int max) { 89 int newPosition = Utils.clamp(finalPosition + distance, min, max); 95 return finalPosition + distance - newPosition;
|
/packages/inputmethods/LatinIME/native/jni/src/utils/ |
autocorrection_threshold_utils.cpp | 74 const int distance = editDistance(before, beforeLength, after, afterLength); local 86 if (score <= 0 || distance >= afterLength) { 88 // or if the edit distance is larger than or equal to afterLength. 91 // add a weight based on edit distance. 92 const float weight = 1.0f - static_cast<float>(distance) / static_cast<float>(afterLength);
|
/external/chromium_org/ui/gfx/ |
rect_conversions.cc | 55 bool IsNearestRectWithinDistance(const gfx::RectF& rect, float distance) { 67 (std::abs(min_x - float_min_x) < distance) && 68 (std::abs(min_y - float_min_y) < distance) && 69 (std::abs(max_x - float_max_x) < distance) && 70 (std::abs(max_y - float_max_y) < distance);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.cons/ |
input_iterator.pass.cpp | 28 assert(std::distance(l.begin(), l.end()) == sizeof(a)/sizeof(a[0])); 39 assert(std::distance(l.begin(), l.end()) == sizeof(a)/sizeof(a[0])); 49 assert(std::distance(l.begin(), l.end()) == sizeof(a)/sizeof(a[0])); 60 assert(std::distance(l.begin(), l.end()) == sizeof(a)/sizeof(a[0])); 71 assert(std::distance(l.begin(), l.end()) == sizeof(a)/sizeof(a[0]));
|
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
shortest-distance.h | 1 // shortest-distance.h 18 // Functions and classes to find shortest distance in an FST. 48 // Computation state of the shortest-distance algorithm. Reusable 52 // (e.g., in epsilon removal). Vector 'distance' should not be 62 vector<Weight> *distance, 65 : fst_(fst.Copy()), distance_(distance), state_queue_(opts.state_queue), 85 vector<Weight> rdistance_; // Relaxation distance. 91 // Compute the shortest distance. If 'source' is kNoStateId, use 180 // Shortest-distance algorithm: this version allows fine control 183 // This computes the shortest distance from the 'opts.source' state t [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/openfst/src/include/fst/ |
push.h | 31 #include <fst/shortest-distance.h> 40 // the output of ShortestDistance. 'distance' is the shortest distance from the 46 const vector<typename Arc::Weight> &distance, 49 return fst.Start() < distance.size() ? 50 distance[fst.Start()] : Arc::Weight::Zero(); 53 for (typename Arc::StateId s = 0; s < distance.size(); ++s) 54 sum = Plus(sum, Times(distance[s], fst.Final(s))); 102 vector<typename Arc::Weight> distance; local 103 ShortestDistance(*fst, &distance, type == REWEIGHT_TO_INITIAL, delta) [all...] |
/external/eigen/test/ |
geo_parametrizedline.cpp | 40 VERIFY_IS_MUCH_SMALLER_THAN( l0.distance(p0), RealScalar(1) ); 41 VERIFY_IS_MUCH_SMALLER_THAN( l0.distance(p0+s0*d0), RealScalar(1) ); 42 VERIFY_IS_APPROX( (l0.projection(p1)-p1).norm(), l0.distance(p1) ); 43 VERIFY_IS_MUCH_SMALLER_THAN( l0.distance(l0.projection(p1)), RealScalar(1) ); 44 VERIFY_IS_APPROX( Scalar(l0.distance((p0+s0*d0) + d0.unitOrthogonal() * s1)), s1 ); 61 VERIFY_IS_MUCH_SMALLER_THAN(l0.distance(pi), RealScalar(1));
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.cons/ |
copy.pass.cpp | 46 assert(distance(m.begin(), m.end()) == 3); 54 assert(distance(mo.begin(), mo.end()) == 3); 81 assert(distance(m.begin(), m.end()) == 3); 89 assert(distance(mo.begin(), mo.end()) == 3); 117 assert(distance(m.begin(), m.end()) == 3); 125 assert(distance(mo.begin(), mo.end()) == 3);
|