summaryrefslogtreecommitdiff
path: root/libstdc++-v3/testsuite
diff options
context:
space:
mode:
authorpaolo <paolo@138bc75d-0d04-0410-961f-82ee72b054a4>2007-01-21 09:57:42 +0000
committerpaolo <paolo@138bc75d-0d04-0410-961f-82ee72b054a4>2007-01-21 09:57:42 +0000
commite836bf5a6e73e844eda95280f470528aee7961b0 (patch)
tree4b0eb4567c4e5d30813186d23802313935982f90 /libstdc++-v3/testsuite
parente51f51369523d5faab32134f260cca822e323ba2 (diff)
downloadgcc-e836bf5a6e73e844eda95280f470528aee7961b0.tar.gz
2007-01-21 Paolo Carlini <pcarlini@suse.de>
PR libstdc++/30449 (fill, fill_n) * include/bits/stl_algobase.h (__fill_aux(wchar_t*, wchar_t*, const wchar_t&), __fill_n_aux(wchar_t*, _Size, const wchar_t&)): New. (fill(signed char*, signed char*, const signed char&), fill(unsigned char*, unsigned char*, const unsigned char&), fill(char*, char*, char&), fill_n(signed char*, _Size, const signed char&), fill_n(unsigned char*, _Size, const unsigned char&), fill_n(char*, _Size, char&)): Rename to __*_aux. (__fill_normal, __fill_n_normal): New, call the latter. (fill, fill_n): Adjust, call the latter. * testsuite/25_algorithms/fill/4.cc: New. * testsuite/25_algorithms/fill/5.cc: New. git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@121027 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'libstdc++-v3/testsuite')
-rw-r--r--libstdc++-v3/testsuite/25_algorithms/fill/4.cc76
-rw-r--r--libstdc++-v3/testsuite/25_algorithms/fill/5.cc76
2 files changed, 152 insertions, 0 deletions
diff --git a/libstdc++-v3/testsuite/25_algorithms/fill/4.cc b/libstdc++-v3/testsuite/25_algorithms/fill/4.cc
new file mode 100644
index 00000000000..e8d52389cdc
--- /dev/null
+++ b/libstdc++-v3/testsuite/25_algorithms/fill/4.cc
@@ -0,0 +1,76 @@
+// 2007-01-19 Paolo Carlini <pcarlini@suse.de>
+
+// Copyright (C) 2007 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library. This library is free
+// software; you can redistribute it and/or modify it under the
+// terms of the GNU General Public License as published by the
+// Free Software Foundation; either version 2, or (at your option)
+// any later version.
+
+// This library is distributed in the hope that it will be useful,
+// but WITHOUT ANY WARRANTY; without Pred the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+// GNU General Public License for more details.
+
+// You should have received a copy of the GNU General Public License along
+// with this library; see the file COPYING. If not, write to the Free
+// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
+// USA.
+
+// 25.2.5 [lib.alg.fill] Fill.
+
+#include <algorithm>
+#include <vector>
+#include <testsuite_hooks.h>
+
+void
+test01()
+{
+ using namespace std;
+ bool test __attribute__((unused)) = true;
+
+ const int A1[] = {3, 3, 3, 3, 3, 3, 3, 3, 3, 3};
+ const int N1 = sizeof(A1) / sizeof(int);
+
+ int i1[N1];
+ fill(i1, i1 + N1, 3);
+ VERIFY( equal(i1, i1 + N1, A1) );
+
+ vector<int> v1(N1);
+ fill(v1.begin(), v1.end(), 3);
+ VERIFY( equal(v1.begin(), v1.end(), A1) );
+
+ const char A2[] = {'\3', '\3', '\3', '\3', '\3',
+ '\3', '\3', '\3', '\3', '\3'};
+ const int N2 = sizeof(A2) / sizeof(char);
+
+ char i2[N2];
+ fill(i2, i2 + N2, '\3');
+ VERIFY( equal(i2, i2 + N2, A2) );
+
+ vector<char> v2(N2);
+ fill(v2.begin(), v2.end(), '\3');
+ VERIFY( equal(v2.begin(), v2.end(), A2) );
+
+#ifdef _GLIBCXX_USE_WCHAR_T
+ const wchar_t A3[] = {L'\3', L'\3', L'\3', L'\3', L'\3',
+ L'\3', L'\3', L'\3', L'\3', L'\3'};
+ const int N3 = sizeof(A3) / sizeof(wchar_t);
+
+ wchar_t i3[N3];
+ fill(i3, i3 + N3, L'\3');
+ VERIFY( equal(i3, i3 + N3, A3) );
+
+ vector<wchar_t> v3(N3);
+ fill(v3.begin(), v3.end(), L'\3');
+ VERIFY( equal(v3.begin(), v3.end(), A3) );
+#endif
+}
+
+int
+main()
+{
+ test01();
+ return 0;
+}
diff --git a/libstdc++-v3/testsuite/25_algorithms/fill/5.cc b/libstdc++-v3/testsuite/25_algorithms/fill/5.cc
new file mode 100644
index 00000000000..8fdb153b383
--- /dev/null
+++ b/libstdc++-v3/testsuite/25_algorithms/fill/5.cc
@@ -0,0 +1,76 @@
+// 2007-01-19 Paolo Carlini <pcarlini@suse.de>
+
+// Copyright (C) 2007 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library. This library is free
+// software; you can redistribute it and/or modify it under the
+// terms of the GNU General Public License as published by the
+// Free Software Foundation; either version 2, or (at your option)
+// any later version.
+
+// This library is distributed in the hope that it will be useful,
+// but WITHOUT ANY WARRANTY; without Pred the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+// GNU General Public License for more details.
+
+// You should have received a copy of the GNU General Public License along
+// with this library; see the file COPYING. If not, write to the Free
+// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
+// USA.
+
+// 25.2.5 [lib.alg.fill] Fill_n.
+
+#include <algorithm>
+#include <vector>
+#include <testsuite_hooks.h>
+
+void
+test01()
+{
+ using namespace std;
+ bool test __attribute__((unused)) = true;
+
+ const int A1[] = {3, 3, 3, 3, 3, 3, 3, 3, 3, 3};
+ const int N1 = sizeof(A1) / sizeof(int);
+
+ int i1[N1];
+ fill_n(i1, N1, 3);
+ VERIFY( equal(i1, i1 + N1, A1) );
+
+ vector<int> v1(N1);
+ fill_n(v1.begin(), N1, 3);
+ VERIFY( equal(v1.begin(), v1.end(), A1) );
+
+ const char A2[] = {'\3', '\3', '\3', '\3', '\3',
+ '\3', '\3', '\3', '\3', '\3'};
+ const int N2 = sizeof(A2) / sizeof(char);
+
+ char i2[N2];
+ fill_n(i2, N2, '\3');
+ VERIFY( equal(i2, i2 + N2, A2) );
+
+ vector<char> v2(N2);
+ fill_n(v2.begin(), N2, '\3');
+ VERIFY( equal(v2.begin(), v2.end(), A2) );
+
+#ifdef _GLIBCXX_USE_WCHAR_T
+ const wchar_t A3[] = {L'\3', L'\3', L'\3', L'\3', L'\3',
+ L'\3', L'\3', L'\3', L'\3', L'\3'};
+ const int N3 = sizeof(A3) / sizeof(wchar_t);
+
+ wchar_t i3[N3];
+ fill_n(i3, N3, L'\3');
+ VERIFY( equal(i3, i3 + N3, A3) );
+
+ vector<wchar_t> v3(N3);
+ fill_n(v3.begin(), N3, L'\3');
+ VERIFY( equal(v3.begin(), v3.end(), A3) );
+#endif
+}
+
+int
+main()
+{
+ test01();
+ return 0;
+}