| /external/libcxx/test/std/containers/unord/unord.set/unord.set.cnstr/ |
| init_size_hash.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_equal.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_allocator.pass.cpp | 61 assert(std::distance(c.begin(), c.end()) == c.size());
62 assert(std::distance(c.cbegin(), c.cend()) == c.size());
97 assert(std::distance(c.begin(), c.end()) == c.size());
98 assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
| range_size.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());
|
| range_size_hash.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());
|
| /external/libvpx/libvpx/vp9/encoder/ |
| vp9_mcomp.h | 30 // Allowed motion vector pixel distance outside image border
71 int sad_per_bit, int distance,
102 int distance,
108 int distance,
|
| /external/mesa3d/src/glsl/builtins/ir/ |
| distance.ir | 1 ((function distance
|
| /external/opencv3/doc/tutorials/imgproc/imgtrans/distance_transformation/ |
| distance_transform.markdown | 1 Image Segmentation with Distance Transform and Watershed Algorithm {#tutorial_distance_transform}
10 - Use the OpenCV function @ref cv::distanceTransform in order to obtain the derived representation of a binary image, where the value of each pixel is replaced by its distance to the nearest background pixel
30 -# Then if we have an image with white background, it is good to tranform it black. This will help us to desciminate the foreground objects easier when we will apply the Distance Transform:
43 -# We are ready now to apply the Distance Tranform on the binary image. Moreover, we normalize the output image in order to be able visualize and threshold the result:
|
| /external/skia/include/effects/ |
| SkArcToPathEffect.h | 15 /** radius must be > 0 to have an effect. It specifies the distance from each corner
|
| SkCornerPathEffect.h | 20 /** radius must be > 0 to have an effect. It specifies the distance from each corner
|
| /external/webrtc/webrtc/modules/audio_processing/beamformer/ |
| array_util.h | 56 // Returns the minimum distance between any two Points in the given
78 float Distance(CartesianPoint<T> a, CartesianPoint<T> b) {
88 // radius: distance from the camera in meters.
98 T distance() const { return s[2]; } function in struct:webrtc::SphericalPoint
|
| /frameworks/base/packages/SystemUI/src/com/android/systemui/classifier/ |
| AccelerationClassifier.java | 24 * A classifier which looks at the speed and distance between successive points of a Stroke.
27 * or distance is equal to zero then the ratio between this and the next part is not calculated. To
81 float distance = previousPoint.dist(point); local
83 float speed = distance / duration;
|
| EndPointLengthClassifier.java | 20 * A classifier which looks at the distance between the first and the last point from the stroke.
|
| /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);
96 assert(distance(m.begin(), m.end()) == 3);
104 assert(distance(mo.begin(), mo.end()) == 3);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.cons/ |
| iter_iter.pass.cpp | 30 assert(d.size() == std::distance(f, l));
31 assert(distance(d.begin(), d.end()) == d.size());
44 assert(d.size() == std::distance(f, l));
45 assert(distance(d.begin(), d.end()) == d.size());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/ |
| equal_range_const.pass.cpp | 43 assert(std::distance(r.first, r.second) == 1);
47 assert(std::distance(r.first, r.second) == 0);
68 assert(std::distance(r.first, r.second) == 1);
72 assert(std::distance(r.first, r.second) == 0);
|
| equal_range_non_const.pass.cpp | 43 assert(std::distance(r.first, r.second) == 1);
47 assert(std::distance(r.first, r.second) == 0);
68 assert(std::distance(r.first, r.second) == 1);
72 assert(std::distance(r.first, r.second) == 0);
|
| /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());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/ |
| iterators.fail.cpp | 44 assert(std::distance(c.begin(), c.end()) == c.size());
45 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());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/unord.multiset.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_size.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_size_hash.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_equal.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());
|
