| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/ |
| iterator.pass.cpp | 66 assert(std::distance(m.begin(), m.end()) == m.size());
67 assert(std::distance(m.rbegin(), m.rend()) == m.size());
111 assert(std::distance(m.begin(), m.end()) == m.size());
112 assert(std::distance(m.cbegin(), m.cend()) == m.size());
113 assert(std::distance(m.rbegin(), m.rend()) == m.size());
114 assert(std::distance(m.crbegin(), m.crend()) == m.size());
155 assert(std::distance(m.begin(), m.end()) == m.size());
156 assert(std::distance(m.rbegin(), m.rend()) == m.size());
200 assert(std::distance(m.begin(), m.end()) == m.size());
201 assert(std::distance(m.cbegin(), m.cend()) == m.size())
[all...] |
| /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/unord/unord.multimap/ |
| swap_member.pass.cpp | 46 assert(std::distance(c1.begin(), c1.end()) == c1.size());
47 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size());
55 assert(std::distance(c2.begin(), c2.end()) == c2.size());
56 assert(std::distance(c2.cbegin(), c2.cend()) == c2.size());
94 assert(std::distance(c1.begin(), c1.end()) == c1.size());
95 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size());
103 assert(std::distance(c2.begin(), c2.end()) == c2.size());
104 assert(std::distance(c2.cbegin(), c2.cend()) == c2.size());
132 assert(std::distance(c1.begin(), c1.end()) == c1.size());
133 assert(std::distance(c1.cbegin(), c1.cend()) == c1.size())
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/unord.multimap.cnstr/ |
| 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_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/iterators/iterator.primitives/iterator.operations/ |
| distance.pass.cpp | 14 // distance(Iter first, Iter last);
18 // distance(Iter first, Iter last);
29 assert(std::distance(first, last) == x);
|
| /art/runtime/interpreter/mterp/arm/ |
| op_goto_32.S | 4 * The branch distance is a signed code-unit offset, which we need to
|
| /art/runtime/interpreter/mterp/arm64/ |
| op_goto_32.S | 4 * The branch distance is a signed code-unit offset, which we need to
|
| /art/runtime/interpreter/mterp/x86/ |
| op_goto_32.S | 4 * The branch distance is a signed code-unit offset, which we need to
|
| /external/autotest/client/cros/multimedia/ |
| display_info.py | 29 @param left: The x-axis distance from the left bound.
30 @param left: The y-axis distance from the top bound.
31 @param left: The x-axis distance from the right bound.
32 @param left: The y-axis distance from the bottom bound.
|
| /external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.modifiers/ |
| emplace_front.pass.cpp | 29 assert(distance(c.begin(), c.end()) == 1);
33 assert(distance(c.begin(), c.end()) == 2);
42 assert(distance(c.begin(), c.end()) == 1);
46 assert(distance(c.begin(), c.end()) == 2);
|
| push_front_rv.pass.cpp | 29 assert(distance(c.begin(), c.end()) == 1);
33 assert(distance(c.begin(), c.end()) == 2);
42 assert(distance(c.begin(), c.end()) == 1);
46 assert(distance(c.begin(), c.end()) == 2);
|
| /external/libcxx/test/std/containers/sequences/list/list.capacity/ |
| 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/unord.multimap.cnstr/ |
| move.pass.cpp | 60 assert(std::distance(c.begin(), c.end()) == c.size());
61 assert(std::distance(c.cbegin(), c.cend()) == c.size());
94 assert(std::distance(eq.first, eq.second) == 2);
102 assert(std::distance(eq.first, eq.second) == 2);
111 assert(std::distance(eq.first, eq.second) == 1);
116 assert(std::distance(eq.first, eq.second) == 1);
120 assert(std::distance(c.begin(), c.end()) == c.size());
121 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())
[all...] |
| /external/libcxx/test/std/containers/unord/unord.multiset/ |
| 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/libcxx/test/std/containers/unord/unord.set/ |
| 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/libvpx/libvpx/vp9/encoder/ |
| vp9_temporal_filter.h | 19 void vp9_temporal_filter(VP9_COMP *cpi, int distance);
|
| /external/opencv3/doc/py_tutorials/py_imgproc/py_contours/py_contours_more_functions/ |
| py_contours_more_functions.markdown | 9 - Finding shortest distance from a point to a polygon
31 point, approximate distance to farthest point ]**. We can visualize it using an image. We draw a
66 This function finds the shortest distance between a point in the image and a contour. It returns the
67 distance which is negative when point is outside the contour, positive when point is inside and zero
74 In the function, third argument is measureDist. If it is True, it finds the signed distance. If
78 @note If you don't want to find the distance, make sure third argument is False, because, it is a
127 Blue color. It represents the distance from all pixels to the white curve on it. All pixels
128 inside curve is blue depending on the distance. Similarly outside points are red. Contour edges
130 distance.
|
