| /external/libmojo/mojo/public/cpp/bindings/lib/ |
| validation_context.h | 51 // On success, the valid memory range is shrinked to begin right after the end
54 uintptr_t begin = reinterpret_cast<uintptr_t>(position); local
55 uintptr_t end = begin + num_bytes;
57 if (!InternalIsValidRange(begin, end))
68 // case, the valid range is shinked to begin right after the claimed handle.
87 // handle indices. In this case, the valid range is shinked to begin right
108 uintptr_t begin = reinterpret_cast<uintptr_t>(position); local
109 uintptr_t end = begin + num_bytes;
111 return InternalIsValidRange(begin, end);
141 bool InternalIsValidRange(uintptr_t begin, uintptr_t end) const
[all...] |
| /external/v8/src/asmjs/ |
| switch-logic.cc | 12 CaseNode* CreateBst(ZoneVector<CaseNode*>* nodes, size_t begin, size_t end) {
13 if (end < begin) {
15 } else if (end == begin) {
16 return nodes->at(begin);
18 size_t root_index = (begin + end) / 2;
21 root->left = CreateBst(nodes, begin, root_index - 1);
35 std::sort(cases->begin(), cases->end());
48 int begin = cases->at(curr_pos); local
50 nodes.push_back(new (zone) CaseNode(begin, end));
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/forwardlist/forwardlist.cons/ |
| copy.pass.cpp | 29 C c0(std::begin(t), std::end(t), A(10));
32 for (C::const_iterator i = c.begin(), e = c.end(); i != e; ++i, ++n)
34 assert(n == std::end(t) - std::begin(t));
44 C c0(std::begin(t), std::end(t), A(10));
47 for (C::const_iterator i = c.begin(), e = c.end(); i != e; ++i, ++n)
49 assert(n == std::end(t) - std::begin(t));
58 C c0(std::begin(t), std::end(t), A());
61 for (C::const_iterator i = c.begin(), e = c.end(); i != e; ++i, ++n)
63 assert(n == std::end(t) - std::begin(t));
|
| copy_alloc.pass.cpp | 28 C c0(std::begin(t), std::end(t), A(10));
31 for (C::const_iterator i = c.begin(), e = c.end(); i != e; ++i, ++n)
33 assert(n == std::end(t) - std::begin(t));
42 C c0(std::begin(t), std::end(t), A(10));
45 for (C::const_iterator i = c.begin(), e = c.end(); i != e; ++i, ++n)
47 assert(n == std::end(t) - std::begin(t));
57 C c0(std::begin(t), std::end(t), A());
60 for (C::const_iterator i = c.begin(), e = c.end(); i != e; ++i, ++n)
62 assert(n == std::end(t) - std::begin(t));
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/list/list.cons/ |
| default.pass.cpp | 24 assert(std::distance(l.begin(), l.end()) == 0);
29 assert(std::distance(l.begin(), l.end()) == 0);
34 assert(std::distance(l.begin(), l.end()) == 0);
40 assert(std::distance(l.begin(), l.end()) == 0);
45 assert(std::distance(l.begin(), l.end()) == 0);
50 assert(std::distance(l.begin(), l.end()) == 0);
55 assert(std::distance(l.begin(), l.end()) == 0);
60 assert(std::distance(l.begin(), l.end()) == 0);
65 assert(std::distance(l.begin(), l.end()) == 0);
|
| /external/ImageMagick/Magick++/demo/ |
| flip.cpp | 41 for_each( imageList.begin(), imageList.end(), flipImage() );
46 morphImages( &morphed, imageList.begin(), imageList.end(), 3 );
50 writeImages( morphed.begin(), morphed.end(), "flip_out.miff" );
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.equal/ |
| equal.pass.cpp | 36 return !std::equal(std::begin(ia), std::end(ia), std::begin(ic))
37 && !std::equal(std::begin(ia), std::end(ia), std::begin(ic), std::end(ic))
38 && std::equal(std::begin(ib), std::end(ib), std::begin(ic))
39 && !std::equal(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic))
41 && std::equal(II(std::begin(ib)), II(std::end(ib)), II(std::begin(ic))
[all...] |
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.first.of/ |
| find_first_of.pass.cpp | 32 return (std::find_first_of(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia))) == FI(ic+1))
33 && (std::find_first_of(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ib)), FI(std::end(ib))) == FI(std::end(ic)))
34 && (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia))) == BI(ic+1))
35 && (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib))) == BI(std::end(ic)))
36 && (std::find_first_of(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ia)), RI(std::end(ia))) == RI(ic+1)
[all...] |
| /external/libcxx/test/std/containers/associative/set/set.cons/ |
| move.pass.cpp | 36 assert(distance(m.begin(), m.end()) == 0);
41 assert(distance(mo.begin(), mo.end()) == 0);
64 assert(distance(m.begin(), m.end()) == 3);
65 assert(*m.begin() == 1);
66 assert(*next(m.begin()) == 2);
67 assert(*next(m.begin(), 2) == 3);
72 assert(distance(mo.begin(), mo.end()) == 0);
95 assert(distance(m.begin(), m.end()) == 3);
96 assert(*m.begin() == 1);
97 assert(*next(m.begin()) == 2)
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/set/set.cons/ |
| move.pass.cpp | 36 assert(distance(m.begin(), m.end()) == 0);
41 assert(distance(mo.begin(), mo.end()) == 0);
64 assert(distance(m.begin(), m.end()) == 3);
65 assert(*m.begin() == 1);
66 assert(*next(m.begin()) == 2);
67 assert(*next(m.begin(), 2) == 3);
72 assert(distance(mo.begin(), mo.end()) == 0);
95 assert(distance(m.begin(), m.end()) == 3);
96 assert(*m.begin() == 1);
97 assert(*next(m.begin()) == 2)
[all...] |
| /external/google-breakpad/src/processor/ |
| static_map-inl.h | 63 int begin = 0; local
67 while (begin < end) {
68 middle = begin + (end - begin) / 2;
75 begin = middle + 1;
84 int begin = 0; local
88 while (begin < end) {
89 middle = begin + (end - begin) / 2;
96 begin = middle + 1
105 int begin = 0; local
[all...] |
| call_stack.cc | 46 for (vector<StackFrame *>::const_iterator iterator = frames_.begin();
|
| /external/llvm/unittests/ADT/ |
| TinyPtrVectorTest.cpp | 49 std::random_shuffle(TestPtrs.begin(), TestPtrs.end(), test_shuffle_rng_p);
73 EXPECT_EQ(Values[i], *std::next(V.begin(), i));
75 EXPECT_EQ(V.end(), std::next(V.begin(), Values.size()));
293 this->V.erase(this->V.begin());
298 this->V.erase(this->V.begin());
299 this->TestPtrs.erase(this->TestPtrs.begin());
301 this->V.erase(std::next(this->V.begin(), 1));
302 this->TestPtrs.erase(std::next(this->TestPtrs.begin(), 1));
304 this->V.erase(std::next(this->V.begin(), 2));
305 this->TestPtrs.erase(std::next(this->TestPtrs.begin(), 2))
[all...] |
| /external/libcxx/test/std/containers/associative/multimap/multimap.cons/ |
| move.pass.cpp | 36 assert(distance(m.begin(), m.end()) == 0);
41 assert(distance(mo.begin(), mo.end()) == 0);
63 assert(distance(m.begin(), m.end()) == 9);
64 assert(*m.begin() == V(1, 1));
65 assert(*next(m.begin()) == V(1, 1.5));
66 assert(*next(m.begin(), 2) == V(1, 2));
67 assert(*next(m.begin(), 3) == V(2, 1));
68 assert(*next(m.begin(), 4) == V(2, 1.5));
69 assert(*next(m.begin(), 5) == V(2, 2));
70 assert(*next(m.begin(), 6) == V(3, 1))
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/multimap/multimap.cons/ |
| move.pass.cpp | 36 assert(distance(m.begin(), m.end()) == 0);
41 assert(distance(mo.begin(), mo.end()) == 0);
63 assert(distance(m.begin(), m.end()) == 9);
64 assert(*m.begin() == V(1, 1));
65 assert(*next(m.begin()) == V(1, 1.5));
66 assert(*next(m.begin(), 2) == V(1, 2));
67 assert(*next(m.begin(), 3) == V(2, 1));
68 assert(*next(m.begin(), 4) == V(2, 1.5));
69 assert(*next(m.begin(), 5) == V(2, 2));
70 assert(*next(m.begin(), 6) == V(3, 1))
[all...] |
| /bionic/linker/ |
| linker_cfi.h | 52 void AddConstant(uintptr_t begin, uintptr_t end, uint16_t v);
55 void AddUnchecked(uintptr_t begin, uintptr_t end);
58 void AddInvalid(uintptr_t begin, uintptr_t end);
61 void Add(uintptr_t begin, uintptr_t end, uintptr_t cfi_check);
|
| /device/google/cuttlefish_common/common/libs/fs/ |
| shared_select.h | 41 iterator begin() { return value_.begin(); } function in class:cvd::SharedFDSet
43 const_iterator begin() const { return value_.begin(); } function in class:cvd::SharedFDSet
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/descriptive/ |
| UnivariateStatistic.java | 40 * @param begin the index of the first element to include
44 double evaluate(double[] values, int begin, int length);
|
| WeightedEvaluation.java | 43 * @param begin the index of the first element to include
47 double evaluate(double[] values, double[] weights, int begin, int length);
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/descriptive/rank/ |
| Percentile.java | 143 public void setData(final double[] values, final int begin, final int length) {
150 super.setData(values, begin, length);
204 * <code>values[begin]</code> if <code>length = 1 </code></li>
228 * position <code>begin</code> in the array and including <code>length</code>
236 * <li>Returns (for any value of <code>p</code>) <code>values[begin]</code>
239 * is null , <code>begin</code> or <code>length</code> is invalid, or
249 * @param begin the first (0-based) element to include in the computation
255 public double evaluate(final double[] values, final int begin,
258 test(values, begin, length);
268 return values[begin]; // always return single value for n =
311 int begin = 0; local
[all...] |
| /external/clang/include/clang/Frontend/ |
| TextDiagnosticBuffer.h | 33 const_iterator err_begin() const { return Errors.begin(); }
36 const_iterator warn_begin() const { return Warnings.begin(); }
39 const_iterator remark_begin() const { return Remarks.begin(); }
42 const_iterator note_begin() const { return Notes.begin(); }
|
| /external/clang/test/SemaCXX/ |
| PR11358.cpp | 8 iterator begin() { return iterator(); } function in struct:test1::container
15 Container::iterator i = c.begin(); // expected-error{{missing 'typename'}}
25 const_iterator begin() const;
31 for (hash_map<KeyType, ValueType>::const_iterator it = map.begin(); // expected-error{{missing 'typename'}}
|
| /external/glide/library/src/main/java/com/bumptech/glide/request/ |
| Request.java | 11 void begin(); method in interface:Request
|
| /external/libchrome/base/trace_event/ |
| category_registry.h | 32 Range(TraceCategory* begin, TraceCategory* end) : begin_(begin), end_(end) {
33 DCHECK_LE(begin, end);
35 TraceCategory* begin() const { return begin_; } function in class:base::trace_event::CategoryRegistry::Range
|
| /external/libcxx/test/libcxx/containers/sequences/vector/ |
| db_iterators_5.pass.cpp | 32 C::iterator i = c.begin();
35 i = c.begin();
44 C::iterator i = c.begin();
47 i = c.begin();
|
