/haiku-buildtools/gcc/gcc/testsuite/g++.dg/cpp0x/ |
H A D | pr45908.C | 9 iterator begin(); 10 const_iterator begin() const; 15 auto end() const -> decltype(v.begin()) 16 { return v.begin(); }
|
H A D | initlist46.C | 13 return *(ib.begin()->begin()) != 42;
|
H A D | constexpr-ptrsub.C | 8 constexpr int const* begin() const { return &x; } function in struct:array 12 constexpr auto b = aa.begin(); 14 static_assert(aa.begin()-aa.begin() == 0, "compiler thinks it's not a constant expression");
|
H A D | decltype61.C | 9 void foo(MyIter begin) argument 11 auto x = [](const decltype(*begin)) { }; 15 void bar(Iterator begin) argument 17 auto x = [](const decltype(*begin)) { };
|
H A D | range-for28.C | 5 int* begin(int i) { return (int*)0; } function in namespace:std
|
H A D | range-for13.C | 2 // with member begin/end 7 template<typename T> int *begin(T &t) function 18 int *begin(); 25 //no begin 31 int *begin(); // { dg-error "is private" } 37 int *begin; member in struct:container4 43 typedef int *begin; typedef in struct:container5 54 callable begin; member in struct:container6 60 static callable begin; member in struct:container7 66 static int *begin(); 78 private_callable begin; member in struct:container9 86 function begin; member in struct:container10 [all...] |
/haiku-buildtools/gcc/libstdc++-v3/testsuite/21_strings/basic_string/modifiers/replace/char/ |
H A D | 2.cc | 31 aux.replace(aux.begin()+5, aux.begin()+20, 32 aux.begin()+10, aux.begin()+15); 36 aux.replace(aux.begin() + 10, aux.begin() + 15, 37 aux.begin() + 5, aux.begin() + 20);
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/autopar/ |
H A D | pr46885.c | 12 foo (int *begin, int *end) argument 16 for (i = begin; i != end; ++i) 19 if (begin)
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/ext/ |
H A D | vla2.C | 11 char* begin(char (&a) [N] ); // { dg-message "note" } 17 begin(d); // { dg-error "no matching function" "" }
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/21_strings/basic_string/modifiers/replace/wchar_t/ |
H A D | 2.cc | 32 aux.replace(aux.begin()+5, aux.begin()+20, 33 aux.begin()+10, aux.begin()+15); 37 aux.replace(aux.begin() + 10, aux.begin() + 15, 38 aux.begin() + 5, aux.begin() + 20);
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/template/ |
H A D | overload6.C | 11 int begin(); 16 unique(A().begin); // { dg-error "invalid use of non-static member function" }
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/compile/ |
H A D | pr51495.c | 10 static const void *const table[] = { &&begin, &&end }; 12 begin:
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/18_support/initializer_list/ |
H A D | range_access.cc | 28 std::begin({1, 2, 3});
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/20_util/ |
H A D | rel_ops.cc | 34 vi != v.begin(); 35 vi > v.begin(); 36 vi <= v.begin(); 37 vi >= v.begin();
|
/haiku-buildtools/binutils/libiberty/ |
H A D | memmem.c | 49 const char *begin; local 63 for (begin = (const char *) haystack; begin <= last_possible; ++begin) 64 if (begin[0] == ((const char *) needle)[0] && 65 !memcmp ((const void *) &begin[1], 68 return (void *) begin;
|
/haiku-buildtools/gcc/libiberty/ |
H A D | memmem.c | 49 const char *begin; local 63 for (begin = (const char *) haystack; begin <= last_possible; ++begin) 64 if (begin[0] == ((const char *) needle)[0] && 65 !memcmp ((const void *) &begin[1], 68 return (void *) begin;
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/copy/ |
H A D | 4.cc | 36 copy(a.begin(), a.end(), i1); 37 VERIFY( equal(i1, i1 + N, a.begin()) ); 40 copy(a.begin(), a.end(), v1.begin()); 41 VERIFY( equal(v1.begin(), v1.end(), a.begin()) ); 44 copy(a.begin(), a.end(), s1); 45 VERIFY( equal(s1, s1 + N, a.begin()) ); 48 copy_backward(a.begin(), a.end(), i2 + N); 49 VERIFY( equal(i2, i2 + N, a.begin()) ); [all...] |
H A D | 3.cc | 36 copy(a.begin(), a.end(), i1); 37 VERIFY( equal(i1, i1 + N, a.begin()) ); 40 copy(a.begin(), a.end(), v1.begin()); 41 VERIFY( equal(v1.begin(), v1.end(), a.begin()) ); 44 copy(a.begin(), a.end(), s1); 45 VERIFY( equal(s1, s1 + N, a.begin()) ); 48 copy_backward(a.begin(), a.end(), i2 + N); 49 VERIFY( equal(i2, i2 + N, a.begin()) ); [all...] |
H A D | 2.cc | 35 copy(a.begin(), a.end(), i1); 36 VERIFY( equal(i1, i1 + N, a.begin()) ); 39 copy(a.begin(), a.end(), v1.begin()); 40 VERIFY( equal(v1.begin(), v1.end(), a.begin()) ); 43 copy(a.begin(), a.end(), s1); 44 VERIFY( equal(s1, s1 + N, a.begin()) ); 47 copy_backward(a.begin(), a.end(), i2 + N); 48 VERIFY( equal(i2, i2 + N, a.begin()) ); [all...] |
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/headers/algorithm/ |
H A D | parallel_algorithm_mixed2.cc | 40 std::equal(v.begin(), v.end(), v.begin()); 41 std::equal(v.begin(), v.end(), v.begin(), std::equal_to<value_type>()); 42 __gnu_parallel::equal(v.begin(), v.end(), v.begin()); 43 __gnu_parallel::equal(v.begin(), v.end(), v.begin(), 46 std::find(v.begin(), v.end(), c); 47 __gnu_parallel::find(v.begin(), [all...] |
H A D | parallel_algorithm_mixed1.cc | 35 std::equal(v.begin(), v.end(), v.begin()); 36 std::equal(v.begin(), v.end(), v.begin(), std::equal_to<value_type>()); 37 __gnu_parallel::equal(v.begin(), v.end(), v.begin()); 38 __gnu_parallel::equal(v.begin(), v.end(), v.begin(), 41 std::find(v.begin(), v.end(), c); 42 __gnu_parallel::find(v.begin(), [all...] |
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/minmax_element/ |
H A D | constexpr.cc | 26 constexpr auto x = std::minmax_element(test.begin(), test.end()); 27 constexpr auto y = std::minmax_element(test.begin(), test.end(), 29 static_assert(x.first == test.begin()+1, ""); 30 static_assert(x.second == test.begin(), ""); 31 static_assert(y.first == test.begin(), ""); 32 static_assert(y.second == test.begin()+1, "");
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/vector/debug/ |
H A D | 60587_neg.cc | 28 a.insert(a.end(), a.begin(), a.begin()); // Expected to abort here
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/forward_list/debug/ |
H A D | insert_after4_neg.cc | 28 fl.insert_after(fl.before_begin(), fl.begin(), std::next(fl.begin(), 2));
|
H A D | erase_after9_neg.cc | 29 auto it = fl1.begin(); 31 fl1.erase_after(it, fl1.begin());
|