Searched refs:begin (Results 176 - 200 of 6417) sorted by relevance

1234567891011>>

/external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.ops/
H A Dunique.pass.cpp27 C c1(std::begin(t1), std::end(t1));
28 C c2(std::begin(t2), std::end(t2));
37 C c1(std::begin(t1), std::end(t1));
38 C c2(std::begin(t2), std::end(t2));
47 C c1(std::begin(t1), std::end(t1));
48 C c2(std::begin(t2), std::end(t2));
65 C c1(std::begin(t1), std::end(t1));
66 C c2(std::begin(t2), std::end(t2));
76 C c1(std::begin(t1), std::end(t1));
77 C c2(std::begin(t
[all...]
H A Dunique_pred.pass.cpp32 C c1(std::begin(t1), std::end(t1));
33 C c2(std::begin(t2), std::end(t2));
42 C c1(std::begin(t1), std::end(t1));
43 C c2(std::begin(t2), std::end(t2));
52 C c1(std::begin(t1), std::end(t1));
53 C c2(std::begin(t2), std::end(t2));
70 C c1(std::begin(t1), std::end(t1));
71 C c2(std::begin(t2), std::end(t2));
81 C c1(std::begin(t1), std::end(t1));
82 C c2(std::begin(t
[all...]
/external/libcxx/test/std/containers/sequences/vector.bool/
H A Dfind.pass.cpp28 std::vector<bool>::iterator j = std::find(b.begin()+1, b.end(), false);
29 assert(static_cast<std::size_t>(j-b.begin()) == i);
37 std::vector<bool>::iterator j = std::find(b.begin()+1, b.end(), true);
38 assert(static_cast<std::size_t>(j-b.begin()) == i);
/external/libcxx/test/std/iterators/predef.iterators/insert.iterators/insert.iter.ops/insert.iter.cons/
H A Dtest.pass.cpp24 std::insert_iterator<C> i(c, c.begin());
/external/libcxx/test/std/iterators/stream.iterators/iterator.range/
H A Dbegin_const.pass.cpp12 // template <class C> auto begin(const C& c) -> decltype(c.begin());
21 std::vector<int>::const_iterator i = begin(v);
H A Dend_array.pass.cpp20 int* i = std::begin(ia);
/external/libcxx/test/std/numerics/numarray/valarray.range/
H A Dbegin_non_const.pass.cpp16 // begin(valarray<T>& v);
28 *begin(v) = 10;
/external/libcxx/test/std/numerics/numeric.ops/inclusive.scan/
H A Dinclusive_scan_op_init.pass.cpp36 assert(std::equal(v.begin(), v.end(), rFirst, rLast));
41 std::inclusive_scan(v.begin(), v.end(), v.begin(), op, init);
42 assert(std::equal(v.begin(), v.end(), rFirst, rLast));
70 std::fill(v.begin(), v.end(), 3);
71 std::inclusive_scan(v.begin(), v.end(), v.begin(), std::plus<>(), 50);
78 std::iota(v.begin(), v.end(), 0);
79 std::inclusive_scan(v.begin(), v.end(), v.begin(), st
[all...]
/external/libcxx/test/std/re/re.iter/re.regiter/re.regiter.cnstr/
H A Dcnstr.fail.cpp33 std::begin(phone_book), std::end(phone_book),
/external/libcxx/test/std/re/re.iter/re.tokiter/re.tokiter.cnstr/
H A Dinit.fail.cpp33 std::cregex_token_iterator i(std::begin(phone_book), std::end(phone_book)-1,
H A Dint.fail.cpp32 std::cregex_token_iterator i(std::begin(phone_book), std::end(phone_book)-1,
/external/libcxx/test/std/re/re.regex/re.regex.construct/
H A Diter_iter.pass.cpp40 test(F(s1.begin()), F(s1.end()), 0);
41 test(F(s2.begin()), F(s2.end()), 0);
42 test(F(s3.begin()), F(s3.end()), 0);
43 test(F(s4.begin()), F(s4.end()), 2);
/external/libcxx/test/std/strings/basic.string/string.iterators/
H A Ddb_iterators_5.pass.cpp31 C::iterator i = c.begin();
34 i = c.begin();
42 C::iterator i = c.begin();
45 i = c.begin();
H A Dend.pass.cpp30 assert(e == s.begin());
31 assert(ce == cs.begin());
33 assert(static_cast<std::size_t>(e - s.begin()) == s.size());
34 assert(static_cast<std::size_t>(ce - cs.begin()) == cs.size());
/external/pdfium/fpdfsdk/
H A Dcpdfsdk_annotiteration.cpp19 std::stable_sort(copiedList.begin(), copiedList.end(),
26 auto it = std::find(copiedList.begin(), copiedList.end(), pTopMostAnnot);
29 copiedList.insert(copiedList.begin(), pTopMostAnnot);
33 std::reverse(copiedList.begin(), copiedList.end());
/external/webrtc/webrtc/sound/
H A Dsoundsysteminterface.cc19 for (SoundDeviceLocatorList::iterator i = devices->begin();
/external/apache-commons-math/src/main/java/org/apache/commons/math/stat/descriptive/
H A DAbstractUnivariateStatistic.java75 * @param begin the index of the first element to include
79 public void setData(final double[] values, final int begin, final int length) { argument
81 System.arraycopy(values, begin, storedData, 0, length);
106 public abstract double evaluate(final double[] values, final int begin, final int length); argument
127 * @param begin index of the first array element to include
134 final int begin,
141 if (begin < 0) {
142 throw new NotPositiveException(LocalizedFormats.START_POSITION, begin);
149 if (begin + length > values.length) {
164 * to verify that the begin an
132 test( final double[] values, final int begin, final int length) argument
191 test( final double[] values, final double[] weights, final int begin, final int length) argument
[all...]
/external/apache-commons-math/src/main/java/org/apache/commons/math/stat/descriptive/moment/
H A DMean.java147 * @param begin index of the first array element to include
154 public double evaluate(final double[] values,final int begin, final int length) { argument
155 if (test(values, begin, length)) {
160 double xbar = sum.evaluate(values, begin, length) / sampleSize;
164 for (int i = begin; i < begin + length; i++) {
195 * @param begin index of the first array element to include
202 final int begin, final int length) {
203 if (test(values, weights, begin, length)) {
207 double sumw = sum.evaluate(weights,begin,lengt
201 evaluate(final double[] values, final double[] weights, final int begin, final int length) argument
[all...]
/external/libcxx/test/std/containers/sequences/list/list.cons/
H A Dsize_type.pass.cpp31 assert(static_cast<std::size_t>(std::distance(d.begin(), d.end())) == n);
46 assert(std::distance(l.begin(), l.end()) == 3);
47 std::list<int>::const_iterator i = l.begin();
58 assert(std::distance(l.begin(), l.end()) == 3);
59 std::list<int>::const_iterator i = l.begin();
71 assert(std::distance(l.begin(), l.end()) == 3);
72 C::const_iterator i = l.begin();
85 assert(std::distance(l.begin(), l.end()) == 3);
90 assert(std::distance(l.begin(), l.end()) == 3);
91 std::list<int, min_allocator<int>>::const_iterator i = l.begin();
[all...]
/external/libcxx/test/std/containers/associative/map/map.cons/
H A Dcopy_assign.pass.cpp86 std::sort(temp1.begin(), temp1.end());
88 std::unique_copy(temp1.begin(), temp1.end(), std::back_inserter<std::vector<int>>(temp2));
91 for (std::vector<int>::const_iterator it = temp2.begin(); it != temp2.end(); ++it ) {
92 std::cout << *it << ": " << std::count(ca_allocs.begin(), ca_allocs.end(), *it) << " vs " << std::count(ca_deallocs.begin(), ca_deallocs.end(), *it) << std::endl;
93 if ( std::count(ca_allocs.begin(), ca_allocs.end(), *it) != std::count(ca_deallocs.begin(), ca_deallocs.end(), *it))
98 std::sort(temp1.begin(), temp1.end());
100 std::unique_copy(temp1.begin(), temp1.end(), std::back_inserter<std::vector<int>>(temp2));
102 for (std::vector<int>::const_iterator it = ca_deallocs.begin(); i
[all...]
/external/apache-commons-math/src/main/java/org/apache/commons/math/stat/descriptive/summary/
H A DProduct.java114 * @param begin index of the first array element to include
121 public double evaluate(final double[] values, final int begin, final int length) { argument
123 if (test(values, begin, length)) {
125 for (int i = begin; i < begin + length; i++) {
154 * @param begin index of the first array element to include
161 final int begin, final int length) {
163 if (test(values, weights, begin, length)) {
165 for (int i = begin; i < begin
160 evaluate(final double[] values, final double[] weights, final int begin, final int length) argument
[all...]
H A DSum.java113 * @param begin index of the first array element to include
120 public double evaluate(final double[] values, final int begin, final int length) { argument
122 if (test(values, begin, length)) {
124 for (int i = begin; i < begin + length; i++) {
152 * @param begin index of the first array element to include
159 final int begin, final int length) {
161 if (test(values, weights, begin, length)) {
163 for (int i = begin; i < begin
158 evaluate(final double[] values, final double[] weights, final int begin, final int length) argument
[all...]
/external/clang/lib/StaticAnalyzer/Core/
H A DFunctionSummary.cpp20 for (MapTy::iterator I = Map.begin(), E = Map.end(); I != E; ++I) {
28 for (MapTy::iterator I = Map.begin(), E = Map.end(); I != E; ++I) {
/external/libcxx/test/std/containers/sequences/array/
H A Dbegin.pass.cpp12 // iterator begin();
29 i = c.begin();
42 assert(c.begin() == c.end());
/external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.modifiers/
H A Demplace_front.pass.cpp35 assert(distance(c.begin(), c.end()) == 1);
42 assert(distance(c.begin(), c.end()) == 1);
46 assert(*next(c.begin()) == Emplaceable());
47 assert(distance(c.begin(), c.end()) == 2);
57 assert(distance(c.begin(), c.end()) == 1);
64 assert(distance(c.begin(), c.end()) == 1);
68 assert(*next(c.begin()) == Emplaceable());
69 assert(distance(c.begin(), c.end()) == 2);

Completed in 511 milliseconds

1234567891011>>