HomeSort by relevance Sort by last modified time
    Searched refs:distance (Results 101 - 125 of 1416) sorted by null

1 2 3 45 6 7 8 91011>>

  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.modifiers/
insert_after_init.pass.cpp 29 assert(distance(c.begin(), c.end()) == 0);
33 assert(distance(c.begin(), c.end()) == 3);
40 assert(distance(c.begin(), c.end()) == 5);
55 assert(distance(c.begin(), c.end()) == 0);
59 assert(distance(c.begin(), c.end()) == 3);
66 assert(distance(c.begin(), c.end()) == 5);
insert_after_range.pass.cpp 33 assert(distance(c.begin(), c.end()) == 0);
37 assert(distance(c.begin(), c.end()) == 3);
44 assert(distance(c.begin(), c.end()) == 5);
61 assert(distance(c.begin(), c.end()) == 0);
65 assert(distance(c.begin(), c.end()) == 3);
72 assert(distance(c.begin(), c.end()) == 5);
insert_after_size_value.pass.cpp 28 assert(distance(c.begin(), c.end()) == 0);
32 assert(distance(c.begin(), c.end()) == 3);
39 assert(distance(c.begin(), c.end()) == 5);
54 assert(distance(c.begin(), c.end()) == 0);
58 assert(distance(c.begin(), c.end()) == 3);
65 assert(distance(c.begin(), c.end()) == 5);
resize_size_value.pass.cpp 29 assert(distance(c.begin(), c.end()) == 3);
35 assert(distance(c.begin(), c.end()) == 6);
44 assert(distance(c.begin(), c.end()) == 6);
60 assert(distance(c.begin(), c.end()) == 3);
66 assert(distance(c.begin(), c.end()) == 6);
75 assert(distance(c.begin(), c.end()) == 6);
emplace_after.pass.cpp 32 assert(distance(c.begin(), c.end()) == 1);
38 assert(distance(c.begin(), c.end()) == 2);
45 assert(distance(c.begin(), c.end()) == 3);
53 assert(distance(c.begin(), c.end()) == 4);
64 assert(distance(c.begin(), c.end()) == 1);
70 assert(distance(c.begin(), c.end()) == 2);
77 assert(distance(c.begin(), c.end()) == 3);
85 assert(distance(c.begin(), c.end()) == 4);
insert_after_const.pass.cpp 30 assert(distance(c.begin(), c.end()) == 1);
36 assert(distance(c.begin(), c.end()) == 2);
43 assert(distance(c.begin(), c.end()) == 3);
51 assert(distance(c.begin(), c.end()) == 4);
63 assert(distance(c.begin(), c.end()) == 1);
69 assert(distance(c.begin(), c.end()) == 2);
76 assert(distance(c.begin(), c.end()) == 3);
84 assert(distance(c.begin(), c.end()) == 4);
insert_after_rv.pass.cpp 32 assert(distance(c.begin(), c.end()) == 1);
38 assert(distance(c.begin(), c.end()) == 2);
45 assert(distance(c.begin(), c.end()) == 3);
53 assert(distance(c.begin(), c.end()) == 4);
65 assert(distance(c.begin(), c.end()) == 1);
71 assert(distance(c.begin(), c.end()) == 2);
78 assert(distance(c.begin(), c.end()) == 3);
86 assert(distance(c.begin(), c.end()) == 4);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.spec/
member_swap.pass.cpp 32 assert(distance(c1.begin(), c1.end()) == 3);
38 assert(distance(c2.begin(), c2.end()) == 6);
56 assert(distance(c1.begin(), c1.end()) == 0);
59 assert(distance(c2.begin(), c2.end()) == 6);
77 assert(distance(c1.begin(), c1.end()) == 3);
83 assert(distance(c2.begin(), c2.end()) == 0);
94 assert(distance(c1.begin(), c1.end()) == 0);
97 assert(distance(c2.begin(), c2.end()) == 0);
111 assert(distance(c1.begin(), c1.end()) == 3);
117 assert(distance(c2.begin(), c2.end()) == 6)
    [all...]
non_member_swap.pass.cpp 33 assert(distance(c1.begin(), c1.end()) == 3);
39 assert(distance(c2.begin(), c2.end()) == 6);
57 assert(distance(c1.begin(), c1.end()) == 0);
60 assert(distance(c2.begin(), c2.end()) == 6);
78 assert(distance(c1.begin(), c1.end()) == 3);
84 assert(distance(c2.begin(), c2.end()) == 0);
95 assert(distance(c1.begin(), c1.end()) == 0);
98 assert(distance(c2.begin(), c2.end()) == 0);
112 assert(distance(c1.begin(), c1.end()) == 3);
118 assert(distance(c2.begin(), c2.end()) == 6)
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/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);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/unord.multimap.cnstr/
assign_move.pass.cpp 65 assert(std::distance(eq.first, eq.second) == 2);
73 assert(std::distance(eq.first, eq.second) == 2);
82 assert(std::distance(eq.first, eq.second) == 1);
87 assert(std::distance(eq.first, eq.second) == 1);
91 assert(std::distance(c.begin(), c.end()) == c.size());
92 assert(std::distance(c.cbegin(), c.cend()) == c.size());
130 assert(std::distance(eq.first, eq.second) == 2);
138 assert(std::distance(eq.first, eq.second) == 2);
147 assert(std::distance(eq.first, eq.second) == 1);
152 assert(std::distance(eq.first, eq.second) == 1)
    [all...]
  /external/chromium_org/third_party/libwebp/enc/
