| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.partitions/ |
| partition.pass.cpp | 12 // template<BidirectionalIterator Iter, Predicate<auto, Iter::value_type> Pred>
13 // requires ShuffleIterator<Iter>
15 // Iter
16 // partition(Iter first, Iter last, Pred pred);
31 template <class Iter>
38 Iter r = std::partition(Iter(ia), Iter(ia + sa), is_odd())
[all...] |
| stable_partition.pass.cpp | 12 // template<BidirectionalIterator Iter, Predicate<auto, Iter::value_type> Pred>
13 // requires ShuffleIterator<Iter>
15 // Iter
16 // stable_partition(Iter first, Iter last, Pred pred);
37 template <class Iter>
57 Iter r = std::stable_partition(Iter(array), Iter(array+size), odd_first())
[all...] |
| /external/google-breakpad/src/testing/gtest/scripts/ |
| gen_gtest_pred_impl.py | 189 def Iter(n, format, sep=''):
197 Iter(3, 'v%s', sep=', ') returns 'v1, v2, v3'.
211 'vs' : Iter(n, 'v%s', sep=', '),
212 'vts' : Iter(n, '#v%s', sep=', '),
223 impl += Iter(n, """,
229 impl += Iter(n, """,
235 impl += Iter(n, """,
245 impl += Iter(n, """
250 impl += Iter(n, """
267 impl += Iter(n, """, \
[all...] |
| /external/protobuf/gtest/scripts/ |
| gen_gtest_pred_impl.py | 189 def Iter(n, format, sep=''):
197 Iter(3, 'v%s', sep=', ') returns 'v1, v2, v3'.
211 'vs' : Iter(n, 'v%s', sep=', '),
212 'vts' : Iter(n, '#v%s', sep=', '),
223 impl += Iter(n, """,
229 impl += Iter(n, """,
235 impl += Iter(n, """,
246 impl += Iter(n, """
251 impl += Iter(n, """
269 impl += Iter(n, """, \
[all...] |
| /external/vulkan-validation-layers/tests/gtest-1.7.0/scripts/ |
| gen_gtest_pred_impl.py | 189 def Iter(n, format, sep=''):
197 Iter(3, 'v%s', sep=', ') returns 'v1, v2, v3'.
211 'vs' : Iter(n, 'v%s', sep=', '),
212 'vts' : Iter(n, '#v%s', sep=', '),
223 impl += Iter(n, """,
229 impl += Iter(n, """,
235 impl += Iter(n, """,
245 impl += Iter(n, """
250 impl += Iter(n, """
267 impl += Iter(n, """, \
[all...] |
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.partitions/ |
| stable_partition.pass.cpp | 12 // template<BidirectionalIterator Iter, Predicate<auto, Iter::value_type> Pred>
13 // requires ShuffleIterator<Iter>
15 // Iter
16 // stable_partition(Iter first, Iter last, Pred pred);
36 template <class Iter>
56 Iter r = std::stable_partition(Iter(array), Iter(array+size), odd_first())
[all...] |
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/ |
| unique_pred.pass.cpp | 12 // template<ForwardIterator Iter, EquivalenceRelation<auto, Iter::value_type> Pred>
13 // requires OutputIterator<Iter, RvalueOf<Iter::reference>::type>
15 // Iter
16 // unique(Iter first, Iter last, Pred pred);
36 template <class Iter>
43 Iter r = std::unique(Iter(ia), Iter(ia+sa), count_equal())
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.unique/ |
| unique_pred.pass.cpp | 12 // template<ForwardIterator Iter, EquivalenceRelation<auto, Iter::value_type> Pred>
13 // requires OutputIterator<Iter, RvalueOf<Iter::reference>::type>
15 // Iter
16 // unique(Iter first, Iter last, Pred pred);
36 template <class Iter>
43 Iter r = std::unique(Iter(ia), Iter(ia+sa), count_equal())
[all...] |
| /external/libcxx/test/std/containers/unord/unord.map/ |
| compare.pass.cpp | 40 typedef MapT::iterator Iter;
42 Iter it = map.find(Key(0));
44 std::pair<Iter, bool> result = map.insert(std::make_pair(Key(0), 42));
|
| /external/skia/src/core/ |
| SkTLList.h | 39 class Iter;
52 typename NodeList::Iter iter; local
53 Node* node = iter.init(fList, Iter::kHead_IterStart);
57 node = iter.next();
89 template <typename... Args> T* addBefore(Iter location, Args&&... args) {
99 template <typename... Args> T* addAfter(Iter location, Args&&... args) {
108 Iter headIter() const { return Iter(*this, Iter::kHead_IterStart);
280 typename NodeList::Iter iter; local
[all...] |
| /external/libcxx/test/std/re/re.regex/re.regex.construct/ |
| iter_iter.pass.cpp | 22 template <class Iter>
24 test(Iter first, Iter last, unsigned mc)
26 std::basic_regex<typename std::iterator_traits<Iter>::value_type> r(first, last);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/re/re.regex/re.regex.construct/ |
| iter_iter.pass.cpp | 22 template <class Iter>
24 test(Iter first, Iter last, unsigned mc)
26 std::basic_regex<typename std::iterator_traits<Iter>::value_type> r(first, last);
|
| /external/skia/src/utils/ |
| SkNWayCanvas.cpp | 40 class SkNWayCanvas::Iter {
42 Iter(const SkTDArray<SkCanvas*>& list) : fList(list) {
61 Iter iter(fList);
62 while (iter.next()) {
63 iter->save();
70 Iter iter(fList);
71 while (iter.next()) {
72 iter->saveLayer(rec)
[all...] |
| /external/skia/include/core/ |
| SkDeque.h | 65 class Iter {
75 Iter();
77 Iter(const SkDeque& d, IterStart startLoc);
89 // Inherit privately from Iter to prevent access to reverse iteration
90 class F2BIter : private Iter {
95 * Wrap Iter's 2 parameter ctor to force initialization to the
100 using Iter::next;
103 * Wrap Iter::reset to force initialization to the beginning of the
111 typedef Iter INHERITED;
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/test/utils/iterator/ |
| token_iterator.hpp | 216 template<typename Iter>
217 bool get( Iter& begin, Iter end )
219 typedef ut_detail::token_assigner<BOOST_DEDUCED_TYPENAME iterator_traversal<Iter>::type> Assigner;
220 Iter check_point;
338 template<typename Iter,
339 typename CharCompare = ut_detail::default_char_compare<BOOST_DEDUCED_TYPENAME iterator_value<Iter>::type>,
340 typename ValueType = std::basic_string<BOOST_DEDUCED_TYPENAME iterator_value<Iter>::type>,
343 : public token_iterator_base<range_token_iterator<Iter,CharCompare,ValueType,Reference>,
344 typename iterator_value<Iter>::type,CharCompare,ValueType,Reference>
[all...] |
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/ |
| remove_if.pass.cpp | 12 // template<ForwardIterator Iter, Predicate<auto, Iter::value_type> Pred>
13 // requires OutputIterator<Iter, RvalueOf<Iter::reference>::type>
15 // Iter
16 // remove_if(Iter first, Iter last, Pred pred);
30 template <class Iter>
56 template <class Iter>
71 Iter r = std::remove_if(Iter(ia), Iter(ia+sa), pred())
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.remove/ |
| remove_if.pass.cpp | 12 // template<ForwardIterator Iter, Predicate<auto, Iter::value_type> Pred>
13 // requires OutputIterator<Iter, RvalueOf<Iter::reference>::type>
15 // Iter
16 // remove_if(Iter first, Iter last, Pred pred);
27 template <class Iter>
50 template <class Iter>
65 Iter r = std::remove_if(Iter(ia), Iter(ia+sa), pred())
[all...] |
| /external/libcxx/test/std/algorithms/alg.sorting/alg.permutation.generators/ |
| next_permutation.pass.cpp | 12 // template<BidirectionalIterator Iter>
13 // requires ShuffleIterator<Iter>
14 // && LessThanComparable<Iter::value_type>
16 // next_permutation(Iter first, Iter last);
33 template <class Iter>
47 x = std::next_permutation(Iter(ia), Iter(ia+e));
|
| next_permutation_comp.pass.cpp | 12 // template<BidirectionalIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare>
13 // requires ShuffleIterator<Iter>
16 // next_permutation(Iter first, Iter last, Compare comp);
34 template <class Iter>
49 x = std::next_permutation(Iter(ia), Iter(ia+e), C());
|
| prev_permutation.pass.cpp | 12 // template<BidirectionalIterator Iter>
13 // requires ShuffleIterator<Iter>
14 // && LessThanComparable<Iter::value_type>
16 // prev_permutation(Iter first, Iter last);
33 template <class Iter>
47 x = std::prev_permutation(Iter(ia), Iter(ia+e));
|
| prev_permutation_comp.pass.cpp | 12 // template<BidirectionalIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare>
13 // requires ShuffleIterator<Iter>
16 // prev_permutation(Iter first, Iter last, Compare comp);
34 template <class Iter>
49 x = std::prev_permutation(Iter(ia), Iter(ia+e), C());
|
| /external/libcxx/test/std/containers/associative/map/ |
| compare.pass.cpp | 31 typedef MapT::iterator Iter;
32 typedef std::pair<Iter, bool> IterBool;
38 Iter it = m_empty.find(Key(0));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/ |
| next_permutation.pass.cpp | 12 // template<BidirectionalIterator Iter>
13 // requires ShuffleIterator<Iter>
14 // && LessThanComparable<Iter::value_type>
16 // next_permutation(Iter first, Iter last);
33 template <class Iter>
47 x = std::next_permutation(Iter(ia), Iter(ia+e));
|
| next_permutation_comp.pass.cpp | 12 // template<BidirectionalIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare>
13 // requires ShuffleIterator<Iter>
16 // next_permutation(Iter first, Iter last, Compare comp);
34 template <class Iter>
49 x = std::next_permutation(Iter(ia), Iter(ia+e), C());
|
| prev_permutation.pass.cpp | 12 // template<BidirectionalIterator Iter>
13 // requires ShuffleIterator<Iter>
14 // && LessThanComparable<Iter::value_type>
16 // prev_permutation(Iter first, Iter last);
33 template <class Iter>
47 x = std::prev_permutation(Iter(ia), Iter(ia+e));
|
