1 //===----------------------------------------------------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is dual licensed under the MIT and the University of Illinois Open
6 // Source Licenses. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
13 // size_type copy(charT* s, size_type n, size_type pos = 0) const;
15 // Throws: out_of_range if pos > size().
16 // Remarks: Let rlen be the smaller of n and size() - pos.
17 // Requires: [s, s+rlen) is a valid range.
18 // Effects: Equivalent to std::copy_n(begin() + pos, rlen, s).
22 #include <experimental/string_view>
25 template<typename CharT>
26 void test1 ( std::experimental::basic_string_view<CharT> sv, size_t n, size_t pos ) {
27 const size_t rlen = std::min ( n, sv.size() - pos );
29 CharT *dest1 = new CharT [rlen + 1]; dest1[rlen] = 0;
30 CharT *dest2 = new CharT [rlen + 1]; dest2[rlen] = 0;
33 sv.copy(dest1, n, pos);
34 std::copy_n(sv.begin() + pos, rlen, dest2);
36 for ( size_t i = 0; i <= rlen; ++i )
37 assert ( dest1[i] == dest2[i] );
39 catch ( const std::out_of_range & ) { assert ( pos > sv.size()); }
45 template<typename CharT>
46 void test ( const CharT *s ) {
47 typedef std::experimental::basic_string_view<CharT> string_view_t;
49 string_view_t sv1 ( s );
54 test1(sv1, sv1.size(), 0);
55 test1(sv1, 20, string_view_t::npos);
60 test1(sv1, 100, string_view_t::npos);
62 test1(sv1, sv1.size(), string_view_t::npos);
64 test1(sv1, sv1.size() + 1, 0);
65 test1(sv1, sv1.size() + 1, 1);
66 test1(sv1, sv1.size() + 1, string_view_t::npos);
71 test ( "ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDE" );
76 test ( L"ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDE" );
81 #if __cplusplus >= 201103L
82 test ( u"ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDE" );
87 test ( U"ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDE" );