Searched refs:Iter (Results 26 - 50 of 228) sorted by relevance

12345678910

/external/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/binary.search/
H A Dbinary_search_comp.pass.cpp12 // 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(
[all...]
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.fill/
H A Dfill.pass.cpp12 // 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(i
[all...]
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.generate/
H A Dgenerate_n.pass.cpp12 // 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/
H A Dreplace.pass.cpp12 // 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(i
[all...]
H A Dreplace_if.pass.cpp12 // 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(i
[all...]
/external/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/equal.range/
H A Dequal_range_comp.pass.cpp12 // 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 las
[all...]
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/
H A Dunique.pass.cpp12 // 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(i
[all...]
H A Dunique_pred.pass.cpp12 // 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(i
[all...]
/external/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/lower.bound/
H A Dlower_bound.pass.cpp12 // 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
[all...]
H A Dlower_bound_comp.pass.cpp12 // 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
[all...]
/external/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/upper.bound/
H A Dupper_bound.pass.cpp12 // 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
[all...]
H A Dupper_bound_comp.pass.cpp12 // 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
[all...]
/external/skia/src/gpu/
H A DGrTraceMarker.h60 class Iter;
62 Iter begin() const;
64 Iter end() const;
70 class GrTraceMarkerSet::Iter { class in class:GrTraceMarkerSet
72 Iter() {}; function in class:GrTraceMarkerSet::Iter
73 Iter& operator=(const Iter& i) {
78 bool operator==(const Iter& i) const {
81 bool operator!=(const Iter& i) const { return !(*this == i); }
83 Iter
91 Iter(const GrTraceMarkerSet* markers, int index) function in class:GrTraceMarkerSet::Iter
[all...]
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/
H A Dremove.pass.cpp12 // 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(i
[all...]
H A Dremove_if.pass.cpp12 // 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
[all...]
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.partitions/
H A Dpartition.pass.cpp12 // 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(i
[all...]
H A Dstable_partition.pass.cpp12 // 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(arra
[all...]
/external/google-breakpad/src/testing/gtest/scripts/
H A Dgen_gtest_pred_impl.py189 def Iter(n, format, sep=''): function
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(
[all...]
/external/protobuf/gtest/scripts/
H A Dgen_gtest_pred_impl.py189 def Iter(n, format, sep=''): function
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(
[all...]
/external/llvm/lib/Fuzzer/test/
H A DFuzzerUnittest.cpp53 for (int Iter = 0; Iter < 3000; Iter++) {
/external/libcxx/test/std/re/re.regex/re.regex.construct/
H A Diter_iter.pass.cpp22 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/include/core/
H A DSkDeque.h65 class Iter { class in class:SkDeque
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;
/external/skia/src/core/
H A DSkTLList.h18 const typename SkTLList<T>::Iter& location);
43 class Iter;
54 typename NodeList::Iter iter;
55 Node* node = iter.init(fList, Iter::kHead_IterStart);
107 T* addBefore(const T& t, const Iter& location) {
113 T* addAfter(const T& t, const Iter& location) {
118 Iter headIter() const { return Iter(*this, Iter::kHead_IterStart); }
119 Iter tailIte
188 class Iter : private NodeList::Iter { class in class:SkTLList
199 Iter() {} function in class:SkTLList::Iter
201 Iter(const SkTLList& list, IterStart start = kHead_IterStart) { function in class:SkTLList::Iter
[all...]
/external/skia/tests/
H A DLListTest.cpp73 typedef SkTInternalLList<ListElement>::Iter Iter; typedef
74 Iter iter;
76 ListElement* cur = iter.init(list, Iter::kHead_IterStart);
81 cur = iter.init(list, Iter::kTail_IterStart);
117 cur = iter.init(list, Iter::kHead_IterStart);
125 typedef ElList::Iter Iter; typedef
132 Iter iter1;
133 Iter iter
[all...]
/external/skia/src/utils/
H A DSkNWayCanvas.cpp40 class SkNWayCanvas::Iter { class in class:SkNWayCanvas
42 Iter(const SkTDArray<SkCanvas*>& list) : fList(list) { function in class:SkNWayCanvas::Iter
61 Iter iter(fList);
71 Iter iter(fList);
82 Iter iter(fList);
90 Iter iter(fList);
98 Iter iter(fList);
106 Iter iter(fList);
114 Iter iter(fList);
122 Iter ite
[all...]

Completed in 442 milliseconds

12345678910