copy.pass.cpp 2.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104
  1. //===----------------------------------------------------------------------===//
  2. //
  3. // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
  4. // See https://llvm.org/LICENSE.txt for license information.
  5. // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
  6. //
  7. //===----------------------------------------------------------------------===//
  8. // <string_view>
  9. // size_type copy(charT* s, size_type n, size_type pos = 0) const;
  10. // Throws: out_of_range if pos > size().
  11. // Remarks: Let rlen be the smaller of n and size() - pos.
  12. // Requires: [s, s+rlen) is a valid range.
  13. // Effects: Equivalent to std::copy_n(begin() + pos, rlen, s).
  14. // Returns: rlen.
  15. #include <string_view>
  16. #include <algorithm>
  17. #include <cassert>
  18. #include <stdexcept>
  19. #include "test_macros.h"
  20. template<typename CharT>
  21. void test1 ( std::basic_string_view<CharT> sv, size_t n, size_t pos ) {
  22. const size_t rlen = std::min ( n, sv.size() - pos );
  23. CharT *dest1 = new CharT [rlen + 1]; dest1[rlen] = 0;
  24. CharT *dest2 = new CharT [rlen + 1]; dest2[rlen] = 0;
  25. if (pos > sv.size()) {
  26. #ifndef TEST_HAS_NO_EXCEPTIONS
  27. try {
  28. sv.copy(dest1, n, pos);
  29. assert(false);
  30. } catch (const std::out_of_range&) {
  31. } catch (...) {
  32. assert(false);
  33. }
  34. #endif
  35. } else {
  36. sv.copy(dest1, n, pos);
  37. std::copy_n(sv.begin() + pos, rlen, dest2);
  38. for ( size_t i = 0; i <= rlen; ++i )
  39. assert ( dest1[i] == dest2[i] );
  40. }
  41. delete [] dest1;
  42. delete [] dest2;
  43. }
  44. template<typename CharT>
  45. void test ( const CharT *s ) {
  46. typedef std::basic_string_view<CharT> string_view_t;
  47. string_view_t sv1 ( s );
  48. test1(sv1, 0, 0);
  49. test1(sv1, 1, 0);
  50. test1(sv1, 20, 0);
  51. test1(sv1, sv1.size(), 0);
  52. test1(sv1, 20, string_view_t::npos);
  53. test1(sv1, 0, 3);
  54. test1(sv1, 2, 3);
  55. test1(sv1, 100, 3);
  56. test1(sv1, 100, string_view_t::npos);
  57. test1(sv1, sv1.size(), string_view_t::npos);
  58. test1(sv1, sv1.size() + 1, 0);
  59. test1(sv1, sv1.size() + 1, 1);
  60. test1(sv1, sv1.size() + 1, string_view_t::npos);
  61. }
  62. int main(int, char**) {
  63. test ( "ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDE" );
  64. test ( "ABCDE");
  65. test ( "a" );
  66. test ( "" );
  67. test ( L"ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDE" );
  68. test ( L"ABCDE" );
  69. test ( L"a" );
  70. test ( L"" );
  71. #if TEST_STD_VER >= 11
  72. test ( u"ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDE" );
  73. test ( u"ABCDE" );
  74. test ( u"a" );
  75. test ( u"" );
  76. test ( U"ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDE" );
  77. test ( U"ABCDE" );
  78. test ( U"a" );
  79. test ( U"" );
  80. #endif
  81. return 0;
  82. }