copy.pass.cpp 2.8 KB

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