| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.binary.search/binary.search/ |
| 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...] |
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.fill/ |
| fill.pass.cpp | 12 // template<ForwardIterator Iter, class T>
13 // requires OutputIterator<Iter, const T&>
15 // fill(Iter first, Iter last, const T& value);
22 template <class Iter>
28 std::fill(Iter(ca), Iter(ca+n), char(1));
35 template <class Iter>
41 std::fill(Iter(ia), Iter(ia+n), 1)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.fill/ |
| fill.pass.cpp | 12 // template<ForwardIterator Iter, class T>
13 // requires OutputIterator<Iter, const T&>
15 // fill(Iter first, Iter last, const T& value);
22 template <class Iter>
28 std::fill(Iter(ca), Iter(ca+n), char(1));
35 template <class Iter>
41 std::fill(Iter(ia), Iter(ia+n), 1)
[all...] |
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.generate/ |
| generate_n.pass.cpp | 12 // template<class Iter, IntegralLike Size, Callable Generator>
13 // requires OutputIterator<Iter, Generator::result_type>
16 // generate_n(Iter first, Size n, Generator gen);
31 template <class Iter>
37 assert(std::generate_n(Iter(ia), UDI(n), gen_test()) == Iter(ia+n));
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.replace/ |
| replace.pass.cpp | 12 // template<ForwardIterator Iter, class T>
13 // requires OutputIterator<Iter, Iter::reference>
14 // && OutputIterator<Iter, const T&>
15 // && HasEqualTo<Iter::value_type, T>
17 // replace(Iter first, Iter last, const T& old_value, const T& new_value);
24 template <class Iter>
30 std::replace(Iter(ia), Iter(ia+sa), 2, 5)
[all...] |
| replace_if.pass.cpp | 12 // template<ForwardIterator Iter, Predicate<auto, Iter::value_type> Pred, class T>
13 // requires OutputIterator<Iter, Iter::reference>
14 // && OutputIterator<Iter, const T&>
17 // replace_if(Iter first, Iter last, Pred pred, const T& new_value);
25 template <class Iter>
31 std::replace_if(Iter(ia), Iter(ia+sa), std::bind2nd(std::equal_to<int>(), 2), 5)
[all...] |
| /external/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/equal.range/ |
| equal_range_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>
15 // pair<Iter, Iter>
16 // equal_range(Iter first, Iter last, const T& value, Compare comp);
25 template <class Iter, class T>
27 test(Iter first, Iter last, const T& value
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.generate/ |
| generate_n.pass.cpp | 12 // template<class Iter, IntegralLike Size, Callable Generator>
13 // requires OutputIterator<Iter, Generator::result_type>
16 // generate_n(Iter first, Size n, Generator gen);
28 template <class Iter>
34 assert(std::generate_n(Iter(ia), n, gen_test()) == Iter(ia+n));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.replace/ |
| replace.pass.cpp | 12 // template<ForwardIterator Iter, class T>
13 // requires OutputIterator<Iter, Iter::reference>
14 // && OutputIterator<Iter, const T&>
15 // && HasEqualTo<Iter::value_type, T>
17 // replace(Iter first, Iter last, const T& old_value, const T& new_value);
24 template <class Iter>
30 std::replace(Iter(ia), Iter(ia+sa), 2, 5)
[all...] |
| replace_if.pass.cpp | 12 // template<ForwardIterator Iter, Predicate<auto, Iter::value_type> Pred, class T>
13 // requires OutputIterator<Iter, Iter::reference>
14 // && OutputIterator<Iter, const T&>
17 // replace_if(Iter first, Iter last, Pred pred, const T& new_value);
25 template <class Iter>
31 std::replace_if(Iter(ia), Iter(ia+sa), std::bind2nd(std::equal_to<int>(), 2), 5)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.binary.search/equal.range/ |
| equal_range_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>
15 // pair<Iter, Iter>
16 // equal_range(Iter first, Iter last, const T& value, Compare comp);
25 template <class Iter, class T>
27 test(Iter first, Iter last, const T& value
[all...] |
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/ |
| unique.pass.cpp | 12 // template<ForwardIterator Iter>
13 // requires OutputIterator<Iter, Iter::reference>
14 // && EqualityComparable<Iter::value_type>
15 // Iter
16 // unique(Iter first, Iter last);
26 template <class Iter>
32 Iter r = std::unique(Iter(ia), Iter(ia+sa))
[all...] |
| /external/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/lower.bound/ |
| lower_bound.pass.cpp | 12 // template<ForwardIterator Iter, class T>
13 // requires HasLess<Iter::value_type, T>
14 // Iter
15 // lower_bound(Iter first, Iter last, const T& value);
23 template <class Iter, class T>
25 test(Iter first, Iter last, const T& value)
27 Iter i = std::lower_bound(first, last, value);
28 for (Iter j = first; j != i; ++j
[all...] |
| lower_bound_comp.pass.cpp | 12 // template<ForwardIterator Iter, class T>
13 // requires HasLess<Iter::value_type, T>
14 // Iter
15 // lower_bound(Iter first, Iter last, const T& value);
24 template <class Iter, class T>
26 test(Iter first, Iter last, const T& value)
28 Iter i = std::lower_bound(first, last, value, std::greater<int>());
29 for (Iter j = first; j != i; ++j
[all...] |
| /external/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/upper.bound/ |
| upper_bound.pass.cpp | 12 // template<ForwardIterator Iter, class T>
13 // requires HasLess<T, Iter::value_type>
14 // Iter
15 // upper_bound(Iter first, Iter last, const T& value);
23 template <class Iter, class T>
25 test(Iter first, Iter last, const T& value)
27 Iter i = std::upper_bound(first, last, value);
28 for (Iter j = first; j != i; ++j
[all...] |
| upper_bound_comp.pass.cpp | 12 // template<ForwardIterator Iter, class T, Predicate<auto, T, Iter::value_type> Compare>
14 // Iter
15 // upper_bound(Iter first, Iter last, const T& value, Compare comp);
24 template <class Iter, class T>
26 test(Iter first, Iter last, const T& value)
28 Iter i = std::upper_bound(first, last, value, std::greater<int>());
29 for (Iter j = first; j != i; ++j
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.unique/ |
| unique.pass.cpp | 12 // template<ForwardIterator Iter>
13 // requires OutputIterator<Iter, Iter::reference>
14 // && EqualityComparable<Iter::value_type>
15 // Iter
16 // unique(Iter first, Iter last);
26 template <class Iter>
32 Iter r = std::unique(Iter(ia), Iter(ia+sa))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.binary.search/lower.bound/ |
| lower_bound.pass.cpp | 12 // template<ForwardIterator Iter, class T>
13 // requires HasLess<Iter::value_type, T>
14 // Iter
15 // lower_bound(Iter first, Iter last, const T& value);
23 template <class Iter, class T>
25 test(Iter first, Iter last, const T& value)
27 Iter i = std::lower_bound(first, last, value);
28 for (Iter j = first; j != i; ++j
[all...] |
| lower_bound_comp.pass.cpp | 12 // template<ForwardIterator Iter, class T>
13 // requires HasLess<Iter::value_type, T>
14 // Iter
15 // lower_bound(Iter first, Iter last, const T& value);
24 template <class Iter, class T>
26 test(Iter first, Iter last, const T& value)
28 Iter i = std::lower_bound(first, last, value, std::greater<int>());
29 for (Iter j = first; j != i; ++j
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.binary.search/upper.bound/ |
| upper_bound.pass.cpp | 12 // template<ForwardIterator Iter, class T>
13 // requires HasLess<T, Iter::value_type>
14 // Iter
15 // upper_bound(Iter first, Iter last, const T& value);
23 template <class Iter, class T>
25 test(Iter first, Iter last, const T& value)
27 Iter i = std::upper_bound(first, last, value);
28 for (Iter j = first; j != i; ++j
[all...] |
| upper_bound_comp.pass.cpp | 12 // template<ForwardIterator Iter, class T, Predicate<auto, T, Iter::value_type> Compare>
14 // Iter
15 // upper_bound(Iter first, Iter last, const T& value, Compare comp);
24 template <class Iter, class T>
26 test(Iter first, Iter last, const T& value)
28 Iter i = std::upper_bound(first, last, value, std::greater<int>());
29 for (Iter j = first; j != i; ++j
[all...] |
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/ |
| remove.pass.cpp | 12 // template<ForwardIterator Iter, class T>
13 // requires OutputIterator<Iter, RvalueOf<Iter::reference>::type>
14 // && HasEqualTo<Iter::value_type, T>
15 // Iter
16 // remove(Iter first, Iter last, const T& value);
26 template <class Iter>
32 Iter r = std::remove(Iter(ia), Iter(ia+sa), 2)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.remove/ |
| remove.pass.cpp | 12 // template<ForwardIterator Iter, class T>
13 // requires OutputIterator<Iter, RvalueOf<Iter::reference>::type>
14 // && HasEqualTo<Iter::value_type, T>
15 // Iter
16 // remove(Iter first, Iter last, const T& value);
26 template <class Iter>
32 Iter r = std::remove(Iter(ia), Iter(ia+sa), 2)
[all...] |
| /external/skia/tests/ |
| LListTest.cpp | 67 typedef SkTInternalLList<ListElement>::Iter Iter;
68 Iter iter; local
70 ListElement* cur = iter.init(list, Iter::kHead_IterStart);
71 for (int i = 0; cur; ++i, cur = iter.next()) {
75 cur = iter.init(list, Iter::kTail_IterStart);
76 for (int i = 0; cur; ++i, cur = iter.prev())
197 Iter iter = list1.headIter(); local
[all...] |
| /external/libcxx/test/std/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...] |
