| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.min.max/ |
| minmax_element_comp.pass.cpp | 12 // template<ForwardIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare>
14 // pair<Iter, Iter>
15 // minmax_element(Iter first, Iter last, Compare comp);
23 template <class Iter>
25 test(Iter first, Iter last)
29 std::pair<Iter, Iter> p = std::minmax_element(first, last, comp)
[all...] |
| /external/libcxx/test/std/algorithms/alg.sorting/alg.sort/is.sorted/ |
| is_sorted.pass.cpp | 12 // template<ForwardIterator Iter>
13 // requires LessThanComparable<Iter::value_type>
15 // is_sorted(Iter first, Iter last);
22 template <class Iter>
29 assert(std::is_sorted(Iter(a), Iter(a)));
30 assert(std::is_sorted(Iter(a), Iter(a+sa)));
36 assert(std::is_sorted(Iter(a), Iter(a+sa)))
[all...] |
| is_sorted_comp.pass.cpp | 12 // template<ForwardIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare>
15 // is_sorted(Iter first, Iter last, Compare comp);
23 template <class Iter>
30 assert(std::is_sorted(Iter(a), Iter(a)));
31 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>()));
37 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>()))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.sort/is.sorted/ |
| is_sorted.pass.cpp | 12 // template<ForwardIterator Iter>
13 // requires LessThanComparable<Iter::value_type>
15 // is_sorted(Iter first, Iter last);
22 template <class Iter>
29 assert(std::is_sorted(Iter(a), Iter(a)));
30 assert(std::is_sorted(Iter(a), Iter(a+sa)));
36 assert(std::is_sorted(Iter(a), Iter(a+sa)))
[all...] |
| is_sorted_comp.pass.cpp | 12 // template<ForwardIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare>
15 // is_sorted(Iter first, Iter last, Compare comp);
23 template <class Iter>
30 assert(std::is_sorted(Iter(a), Iter(a)));
31 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>()));
37 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>()))
[all...] |
| /art/runtime/base/ |
| iteration_range.h | 26 template <typename Iter>
29 typedef Iter iterator;
30 typedef typename std::iterator_traits<Iter>::difference_type difference_type;
31 typedef typename std::iterator_traits<Iter>::value_type value_type;
32 typedef typename std::iterator_traits<Iter>::pointer pointer;
33 typedef typename std::iterator_traits<Iter>::reference reference;
47 template <typename Iter>
48 static inline IterationRange<Iter> MakeIterationRange(const Iter& begin_it, const Iter& end_it)
[all...] |
| /external/libcxx/test/std/algorithms/alg.sorting/alg.min.max/ |
| max_element.pass.cpp | 12 // template<ForwardIterator Iter>
13 // requires LessThanComparable<Iter::value_type>
14 // Iter
15 // max_element(Iter first, Iter last);
22 template <class Iter>
24 test(Iter first, Iter last)
26 Iter i = std::max_element(first, last);
29 for (Iter j = first; j != last; ++j
[all...] |
| min_element.pass.cpp | 12 // template<ForwardIterator Iter>
13 // requires LessThanComparable<Iter::value_type>
14 // Iter
15 // min_element(Iter first, Iter last);
22 template <class Iter>
24 test(Iter first, Iter last)
26 Iter i = std::min_element(first, last);
29 for (Iter j = first; j != last; ++j
[all...] |
| max_element_comp.pass.cpp | 12 // template<ForwardIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare>
14 // Iter
15 // max_element(Iter first, Iter last, Compare comp);
23 template <class Iter>
25 test(Iter first, Iter last)
27 Iter i = std::max_element(first, last, std::greater<int>());
30 for (Iter j = first; j != last; ++j
[all...] |
| min_element_comp.pass.cpp | 12 // template<ForwardIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare>
14 // Iter
15 // min_element(Iter first, Iter last, Compare comp);
23 template <class Iter>
25 test(Iter first, Iter last)
27 Iter i = std::min_element(first, last, std::greater<int>());
30 for (Iter j = first; j != last; ++j
[all...] |
| /external/libcxx/test/std/algorithms/alg.sorting/alg.merge/ |
| inplace_merge.pass.cpp | 12 // template<BidirectionalIterator Iter>
13 // requires ShuffleIterator<Iter>
14 // && LessThanComparable<Iter::value_type>
16 // inplace_merge(Iter first, Iter middle, Iter last);
45 template <class Iter>
49 typedef typename std::iterator_traits<Iter>::value_type value_type;
57 std::inplace_merge(Iter(ia), Iter(ia+M), Iter(ia+N))
[all...] |
| inplace_merge_comp.pass.cpp | 12 // template<BidirectionalIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare>
13 // requires ShuffleIterator<Iter>
16 // inplace_merge(Iter first, Iter middle, Iter last, Compare comp);
61 template <class Iter>
66 typedef typename std::iterator_traits<Iter>::value_type value_type;
74 std::inplace_merge(Iter(ia), Iter(ia+M), Iter(ia+N), std::ref(pred))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.merge/ |
| inplace_merge_comp.pass.cpp | 12 // template<BidirectionalIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare>
13 // requires ShuffleIterator<Iter>
16 // inplace_merge(Iter first, Iter middle, Iter last, Compare comp);
35 template <class Iter>
46 std::inplace_merge(Iter(ia), Iter(ia+M), Iter(ia+N), std::greater<int>())
[all...] |
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.generate/ |
| generate.pass.cpp | 12 // template<ForwardIterator Iter, Callable Generator>
13 // requires OutputIterator<Iter, Generator::result_type>
16 // generate(Iter first, Iter last, Generator gen);
28 template <class Iter>
34 std::generate(Iter(ia), Iter(ia+n), gen_test());
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/equal.range/ |
| equal_range.pass.cpp | 12 // template<ForwardIterator Iter, class T>
13 // requires HasLess<T, Iter::value_type>
14 // && HasLess<Iter::value_type, T>
15 // pair<Iter, Iter>
16 // equal_range(Iter first, Iter last, const T& value);
24 template <class Iter, class T>
26 test(Iter first, Iter last, const T& value
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.generate/ |
| generate.pass.cpp | 12 // template<ForwardIterator Iter, Callable Generator>
13 // requires OutputIterator<Iter, Generator::result_type>
16 // generate(Iter first, Iter last, Generator gen);
28 template <class Iter>
34 std::generate(Iter(ia), Iter(ia+n), gen_test());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.binary.search/equal.range/ |
| equal_range.pass.cpp | 12 // template<ForwardIterator Iter, class T>
13 // requires HasLess<T, Iter::value_type>
14 // && HasLess<Iter::value_type, T>
15 // pair<Iter, Iter>
16 // equal_range(Iter first, Iter last, const T& value);
24 template <class Iter, class T>
26 test(Iter first, Iter last, const T& value
[all...] |
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.reverse/ |
| reverse.pass.cpp | 12 // template<BidirectionalIterator Iter>
13 // requires HasSwap<Iter::reference, Iter::reference>
15 // reverse(Iter first, Iter last);
22 template <class Iter>
28 std::reverse(Iter(ia), Iter(ia));
30 std::reverse(Iter(ia), Iter(ia+sa))
[all...] |
| /external/skia/src/gpu/ |
| GrTraceMarker.h | 59 class Iter;
61 Iter begin() const;
63 Iter end() const;
69 class GrTraceMarkerSet::Iter {
71 Iter() {};
72 Iter& operator=(const Iter& i) {
77 bool operator==(const Iter& i) const {
80 bool operator!=(const Iter& i) const { return !(*this == i); }
82 Iter& operator++()
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.reverse/ |
| reverse.pass.cpp | 12 // template<BidirectionalIterator Iter>
13 // requires HasSwap<Iter::reference, Iter::reference>
15 // reverse(Iter first, Iter last);
22 template <class Iter>
28 std::reverse(Iter(ia), Iter(ia));
30 std::reverse(Iter(ia), Iter(ia+sa))
[all...] |
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.rotate/ |
| rotate.pass.cpp | 12 // template<ShuffleIterator Iter>
13 // Iter
14 // rotate(Iter first, Iter middle, Iter last);
24 template <class Iter>
30 Iter r = std::rotate(Iter(ia), Iter(ia), Iter(ia))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.rotate/ |
| rotate.pass.cpp | 12 // template<ShuffleIterator Iter>
13 // Iter
14 // rotate(Iter first, Iter middle, Iter last);
24 template <class Iter>
30 Iter r = std::rotate(Iter(ia), Iter(ia), Iter(ia))
[all...] |
| /external/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/binary.search/ |
| binary_search.pass.cpp | 12 // template<ForwardIterator Iter, class T>
13 // requires HasLess<T, Iter::value_type>
14 // && HasLess<Iter::value_type, T>
16 // binary_search(Iter first, Iter last, const T& value);
24 template <class Iter, class T>
26 test(Iter first, Iter last, const T& value, bool x)
31 template <class Iter>
47 test(Iter(v.data()), Iter(v.data()+v.size()), x, true)
[all...] |
| binary_search_comp.pass.cpp | 12 // template<ForwardIterator Iter, class T, CopyConstructible Compare>
13 // requires Predicate<Compare, T, Iter::value_type>
14 // && Predicate<Compare, Iter::value_type, T>
16 // binary_search(Iter first, Iter last, const T& value, Compare comp);
25 template <class Iter, class T>
27 test(Iter first, Iter last, const T& value, bool x)
32 template <class Iter>
48 test(Iter(v.data()), Iter(v.data()+v.size()), x, true)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.binary.search/binary.search/ |
| binary_search.pass.cpp | 12 // template<ForwardIterator Iter, class T>
13 // requires HasLess<T, Iter::value_type>
14 // && HasLess<Iter::value_type, T>
16 // binary_search(Iter first, Iter last, const T& value);
24 template <class Iter, class T>
26 test(Iter first, Iter last, const T& value, bool x)
31 template <class Iter>
47 test(Iter(v.data()), Iter(v.data()+v.size()), x, true)
[all...] |
