/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/multiset.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()) == 9); 77 assert(distance(mo.begin(), mo.end()) == 0); 102 assert(distance(m.begin(), m.end()) == 9); 116 assert(distance(mo.begin(), mo.end()) == 0);
|
initializer_list_compare.pass.cpp | 28 assert(distance(m.begin(), m.end()) == 6);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/ |
rehash.pass.cpp | 31 assert(std::distance(eq.first, eq.second) == 2); 39 assert(std::distance(eq.first, eq.second) == 2); 48 assert(std::distance(eq.first, eq.second) == 1); 53 assert(std::distance(eq.first, eq.second) == 1); 57 assert(std::distance(c.begin(), c.end()) == c.size()); 58 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
equal_range_const.pass.cpp | 45 assert(std::distance(r.first, r.second) == 1); 49 assert(std::distance(r.first, r.second) == 0); 81 assert(std::distance(r.first, r.second) == 1); 85 assert(std::distance(r.first, r.second) == 0);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/unord.set.cnstr/ |
copy.pass.cpp | 62 assert(std::distance(c.begin(), c.end()) == c.size()); 63 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 101 assert(std::distance(c.begin(), c.end()) == c.size()); 102 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 141 assert(std::distance(c.begin(), c.end()) == c.size()); 142 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
/packages/apps/QuickSearchBox/src/com/android/quicksearchbox/util/ |
LevenshteinDistance.java | 20 * This class represents the matrix used in the Levenshtein distance algorithm, together 60 * Implementation of Levenshtein distance algorithm. 62 * @return The Levenshtein distance. 77 int distance = distTab[s-1][t] + 1; local 81 if (d + 1 < distance ) { 82 distance = d + 1; 87 if (d + cost < distance) { 88 distance = d + cost; 91 distTab[s][t] = distance;
|
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
push.h | 27 #include "fst/lib/shortest-distance.h" 42 vector<typename Arc::Weight> distance; local 43 ShortestDistance(*fst, &distance, type == REWEIGHT_TO_INITIAL); 44 Reweight(fst, distance, type);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.modifiers/ |
erase_after_many.pass.cpp | 29 assert(distance(c.begin(), c.end()) == 10); 43 assert(distance(c.begin(), c.end()) == 8); 55 assert(distance(c.begin(), c.end()) == 8); 67 assert(distance(c.begin(), c.end()) == 5); 76 assert(distance(c.begin(), c.end()) == 4); 85 assert(distance(c.begin(), c.end()) == 0); 96 assert(distance(c.begin(), c.end()) == 10); 110 assert(distance(c.begin(), c.end()) == 8); 122 assert(distance(c.begin(), c.end()) == 8); 134 assert(distance(c.begin(), c.end()) == 5) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.ops/ |
splice_pos_list_iter_iter.pass.cpp | 31 assert(distance(l1.begin(), l1.end()) == 3); 43 assert(distance(l1.begin(), l1.end()) == 3); 55 assert(distance(l1.begin(), l1.end()) == 3); 68 assert(distance(l1.begin(), l1.end()) == 5); 88 assert(distance(l1.begin(), l1.end()) == 5); 108 assert(distance(l1.begin(), l1.end()) == 5); 136 assert(distance(l1.begin(), l1.end()) == 3); 148 assert(distance(l1.begin(), l1.end()) == 3); 160 assert(distance(l1.begin(), l1.end()) == 3); 173 assert(distance(l1.begin(), l1.end()) == 5) [all...] |
/external/chromium_org/third_party/WebKit/Source/core/history/ |
BackForwardController.h | 49 void goBackOrForward(int distance);
|
/external/guava/guava/src/com/google/common/collect/ |
DiscreteDomain.java | 27 * operations: {@link #next}, {@link #previous} and {@link #distance}, according 71 * next(next(next(start)))}, then {@code distance(start, end) == 3} and {@code 72 * distance(end, start) == -3}. As well, {@code distance(a, a)} is always 78 * @return the distance as described above, or {@link Long#MIN_VALUE} or 79 * {@link Long#MIN_VALUE} if the distance is too small or too large, 82 public abstract long distance(C start, C end); method in class:DiscreteDomain
|
/external/jmonkeyengine/engine/src/blender/com/jme3/scene/plugins/blender/constraints/ |
ConstraintShrinkWrap.java | 75 float distance = Float.MAX_VALUE;
local 77 float temp = currentTranslation.distance(p);
78 if(temp < distance) {
79 distance = temp;
|
/frameworks/av/media/libstagefright/codecs/amrwbenc/src/ |
qpisf_2s.c | 66 Word32 i, k, temp, min_err, distance; local 78 distance = MAX_32; 93 if(temp < distance) 95 distance = temp; 107 distance = MAX_32; 121 if(temp < distance) 123 distance = temp; 156 Word32 temp, min_err, distance; local 168 distance = MAX_32; 182 if(temp < distance) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.cons/ |
copy_alloc.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);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/set.cons/ |
copy.pass.cpp | 45 assert(distance(m.begin(), m.end()) == 3); 53 assert(distance(mo.begin(), mo.end()) == 3); 80 assert(distance(m.begin(), m.end()) == 3); 88 assert(distance(mo.begin(), mo.end()) == 3);
|
copy_assign.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);
|
initializer_list_compare.pass.cpp | 28 assert(distance(m.begin(), m.end()) == 6);
|
iter_iter_comp.pass.cpp | 43 assert(distance(m.begin(), m.end()) == 3);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/unord.map.cnstr/ |
assign_init.pass.cpp | 57 assert(std::distance(c.begin(), c.end()) == c.size()); 58 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 90 assert(std::distance(c.begin(), c.end()) == c.size()); 91 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
init.pass.cpp | 57 assert(std::distance(c.begin(), c.end()) == c.size()); 58 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());
|
init_size.pass.cpp | 59 assert(std::distance(c.begin(), c.end()) == c.size()); 60 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 93 assert(std::distance(c.begin(), c.end()) == c.size()); 94 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
init_size_hash.pass.cpp | 60 assert(std::distance(c.begin(), c.end()) == c.size()); 61 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 95 assert(std::distance(c.begin(), c.end()) == c.size()); 96 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
init_size_hash_equal.pass.cpp | 62 assert(std::distance(c.begin(), c.end()) == c.size()); 63 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 98 assert(std::distance(c.begin(), c.end()) == c.size()); 99 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
range.pass.cpp | 61 assert(std::distance(c.begin(), c.end()) == c.size()); 62 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 95 assert(std::distance(c.begin(), c.end()) == c.size()); 96 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
range_size.pass.cpp | 63 assert(std::distance(c.begin(), c.end()) == c.size()); 64 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 99 assert(std::distance(c.begin(), c.end()) == c.size()); 100 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|