backward_references.h 81 // Splitting of distance and length codes into prefixes and
84 static WEBP_INLINE void PrefixEncode(int distance, int* const code,
87 if (distance > 2) { // Collect the two most significant bits.
88 const int highest_bit = BitsLog2Floor(--distance);
89 const int second_highest_bit = (distance >> (highest_bit - 1)) & 1;
91 *extra_bits_value = distance & ((1 << *extra_bits_count) - 1);
96 *code = (distance == 2) ? 1 : 0;
117 static WEBP_INLINE PixOrCopy PixOrCopyCreateCopy(uint32_t distance,
121 retval.argb_or_distance = distance;
  /external/jmonkeyengine/engine/src/android/com/jme3/util/
FastInteger.java 240 * @param distance
245 public static int rotateLeft(int i, int distance) {
246 if (distance == 0) {
251 * implicitly masked with 0x1F, which the negation of 'distance' is
254 return ((i << distance) | (i >>> (-distance)));
263 * @param distance
268 public static int rotateRight(int i, int distance) {
269 if (distance == 0) {
274 * implicitly masked with 0x1F, which the negation of 'distance' i
    [all...]
  /external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/
ShadowAbsListView.java 25 public void smoothScrollBy(int distance, int duration) {
26 this.lastSmoothScrollByDistance = distance;
49 * Robolectric accessor for the last smoothScrollBy distance
51 * @return int distance
  /external/webp/src/enc/
backward_references.h 81 // Splitting of distance and length codes into prefixes and
84 static WEBP_INLINE void PrefixEncode(int distance, int* const code,
87 if (distance > 2) { // Collect the two most significant bits.
88 const int highest_bit = BitsLog2Floor(--distance);
89 const int second_highest_bit = (distance >> (highest_bit - 1)) & 1;
91 *extra_bits_value = distance & ((1 << *extra_bits_count) - 1);
96 *code = (distance == 2) ? 1 : 0;
117 static WEBP_INLINE PixOrCopy PixOrCopyCreateCopy(uint32_t distance,
121 retval.argb_or_distance = distance;
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.cons/
assign_initializer_list.pass.cpp 43 assert(distance(m.begin(), m.end()) == 3);
68 assert(distance(m.begin(), m.end()) == 3);
initializer_list.pass.cpp 39 assert(distance(m.begin(), m.end()) == 3);
60 assert(distance(m.begin(), m.end()) == 3);
move.pass.cpp 35 assert(distance(m.begin(), m.end()) == 0);
40 assert(distance(mo.begin(), mo.end()) == 0);
62 assert(distance(m.begin(), m.end()) == 3);
70 assert(distance(mo.begin(), mo.end()) == 0);
81 assert(distance(m.begin(), m.end()) == 0);
86 assert(distance(mo.begin(), mo.end()) == 0);
108 assert(distance(m.begin(), m.end()) == 3);
116 assert(distance(mo.begin(), mo.end()) == 0);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.modifiers/
insert_initializer_list.pass.cpp 41 assert(distance(m.begin(), m.end()) == 3);
64 assert(distance(m.begin(), m.end()) == 3);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/set.cons/
iter_iter.pass.cpp 42 assert(distance(m.begin(), m.end()) == 3);
65 assert(distance(m.begin(), m.end()) == 3);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.iter/
iterators.pass.cpp 33 assert(std::distance(i, j) == 0);
42 assert(std::distance(i, j) == 0);
51 assert(std::distance(i, j) == 0);
66 assert(std::distance(c.begin(), c.end()) == 10);
81 assert(std::distance(i, j) == 0);
90 assert(std::distance(i, j) == 0);
99 assert(std::distance(i, j) == 0);
114 assert(std::distance(c.begin(), c.end()) == 10);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/
iterators.pass.cpp 39 assert(std::distance(i, j) == 0);
48 assert(std::distance(i, j) == 0);
57 assert(std::distance(i, j) == 0);
72 assert(std::distance(c.begin(), c.end()) == 10);
87 assert(std::distance(i, j) == 0);
96 assert(std::distance(i, j) == 0);
105 assert(std::distance(i, j) == 0);
120 assert(std::distance(c.begin(), c.end()) == 10);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.modifiers/
erase_iter_iter.pass.cpp 26 assert(distance(l1.cbegin(), l1.cend()) == 3);
33 assert(distance(l1.cbegin(), l1.cend()) == 2);
41 assert(distance(l1.cbegin(), l1.cend()) == 1);
49 assert(distance(l1.cbegin(), l1.cend()) == 0);
57 assert(distance(l1.cbegin(), l1.cend()) == 3);
64 assert(distance(l1.cbegin(), l1.cend()) == 2);
72 assert(distance(l1.cbegin(), l1.cend()) == 1);
80 assert(distance(l1.cbegin(), l1.cend()) == 0);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/
iterators.pass.cpp 39 assert(std::distance(i, j) == 0);
48 assert(std::distance(i, j) == 0);
57 assert(std::distance(i, j) == 0);
72 assert(std::distance(c.begin(), c.end()) == 10);
87 assert(std::distance(i, j) == 0);
96 assert(std::distance(i, j) == 0);
105 assert(std::distance(i, j) == 0);
120 assert(std::distance(c.begin(), c.end()) == 10);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.modifiers/
erase_iter_iter.pass.cpp 26 assert(distance(l1.cbegin(), l1.cend()) == 3);
33 assert(distance(l1.cbegin(), l1.cend()) == 2);
41 assert(distance(l1.cbegin(), l1.cend()) == 1);
49 assert(distance(l1.cbegin(), l1.cend()) == 0);
64 assert(distance(l1.cbegin(), l1.cend()) == 3);
71 assert(distance(l1.cbegin(), l1.cend()) == 2);
79 assert(distance(l1.cbegin(), l1.cend()) == 1);
87 assert(distance(l1.cbegin(), l1.cend()) == 0);

Completed in 2280 milliseconds

1 2 3 45 6 7 8 91011>>