| /external/libcxx/test/std/containers/associative/multiset/ |
| equal_range.pass.cpp | 45 assert(r.first == next(m.begin(), 0));
46 assert(r.second == next(m.begin(), 0));
48 assert(r.first == next(m.begin(), 0));
49 assert(r.second == next(m.begin(), 3));
51 assert(r.first == next(m.begin(), 3));
52 assert(r.second == next(m.begin(), 3));
54 assert(r.first == next(m.begin(), 3));
55 assert(r.second == next(m.begin(), 6));
57 assert(r.first == next(m.begin(), 6));
58 assert(r.second == next(m.begin(), 6))
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/multiset/ |
| equal_range.pass.cpp | 45 assert(r.first == next(m.begin(), 0));
46 assert(r.second == next(m.begin(), 0));
48 assert(r.first == next(m.begin(), 0));
49 assert(r.second == next(m.begin(), 3));
51 assert(r.first == next(m.begin(), 3));
52 assert(r.second == next(m.begin(), 3));
54 assert(r.first == next(m.begin(), 3));
55 assert(r.second == next(m.begin(), 6));
57 assert(r.first == next(m.begin(), 6));
58 assert(r.second == next(m.begin(), 6))
[all...] |
| /external/libcxx/test/std/containers/associative/multimap/multimap.cons/ |
| iter_iter.pass.cpp | 41 assert(distance(m.begin(), m.end()) == 9);
42 assert(*m.begin() == V(1, 1));
43 assert(*next(m.begin()) == V(1, 1.5));
44 assert(*next(m.begin(), 2) == V(1, 2));
45 assert(*next(m.begin(), 3) == V(2, 1));
46 assert(*next(m.begin(), 4) == V(2, 1.5));
47 assert(*next(m.begin(), 5) == V(2, 2));
48 assert(*next(m.begin(), 6) == V(3, 1));
49 assert(*next(m.begin(), 7) == V(3, 1.5));
50 assert(*next(m.begin(), 8) == V(3, 2))
[all...] |
| iter_iter_comp_alloc.pass.cpp | 47 assert(distance(m.begin(), m.end()) == 9);
48 assert(*m.begin() == V(1, 1));
49 assert(*next(m.begin()) == V(1, 1.5));
50 assert(*next(m.begin(), 2) == V(1, 2));
51 assert(*next(m.begin(), 3) == V(2, 1));
52 assert(*next(m.begin(), 4) == V(2, 1.5));
53 assert(*next(m.begin(), 5) == V(2, 2));
54 assert(*next(m.begin(), 6) == V(3, 1));
55 assert(*next(m.begin(), 7) == V(3, 1.5));
56 assert(*next(m.begin(), 8) == V(3, 2))
[all...] |
| iter_iter_comp.pass.cpp | 44 assert(distance(m.begin(), m.end()) == 9);
45 assert(*m.begin() == V(1, 1));
46 assert(*next(m.begin()) == V(1, 1.5));
47 assert(*next(m.begin(), 2) == V(1, 2));
48 assert(*next(m.begin(), 3) == V(2, 1));
49 assert(*next(m.begin(), 4) == V(2, 1.5));
50 assert(*next(m.begin(), 5) == V(2, 2));
51 assert(*next(m.begin(), 6) == V(3, 1));
52 assert(*next(m.begin(), 7) == V(3, 1.5));
53 assert(*next(m.begin(), 8) == V(3, 2))
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/multimap/multimap.cons/ |
| iter_iter.pass.cpp | 41 assert(distance(m.begin(), m.end()) == 9);
42 assert(*m.begin() == V(1, 1));
43 assert(*next(m.begin()) == V(1, 1.5));
44 assert(*next(m.begin(), 2) == V(1, 2));
45 assert(*next(m.begin(), 3) == V(2, 1));
46 assert(*next(m.begin(), 4) == V(2, 1.5));
47 assert(*next(m.begin(), 5) == V(2, 2));
48 assert(*next(m.begin(), 6) == V(3, 1));
49 assert(*next(m.begin(), 7) == V(3, 1.5));
50 assert(*next(m.begin(), 8) == V(3, 2))
[all...] |
| iter_iter_comp_alloc.pass.cpp | 47 assert(distance(m.begin(), m.end()) == 9);
48 assert(*m.begin() == V(1, 1));
49 assert(*next(m.begin()) == V(1, 1.5));
50 assert(*next(m.begin(), 2) == V(1, 2));
51 assert(*next(m.begin(), 3) == V(2, 1));
52 assert(*next(m.begin(), 4) == V(2, 1.5));
53 assert(*next(m.begin(), 5) == V(2, 2));
54 assert(*next(m.begin(), 6) == V(3, 1));
55 assert(*next(m.begin(), 7) == V(3, 1.5));
56 assert(*next(m.begin(), 8) == V(3, 2))
[all...] |
| iter_iter_comp.pass.cpp | 44 assert(distance(m.begin(), m.end()) == 9);
45 assert(*m.begin() == V(1, 1));
46 assert(*next(m.begin()) == V(1, 1.5));
47 assert(*next(m.begin(), 2) == V(1, 2));
48 assert(*next(m.begin(), 3) == V(2, 1));
49 assert(*next(m.begin(), 4) == V(2, 1.5));
50 assert(*next(m.begin(), 5) == V(2, 2));
51 assert(*next(m.begin(), 6) == V(3, 1));
52 assert(*next(m.begin(), 7) == V(3, 1.5));
53 assert(*next(m.begin(), 8) == V(3, 2))
[all...] |
| /external/libcxx/test/std/containers/associative/map/map.ops/ |
| lower_bound.pass.cpp | 45 assert(r == m.begin());
47 assert(r == next(m.begin()));
49 assert(r == next(m.begin(), 2));
51 assert(r == next(m.begin(), 3));
53 assert(r == next(m.begin(), 4));
55 assert(r == next(m.begin(), 5));
57 assert(r == next(m.begin(), 6));
59 assert(r == next(m.begin(), 7));
61 assert(r == next(m.begin(), 0));
63 assert(r == next(m.begin(), 1))
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/map/map.ops/ |
| lower_bound.pass.cpp | 45 assert(r == m.begin());
47 assert(r == next(m.begin()));
49 assert(r == next(m.begin(), 2));
51 assert(r == next(m.begin(), 3));
53 assert(r == next(m.begin(), 4));
55 assert(r == next(m.begin(), 5));
57 assert(r == next(m.begin(), 6));
59 assert(r == next(m.begin(), 7));
61 assert(r == next(m.begin(), 0));
63 assert(r == next(m.begin(), 1))
[all...] |
| /external/libcxx/test/std/containers/sequences/list/list.ops/ |
| splice_pos_list_iter.pass.cpp | 27 l1.splice(l1.end(), l2, l2.begin());
29 assert(distance(l1.begin(), l1.end()) == 1);
31 assert(distance(l2.begin(), l2.end()) == 0);
32 std::list<int>::const_iterator i = l1.begin();
38 l1.splice(l1.end(), l2, l2.begin());
40 assert(distance(l1.begin(), l1.end()) == 1);
42 assert(distance(l2.begin(), l2.end()) == 1);
43 std::list<int>::const_iterator i = l1.begin();
45 i = l2.begin();
51 l1.splice(l1.end(), l2, next(l2.begin()));
[all...] |
| splice_pos_list_iter_iter.pass.cpp | 26 l1.splice(l1.begin(), l1, next(l1.begin()), next(l1.begin()));
28 assert(distance(l1.begin(), l1.end()) == 3);
29 std::list<int>::const_iterator i = l1.begin();
38 l1.splice(l1.begin(), l1, next(l1.begin()), next(l1.begin(), 2));
40 assert(distance(l1.begin(), l1.end()) == 3);
41 std::list<int>::const_iterator i = l1.begin();
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/list/list.ops/ |
| splice_pos_list_iter.pass.cpp | 27 l1.splice(l1.end(), l2, l2.begin());
29 assert(distance(l1.begin(), l1.end()) == 1);
31 assert(distance(l2.begin(), l2.end()) == 0);
32 std::list<int>::const_iterator i = l1.begin();
38 l1.splice(l1.end(), l2, l2.begin());
40 assert(distance(l1.begin(), l1.end()) == 1);
42 assert(distance(l2.begin(), l2.end()) == 1);
43 std::list<int>::const_iterator i = l1.begin();
45 i = l2.begin();
51 l1.splice(l1.end(), l2, next(l2.begin()));
[all...] |
| splice_pos_list_iter_iter.pass.cpp | 26 l1.splice(l1.begin(), l1, next(l1.begin()), next(l1.begin()));
28 assert(distance(l1.begin(), l1.end()) == 3);
29 std::list<int>::const_iterator i = l1.begin();
38 l1.splice(l1.begin(), l1, next(l1.begin()), next(l1.begin(), 2));
40 assert(distance(l1.begin(), l1.end()) == 3);
41 std::list<int>::const_iterator i = l1.begin();
[all...] |
| /external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.modifiers/ |
| emplace_after.pass.cpp | 31 assert(i == c.begin());
33 assert(distance(c.begin(), c.end()) == 1);
36 assert(i == next(c.begin()));
38 assert(*next(c.begin()) == Emplaceable(1, 2.5));
39 assert(distance(c.begin(), c.end()) == 2);
42 assert(i == next(c.begin(), 2));
44 assert(*next(c.begin()) == Emplaceable(1, 2.5));
45 assert(*next(c.begin(), 2) == Emplaceable(2, 3.5));
46 assert(distance(c.begin(), c.end()) == 3);
49 assert(i == next(c.begin()));
[all...] |
| insert_after_const.pass.cpp | 27 assert(i == c.begin());
30 assert(distance(c.begin(), c.end()) == 1);
33 assert(i == next(c.begin()));
35 assert(*next(c.begin()) == 1);
36 assert(distance(c.begin(), c.end()) == 2);
39 assert(i == next(c.begin(), 2));
41 assert(*next(c.begin()) == 1);
42 assert(*next(c.begin(), 2) == 2);
43 assert(distance(c.begin(), c.end()) == 3);
46 assert(i == next(c.begin()));
[all...] |
| insert_after_rv.pass.cpp | 30 assert(i == c.begin());
33 assert(distance(c.begin(), c.end()) == 1);
36 assert(i == next(c.begin()));
38 assert(*next(c.begin()) == 1);
39 assert(distance(c.begin(), c.end()) == 2);
42 assert(i == next(c.begin(), 2));
44 assert(*next(c.begin()) == 1);
45 assert(*next(c.begin(), 2) == 2);
46 assert(distance(c.begin(), c.end()) == 3);
49 assert(i == next(c.begin()));
[all...] |
| /external/protobuf/src/google/protobuf/stubs/ |
| stl_util.h | 52 void STLDeleteContainerPointers(ForwardIterator begin,
54 while (begin != end) {
55 ForwardIterator temp = begin;
56 ++begin;
85 return str->empty() ? NULL : &*str->begin();
90 // hash_set, or any other STL container which defines sensible begin(), end(),
101 STLDeleteContainerPointers(container->begin(), container->end());
112 for (typename T::iterator i = v->begin(); i != v->end(); ++i) {
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/ |
| range_access.h | 48 begin(_Container& __cont) -> decltype(__cont.begin())
49 { return __cont.begin(); }
58 begin(const _Container& __cont) -> decltype(__cont.begin())
59 { return __cont.begin(); }
87 begin(_Tp (&__arr)[_Nm])
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
| range_access.h | 48 begin(_Container& __cont) -> decltype(__cont.begin())
49 { return __cont.begin(); }
58 begin(const _Container& __cont) -> decltype(__cont.begin())
59 { return __cont.begin(); }
87 begin(_Tp (&__arr)[_Nm])
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/forwardlist/forwardlist.modifiers/ |
| emplace_after.pass.cpp | 31 assert(i == c.begin());
33 assert(distance(c.begin(), c.end()) == 1);
36 assert(i == next(c.begin()));
38 assert(*next(c.begin()) == Emplaceable(1, 2.5));
39 assert(distance(c.begin(), c.end()) == 2);
42 assert(i == next(c.begin(), 2));
44 assert(*next(c.begin()) == Emplaceable(1, 2.5));
45 assert(*next(c.begin(), 2) == Emplaceable(2, 3.5));
46 assert(distance(c.begin(), c.end()) == 3);
49 assert(i == next(c.begin()));
[all...] |
| insert_after_const.pass.cpp | 27 assert(i == c.begin());
30 assert(distance(c.begin(), c.end()) == 1);
33 assert(i == next(c.begin()));
35 assert(*next(c.begin()) == 1);
36 assert(distance(c.begin(), c.end()) == 2);
39 assert(i == next(c.begin(), 2));
41 assert(*next(c.begin()) == 1);
42 assert(*next(c.begin(), 2) == 2);
43 assert(distance(c.begin(), c.end()) == 3);
46 assert(i == next(c.begin()));
[all...] |
| insert_after_rv.pass.cpp | 30 assert(i == c.begin());
33 assert(distance(c.begin(), c.end()) == 1);
36 assert(i == next(c.begin()));
38 assert(*next(c.begin()) == 1);
39 assert(distance(c.begin(), c.end()) == 2);
42 assert(i == next(c.begin(), 2));
44 assert(*next(c.begin()) == 1);
45 assert(*next(c.begin(), 2) == 2);
46 assert(distance(c.begin(), c.end()) == 3);
49 assert(i == next(c.begin()));
[all...] |
| /prebuilts/tools/darwin-x86_64/protoc/include/google/protobuf/stubs/ |
| stl_util.h | 52 void STLDeleteContainerPointers(ForwardIterator begin,
54 while (begin != end) {
55 ForwardIterator temp = begin;
56 ++begin;
85 return str->empty() ? NULL : &*str->begin();
90 // hash_set, or any other STL container which defines sensible begin(), end(),
101 STLDeleteContainerPointers(container->begin(), container->end());
112 for (typename T::iterator i = v->begin(); i != v->end(); ++i) {
|
| /tools/apksig/src/test/java/com/android/apksig/internal/util/ |
| ChainedDataSourceTest.java | 51 for (int begin = 0; begin < mChain.size(); begin++) {
52 for (int end = begin + 1; end < mChain.size(); end++) {
53 int size = end - begin;
55 mChain.feed(begin, size, sink);
57 ByteBuffer.wrap("1234567890".substring(begin, end).getBytes(US_ASCII)),
69 for (int begin = 0; begin < mChain.size(); begin++)
[all...] |
