/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
partial_sum.h | 47 * @param begin Begin iterator of input sequence. 49 * @param result Begin iterator of output sequence. 58 parallel_partial_sum_basecase(InputIterator begin, InputIterator end, 63 if (begin == end) 66 while (begin != end) 68 value = bin_op(value, *begin); 71 ++begin; 78 * @param begin Begin iterator of input sequence [all...] |
/ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/forwardlist/forwardlist.modifiers/ |
emplace_after.pass.cpp | 29 assert(i == c.begin()); 31 assert(distance(c.begin(), c.end()) == 1); 34 assert(i == next(c.begin())); 36 assert(*next(c.begin()) == Emplaceable(1, 2.5)); 37 assert(distance(c.begin(), c.end()) == 2); 40 assert(i == next(c.begin(), 2)); 42 assert(*next(c.begin()) == Emplaceable(1, 2.5)); 43 assert(*next(c.begin(), 2) == Emplaceable(2, 3.5)); 44 assert(distance(c.begin(), c.end()) == 3); 47 assert(i == next(c.begin())); [all...] |
insert_after_const.pass.cpp | 25 assert(i == c.begin()); 28 assert(distance(c.begin(), c.end()) == 1); 31 assert(i == next(c.begin())); 33 assert(*next(c.begin()) == 1); 34 assert(distance(c.begin(), c.end()) == 2); 37 assert(i == next(c.begin(), 2)); 39 assert(*next(c.begin()) == 1); 40 assert(*next(c.begin(), 2) == 2); 41 assert(distance(c.begin(), c.end()) == 3); 44 assert(i == next(c.begin())); [all...] |
insert_after_rv.pass.cpp | 28 assert(i == c.begin()); 31 assert(distance(c.begin(), c.end()) == 1); 34 assert(i == next(c.begin())); 36 assert(*next(c.begin()) == 1); 37 assert(distance(c.begin(), c.end()) == 2); 40 assert(i == next(c.begin(), 2)); 42 assert(*next(c.begin()) == 1); 43 assert(*next(c.begin(), 2) == 2); 44 assert(distance(c.begin(), c.end()) == 3); 47 assert(i == next(c.begin())); [all...] |
erase_after_one.pass.cpp | 23 C c(std::begin(t), std::end(t)); 27 assert(distance(c.begin(), c.end()) == 4); 28 assert(*next(c.begin(), 0) == 0); 29 assert(*next(c.begin(), 1) == 1); 30 assert(*next(c.begin(), 2) == 2); 31 assert(*next(c.begin(), 3) == 3); 34 assert(i == c.begin()); 35 assert(distance(c.begin(), c.end()) == 3); 36 assert(*next(c.begin(), 0) == 1); 37 assert(*next(c.begin(), 1) == 2) [all...] |
insert_after_init.pass.cpp | 27 assert(distance(c.begin(), c.end()) == 0); 31 assert(distance(c.begin(), c.end()) == 3); 32 assert(*next(c.begin(), 0) == 0); 33 assert(*next(c.begin(), 1) == 1); 34 assert(*next(c.begin(), 2) == 2); 36 i = c.insert_after(c.begin(), {3, 4}); 37 assert(i == next(c.begin(), 2)); 38 assert(distance(c.begin(), c.end()) == 5); 39 assert(*next(c.begin(), 0) == 0); 40 assert(*next(c.begin(), 1) == 3) [all...] |
insert_after_range.pass.cpp | 32 assert(distance(c.begin(), c.end()) == 0); 36 assert(distance(c.begin(), c.end()) == 3); 37 assert(*next(c.begin(), 0) == 0); 38 assert(*next(c.begin(), 1) == 1); 39 assert(*next(c.begin(), 2) == 2); 41 i = c.insert_after(c.begin(), J(t+3), J(t+5)); 42 assert(i == next(c.begin(), 2)); 43 assert(distance(c.begin(), c.end()) == 5); 44 assert(*next(c.begin(), 0) == 0); 45 assert(*next(c.begin(), 1) == 3) [all...] |
insert_after_size_value.pass.cpp | 26 assert(distance(c.begin(), c.end()) == 0); 30 assert(distance(c.begin(), c.end()) == 3); 31 assert(*next(c.begin(), 0) == 3); 32 assert(*next(c.begin(), 1) == 3); 33 assert(*next(c.begin(), 2) == 3); 35 i = c.insert_after(c.begin(), 2, 2); 36 assert(i == next(c.begin(), 2)); 37 assert(distance(c.begin(), c.end()) == 5); 38 assert(*next(c.begin(), 0) == 3); 39 assert(*next(c.begin(), 1) == 2) [all...] |
/external/clang/test/Sema/ |
pragma-arc-cf-code-audited.c | 3 #pragma clang arc_cf_code_audited foo // expected-error {{expected 'begin' or 'end'}} 5 #pragma clang arc_cf_code_audited begin foo // expected-warning {{extra tokens at end of #pragma directive}} 10 #pragma clang arc_cf_code_audited begin // expected-note {{#pragma entered here}} 11 #pragma clang arc_cf_code_audited begin // expected-error {{already inside '#pragma clang arc_cf_code_audited'}} expected-note {{#pragma entered here}} 18 #pragma clang arc_cf_code_audited begin // expected-error {{'#pragma clang arc_cf_code_audited' was not ended within this file}}
|
/ndk/sources/cxx-stl/llvm-libc++/test/containers/associative/multiset/multiset.cons/ |
copy_alloc.pass.cpp | 44 assert(distance(m.begin(), m.end()) == 9); 45 assert(*next(m.begin(), 0) == 1); 46 assert(*next(m.begin(), 1) == 1); 47 assert(*next(m.begin(), 2) == 1); 48 assert(*next(m.begin(), 3) == 2); 49 assert(*next(m.begin(), 4) == 2); 50 assert(*next(m.begin(), 5) == 2); 51 assert(*next(m.begin(), 6) == 3); 52 assert(*next(m.begin(), 7) == 3); 53 assert(*next(m.begin(), 8) == 3) [all...] |
/external/llvm/test/Transforms/Inline/ |
ptr-diff.ll | 17 define i32 @inner1(i32* %begin, i32* %end) { 18 %begin.i = ptrtoint i32* %begin to i32 20 %distance = sub i32 %end.i, %begin.i 28 %t = load i32* %begin 45 define i32 @inner2(i32* %begin, i32* %end) { 46 %begin.i = ptrtoint i32* %begin to i32 48 %distance = sub i32 %end.i, %begin.i 56 %t = load i32* %begin [all...] |
/external/stlport/test/unit/ |
includes_test.cpp | 55 bool r1=includes(v1.begin(), v1.end(), v2.begin(), v2.end()); 61 bool r2=includes(v1.begin(), v1.end(), v2.begin(), v2.end()); 77 sort(v1.begin(), v1.end(), compare_strings); 78 sort(v2.begin(), v2.end(), compare_strings); 80 bool r1 = includes(v1.begin(), v1.end(), v2.begin(), v2.end(), compare_strings); 85 bool r2 = includes(v1.begin(), v1.end(), v2.begin(), v2.end(), compare_strings) [all...] |
perm_test.cpp | 54 __iota(v1.begin(), v1.end(), 0); 56 prev_permutation(v1.begin(), v1.end()); 60 prev_permutation(v1.begin(), v1.end()); 64 prev_permutation(v1.begin(), v1.end()); 68 prev_permutation(v1.begin(), v1.end()); 72 prev_permutation(v1.begin(), v1.end()); 76 prev_permutation(v1.begin(), v1.end()); 80 prev_permutation(v1.begin(), v1.end()); 84 prev_permutation(v1.begin(), v1.end()); 88 prev_permutation(v1.begin(), v1.end()) [all...] |
/ndk/tests/device/test-gnustl-full/unit/ |
includes_test.cpp | 55 bool r1=includes(v1.begin(), v1.end(), v2.begin(), v2.end()); 61 bool r2=includes(v1.begin(), v1.end(), v2.begin(), v2.end()); 77 sort(v1.begin(), v1.end(), compare_strings); 78 sort(v2.begin(), v2.end(), compare_strings); 80 bool r1 = includes(v1.begin(), v1.end(), v2.begin(), v2.end(), compare_strings); 85 bool r2 = includes(v1.begin(), v1.end(), v2.begin(), v2.end(), compare_strings) [all...] |
perm_test.cpp | 54 __iota(v1.begin(), v1.end(), 0); 56 prev_permutation(v1.begin(), v1.end()); 60 prev_permutation(v1.begin(), v1.end()); 64 prev_permutation(v1.begin(), v1.end()); 68 prev_permutation(v1.begin(), v1.end()); 72 prev_permutation(v1.begin(), v1.end()); 76 prev_permutation(v1.begin(), v1.end()); 80 prev_permutation(v1.begin(), v1.end()); 84 prev_permutation(v1.begin(), v1.end()); 88 prev_permutation(v1.begin(), v1.end()) [all...] |
/ndk/tests/device/test-stlport/unit/ |
includes_test.cpp | 55 bool r1=includes(v1.begin(), v1.end(), v2.begin(), v2.end()); 61 bool r2=includes(v1.begin(), v1.end(), v2.begin(), v2.end()); 77 sort(v1.begin(), v1.end(), compare_strings); 78 sort(v2.begin(), v2.end(), compare_strings); 80 bool r1 = includes(v1.begin(), v1.end(), v2.begin(), v2.end(), compare_strings); 85 bool r2 = includes(v1.begin(), v1.end(), v2.begin(), v2.end(), compare_strings) [all...] |
perm_test.cpp | 54 __iota(v1.begin(), v1.end(), 0); 56 prev_permutation(v1.begin(), v1.end()); 60 prev_permutation(v1.begin(), v1.end()); 64 prev_permutation(v1.begin(), v1.end()); 68 prev_permutation(v1.begin(), v1.end()); 72 prev_permutation(v1.begin(), v1.end()); 76 prev_permutation(v1.begin(), v1.end()); 80 prev_permutation(v1.begin(), v1.end()); 84 prev_permutation(v1.begin(), v1.end()); 88 prev_permutation(v1.begin(), v1.end()) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/test/containers/associative/multimap/multimap.modifiers/ |
erase_key.pass.cpp | 42 assert(next(m.begin(), 0)->first == 1); 43 assert(next(m.begin(), 0)->second == 1); 44 assert(next(m.begin(), 1)->first == 1); 45 assert(next(m.begin(), 1)->second == 1.5); 46 assert(next(m.begin(), 2)->first == 1); 47 assert(next(m.begin(), 2)->second == 2); 48 assert(next(m.begin(), 3)->first == 3); 49 assert(next(m.begin(), 3)->second == 1); 50 assert(next(m.begin(), 4)->first == 3); 51 assert(next(m.begin(), 4)->second == 1.5) [all...] |
emplace.pass.cpp | 32 assert(r == m.begin()); 34 assert(m.begin()->first == 0); 35 assert(m.begin()->second == DefaultOnly()); 38 assert(r == next(m.begin())); 40 assert(next(m.begin())->first == 1); 41 assert(next(m.begin())->second == DefaultOnly()); 44 assert(r == next(m.begin(), 2)); 46 assert(next(m.begin(), 2)->first == 1); 47 assert(next(m.begin(), 2)->second == DefaultOnly()); 56 assert(r == m.begin()); [all...] |
emplace_hint.pass.cpp | 32 assert(r == m.begin()); 34 assert(m.begin()->first == 0); 35 assert(m.begin()->second == DefaultOnly()); 38 assert(r == next(m.begin())); 40 assert(next(m.begin())->first == 1); 41 assert(next(m.begin())->second == DefaultOnly()); 44 assert(r == next(m.begin(), 2)); 46 assert(next(m.begin(), 2)->first == 1); 47 assert(next(m.begin(), 2)->second == DefaultOnly()); 56 assert(r == m.begin()); [all...] |
/external/clang/test/CXX/stmt.stmt/stmt.iter/stmt.ranged/ |
p1.cpp | 4 int begin; member in struct:pr12960 6 for (int& it : x) { // expected-error {{invalid range expression of type 'int'; no viable 'begin' function available}} 17 auto begin(T &&t) -> decltype(t.begin()) { return t.begin(); } // expected-note 2{{ignored: substitution failure}} 22 auto begin(T &&t) -> decltype(t.alt_begin()) { return t.alt_begin(); } // expected-note {{selected 'begin' template [with T = }} \ 29 int begin(int); 37 int *begin(); // expected-note 3{{selected 'begin' function with iterator type 'int *'}} expected-note {{'begin' declared here} [all...] |
/frameworks/rs/ |
spec.l | 51 "/*" BEGIN(comment); 55 <comment>"*"+"/" BEGIN(INITIAL); 64 BEGIN(api_entry); 68 BEGIN(api_entry2); 90 BEGIN(var_type); 97 BEGIN(var_type); 107 BEGIN(typeNextState); 113 BEGIN(typeNextState); 119 BEGIN(typeNextState); 125 BEGIN(typeNextState) [all...] |
/external/chromium/chrome/browser/autofill/ |
form_group.cc | 18 a.begin(), a.end(), 19 b.begin(), b.end(), 20 std::inserter(symmetric_difference, symmetric_difference.begin())); 32 for (FieldTypeSet::const_iterator iter = types.begin(); iter != types.end(); 47 std::set_intersection(a.begin(), a.end(), 48 b.begin(), b.end(), 49 std::inserter(intersection, intersection.begin())); 55 for (FieldTypeSet::const_iterator iter = intersection.begin(); 69 std::set_difference(b.begin(), b.end(), 70 a.begin(), a.end() [all...] |
/external/icu4c/common/ |
uchriter.cpp | 81 && begin == realThat.begin 87 return ustr_hashUCharsN(text, textLength) ^ pos ^ begin ^ end; 97 pos = begin; 107 pos = begin; 118 if(pos > begin) { 127 if(position < begin) { 128 pos = begin; 143 if (pos >= begin && pos < end) { 177 if (pos > begin) { [all...] |
/ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/list/list.ops/ |
splice_pos_list_iter_iter.pass.cpp | 23 l1.splice(l1.begin(), l1, next(l1.begin()), next(l1.begin())); 25 assert(distance(l1.begin(), l1.end()) == 3); 26 std::list<int>::const_iterator i = l1.begin(); 35 l1.splice(l1.begin(), l1, next(l1.begin()), next(l1.begin(), 2)); 37 assert(distance(l1.begin(), l1.end()) == 3); 38 std::list<int>::const_iterator i = l1.begin(); [all...] |