aboutsummaryrefslogtreecommitdiff
path: root/test/std/strings/basic.string/string.modifiers/string_assign/T_size_size.pass.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'test/std/strings/basic.string/string.modifiers/string_assign/T_size_size.pass.cpp')
-rw-r--r--test/std/strings/basic.string/string.modifiers/string_assign/T_size_size.pass.cpp195
1 files changed, 195 insertions, 0 deletions
diff --git a/test/std/strings/basic.string/string.modifiers/string_assign/T_size_size.pass.cpp b/test/std/strings/basic.string/string.modifiers/string_assign/T_size_size.pass.cpp
new file mode 100644
index 000000000000..bf51d816e86e
--- /dev/null
+++ b/test/std/strings/basic.string/string.modifiers/string_assign/T_size_size.pass.cpp
@@ -0,0 +1,195 @@
+//===----------------------------------------------------------------------===//
+//
+// The LLVM Compiler Infrastructure
+//
+// This file is dual licensed under the MIT and the University of Illinois Open
+// Source Licenses. See LICENSE.TXT for details.
+//
+//===----------------------------------------------------------------------===//
+
+// <string>
+
+// template <class T>
+// basic_string& assign(const T& t, size_type pos, size_type n=npos); // C++17
+
+#include <string>
+#include <stdexcept>
+#include <cassert>
+
+#include "test_macros.h"
+#include "min_allocator.h"
+
+template <class S, class SV>
+void
+test(S s, SV sv, typename S::size_type pos, typename S::size_type n, S expected)
+{
+ if (pos <= sv.size())
+ {
+ s.assign(sv, pos, n);
+ LIBCPP_ASSERT(s.__invariants());
+ assert(s == expected);
+ }
+#ifndef TEST_HAS_NO_EXCEPTIONS
+ else
+ {
+ try
+ {
+ s.assign(sv, pos, n);
+ assert(false);
+ }
+ catch (std::out_of_range&)
+ {
+ assert(pos > sv.size());
+ }
+ }
+#endif
+}
+
+template <class S, class SV>
+void
+test_npos(S s, SV sv, typename S::size_type pos, S expected)
+{
+ if (pos <= sv.size())
+ {
+ s.assign(sv, pos);
+ LIBCPP_ASSERT(s.__invariants());
+ assert(s == expected);
+ }
+#ifndef TEST_HAS_NO_EXCEPTIONS
+ else
+ {
+ try
+ {
+ s.assign(sv, pos);
+ assert(false);
+ }
+ catch (std::out_of_range&)
+ {
+ assert(pos > sv.size());
+ }
+ }
+#endif
+}
+
+int main()
+{
+ {
+ typedef std::string S;
+ typedef std::string_view SV;
+ test(S(), SV(), 0, 0, S());
+ test(S(), SV(), 1, 0, S());
+ test(S(), SV("12345"), 0, 3, S("123"));
+ test(S(), SV("12345"), 1, 4, S("2345"));
+ test(S(), SV("12345"), 3, 15, S("45"));
+ test(S(), SV("12345"), 5, 15, S(""));
+ test(S(), SV("12345"), 6, 15, S("not happening"));
+ test(S(), SV("12345678901234567890"), 0, 0, S());
+ test(S(), SV("12345678901234567890"), 1, 1, S("2"));
+ test(S(), SV("12345678901234567890"), 2, 3, S("345"));
+ test(S(), SV("12345678901234567890"), 12, 13, S("34567890"));
+ test(S(), SV("12345678901234567890"), 21, 13, S("not happening"));
+
+ test(S("12345"), SV(), 0, 0, S());
+ test(S("12345"), SV("12345"), 2, 2, S("34"));
+ test(S("12345"), SV("1234567890"), 0, 100, S("1234567890"));
+
+ test(S("12345678901234567890"), SV(), 0, 0, S());
+ test(S("12345678901234567890"), SV("12345"), 1, 3, S("234"));
+ test(S("12345678901234567890"), SV("12345678901234567890"), 5, 10,
+ S("6789012345"));
+ }
+#if TEST_STD_VER >= 11
+ {
+ typedef std::basic_string <char, std::char_traits<char>, min_allocator<char>> S;
+ typedef std::basic_string_view<char, std::char_traits<char> > SV;
+ test(S(), SV(), 0, 0, S());
+ test(S(), SV(), 1, 0, S());
+ test(S(), SV("12345"), 0, 3, S("123"));
+ test(S(), SV("12345"), 1, 4, S("2345"));
+ test(S(), SV("12345"), 3, 15, S("45"));
+ test(S(), SV("12345"), 5, 15, S(""));
+ test(S(), SV("12345"), 6, 15, S("not happening"));
+ test(S(), SV("12345678901234567890"), 0, 0, S());
+ test(S(), SV("12345678901234567890"), 1, 1, S("2"));
+ test(S(), SV("12345678901234567890"), 2, 3, S("345"));
+ test(S(), SV("12345678901234567890"), 12, 13, S("34567890"));
+ test(S(), SV("12345678901234567890"), 21, 13, S("not happening"));
+
+ test(S("12345"), SV(), 0, 0, S());
+ test(S("12345"), SV("12345"), 2, 2, S("34"));
+ test(S("12345"), SV("1234567890"), 0, 100, S("1234567890"));
+
+ test(S("12345678901234567890"), SV(), 0, 0, S());
+ test(S("12345678901234567890"), SV("12345"), 1, 3, S("234"));
+ test(S("12345678901234567890"), SV("12345678901234567890"), 5, 10,
+ S("6789012345"));
+ }
+#endif
+ {
+ typedef std::string S;
+ typedef std::string_view SV;
+ test_npos(S(), SV(), 0, S());
+ test_npos(S(), SV(), 1, S());
+ test_npos(S(), SV("12345"), 0, S("12345"));
+ test_npos(S(), SV("12345"), 1, S("2345"));
+ test_npos(S(), SV("12345"), 3, S("45"));
+ test_npos(S(), SV("12345"), 5, S(""));
+ test_npos(S(), SV("12345"), 6, S("not happening"));
+ }
+
+ {
+ std::string s = "ABCD";
+ std::string_view sv = "EFGH";
+ char arr[] = "IJKL";
+
+ s.assign("CDEF", 0); // calls assign(const char *, len)
+ assert(s == "");
+ s.clear();
+
+ s.assign("QRST", 0, std::string::npos); // calls assign(string("QRST", pos, len)
+ assert(s == "QRST");
+ s.clear();
+
+ s.assign(sv, 0); // calls assign(T, pos, npos)
+ assert(s == sv);
+ s.clear();
+
+ s.assign(sv, 0, std::string::npos); // calls assign(T, pos, npos)
+ assert(s == sv);
+ s.clear();
+
+ s.assign(arr, 0); // calls assign(const char *, len)
+ assert(s == "");
+ s.clear();
+
+ s.assign(arr, 0, std::string::npos); // calls assign(string("IJKL"), pos, npos)
+ assert(s == "IJKL");
+ s.clear();
+
+ s.assign(arr, 0); // calls assign(const char *, len)
+ assert(s == "");
+ s.clear();
+ }
+
+ {
+ std::string s = "ABCD";
+ std::string_view sv = s;
+ s.assign(sv);
+ assert(s == "ABCD");
+
+ sv = s;
+ s.assign(sv, 0, std::string::npos);
+ assert(s == "ABCD");
+ }
+
+ {
+ std::string s = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
+ std::string_view sv = s;
+ s.assign(sv);
+ assert(s == "ABCDEFGHIJKLMNOPQRSTUVWXYZ");
+
+ sv = s;
+ s.assign(sv, 0, std::string::npos);
+ assert(s == "ABCDEFGHIJKLMNOPQRSTUVWXYZ");
+ }
+}