Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched full:distance (Results 476 - 500 of 3970) sorted by null

<<11121314151617181920>>

/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/unord.multiset.cnstr/
move.pass.cpp	58 assert(std::distance(c.begin(), c.end()) == c.size()); 59 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()); 134 assert(std::distance(c.begin(), c.end()) == c.size()); 135 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 174 assert(std::distance(c.begin(), c.end()) == c.size()); 175 assert(std::distance(c.cbegin(), c.cend()) == c.size());
move_alloc.pass.cpp	72 assert(std::distance(c.begin(), c.end()) == c.size()); 73 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 113 assert(std::distance(c.begin(), c.end()) == c.size()); 114 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 163 assert(std::distance(c.begin(), c.end()) == c.size()); 164 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 204 assert(std::distance(c.begin(), c.end()) == c.size()); 205 assert(std::distance(c.cbegin(), c.cend()) == c.size());
range.pass.cpp	58 assert(std::distance(c.begin(), c.end()) == c.size()); 59 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 91 assert(std::distance(c.begin(), c.end()) == c.size()); 92 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 125 assert(std::distance(c.begin(), c.end()) == c.size()); 126 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 160 assert(std::distance(c.begin(), c.end()) == c.size()); 161 assert(std::distance(c.cbegin(), c.cend()) == c.size());
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/unord.set.cnstr/
assign_move.pass.cpp	70 assert(std::distance(c.begin(), c.end()) == c.size()); 71 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 115 assert(std::distance(c.begin(), c.end()) == c.size()); 116 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 160 assert(std::distance(c.begin(), c.end()) == c.size()); 161 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 206 assert(std::distance(c.begin(), c.end()) == c.size()); 207 assert(std::distance(c.cbegin(), c.cend()) == c.size());
move.pass.cpp	58 assert(std::distance(c.begin(), c.end()) == c.size()); 59 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()); 134 assert(std::distance(c.begin(), c.end()) == c.size()); 135 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 174 assert(std::distance(c.begin(), c.end()) == c.size()); 175 assert(std::distance(c.cbegin(), c.cend()) == c.size());
range.pass.cpp	58 assert(std::distance(c.begin(), c.end()) == c.size()); 59 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 91 assert(std::distance(c.begin(), c.end()) == c.size()); 92 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 125 assert(std::distance(c.begin(), c.end()) == c.size()); 126 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 160 assert(std::distance(c.begin(), c.end()) == c.size()); 161 assert(std::distance(c.cbegin(), c.cend()) == c.size());
/external/autotest/client/site_tests/firmware_TouchMTB/tests/logs/lumpy/20130506_031746-fw_11.27-robot_sim/
touch_firmware_report-lumpy-fw_11.27-complete-20130614_065557	26 Largest distance slot0: 4 px 55 Largest distance slot0: 11 px 84 Largest distance slot0: 8 px 113 Largest distance slot0: 6 px 142 Largest distance slot0: 18 px 148 Largest distance slot1: 14 px
/external/libcxx/test/std/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);
/external/libcxx/test/std/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);
/external/libcxx/test/std/containers/sequences/list/list.modifiers/
insert_iter_iter_iter.pass.cpp	53 assert(distance(l1.begin(), l1.end()) == 3); 64 assert(distance(l1.begin(), l1.end()) == 6); 89 assert(distance(l1.begin(), l1.end()) == 6); 122 assert(distance(l1.begin(), l1.end()) == 3); 133 assert(distance(l1.begin(), l1.end()) == 6); 158 assert(distance(l1.begin(), l1.end()) == 6);
/external/libcxx/test/std/containers/sequences/vector.bool/
iterators.pass.cpp	33 assert(std::distance(i, j) == 0); 42 assert(std::distance(i, j) == 0); 51 assert(std::distance(i, j) == 0); 68 assert(std::distance(i, j) == 0); 77 assert(std::distance(i, j) == 0); 86 assert(std::distance(i, j) == 0);
/external/libcxx/test/std/containers/unord/unord.map/unord.map.cnstr/
copy.pass.cpp	64 assert(std::distance(c.begin(), c.end()) == c.size()); 65 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 104 assert(std::distance(c.begin(), c.end()) == c.size()); 105 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 145 assert(std::distance(c.begin(), c.end()) == c.size()); 146 assert(std::distance(c.cbegin(), c.cend()) == c.size());
move_alloc.pass.cpp	65 assert(std::distance(c.begin(), c.end()) == c.size()); 66 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 106 assert(std::distance(c.begin(), c.end()) == c.size()); 107 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 148 assert(std::distance(c.begin(), c.end()) == c.size()); 149 assert(std::distance(c.cbegin(), c.cend()) == c.size());
/external/libcxx/test/std/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());
/external/libcxx/test/std/containers/unord/unord.multiset/unord.multiset.cnstr/
copy.pass.cpp	70 assert(std::distance(c.begin(), c.end()) == c.size()); 71 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 117 assert(std::distance(c.begin(), c.end()) == c.size()); 118 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 165 assert(std::distance(c.begin(), c.end()) == c.size()); 166 assert(std::distance(c.cbegin(), c.cend()) == c.size());
/external/libcxx/test/std/containers/unord/unord.set/unord.set.cnstr/
assign_copy.pass.cpp	69 assert(std::distance(c.begin(), c.end()) == c.size()); 70 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 132 assert(std::distance(c.begin(), c.end()) == c.size()); 133 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 178 assert(std::distance(c.begin(), c.end()) == c.size()); 179 assert(std::distance(c.cbegin(), c.cend()) == c.size());
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());
move_alloc.pass.cpp	64 assert(std::distance(c.begin(), c.end()) == c.size()); 65 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 105 assert(std::distance(c.begin(), c.end()) == c.size()); 106 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 147 assert(std::distance(c.begin(), c.end()) == c.size()); 148 assert(std::distance(c.cbegin(), c.cend()) == c.size());
/external/libgdx/gdx/src/com/badlogic/gdx/math/collision/
Ray.java	48 /** Returns the endpoint given the distance. This is calculated as startpoint + distance * direction. 50 * @param distance The distance from the end point to the start point. 52 public Vector3 getEndPoint (final Vector3 out, final float distance) { 53 return out.set(direction).scl(distance).add(origin);
/external/libopus/silk/
NLSF_stabilize.c	37 /* Euclidean distance to input vector */ 49 const opus_int16 *NDeltaMin_Q15, /* I Min distance vector, NDeltaMin_Q15[L] must be >= 1 [L+1] */ 62 /* Find smallest distance */ 83 /* Now check if the smallest distance non-negative */ 131 /* Keep delta_min distance between the NLSFs */ 138 /* Keep NDeltaMin distance between the NLSFs */
/external/llvm/include/llvm/ADT/
edit_distance.h	1 //===-- llvm/ADT/edit_distance.h - Array edit distance function --- C++ -*-===// 10 // This file defines a Levenshtein distance function that works for any two 25 /// \brief Determine the edit distance between two sequences. 35 /// \param MaxEditDistance If non-zero, the maximum edit distance that this 36 /// routine is allowed to compute. If the edit distance will exceed that 48 // distance, which is described here:
/external/opencv3/samples/cpp/
distrans.cpp	47 // begin "painting" the distance transform result 87 imshow("Distance Map", dist8u ); 92 printf("\nProgram to demonstrate the use of the distance transform function between edge images.\n" 102 "\t0 - use precise distance transform\n" 126 namedWindow("Distance Map", 1); 127 createTrackbar("Brightness Threshold", "Distance Map", &edgeThresh, 255, onTrackbar, 0);
/external/opencv3/samples/cpp/tutorial_code/ImgTrans/
imageSegmentation.cpp	3 * @brief Sample code showing how to segment overlapping objects using Laplacian filtering, in addition to Watershed and Distance Transformation 29 // better results during the use of Distance Transform 82 // Perform the distance transform algorithm 86 // Normalize the distance image for range = {0.0, 1.0} 89 imshow("Distance Transform Image", dist); 104 // Create the CV_8U version of the distance image
/external/skia/tests/
PathMeasureTest.cpp	63 d = distance(pts[0], pts[1]); 64 distance += d; 65 seg->fDistance = distance; 70 This 2nd assert failes because (distance += d) didn't affect distance 71 because distance >>> d.
/external/zopfli/src/zopfli/
lz77.h	47 if > 0: length in corresponding litlens, this is the distance. */ 66 /* Cache for length/distance pairs found so far. */ 76 Finds the longest match (length and corresponding distance) for LZ77 87 smallest distance required to reach this length. Only 256 of its 259 values 94 unsigned short* sublen, unsigned short* distance, unsigned short* length); 103 Counts the number of literal, length and distance symbols in the given lz77

Completed in 2601 milliseconds

<<11121314151617181920>>