| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/ |
| size.pass.cpp | 33 m.erase(m.begin());
35 m.erase(m.begin());
37 m.erase(m.begin());
51 m.erase(m.begin());
53 m.erase(m.begin());
55 m.erase(m.begin());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/ |
| size.pass.cpp | 33 m.erase(m.begin());
35 m.erase(m.begin());
37 m.erase(m.begin());
51 m.erase(m.begin());
53 m.erase(m.begin());
55 m.erase(m.begin());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/ |
| insert_iter_iter.pass.cpp | 44 assert(*m.begin() == 1);
45 assert(*next(m.begin()) == 2);
46 assert(*next(m.begin(), 2) == 3);
68 assert(*m.begin() == 1);
69 assert(*next(m.begin()) == 2);
70 assert(*next(m.begin(), 2) == 3);
|
| size.pass.cpp | 33 m.erase(m.begin());
35 m.erase(m.begin());
37 m.erase(m.begin());
51 m.erase(m.begin());
53 m.erase(m.begin());
55 m.erase(m.begin());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.cons/ |
| range.pass.cpp | 29 C c(I(std::begin(t)), I(std::end(t)));
31 for (C::const_iterator i = c.begin(), e = c.end(); i != e; ++i, ++n)
33 assert(n == std::end(t) - std::begin(t));
41 C c(I(std::begin(t)), I(std::end(t)));
43 for (C::const_iterator i = c.begin(), e = c.end(); i != e; ++i, ++n)
45 assert(n == std::end(t) - std::begin(t));
|
| range_alloc.pass.cpp | 32 C c(I(std::begin(t)), I(std::end(t)), A(13));
34 for (C::const_iterator i = c.begin(), e = c.end(); i != e; ++i, ++n)
36 assert(n == std::end(t) - std::begin(t));
46 C c(I(std::begin(t)), I(std::end(t)), A());
48 for (C::const_iterator i = c.begin(), e = c.end(); i != e; ++i, ++n)
50 assert(n == std::end(t) - std::begin(t));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.modifiers/ |
| emplace_front.pass.cpp | 29 assert(distance(c.begin(), c.end()) == 1);
32 assert(*next(c.begin()) == Emplaceable());
33 assert(distance(c.begin(), c.end()) == 2);
42 assert(distance(c.begin(), c.end()) == 1);
45 assert(*next(c.begin()) == Emplaceable());
46 assert(distance(c.begin(), c.end()) == 2);
|
| push_front_const.pass.cpp | 27 assert(distance(c.begin(), c.end()) == 1);
30 assert(*next(c.begin()) == 1);
31 assert(distance(c.begin(), c.end()) == 2);
40 assert(distance(c.begin(), c.end()) == 1);
43 assert(*next(c.begin()) == 1);
44 assert(distance(c.begin(), c.end()) == 2);
|
| push_front_rv.pass.cpp | 29 assert(distance(c.begin(), c.end()) == 1);
32 assert(*next(c.begin()) == 1);
33 assert(distance(c.begin(), c.end()) == 2);
42 assert(distance(c.begin(), c.end()) == 1);
45 assert(*next(c.begin()) == 1);
46 assert(distance(c.begin(), c.end()) == 2);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.ops/ |
| merge.pass.cpp | 28 C c1(std::begin(t1), std::end(t1));
29 C c2(std::begin(t2), std::end(t2));
31 C c3(std::begin(t3), std::end(t3));
41 C c1(std::begin(t1), std::end(t1));
42 C c2(std::begin(t2), std::end(t2));
44 C c3(std::begin(t3), std::end(t3));
|
| merge_pred.pass.cpp | 29 C c1(std::begin(t1), std::end(t1));
30 C c2(std::begin(t2), std::end(t2));
32 C c3(std::begin(t3), std::end(t3));
42 C c1(std::begin(t1), std::end(t1));
43 C c2(std::begin(t2), std::end(t2));
45 C c3(std::begin(t3), std::end(t3));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.cons/ |
| default.pass.cpp | 24 assert(std::distance(l.begin(), l.end()) == 0);
29 assert(std::distance(l.begin(), l.end()) == 0);
34 assert(std::distance(l.begin(), l.end()) == 0);
40 assert(std::distance(l.begin(), l.end()) == 0);
45 assert(std::distance(l.begin(), l.end()) == 0);
50 assert(std::distance(l.begin(), l.end()) == 0);
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/range/ |
| begin.hpp | 21 #include <boost/range/detail/begin.hpp>
49 return c.begin();
96 // unqualified calls to begin/end.
101 inline BOOST_DEDUCED_TYPENAME range_iterator<T>::type begin( T& r ) function in namespace:boost::range_adl_barrier
112 inline BOOST_DEDUCED_TYPENAME range_iterator<const T>::type begin( const T& r ) function in namespace:boost::range_adl_barrier
135 return boost::range_adl_barrier::begin( r );
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/test/utils/basic_cstring/ |
| compare.hpp | 69 return x.size() == y.size() && ut_detail::case_ins<CharT>::compare( x.begin(), y.begin(), x.size() ) == 0;
86 : ut_detail::case_ins<CharT>::compare( x.begin(), y.begin(), x.size() ) < 0;
104 : traits_type::compare( x.begin(), y.begin(), x.size() ) < 0;
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| alg_test.cpp | 81 int n = count(i.begin(), i.end(), 2);
85 count(i.begin(), i.end(), 2, n);
99 sort(years.begin(), years.end());
111 sort(years.begin(), years.end()); // <-- changed!
130 slist<int>::iterator slit = search_n(slint.begin(), slint.end(), 2, 2);
140 list<int>::iterator lit = search_n(lint.begin(), lint.end(), 3, 3);
150 deque<int>::iterator dit = search_n(dint.begin(), dint.end(), 4, 4);
163 slist<int>::iterator slit = search_n(slint.begin(), slint.end(), 2, 1, greater<int>());
173 list<int>::iterator lit = search_n(lint.begin(), lint.end(), 3, 2, greater<int>());
183 deque<int>::iterator dit = search_n(dint.begin(), dint.end(), 4, 3, greater<int>())
[all...] |
| heap_test.cpp | 78 make_heap(v.begin(), v.end());
81 push_heap(v.begin(), v.end());
83 sort_heap(v.begin(), v.end());
97 make_heap(v.begin(), v.end(), greater<int>());
100 push_heap(v.begin(), v.end(), greater<int>());
102 sort_heap(v.begin(), v.end(), greater<int>());
|
| mismatch_test.cpp | 55 __iota(v1.begin(), v1.end(), 0);
58 pair <IntVec::iterator, IntVec::iterator> result = mismatch(v1.begin(), v1.end(), v2.begin());
63 result = mismatch(v1.begin(), v1.end(), v2.begin());
65 CPPUNIT_ASSERT((result.first - v1.begin())==5);
|
| /ndk/tests/device/test-stlport/unit/ |
| alg_test.cpp | 81 int n = count(i.begin(), i.end(), 2);
85 count(i.begin(), i.end(), 2, n);
99 sort(years.begin(), years.end());
111 sort(years.begin(), years.end()); // <-- changed!
130 slist<int>::iterator slit = search_n(slint.begin(), slint.end(), 2, 2);
140 list<int>::iterator lit = search_n(lint.begin(), lint.end(), 3, 3);
150 deque<int>::iterator dit = search_n(dint.begin(), dint.end(), 4, 4);
163 slist<int>::iterator slit = search_n(slint.begin(), slint.end(), 2, 1, greater<int>());
173 list<int>::iterator lit = search_n(lint.begin(), lint.end(), 3, 2, greater<int>());
183 deque<int>::iterator dit = search_n(dint.begin(), dint.end(), 4, 3, greater<int>())
[all...] |
| heap_test.cpp | 78 make_heap(v.begin(), v.end());
81 push_heap(v.begin(), v.end());
83 sort_heap(v.begin(), v.end());
97 make_heap(v.begin(), v.end(), greater<int>());
100 push_heap(v.begin(), v.end(), greater<int>());
102 sort_heap(v.begin(), v.end(), greater<int>());
|
| mismatch_test.cpp | 55 __iota(v1.begin(), v1.end(), 0);
58 pair <IntVec::iterator, IntVec::iterator> result = mismatch(v1.begin(), v1.end(), v2.begin());
63 result = mismatch(v1.begin(), v1.end(), v2.begin());
65 CPPUNIT_ASSERT((result.first - v1.begin())==5);
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/debug/ |
| vector | 174 begin()
175 { return iterator(_Base::begin(), this); }
178 begin() const
179 { return const_iterator(_Base::begin(), this); }
199 { return reverse_iterator(begin()); }
203 { return const_reverse_iterator(begin()); }
208 { return const_iterator(_Base::begin(), this); }
220 { return const_reverse_iterator(begin()); }
232 this->_M_invalidate_if(_After_nth(__sz, _M_base().begin()));
356 difference_type __offset = __position - begin();
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/debug/ |
| vector | 174 begin()
175 { return iterator(_Base::begin(), this); }
178 begin() const
179 { return const_iterator(_Base::begin(), this); }
199 { return reverse_iterator(begin()); }
203 { return const_reverse_iterator(begin()); }
208 { return const_iterator(_Base::begin(), this); }
220 { return const_reverse_iterator(begin()); }
232 this->_M_invalidate_if(_After_nth(__sz, _M_base().begin()));
356 difference_type __offset = __position - begin();
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/debug/ |
| vector | 174 begin()
175 { return iterator(_Base::begin(), this); }
178 begin() const
179 { return const_iterator(_Base::begin(), this); }
199 { return reverse_iterator(begin()); }
203 { return const_reverse_iterator(begin()); }
208 { return const_iterator(_Base::begin(), this); }
220 { return const_reverse_iterator(begin()); }
232 this->_M_invalidate_if(_After_nth(__sz, _M_base().begin()));
356 difference_type __offset = __position - begin();
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/debug/ |
| vector | 174 begin()
175 { return iterator(_Base::begin(), this); }
178 begin() const
179 { return const_iterator(_Base::begin(), this); }
199 { return reverse_iterator(begin()); }
203 { return const_reverse_iterator(begin()); }
208 { return const_iterator(_Base::begin(), this); }
220 { return const_reverse_iterator(begin()); }
232 this->_M_invalidate_if(_After_nth(__sz, _M_base().begin()));
356 difference_type __offset = __position - begin();
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/debug/ |
| vector | 174 begin()
175 { return iterator(_Base::begin(), this); }
178 begin() const
179 { return const_iterator(_Base::begin(), this); }
199 { return reverse_iterator(begin()); }
203 { return const_reverse_iterator(begin()); }
208 { return const_iterator(_Base::begin(), this); }
220 { return const_reverse_iterator(begin()); }
232 this->_M_invalidate_if(_After_nth(__sz, _M_base().begin()));
356 difference_type __offset = __position - begin();
[all...] |
