| /haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/multiset/modifiers/insert/ |
| H A D | 2.cc | 24 // A few tests for insert with hint, in the occasion of libstdc++/19422
34 ms0.insert(1);
35 ms1.insert(ms1.end(), 1);
38 ms0.insert(3);
39 ms1.insert(ms1.begin(), 3);
42 ms0.insert(4);
43 iter1 = ms1.insert(ms1.end(), 4);
46 ms0.insert(6);
47 ms1.insert(iter1, 6);
50 ms0.insert(
[all...] |
| /haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/set/modifiers/insert/ |
| H A D | 1.cc | 24 // A few tests for insert with hint, in the occasion of libstdc++/19422
34 s0.insert(1);
35 s1.insert(s1.end(), 1);
38 s0.insert(3);
39 s1.insert(s1.begin(), 3);
42 s0.insert(4);
43 iter1 = s1.insert(s1.end(), 4);
46 s0.insert(6);
47 s1.insert(iter1, 6);
50 s0.insert(
[all...] |
| /haiku-buildtools/gcc/gcc/testsuite/g++.dg/template/ |
| H A D | inherit3.C | 3 void insert (const T&);
5 void insert (X, X);
10 insert (i);
|
| /haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/deque/modifiers/insert/ |
| H A D | const_iterator.cc | 27 std::deque<int>::iterator it = d1.insert(d1.cbegin(), n);
28 it = d1.insert(d1.cbegin(), 1);
29 it = d1.insert(d1.cbegin(), {2, 3});
30 it = d1.insert(d1.cbegin(), 1, 4);
31 it = d1.insert(d1.cbegin(), d2.begin(), d2.end());
|
| /haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/list/modifiers/insert/ |
| H A D | const_iterator.cc | 27 std::list<int>::iterator it = l1.insert(l1.cbegin(), n);
28 it = l1.insert(l1.cbegin(), 1);
29 it = l1.insert(l1.cbegin(), {2, 3});
30 it = l1.insert(l1.cbegin(), 1, 4);
31 it = l1.insert(l1.cbegin(), l2.begin(), l2.end());
|
| /haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/unordered_set/operators/ |
| H A D | 1.cc | 33 us1.insert(1);
34 us2.insert(1);
38 us1.insert(2);
39 us2.insert(2);
43 us1.insert(1);
44 us2.insert(1);
48 us1.insert(3);
52 us2.insert(3);
64 us1.insert(1);
65 us2.insert(
[all...] |
| /haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/vector/modifiers/insert/ |
| H A D | const_iterator.cc | 27 std::vector<int>::iterator it = v1.insert(v1.cbegin(), n);
28 it = v1.insert(v1.cbegin(), 1);
29 it = v1.insert(v1.cbegin(), {2, 3});
30 it = v1.insert(v1.cbegin(), 1, 4);
31 it = v1.insert(v1.cbegin(), v2.begin(), v2.end());
|
| /haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/unordered_multiset/operators/ |
| H A D | 1.cc | 33 ums1.insert(1);
34 ums2.insert(1);
38 ums1.insert(2);
39 ums2.insert(2);
43 ums1.insert(1);
44 ums2.insert(1);
48 ums1.insert(3);
52 ums2.insert(3);
64 ums1.insert(1);
65 ums2.insert(
[all...] |
| /haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/unordered_map/operators/ |
| H A D | 1.cc | 34 um1.insert(Pair(1, -1));
35 um2.insert(Pair(1, -1));
39 um1.insert(Pair(2, -1));
40 um2.insert(Pair(2, -1));
44 um1.insert(Pair(1, -1));
45 um2.insert(Pair(1, -1));
49 um1.insert(Pair(3, -3));
53 um2.insert(Pair(3, -3));
65 um1.insert(Pair(1, -1));
66 um2.insert(Pai
[all...] |
| /haiku-buildtools/gcc/gcc/testsuite/g++.dg/opt/ |
| H A D | pr17411-1.C | 15 void insert(const pair& __x);
19 insert(pair(CalibData()));
|
| /haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/unordered_set/ |
| H A D | 61143.cc | 27 us1.insert(1);
31 us1.insert(1);
|
| /haiku-buildtools/gcc/libstdc++-v3/testsuite/libstdc++-xmethods/ |
| H A D | associative-containers.cc | 40 s.insert (i % 5);
41 ms.insert (i % 5);
42 us.insert (i % 7);
43 ums.insert (i % 7);
45 m.insert(std::pair<char, int> ('a' + i % 5, i));
46 mm.insert(std::pair<char, int> ('a' + i % 5, i));
47 um.insert(std::pair<char, int> ('a' + i % 7, i));
48 umm.insert(std::pair<char, int> ('a' + i % 7, i));
|
| /haiku-buildtools/gcc/gcc/testsuite/gcc.target/avr/torture/ |
| H A D | builtins-error.c | 3 char insert (long a) function
|
| /haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/vector/bool/modifiers/insert/ |
| H A D | const_iterator.cc | 26 std::vector<bool>::iterator it = vb1.insert(vb1.cbegin(), true);
27 it = vb1.insert(vb1.cbegin(), {false, true});
28 it = vb1.insert(vb1.cbegin(), 1, false);
29 it = vb1.insert(vb1.cbegin(), vb2.begin(), vb2.end());
|
| /haiku-buildtools/gcc/libstdc++-v3/testsuite/ext/vstring/modifiers/insert/char/ |
| H A D | const_iterator.cc | 26 __gnu_cxx::__vstring::iterator it = vs1.insert(vs1.cbegin(), '1');
27 it = vs1.insert(vs1.cbegin(), 1, '2');
28 it = vs1.insert(vs1.cbegin(), {'3', '4'});
29 it = vs1.insert(vs1.cbegin(), vs1.begin(), vs1.end());
|
| /haiku-buildtools/gcc/libstdc++-v3/testsuite/ext/vstring/modifiers/insert/wchar_t/ |
| H A D | const_iterator.cc | 26 __gnu_cxx::__wvstring::iterator it = wvs1.insert(wvs1.cbegin(), L'1');
27 it = wvs1.insert(wvs1.cbegin(), 1, L'2');
28 it = wvs1.insert(wvs1.cbegin(), {L'3', L'4'});
29 it = wvs1.insert(wvs1.cbegin(), wvs1.begin(), wvs1.end());
|
| /haiku-buildtools/gcc/gcc/testsuite/g++.dg/lto/ |
| H A D | pr52035_0.C | 6 static void insert(int n);
9 template <typename T> void QVector<T>::insert(size_type n) {} function in class:QVector
13 QVector<int>::insert(n);
|
| /haiku-buildtools/gcc/gcc/testsuite/g++.dg/overload/ |
| H A D | ambig2.C | 16 QString &insert( unsigned int index, const QString & );
17 QString &insert( unsigned int index, QChar );
22 { return insert(0,s); }
|
| /haiku-buildtools/gcc/gcc/testsuite/g++.dg/cpp0x/ |
| H A D | initlist67.C | 11 void insert(const _Key&);
12 void insert(initializer_list<_Key>);
26 s.insert( { "abc", "def", "hij"} );
|
| /haiku-buildtools/gcc/libstdc++-v3/testsuite/21_strings/basic_string/modifiers/insert/char/ |
| H A D | 2.cc | 20 // 21.3.5.4 basic_string::insert
26 // string& insert(size_type __p, const char* s, size_type n);
27 // string& insert(size_type __p, const char* s);
37 str01.insert(0, str01.c_str() + str01.size() - 4, 4);
40 str01.insert(0, str01.c_str(), 5);
43 str01.insert(10, str01.c_str() + 4, 6);
46 str01.insert(15, str01.c_str(), 10);
49 str01.insert(15, str01.c_str() + 11, 13);
52 str01.insert(0, str01.c_str());
57 str01.insert(
[all...] |
| /haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/unordered_multimap/operators/ |
| H A D | 1.cc | 34 umm1.insert(Pair(1, -1));
35 umm2.insert(Pair(1, -1));
39 umm1.insert(Pair(2, -1));
40 umm2.insert(Pair(2, -1));
44 umm1.insert(Pair(1, -1));
45 umm2.insert(Pair(1, -1));
49 umm1.insert(Pair(3, -3));
53 umm2.insert(Pair(3, -3));
65 umm1.insert(Pair(1, -1));
66 umm2.insert(Pai
[all...] |
| /haiku-buildtools/legacy/binutils/gas/testsuite/gas/mips/ |
| H A D | mips64r2-ill.l | 28 .*:102: Error: Improper insert size \(0, position 0\)
29 .*:105: Error: Improper insert size \(65, position 0\)
30 .*:115: Error: Improper insert size \(64, position 1\)
31 .*:117: Error: Improper insert size \(2, position 63\)
32 .*:118: Error: Improper insert size \(63, position 63\)
33 .*:119: Error: Improper insert size \(64, position 63\)
36 .*:130: Error: Improper insert size \(1, position 31\)
37 .*:133: Error: Improper insert size \(65, position 0\)
38 .*:136: Error: Improper insert size \(2, position 0\)
39 .*:137: Error: Improper insert siz
[all...] |
| /haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/unordered_set/operations/ |
| H A D | count.cc | 35 us0.insert(1);
39 us0.insert(1);
43 us0.insert(2);
46 us0.insert(3);
47 us0.insert(3);
48 us0.insert(3);
69 us1.insert(4);
70 us1.insert(5);
71 us1.insert(5);
72 us1.insert(
[all...] |
| /haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/multiset/operations/ |
| H A D | count.cc | 33 ms0.insert(1);
37 ms0.insert(1);
41 ms0.insert(2);
44 ms0.insert(3);
45 ms0.insert(3);
46 ms0.insert(3);
67 ms1.insert(4);
68 ms1.insert(5);
69 ms1.insert(5);
70 ms1.insert(
[all...] |
| /haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/set/operations/ |
| H A D | count.cc | 33 s0.insert(1);
37 s0.insert(1);
41 s0.insert(2);
44 s0.insert(3);
45 s0.insert(3);
46 s0.insert(3);
67 s1.insert(4);
68 s1.insert(5);
69 s1.insert(5);
70 s1.insert(
[all...] |