33 #define _COW_STRING_H 1
35 #if ! _GLIBCXX_USE_CXX11_ABI
37 #ifdef __cpp_lib_is_constant_evaluated
39 # define __cpp_lib_constexpr_string 201811L
40 #elif __cplusplus >= 201703L && _GLIBCXX_HAVE_IS_CONSTANT_EVALUATED
42 # define __cpp_lib_constexpr_string 201611L
45 namespace std _GLIBCXX_VISIBILITY(default)
47 _GLIBCXX_BEGIN_NAMESPACE_VERSION
111 template<
typename _CharT,
typename _Traits,
typename _Alloc>
115 rebind<_CharT>::other _CharT_alloc_type;
120 typedef _Traits traits_type;
121 typedef typename _Traits::char_type value_type;
122 typedef _Alloc allocator_type;
123 typedef typename _CharT_alloc_traits::size_type size_type;
124 typedef typename _CharT_alloc_traits::difference_type difference_type;
125 #if __cplusplus < 201103L
126 typedef typename _CharT_alloc_type::reference reference;
127 typedef typename _CharT_alloc_type::const_reference const_reference;
129 typedef value_type& reference;
130 typedef const value_type& const_reference;
132 typedef typename _CharT_alloc_traits::pointer pointer;
133 typedef typename _CharT_alloc_traits::const_pointer const_pointer;
134 typedef __gnu_cxx::__normal_iterator<pointer, basic_string> iterator;
135 typedef __gnu_cxx::__normal_iterator<const_pointer, basic_string>
142 typedef iterator __const_iterator;
162 size_type _M_capacity;
163 _Atomic_word _M_refcount;
166 struct _Rep : _Rep_base
170 rebind<char>::other _Raw_bytes_alloc;
185 static const size_type _S_max_size;
186 static const _CharT _S_terminal;
190 static size_type _S_empty_rep_storage[];
193 _S_empty_rep() _GLIBCXX_NOEXCEPT
198 void* __p =
reinterpret_cast<void*
>(&_S_empty_rep_storage);
199 return *
reinterpret_cast<_Rep*
>(__p);
203 _M_is_leaked()
const _GLIBCXX_NOEXCEPT
205 #if defined(__GTHREADS)
210 return __atomic_load_n(&this->_M_refcount, __ATOMIC_RELAXED) < 0;
212 return this->_M_refcount < 0;
217 _M_is_shared()
const _GLIBCXX_NOEXCEPT
219 #if defined(__GTHREADS)
225 if (!__gnu_cxx::__is_single_threaded())
226 return __atomic_load_n(&this->_M_refcount, __ATOMIC_ACQUIRE) > 0;
228 return this->_M_refcount > 0;
232 _M_set_leaked() _GLIBCXX_NOEXCEPT
233 { this->_M_refcount = -1; }
236 _M_set_sharable() _GLIBCXX_NOEXCEPT
237 { this->_M_refcount = 0; }
240 _M_set_length_and_sharable(size_type __n) _GLIBCXX_NOEXCEPT
242 #if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
243 if (__builtin_expect(
this != &_S_empty_rep(),
false))
246 this->_M_set_sharable();
247 this->_M_length = __n;
248 traits_type::assign(this->_M_refdata()[__n], _S_terminal);
256 {
return reinterpret_cast<_CharT*
>(
this + 1); }
259 _M_grab(
const _Alloc& __alloc1,
const _Alloc& __alloc2)
261 return (!_M_is_leaked() && __alloc1 == __alloc2)
262 ? _M_refcopy() : _M_clone(__alloc1);
267 _S_create(size_type, size_type,
const _Alloc&);
270 _M_dispose(
const _Alloc& __a) _GLIBCXX_NOEXCEPT
272 #if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
273 if (__builtin_expect(
this != &_S_empty_rep(),
false))
277 _GLIBCXX_SYNCHRONIZATION_HAPPENS_BEFORE(&this->_M_refcount);
286 if (__gnu_cxx::__exchange_and_add_dispatch(&this->_M_refcount,
289 _GLIBCXX_SYNCHRONIZATION_HAPPENS_AFTER(&this->_M_refcount);
296 _M_destroy(
const _Alloc&)
throw();
301 #if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
302 if (__builtin_expect(
this != &_S_empty_rep(),
false))
304 __gnu_cxx::__atomic_add_dispatch(&this->_M_refcount, 1);
309 _M_clone(
const _Alloc&, size_type __res = 0);
313 struct _Alloc_hider : _Alloc
315 _Alloc_hider(_CharT* __dat,
const _Alloc& __a) _GLIBCXX_NOEXCEPT
316 : _Alloc(__a), _M_p(__dat) { }
326 static const size_type
npos =
static_cast<size_type
>(-1);
330 mutable _Alloc_hider _M_dataplus;
333 _M_data() const _GLIBCXX_NOEXCEPT
334 {
return _M_dataplus._M_p; }
337 _M_data(_CharT* __p) _GLIBCXX_NOEXCEPT
338 {
return (_M_dataplus._M_p = __p); }
341 _M_rep() const _GLIBCXX_NOEXCEPT
342 {
return &((
reinterpret_cast<_Rep*
> (_M_data()))[-1]); }
347 _M_ibegin() const _GLIBCXX_NOEXCEPT
348 {
return iterator(_M_data()); }
351 _M_iend() const _GLIBCXX_NOEXCEPT
352 {
return iterator(_M_data() + this->
size()); }
357 if (!_M_rep()->_M_is_leaked())
362 _M_check(size_type __pos,
const char* __s)
const
364 if (__pos > this->
size())
365 __throw_out_of_range_fmt(__N(
"%s: __pos (which is %zu) > "
366 "this->size() (which is %zu)"),
367 __s, __pos, this->
size());
372 _M_check_length(size_type __n1, size_type __n2,
const char* __s)
const
375 __throw_length_error(__N(__s));
380 _M_limit(size_type __pos, size_type __off)
const _GLIBCXX_NOEXCEPT
382 const bool __testoff = __off < this->
size() - __pos;
383 return __testoff ? __off : this->
size() - __pos;
388 _M_disjunct(
const _CharT* __s)
const _GLIBCXX_NOEXCEPT
390 return (less<const _CharT*>()(__s, _M_data())
391 || less<const _CharT*>()(_M_data() + this->
size(), __s));
397 _M_copy(_CharT* __d,
const _CharT* __s, size_type __n) _GLIBCXX_NOEXCEPT
400 traits_type::assign(*__d, *__s);
402 traits_type::copy(__d, __s, __n);
406 _M_move(_CharT* __d,
const _CharT* __s, size_type __n) _GLIBCXX_NOEXCEPT
409 traits_type::assign(*__d, *__s);
411 traits_type::move(__d, __s, __n);
415 _M_assign(_CharT* __d, size_type __n, _CharT __c) _GLIBCXX_NOEXCEPT
418 traits_type::assign(*__d, __c);
420 traits_type::assign(__d, __n, __c);
425 template<
class _Iterator>
427 _S_copy_chars(_CharT* __p, _Iterator __k1, _Iterator __k2)
429 for (; __k1 != __k2; ++__k1, (void)++__p)
430 traits_type::assign(*__p, *__k1);
434 _S_copy_chars(_CharT* __p, iterator __k1, iterator __k2) _GLIBCXX_NOEXCEPT
435 { _S_copy_chars(__p, __k1.base(), __k2.base()); }
438 _S_copy_chars(_CharT* __p, const_iterator __k1, const_iterator __k2)
440 { _S_copy_chars(__p, __k1.base(), __k2.base()); }
443 _S_copy_chars(_CharT* __p, _CharT* __k1, _CharT* __k2) _GLIBCXX_NOEXCEPT
444 { _M_copy(__p, __k1, __k2 - __k1); }
447 _S_copy_chars(_CharT* __p,
const _CharT* __k1,
const _CharT* __k2)
449 { _M_copy(__p, __k1, __k2 - __k1); }
452 _S_compare(size_type __n1, size_type __n2) _GLIBCXX_NOEXCEPT
454 const difference_type __d = difference_type(__n1 - __n2);
456 if (__d > __gnu_cxx::__numeric_traits<int>::__max)
457 return __gnu_cxx::__numeric_traits<int>::__max;
458 else if (__d < __gnu_cxx::__numeric_traits<int>::__min)
459 return __gnu_cxx::__numeric_traits<int>::__min;
465 _M_mutate(size_type __pos, size_type __len1, size_type __len2);
471 _S_empty_rep() _GLIBCXX_NOEXCEPT
472 {
return _Rep::_S_empty_rep(); }
474 #if __cplusplus >= 201703L
476 typedef basic_string_view<_CharT, _Traits> __sv_type;
478 template<
typename _Tp,
typename _Res>
480 __and_<is_convertible<const _Tp&, __sv_type>,
481 __not_<is_convertible<const _Tp*, const basic_string*>>,
482 __not_<is_convertible<const _Tp&, const _CharT*>>>::value,
487 _S_to_string_view(__sv_type __svt) noexcept
496 explicit __sv_wrapper(__sv_type __sv) noexcept : _M_sv(__sv) { }
520 #if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
522 : _M_dataplus(_S_empty_rep()._M_refdata(), _Alloc())
524 : _M_dataplus(_S_construct(size_type(), _CharT(), _Alloc()), _Alloc())
533 : _M_dataplus(_S_construct(size_type(), _CharT(), __a), __a)
542 : _M_dataplus(__str._M_rep()->_M_grab(_Alloc(__str.
get_allocator()),
556 const _Alloc& __a = _Alloc());
574 size_type __n,
const _Alloc& __a);
586 const _Alloc& __a = _Alloc())
587 : _M_dataplus(_S_construct(__s, __s + __n, __a), __a)
595 #if __cpp_deduction_guides && ! defined _GLIBCXX_DEFINING_STRING_INSTANTIATIONS
598 template<
typename = _RequireAllocator<_Alloc>>
601 : _M_dataplus(_S_construct(__s, __s ? __s + traits_type::
length(__s) :
602 __s +
npos, __a), __a)
612 : _M_dataplus(_S_construct(__n, __c, __a), __a)
615 #if __cplusplus >= 201103L
624 : _M_dataplus(
std::move(__str._M_dataplus))
626 #if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
628 __str._M_data(_S_empty_rep()._M_refdata());
634 if (_M_rep()->_M_is_shared())
635 __gnu_cxx::__atomic_add_dispatch(&_M_rep()->_M_refcount, 1);
637 _M_rep()->_M_refcount = 1;
647 : _M_dataplus(_S_construct(__l.
begin(), __l.
end(), __a), __a)
651 : _M_dataplus(__str._M_rep()->_M_grab(__a, __str.
get_allocator()), __a)
655 : _M_dataplus(__str._M_data(), __a)
659 #if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
660 __str._M_data(_S_empty_rep()._M_refdata());
662 __str._M_data(_S_construct(size_type(), _CharT(), __a));
666 _M_dataplus._M_p = _S_construct(__str.
begin(), __str.
end(), __a);
670 #if __cplusplus >= 202100L
681 template<
class _InputIterator>
683 const _Alloc& __a = _Alloc())
684 : _M_dataplus(_S_construct(__beg, __end, __a), __a)
687 #if __cplusplus >= 201703L
695 template<
typename _Tp,
698 const _Alloc& __a = _Alloc())
706 template<
typename _Tp,
typename = _If_sv<_Tp,
void>>
709 :
basic_string(__sv_wrapper(_S_to_string_view(__t)), __a) { }
724 {
return this->
assign(__str); }
732 {
return this->
assign(__s); }
748 #if __cplusplus >= 201103L
772 this->
assign(__l.begin(), __l.size());
777 #if __cplusplus >= 201703L
782 template<
typename _Tp>
783 _If_sv<_Tp, basic_string&>
785 {
return this->
assign(__svt); }
804 return iterator(_M_data());
813 {
return const_iterator(_M_data()); }
823 return iterator(_M_data() + this->
size());
831 end() const _GLIBCXX_NOEXCEPT
832 {
return const_iterator(_M_data() + this->
size()); }
848 const_reverse_iterator
866 const_reverse_iterator
870 #if __cplusplus >= 201103L
877 {
return const_iterator(this->_M_data()); }
885 {
return const_iterator(this->_M_data() + this->
size()); }
892 const_reverse_iterator
901 const_reverse_iterator
912 {
return _M_rep()->_M_length; }
918 {
return _M_rep()->_M_length; }
923 {
return _Rep::_S_max_size; }
950 { this->
resize(__n, _CharT()); }
952 #if __cplusplus >= 201103L
953 #pragma GCC diagnostic push
954 #pragma GCC diagnostic ignored "-Wdeprecated-declarations"
959 #pragma GCC diagnostic pop
968 {
return _M_rep()->_M_capacity; }
991 #if __cplusplus > 201703L
992 [[deprecated(
"use shrink_to_fit() instead")]]
1000 #if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
1004 if (_M_rep()->_M_is_shared())
1007 _M_data(_S_empty_rep()._M_refdata());
1010 _M_rep()->_M_set_length_and_sharable(0);
1016 { _M_mutate(0, this->
size(), 0); }
1023 _GLIBCXX_NODISCARD
bool
1025 {
return this->
size() == 0; }
1041 __glibcxx_assert(__pos <=
size());
1042 return _M_data()[__pos];
1060 __glibcxx_assert(__pos <=
size());
1062 _GLIBCXX_DEBUG_PEDASSERT(__cplusplus >= 201103L || __pos <
size());
1064 return _M_data()[__pos];
1080 if (__n >= this->
size())
1081 __throw_out_of_range_fmt(__N(
"basic_string::at: __n "
1082 "(which is %zu) >= this->size() "
1085 return _M_data()[__n];
1103 __throw_out_of_range_fmt(__N(
"basic_string::at: __n "
1104 "(which is %zu) >= this->size() "
1108 return _M_data()[__n];
1111 #if __cplusplus >= 201103L
1119 __glibcxx_assert(!
empty());
1130 __glibcxx_assert(!
empty());
1141 __glibcxx_assert(!
empty());
1152 __glibcxx_assert(!
empty());
1165 {
return this->
append(__str); }
1174 {
return this->
append(__s); }
1188 #if __cplusplus >= 201103L
1196 {
return this->
append(__l.begin(), __l.size()); }
1199 #if __cplusplus >= 201703L
1205 template<
typename _Tp>
1206 _If_sv<_Tp, basic_string&>
1208 {
return this->
append(__svt); }
1252 __glibcxx_requires_string(__s);
1253 return this->
append(__s, traits_type::length(__s));
1267 #if __cplusplus >= 201103L
1275 {
return this->
append(__l.begin(), __l.size()); }
1286 template<
class _InputIterator>
1288 append(_InputIterator __first, _InputIterator __last)
1289 {
return this->
replace(_M_iend(), _M_iend(), __first, __last); }
1291 #if __cplusplus >= 201703L
1297 template<
typename _Tp>
1298 _If_sv<_Tp, basic_string&>
1302 return this->
append(__sv.data(), __sv.size());
1313 template<
typename _Tp>
1314 _If_sv<_Tp, basic_string&>
1318 return append(__sv.data()
1319 + std::__sv_check(__sv.size(), __pos,
"basic_string::append"),
1320 std::__sv_limit(__sv.size(), __pos, __n));
1331 const size_type __len = 1 + this->
size();
1332 if (__len > this->
capacity() || _M_rep()->_M_is_shared())
1334 traits_type::assign(_M_data()[this->
size()], __c);
1335 _M_rep()->_M_set_length_and_sharable(__len);
1346 #if __cplusplus >= 201103L
1379 {
return this->
assign(__str._M_data()
1380 + __str._M_check(__pos,
"basic_string::assign"),
1381 __str._M_limit(__pos, __n)); }
1408 __glibcxx_requires_string(__s);
1409 return this->
assign(__s, traits_type::length(__s));
1423 {
return _M_replace_aux(size_type(0), this->
size(), __n, __c); }
1433 template<
class _InputIterator>
1435 assign(_InputIterator __first, _InputIterator __last)
1436 {
return this->
replace(_M_ibegin(), _M_iend(), __first, __last); }
1438 #if __cplusplus >= 201103L
1446 {
return this->
assign(__l.begin(), __l.size()); }
1449 #if __cplusplus >= 201703L
1455 template<
typename _Tp>
1456 _If_sv<_Tp, basic_string&>
1460 return this->
assign(__sv.data(), __sv.size());
1470 template<
typename _Tp>
1471 _If_sv<_Tp, basic_string&>
1475 return assign(__sv.data()
1476 + std::__sv_check(__sv.size(), __pos,
"basic_string::assign"),
1477 std::__sv_limit(__sv.size(), __pos, __n));
1495 insert(iterator __p, size_type __n, _CharT __c)
1496 { this->
replace(__p, __p, __n, __c); }
1510 template<
class _InputIterator>
1512 insert(iterator __p, _InputIterator __beg, _InputIterator __end)
1513 { this->
replace(__p, __p, __beg, __end); }
1515 #if __cplusplus >= 201103L
1525 _GLIBCXX_DEBUG_PEDASSERT(__p >= _M_ibegin() && __p <= _M_iend());
1526 this->
insert(__p - _M_ibegin(), __l.begin(), __l.size());
1544 {
return this->
insert(__pos1, __str, size_type(0), __str.
size()); }
1566 size_type __pos2, size_type __n =
npos)
1567 {
return this->
insert(__pos1, __str._M_data()
1568 + __str._M_check(__pos2,
"basic_string::insert"),
1569 __str._M_limit(__pos2, __n)); }
1588 insert(size_type __pos,
const _CharT* __s, size_type __n);
1608 __glibcxx_requires_string(__s);
1609 return this->
insert(__pos, __s, traits_type::length(__s));
1629 insert(size_type __pos, size_type __n, _CharT __c)
1630 {
return _M_replace_aux(_M_check(__pos,
"basic_string::insert"),
1631 size_type(0), __n, __c); }
1649 _GLIBCXX_DEBUG_PEDASSERT(__p >= _M_ibegin() && __p <= _M_iend());
1650 const size_type __pos = __p - _M_ibegin();
1651 _M_replace_aux(__pos, size_type(0), size_type(1), __c);
1652 _M_rep()->_M_set_leaked();
1653 return iterator(_M_data() + __pos);
1656 #if __cplusplus >= 201703L
1663 template<
typename _Tp>
1664 _If_sv<_Tp, basic_string&>
1668 return this->
insert(__pos, __sv.data(), __sv.size());
1679 template<
typename _Tp>
1680 _If_sv<_Tp, basic_string&>
1682 size_type __pos2, size_type __n =
npos)
1685 return this->
replace(__pos1, size_type(0), __sv.data()
1686 + std::__sv_check(__sv.size(), __pos2,
"basic_string::insert"),
1687 std::__sv_limit(__sv.size(), __pos2, __n));
1709 _M_mutate(_M_check(__pos,
"basic_string::erase"),
1710 _M_limit(__pos, __n), size_type(0));
1725 _GLIBCXX_DEBUG_PEDASSERT(__position >= _M_ibegin()
1726 && __position < _M_iend());
1727 const size_type __pos = __position - _M_ibegin();
1728 _M_mutate(__pos, size_type(1), size_type(0));
1729 _M_rep()->_M_set_leaked();
1730 return iterator(_M_data() + __pos);
1743 erase(iterator __first, iterator __last);
1745 #if __cplusplus >= 201103L
1754 __glibcxx_assert(!
empty());
1778 {
return this->
replace(__pos, __n, __str._M_data(), __str.
size()); }
1800 size_type __pos2, size_type __n2 =
npos)
1801 {
return this->
replace(__pos1, __n1, __str._M_data()
1802 + __str._M_check(__pos2,
"basic_string::replace"),
1803 __str._M_limit(__pos2, __n2)); }
1824 replace(size_type __pos, size_type __n1,
const _CharT* __s,
1844 replace(size_type __pos, size_type __n1,
const _CharT* __s)
1846 __glibcxx_requires_string(__s);
1847 return this->
replace(__pos, __n1, __s, traits_type::length(__s));
1868 replace(size_type __pos, size_type __n1, size_type __n2, _CharT __c)
1869 {
return _M_replace_aux(_M_check(__pos,
"basic_string::replace"),
1870 _M_limit(__pos, __n1), __n2, __c); }
1887 {
return this->
replace(__i1, __i2, __str._M_data(), __str.
size()); }
1905 replace(iterator __i1, iterator __i2,
const _CharT* __s, size_type __n)
1907 _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2
1908 && __i2 <= _M_iend());
1909 return this->
replace(__i1 - _M_ibegin(), __i2 - __i1, __s, __n);
1926 replace(iterator __i1, iterator __i2,
const _CharT* __s)
1928 __glibcxx_requires_string(__s);
1929 return this->
replace(__i1, __i2, __s, traits_type::length(__s));
1947 replace(iterator __i1, iterator __i2, size_type __n, _CharT __c)
1949 _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2
1950 && __i2 <= _M_iend());
1951 return _M_replace_aux(__i1 - _M_ibegin(), __i2 - __i1, __n, __c);
1969 template<
class _InputIterator>
1972 _InputIterator __k1, _InputIterator __k2)
1974 _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2
1975 && __i2 <= _M_iend());
1976 __glibcxx_requires_valid_range(__k1, __k2);
1977 typedef typename std::__is_integer<_InputIterator>::__type _Integral;
1978 return _M_replace_dispatch(__i1, __i2, __k1, __k2, _Integral());
1986 _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2
1987 && __i2 <= _M_iend());
1988 __glibcxx_requires_valid_range(__k1, __k2);
1989 return this->
replace(__i1 - _M_ibegin(), __i2 - __i1,
1994 replace(iterator __i1, iterator __i2,
1995 const _CharT* __k1,
const _CharT* __k2)
1997 _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2
1998 && __i2 <= _M_iend());
1999 __glibcxx_requires_valid_range(__k1, __k2);
2000 return this->
replace(__i1 - _M_ibegin(), __i2 - __i1,
2005 replace(iterator __i1, iterator __i2, iterator __k1, iterator __k2)
2007 _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2
2008 && __i2 <= _M_iend());
2009 __glibcxx_requires_valid_range(__k1, __k2);
2010 return this->
replace(__i1 - _M_ibegin(), __i2 - __i1,
2011 __k1.base(), __k2 - __k1);
2015 replace(iterator __i1, iterator __i2,
2016 const_iterator __k1, const_iterator __k2)
2018 _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2
2019 && __i2 <= _M_iend());
2020 __glibcxx_requires_valid_range(__k1, __k2);
2021 return this->
replace(__i1 - _M_ibegin(), __i2 - __i1,
2022 __k1.base(), __k2 - __k1);
2025 #if __cplusplus >= 201103L
2042 {
return this->
replace(__i1, __i2, __l.begin(), __l.end()); }
2045 #if __cplusplus >= 201703L
2053 template<
typename _Tp>
2054 _If_sv<_Tp, basic_string&>
2055 replace(size_type __pos, size_type __n,
const _Tp& __svt)
2058 return this->
replace(__pos, __n, __sv.data(), __sv.size());
2070 template<
typename _Tp>
2071 _If_sv<_Tp, basic_string&>
2072 replace(size_type __pos1, size_type __n1,
const _Tp& __svt,
2073 size_type __pos2, size_type __n2 =
npos)
2076 return this->
replace(__pos1, __n1,
2078 + std::__sv_check(__sv.size(), __pos2,
"basic_string::replace"),
2079 std::__sv_limit(__sv.size(), __pos2, __n2));
2091 template<
typename _Tp>
2092 _If_sv<_Tp, basic_string&>
2093 replace(const_iterator __i1, const_iterator __i2,
const _Tp& __svt)
2096 return this->
replace(__i1 -
begin(), __i2 - __i1, __sv);
2101 template<
class _Integer>
2104 _Integer __val, __true_type)
2105 {
return _M_replace_aux(__i1 - _M_ibegin(), __i2 - __i1, __n, __val); }
2107 template<
class _InputIterator>
2109 _M_replace_dispatch(iterator __i1, iterator __i2, _InputIterator __k1,
2110 _InputIterator __k2, __false_type);
2113 _M_replace_aux(size_type __pos1, size_type __n1, size_type __n2,
2117 _M_replace_safe(size_type __pos1, size_type __n1,
const _CharT* __s,
2122 template<
class _InIterator>
2124 _S_construct_aux(_InIterator __beg, _InIterator __end,
2125 const _Alloc& __a, __false_type)
2127 typedef typename iterator_traits<_InIterator>::iterator_category _Tag;
2128 return _S_construct(__beg, __end, __a, _Tag());
2133 template<
class _Integer>
2135 _S_construct_aux(_Integer __beg, _Integer __end,
2136 const _Alloc& __a, __true_type)
2137 {
return _S_construct_aux_2(
static_cast<size_type
>(__beg),
2141 _S_construct_aux_2(size_type __req, _CharT __c,
const _Alloc& __a)
2142 {
return _S_construct(__req, __c, __a); }
2144 template<
class _InIterator>
2146 _S_construct(_InIterator __beg, _InIterator __end,
const _Alloc& __a)
2148 typedef typename std::__is_integer<_InIterator>::__type _Integral;
2149 return _S_construct_aux(__beg, __end, __a, _Integral());
2153 template<
class _InIterator>
2155 _S_construct(_InIterator __beg, _InIterator __end,
const _Alloc& __a,
2156 input_iterator_tag);
2160 template<
class _FwdIterator>
2162 _S_construct(_FwdIterator __beg, _FwdIterator __end,
const _Alloc& __a,
2163 forward_iterator_tag);
2166 _S_construct(size_type __req, _CharT __c,
const _Alloc& __a);
2183 copy(_CharT* __s, size_type __n, size_type __pos = 0)
const;
2205 {
return _M_data(); }
2217 {
return _M_data(); }
2219 #if __cplusplus >= 201703L
2239 {
return _M_dataplus; }
2254 find(
const _CharT* __s, size_type __pos, size_type __n)
const
2270 {
return this->
find(__str.
data(), __pos, __str.
size()); }
2283 find(
const _CharT* __s, size_type __pos = 0) const _GLIBCXX_NOEXCEPT
2285 __glibcxx_requires_string(__s);
2286 return this->
find(__s, __pos, traits_type::length(__s));
2300 find(_CharT __c, size_type __pos = 0) const _GLIBCXX_NOEXCEPT;
2302 #if __cplusplus >= 201703L
2309 template<
typename _Tp>
2310 _If_sv<_Tp, size_type>
2311 find(
const _Tp& __svt, size_type __pos = 0) const
2315 return this->
find(__sv.data(), __pos, __sv.size());
2347 rfind(
const _CharT* __s, size_type __pos, size_type __n)
const
2361 rfind(
const _CharT* __s, size_type __pos =
npos)
const _GLIBCXX_NOEXCEPT
2363 __glibcxx_requires_string(__s);
2364 return this->
rfind(__s, __pos, traits_type::length(__s));
2378 rfind(_CharT __c, size_type __pos =
npos)
const _GLIBCXX_NOEXCEPT;
2380 #if __cplusplus >= 201703L
2387 template<
typename _Tp>
2388 _If_sv<_Tp, size_type>
2393 return this->
rfind(__sv.data(), __pos, __sv.size());
2426 find_first_of(
const _CharT* __s, size_type __pos, size_type __n)
const
2443 __glibcxx_requires_string(__s);
2444 return this->
find_first_of(__s, __pos, traits_type::length(__s));
2461 {
return this->
find(__c, __pos); }
2463 #if __cplusplus >= 201703L
2471 template<
typename _Tp>
2472 _If_sv<_Tp, size_type>
2477 return this->
find_first_of(__sv.data(), __pos, __sv.size());
2510 find_last_of(
const _CharT* __s, size_type __pos, size_type __n)
const
2527 __glibcxx_requires_string(__s);
2528 return this->
find_last_of(__s, __pos, traits_type::length(__s));
2545 {
return this->
rfind(__c, __pos); }
2547 #if __cplusplus >= 201703L
2555 template<
typename _Tp>
2556 _If_sv<_Tp, size_type>
2561 return this->
find_last_of(__sv.data(), __pos, __sv.size());
2594 size_type __n)
const _GLIBCXX_NOEXCEPT;
2610 __glibcxx_requires_string(__s);
2628 #if __cplusplus >= 201703L
2636 template<
typename _Tp>
2637 _If_sv<_Tp, size_type>
2676 size_type __n)
const _GLIBCXX_NOEXCEPT;
2692 __glibcxx_requires_string(__s);
2710 #if __cplusplus >= 201703L
2718 template<
typename _Tp>
2719 _If_sv<_Tp, size_type>
2743 _M_check(__pos,
"basic_string::substr"), __n); }
2762 const size_type __size = this->
size();
2763 const size_type __osize = __str.
size();
2764 const size_type __len =
std::min(__size, __osize);
2766 int __r = traits_type::compare(_M_data(), __str.
data(), __len);
2768 __r = _S_compare(__size, __osize);
2772 #if __cplusplus >= 201703L
2778 template<
typename _Tp>
2784 const size_type __size = this->
size();
2785 const size_type __osize = __sv.size();
2786 const size_type __len =
std::min(__size, __osize);
2788 int __r = traits_type::compare(_M_data(), __sv.data(), __len);
2790 __r = _S_compare(__size, __osize);
2802 template<
typename _Tp>
2804 compare(size_type __pos, size_type __n,
const _Tp& __svt)
const
2808 return __sv_type(*this).substr(__pos, __n).compare(__sv);
2821 template<
typename _Tp>
2823 compare(size_type __pos1, size_type __n1,
const _Tp& __svt,
2824 size_type __pos2, size_type __n2 =
npos)
const
2829 .substr(__pos1, __n1).compare(__sv.substr(__pos2, __n2));
2880 size_type __pos2, size_type __n2 =
npos)
const;
2897 compare(
const _CharT* __s)
const _GLIBCXX_NOEXCEPT;
2921 compare(size_type __pos, size_type __n1,
const _CharT* __s)
const;
2948 compare(size_type __pos, size_type __n1,
const _CharT* __s,
2949 size_type __n2)
const;
2951 #if __cplusplus > 201703L
2954 {
return __sv_type(this->
data(), this->
size()).starts_with(__x); }
2957 starts_with(_CharT __x)
const noexcept
2958 {
return __sv_type(this->
data(), this->
size()).starts_with(__x); }
2961 starts_with(
const _CharT* __x)
const noexcept
2962 {
return __sv_type(this->
data(), this->
size()).starts_with(__x); }
2965 ends_with(basic_string_view<_CharT, _Traits> __x)
const noexcept
2966 {
return __sv_type(this->
data(), this->
size()).ends_with(__x); }
2969 ends_with(_CharT __x)
const noexcept
2970 {
return __sv_type(this->
data(), this->
size()).ends_with(__x); }
2973 ends_with(
const _CharT* __x)
const noexcept
2974 {
return __sv_type(this->
data(), this->
size()).ends_with(__x); }
2977 #if __cplusplus > 202011L
2979 contains(basic_string_view<_CharT, _Traits> __x)
const noexcept
2980 {
return __sv_type(this->
data(), this->
size()).contains(__x); }
2983 contains(_CharT __x)
const noexcept
2984 {
return __sv_type(this->
data(), this->
size()).contains(__x); }
2987 contains(
const _CharT* __x)
const noexcept
2988 {
return __sv_type(this->
data(), this->
size()).contains(__x); }
2991 # ifdef _GLIBCXX_TM_TS_INTERNAL
2993 ::_txnal_cow_string_C1_for_exceptions(
void* that,
const char* s,
2996 ::_txnal_cow_string_c_str(
const void *that);
2998 ::_txnal_cow_string_D1(
void *that);
3000 ::_txnal_cow_string_D1_commit(
void *that);
3004 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3005 const typename basic_string<_CharT, _Traits, _Alloc>::size_type
3006 basic_string<_CharT, _Traits, _Alloc>::
3007 _Rep::_S_max_size = (((npos -
sizeof(_Rep_base))/
sizeof(_CharT)) - 1) / 4;
3009 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3011 basic_string<_CharT, _Traits, _Alloc>::
3012 _Rep::_S_terminal = _CharT();
3014 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3015 const typename basic_string<_CharT, _Traits, _Alloc>::size_type
3020 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3021 typename basic_string<_CharT, _Traits, _Alloc>::size_type
3022 basic_string<_CharT, _Traits, _Alloc>::_Rep::_S_empty_rep_storage[
3023 (
sizeof(_Rep_base) +
sizeof(_CharT) +
sizeof(size_type) - 1) /
3030 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3031 template<
typename _InIterator>
3033 basic_string<_CharT, _Traits, _Alloc>::
3034 _S_construct(_InIterator __beg, _InIterator __end,
const _Alloc& __a,
3037 #if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
3038 if (__beg == __end && __a == _Alloc())
3039 return _S_empty_rep()._M_refdata();
3043 size_type __len = 0;
3044 while (__beg != __end && __len <
sizeof(__buf) /
sizeof(_CharT))
3046 __buf[__len++] = *__beg;
3049 _Rep* __r = _Rep::_S_create(__len, size_type(0), __a);
3050 _M_copy(__r->_M_refdata(), __buf, __len);
3053 while (__beg != __end)
3055 if (__len == __r->_M_capacity)
3058 _Rep* __another = _Rep::_S_create(__len + 1, __len, __a);
3059 _M_copy(__another->_M_refdata(), __r->_M_refdata(), __len);
3060 __r->_M_destroy(__a);
3063 __r->_M_refdata()[__len++] = *__beg;
3069 __r->_M_destroy(__a);
3070 __throw_exception_again;
3072 __r->_M_set_length_and_sharable(__len);
3073 return __r->_M_refdata();
3076 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3077 template <
typename _InIterator>
3079 basic_string<_CharT, _Traits, _Alloc>::
3080 _S_construct(_InIterator __beg, _InIterator __end,
const _Alloc& __a,
3081 forward_iterator_tag)
3083 #if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
3084 if (__beg == __end && __a == _Alloc())
3085 return _S_empty_rep()._M_refdata();
3088 if (__gnu_cxx::__is_null_pointer(__beg) && __beg != __end)
3089 __throw_logic_error(__N(
"basic_string::_S_construct null not valid"));
3091 const size_type __dnew =
static_cast<size_type
>(
std::distance(__beg,
3094 _Rep* __r = _Rep::_S_create(__dnew, size_type(0), __a);
3096 { _S_copy_chars(__r->_M_refdata(), __beg, __end); }
3099 __r->_M_destroy(__a);
3100 __throw_exception_again;
3102 __r->_M_set_length_and_sharable(__dnew);
3103 return __r->_M_refdata();
3106 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3108 basic_string<_CharT, _Traits, _Alloc>::
3109 _S_construct(size_type __n, _CharT __c,
const _Alloc& __a)
3111 #if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
3112 if (__n == 0 && __a == _Alloc())
3113 return _S_empty_rep()._M_refdata();
3116 _Rep* __r = _Rep::_S_create(__n, size_type(0), __a);
3118 _M_assign(__r->_M_refdata(), __n, __c);
3120 __r->_M_set_length_and_sharable(__n);
3121 return __r->_M_refdata();
3124 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3127 : _M_dataplus(_S_construct(__str._M_data()
3128 + __str._M_check(__pos,
3129 "basic_string::basic_string"),
3130 __str._M_data() + __str._M_limit(__pos, npos)
3134 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3137 : _M_dataplus(_S_construct(__str._M_data()
3138 + __str._M_check(__pos,
3139 "basic_string::basic_string"),
3140 __str._M_data() + __str._M_limit(__pos, __n)
3141 + __pos, _Alloc()), _Alloc())
3144 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3147 size_type __n,
const _Alloc& __a)
3148 : _M_dataplus(_S_construct(__str._M_data()
3149 + __str._M_check(__pos,
3150 "basic_string::basic_string"),
3151 __str._M_data() + __str._M_limit(__pos, __n)
3155 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3160 if (_M_rep() != __str._M_rep())
3163 const allocator_type __a = this->get_allocator();
3164 _CharT* __tmp = __str._M_rep()->_M_grab(__a, __str.
get_allocator());
3165 _M_rep()->_M_dispose(__a);
3171 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3174 assign(
const _CharT* __s, size_type __n)
3176 __glibcxx_requires_string_len(__s, __n);
3177 _M_check_length(this->
size(), __n,
"basic_string::assign");
3178 if (_M_disjunct(__s) || _M_rep()->_M_is_shared())
3179 return _M_replace_safe(size_type(0), this->
size(), __s, __n);
3183 const size_type __pos = __s - _M_data();
3185 _M_copy(_M_data(), __s, __n);
3187 _M_move(_M_data(), __s, __n);
3188 _M_rep()->_M_set_length_and_sharable(__n);
3193 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3196 append(size_type __n, _CharT __c)
3200 _M_check_length(size_type(0), __n,
"basic_string::append");
3201 const size_type __len = __n + this->
size();
3202 if (__len > this->capacity() || _M_rep()->_M_is_shared())
3203 this->reserve(__len);
3204 _M_assign(_M_data() + this->
size(), __n, __c);
3205 _M_rep()->_M_set_length_and_sharable(__len);
3210 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3213 append(
const _CharT* __s, size_type __n)
3215 __glibcxx_requires_string_len(__s, __n);
3218 _M_check_length(size_type(0), __n,
"basic_string::append");
3219 const size_type __len = __n + this->
size();
3220 if (__len > this->capacity() || _M_rep()->_M_is_shared())
3222 if (_M_disjunct(__s))
3223 this->reserve(__len);
3226 const size_type __off = __s - _M_data();
3227 this->reserve(__len);
3228 __s = _M_data() + __off;
3231 _M_copy(_M_data() + this->
size(), __s, __n);
3232 _M_rep()->_M_set_length_and_sharable(__len);
3237 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3242 const size_type __size = __str.
size();
3245 const size_type __len = __size + this->
size();
3246 if (__len > this->capacity() || _M_rep()->_M_is_shared())
3247 this->reserve(__len);
3248 _M_copy(_M_data() + this->
size(), __str._M_data(), __size);
3249 _M_rep()->_M_set_length_and_sharable(__len);
3254 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3259 __str._M_check(__pos,
"basic_string::append");
3260 __n = __str._M_limit(__pos, __n);
3263 const size_type __len = __n + this->
size();
3264 if (__len > this->capacity() || _M_rep()->_M_is_shared())
3265 this->reserve(__len);
3266 _M_copy(_M_data() + this->
size(), __str._M_data() + __pos, __n);
3267 _M_rep()->_M_set_length_and_sharable(__len);
3272 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3275 insert(size_type __pos,
const _CharT* __s, size_type __n)
3277 __glibcxx_requires_string_len(__s, __n);
3278 _M_check(__pos,
"basic_string::insert");
3279 _M_check_length(size_type(0), __n,
"basic_string::insert");
3280 if (_M_disjunct(__s) || _M_rep()->_M_is_shared())
3281 return _M_replace_safe(__pos, size_type(0), __s, __n);
3285 const size_type __off = __s - _M_data();
3286 _M_mutate(__pos, 0, __n);
3287 __s = _M_data() + __off;
3288 _CharT* __p = _M_data() + __pos;
3289 if (__s + __n <= __p)
3290 _M_copy(__p, __s, __n);
3291 else if (__s >= __p)
3292 _M_copy(__p, __s + __n, __n);
3295 const size_type __nleft = __p - __s;
3296 _M_copy(__p, __s, __nleft);
3297 _M_copy(__p + __nleft, __p + __n, __n - __nleft);
3303 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3304 typename basic_string<_CharT, _Traits, _Alloc>::iterator
3306 erase(iterator __first, iterator __last)
3308 _GLIBCXX_DEBUG_PEDASSERT(__first >= _M_ibegin() && __first <= __last
3309 && __last <= _M_iend());
3314 const size_type __size = __last - __first;
3317 const size_type __pos = __first - _M_ibegin();
3318 _M_mutate(__pos, __size, size_type(0));
3319 _M_rep()->_M_set_leaked();
3320 return iterator(_M_data() + __pos);
3326 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3329 replace(size_type __pos, size_type __n1,
const _CharT* __s,
3332 __glibcxx_requires_string_len(__s, __n2);
3333 _M_check(__pos,
"basic_string::replace");
3334 __n1 = _M_limit(__pos, __n1);
3335 _M_check_length(__n1, __n2,
"basic_string::replace");
3337 if (_M_disjunct(__s) || _M_rep()->_M_is_shared())
3338 return _M_replace_safe(__pos, __n1, __s, __n2);
3339 else if ((__left = __s + __n2 <= _M_data() + __pos)
3340 || _M_data() + __pos + __n1 <= __s)
3343 size_type __off = __s - _M_data();
3344 __left ? __off : (__off += __n2 - __n1);
3345 _M_mutate(__pos, __n1, __n2);
3346 _M_copy(_M_data() + __pos, _M_data() + __off, __n2);
3353 return _M_replace_safe(__pos, __n1, __tmp._M_data(), __n2);
3357 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3362 const size_type __size =
sizeof(_Rep_base)
3363 + (this->_M_capacity + 1) *
sizeof(_CharT);
3364 _Raw_bytes_alloc(__a).deallocate(
reinterpret_cast<char*
>(
this), __size);
3367 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3369 basic_string<_CharT, _Traits, _Alloc>::
3379 if (_M_rep()->_M_is_shared())
3381 _M_rep()->_M_set_leaked();
3384 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3386 basic_string<_CharT, _Traits, _Alloc>::
3387 _M_mutate(size_type __pos, size_type __len1, size_type __len2)
3389 const size_type __old_size = this->
size();
3390 const size_type __new_size = __old_size + __len2 - __len1;
3391 const size_type __how_much = __old_size - __pos - __len1;
3393 if (__new_size > this->capacity() || _M_rep()->_M_is_shared())
3396 const allocator_type __a = get_allocator();
3397 _Rep* __r = _Rep::_S_create(__new_size, this->capacity(), __a);
3400 _M_copy(__r->_M_refdata(), _M_data(), __pos);
3402 _M_copy(__r->_M_refdata() + __pos + __len2,
3403 _M_data() + __pos + __len1, __how_much);
3405 _M_rep()->_M_dispose(__a);
3406 _M_data(__r->_M_refdata());
3408 else if (__how_much && __len1 != __len2)
3411 _M_move(_M_data() + __pos + __len2,
3412 _M_data() + __pos + __len1, __how_much);
3414 _M_rep()->_M_set_length_and_sharable(__new_size);
3417 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3422 const size_type __capacity = capacity();
3428 if (__res <= __capacity)
3430 if (!_M_rep()->_M_is_shared())
3437 const allocator_type __a = get_allocator();
3438 _CharT* __tmp = _M_rep()->_M_clone(__a, __res - this->
size());
3439 _M_rep()->_M_dispose(__a);
3443 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3449 if (_M_rep()->_M_is_leaked())
3450 _M_rep()->_M_set_sharable();
3451 if (__s._M_rep()->_M_is_leaked())
3452 __s._M_rep()->_M_set_sharable();
3453 if (this->get_allocator() == __s.get_allocator())
3455 _CharT* __tmp = _M_data();
3456 _M_data(__s._M_data());
3463 __s.get_allocator());
3464 const basic_string __tmp2(__s._M_ibegin(), __s._M_iend(),
3465 this->get_allocator());
3471 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3474 _S_create(size_type __capacity, size_type __old_capacity,
3475 const _Alloc& __alloc)
3479 if (__capacity > _S_max_size)
3480 __throw_length_error(__N(
"basic_string::_S_create"));
3505 const size_type __pagesize = 4096;
3506 const size_type __malloc_header_size = 4 *
sizeof(
void*);
3514 if (__capacity > __old_capacity && __capacity < 2 * __old_capacity)
3515 __capacity = 2 * __old_capacity;
3520 size_type __size = (__capacity + 1) *
sizeof(_CharT) +
sizeof(_Rep);
3522 const size_type __adj_size = __size + __malloc_header_size;
3523 if (__adj_size > __pagesize && __capacity > __old_capacity)
3525 const size_type __extra = __pagesize - __adj_size % __pagesize;
3526 __capacity += __extra /
sizeof(_CharT);
3528 if (__capacity > _S_max_size)
3529 __capacity = _S_max_size;
3530 __size = (__capacity + 1) *
sizeof(_CharT) +
sizeof(_Rep);
3535 void* __place = _Raw_bytes_alloc(__alloc).allocate(__size);
3536 _Rep *__p =
new (__place) _Rep;
3537 __p->_M_capacity = __capacity;
3545 __p->_M_set_sharable();
3549 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3551 basic_string<_CharT, _Traits, _Alloc>::_Rep::
3552 _M_clone(
const _Alloc& __alloc, size_type __res)
3555 const size_type __requested_cap = this->_M_length + __res;
3556 _Rep* __r = _Rep::_S_create(__requested_cap, this->_M_capacity,
3558 if (this->_M_length)
3559 _M_copy(__r->_M_refdata(), _M_refdata(), this->_M_length);
3561 __r->_M_set_length_and_sharable(this->_M_length);
3562 return __r->_M_refdata();
3565 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3568 resize(size_type __n, _CharT __c)
3570 const size_type __size = this->
size();
3571 _M_check_length(__size, __n,
"basic_string::resize");
3573 this->append(__n - __size, __c);
3574 else if (__n < __size)
3579 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3580 template<
typename _InputIterator>
3584 _InputIterator __k2, __false_type)
3587 const size_type __n1 = __i2 - __i1;
3588 _M_check_length(__n1, __s.size(),
"basic_string::_M_replace_dispatch");
3589 return _M_replace_safe(__i1 - _M_ibegin(), __n1, __s._M_data(),
3593 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3594 basic_string<_CharT, _Traits, _Alloc>&
3595 basic_string<_CharT, _Traits, _Alloc>::
3596 _M_replace_aux(size_type __pos1, size_type __n1, size_type __n2,
3599 _M_check_length(__n1, __n2,
"basic_string::_M_replace_aux");
3600 _M_mutate(__pos1, __n1, __n2);
3602 _M_assign(_M_data() + __pos1, __n2, __c);
3606 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3607 basic_string<_CharT, _Traits, _Alloc>&
3608 basic_string<_CharT, _Traits, _Alloc>::
3609 _M_replace_safe(size_type __pos1, size_type __n1,
const _CharT* __s,
3612 _M_mutate(__pos1, __n1, __n2);
3614 _M_copy(_M_data() + __pos1, __s, __n2);
3618 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3623 #if __cpp_exceptions
3624 if (length() < capacity() || _M_rep()->_M_is_shared())
3627 const allocator_type __a = get_allocator();
3628 _CharT* __tmp = _M_rep()->_M_clone(__a);
3629 _M_rep()->_M_dispose(__a);
3639 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3640 typename basic_string<_CharT, _Traits, _Alloc>::size_type
3642 copy(_CharT* __s, size_type __n, size_type __pos)
const
3644 _M_check(__pos,
"basic_string::copy");
3645 __n = _M_limit(__pos, __n);
3646 __glibcxx_requires_string_len(__s, __n);
3648 _M_copy(__s, _M_data() + __pos, __n);
3652 _GLIBCXX_END_NAMESPACE_VERSION
typename enable_if< _Cond, _Tp >::type enable_if_t
Alias template for enable_if.
constexpr std::remove_reference< _Tp >::type && move(_Tp &&__t) noexcept
Convert a value to an rvalue.
constexpr const _Tp & min(const _Tp &, const _Tp &)
This does what you think it does.
ISO C++ entities toplevel namespace is std.
constexpr iterator_traits< _InputIterator >::difference_type distance(_InputIterator __first, _InputIterator __last)
A generalization of pointer arithmetic.
constexpr auto empty(const _Container &__cont) noexcept(noexcept(__cont.empty())) -> decltype(__cont.empty())
Return whether a container is empty.
constexpr auto size(const _Container &__cont) noexcept(noexcept(__cont.size())) -> decltype(__cont.size())
Return the size of a container.
Uniform interface to all allocator types.
Managing sequences of characters and character-like objects.
const_reverse_iterator crbegin() const noexcept
void swap(basic_string &__s) noexcept(/*conditional */)
Swap contents with another string.
basic_string & assign(size_type __n, _CharT __c)
Set value to multiple characters.
_If_sv< _Tp, basic_string & > append(const _Tp &__svt)
Append a string_view.
basic_string & append(const basic_string &__str, size_type __pos, size_type __n=npos)
Append a substring.
void push_back(_CharT __c)
Append a single character.
const_iterator cend() const noexcept
size_type find(const _CharT *__s, size_type __pos=0) const noexcept
Find position of a C string.
basic_string(_InputIterator __beg, _InputIterator __end, const _Alloc &__a=_Alloc())
Construct string as copy of a range.
basic_string & replace(size_type __pos, size_type __n1, size_type __n2, _CharT __c)
Replace characters with multiple characters.
basic_string & replace(iterator __i1, iterator __i2, const _CharT *__s)
Replace range of characters with C string.
_If_sv< _Tp, size_type > find_last_of(const _Tp &__svt, size_type __pos=npos) const noexcept(is_same< _Tp, __sv_type >::value)
Find last position of a character of string.
size_type find_first_of(const basic_string &__str, size_type __pos=0) const noexcept
Find position of a character of string.
basic_string & append(_InputIterator __first, _InputIterator __last)
Append a range of characters.
basic_string & operator=(initializer_list< _CharT > __l)
Set value to string constructed from initializer list.
iterator erase(iterator __first, iterator __last)
Remove a range of characters.
_If_sv< _Tp, size_type > find(const _Tp &__svt, size_type __pos=0) const noexcept(is_same< _Tp, __sv_type >::value)
Find position of a string_view.
basic_string(const _Alloc &__a)
Construct an empty string using allocator a.
const _CharT * c_str() const noexcept
Return const pointer to null-terminated contents.
basic_string & assign(const _CharT *__s)
Set value to contents of a C string.
size_type find_last_of(const _CharT *__s, size_type __pos=npos) const noexcept
Find last position of a character of C string.
_If_sv< _Tp, basic_string & > append(const _Tp &__svt, size_type __pos, size_type __n=npos)
Append a range of characters from a string_view.
void insert(iterator __p, initializer_list< _CharT > __l)
Insert an initializer_list of characters.
size_type rfind(const _CharT *__s, size_type __pos=npos) const noexcept
Find last position of a C string.
basic_string substr(size_type __pos=0, size_type __n=npos) const
Get a substring.
iterator erase(iterator __position)
Remove one character.
size_type find(const _CharT *__s, size_type __pos, size_type __n) const noexcept
Find position of a C substring.
size_type find(const basic_string &__str, size_type __pos=0) const noexcept
Find position of a string.
basic_string & assign(const _CharT *__s, size_type __n)
Set value to a C substring.
size_type find_last_not_of(const basic_string &__str, size_type __pos=npos) const noexcept
Find last position of a character not in string.
_If_sv< _Tp, basic_string & > operator=(const _Tp &__svt)
Set value to string constructed from a string_view.
basic_string(const basic_string &__str)
Construct string with copy of value of str.
basic_string & replace(iterator __i1, iterator __i2, size_type __n, _CharT __c)
Replace range of characters with multiple characters.
int compare(const basic_string &__str) const
Compare to a string.
_If_sv< _Tp, basic_string & > replace(const_iterator __i1, const_iterator __i2, const _Tp &__svt)
Replace range of characters with string_view.
basic_string & operator=(const _CharT *__s)
Copy contents of s into this string.
basic_string(const basic_string &__str, size_type __pos, const _Alloc &__a=_Alloc())
Construct string as copy of a substring.
basic_string(const basic_string &__str, size_type __pos, size_type __n)
Construct string as copy of a substring.
size_type find_first_not_of(const basic_string &__str, size_type __pos=0) const noexcept
Find position of a character not in string.
_If_sv< _Tp, basic_string & > insert(size_type __pos, const _Tp &__svt)
Insert a string_view.
basic_string & replace(size_type __pos, size_type __n1, const _CharT *__s)
Replace characters with value of a C string.
const_reference front() const noexcept
size_type find_last_not_of(const _CharT *__s, size_type __pos=npos) const noexcept
Find last position of a character not in C string.
void insert(iterator __p, size_type __n, _CharT __c)
Insert multiple characters.
basic_string & operator+=(const basic_string &__str)
Append a string to this string.
basic_string & assign(const basic_string &__str)
Set value to contents of another string.
basic_string & append(size_type __n, _CharT __c)
Append multiple characters.
basic_string(const _Tp &__t, size_type __pos, size_type __n, const _Alloc &__a=_Alloc())
Construct string from a substring of a string_view.
reverse_iterator rbegin()
basic_string & operator+=(initializer_list< _CharT > __l)
Append an initializer_list of characters.
_If_sv< _Tp, basic_string & > operator+=(const _Tp &__svt)
Append a string_view.
basic_string(initializer_list< _CharT > __l, const _Alloc &__a=_Alloc())
Construct string from an initializer list.
basic_string & replace(size_type __pos, size_type __n, const basic_string &__str)
Replace characters with value from another string.
basic_string(const basic_string &__str, size_type __pos, size_type __n, const _Alloc &__a)
Construct string as copy of a substring.
basic_string(const _Tp &__t, const _Alloc &__a=_Alloc())
Construct string from a string_view.
basic_string & replace(size_type __pos, size_type __n1, const _CharT *__s, size_type __n2)
Replace characters with value of a C substring.
_If_sv< _Tp, basic_string & > replace(size_type __pos, size_type __n, const _Tp &__svt)
Replace range of characters with string_view.
basic_string & assign(_InputIterator __first, _InputIterator __last)
Set value to a range of characters.
void pop_back()
Remove the last character.
basic_string & insert(size_type __pos1, const basic_string &__str)
Insert value of a string.
_If_sv< _Tp, basic_string & > assign(const _Tp &__svt)
Set value from a string_view.
basic_string(basic_string &&__str) noexcept
Move construct string.
size_type copy(_CharT *__s, size_type __n, size_type __pos=0) const
Copy substring into C string.
size_type length() const noexcept
Returns the number of characters in the string, not including any null-termination.
size_type find_last_of(const basic_string &__str, size_type __pos=npos) const noexcept
Find last position of a character of string.
basic_string & replace(iterator __i1, iterator __i2, initializer_list< _CharT > __l)
Replace range of characters with initializer_list.
basic_string & insert(size_type __pos, const _CharT *__s, size_type __n)
Insert a C substring.
basic_string & insert(size_type __pos1, const basic_string &__str, size_type __pos2, size_type __n=npos)
Insert a substring.
_If_sv< _Tp, int > compare(const _Tp &__svt) const noexcept(is_same< _Tp, __sv_type >::value)
Compare to a string_view.
_If_sv< _Tp, size_type > rfind(const _Tp &__svt, size_type __pos=npos) const noexcept(is_same< _Tp, __sv_type >::value)
Find last position of a string_view.
size_type size() const noexcept
Returns the number of characters in the string, not including any null-termination.
size_type rfind(const basic_string &__str, size_type __pos=npos) const noexcept
Find last position of a string.
basic_string & assign(initializer_list< _CharT > __l)
Set value to an initializer_list of characters.
basic_string(size_type __n, _CharT __c, const _Alloc &__a=_Alloc())
Construct string as multiple characters.
_If_sv< _Tp, basic_string & > assign(const _Tp &__svt, size_type __pos, size_type __n=npos)
Set value from a range of characters in a string_view.
void shrink_to_fit() noexcept
A non-binding request to reduce capacity() to size().
basic_string & replace(iterator __i1, iterator __i2, const _CharT *__s, size_type __n)
Replace range of characters with C substring.
basic_string & assign(basic_string &&__str) noexcept(allocator_traits< _Alloc >::is_always_equal::value)
Set value to contents of another string.
void resize(size_type __n, _CharT __c)
Resizes the string to the specified number of characters.
void reserve()
Equivalent to shrink_to_fit().
const _CharT * data() const noexcept
Return const pointer to contents.
basic_string & operator=(_CharT __c)
Set value to string of length 1.
const_reference at(size_type __n) const
Provides access to the data contained in the string.
const_reference back() const noexcept
const_reverse_iterator rend() const noexcept
_If_sv< _Tp, basic_string & > insert(size_type __pos1, const _Tp &__svt, size_type __pos2, size_type __n=npos)
Insert a string_view.
const_iterator end() const noexcept
basic_string & operator+=(_CharT __c)
Append a character.
size_type find_last_of(_CharT __c, size_type __pos=npos) const noexcept
Find last position of a character.
_If_sv< _Tp, size_type > find_first_not_of(const _Tp &__svt, size_type __pos=0) const noexcept(is_same< _Tp, __sv_type >::value)
Find position of a character not in a string_view.
basic_string & append(const basic_string &__str)
Append a string to this string.
_CharT * data() noexcept
Return non-const pointer to contents.
const_iterator begin() const noexcept
_If_sv< _Tp, int > compare(size_type __pos1, size_type __n1, const _Tp &__svt, size_type __pos2, size_type __n2=npos) const noexcept(is_same< _Tp, __sv_type >::value)
Compare to a string_view.
const_reverse_iterator crend() const noexcept
void resize(size_type __n)
Resizes the string to the specified number of characters.
const_reverse_iterator rbegin() const noexcept
_If_sv< _Tp, basic_string & > replace(size_type __pos1, size_type __n1, const _Tp &__svt, size_type __pos2, size_type __n2=npos)
Replace range of characters with string_view.
_If_sv< _Tp, int > compare(size_type __pos, size_type __n, const _Tp &__svt) const noexcept(is_same< _Tp, __sv_type >::value)
Compare to a string_view.
basic_string & operator=(const basic_string &__str)
Assign the value of str to this string.
const_reference operator[](size_type __pos) const noexcept
Subscript access to the data contained in the string.
basic_string(const _CharT *__s, const _Alloc &__a=_Alloc())
Construct string as copy of a C string.
basic_string & operator=(basic_string &&__str) noexcept(/*conditional */)
Move assign the value of str to this string.
size_type find_first_of(_CharT __c, size_type __pos=0) const noexcept
Find position of a character.
basic_string & replace(iterator __i1, iterator __i2, _InputIterator __k1, _InputIterator __k2)
Replace range of characters with range.
bool empty() const noexcept
basic_string & append(initializer_list< _CharT > __l)
Append an initializer_list of characters.
static const size_type npos
Value returned by various member functions when they fail.
allocator_type get_allocator() const noexcept
Return copy of allocator used to construct this string.
basic_string & insert(size_type __pos, const _CharT *__s)
Insert a C string.
const_iterator cbegin() const noexcept
basic_string & erase(size_type __pos=0, size_type __n=npos)
Remove characters.
basic_string & replace(iterator __i1, iterator __i2, const basic_string &__str)
Replace range of characters with string.
~basic_string() noexcept
Destroy the string instance.
size_type capacity() const noexcept
basic_string & operator+=(const _CharT *__s)
Append a C string.
basic_string() noexcept
Default constructor creates an empty string.
void insert(iterator __p, _InputIterator __beg, _InputIterator __end)
Insert a range of characters.
size_type find_first_of(const _CharT *__s, size_type __pos=0) const noexcept
Find position of a character of C string.
basic_string & replace(size_type __pos1, size_type __n1, const basic_string &__str, size_type __pos2, size_type __n2=npos)
Replace characters with value from another string.
size_type max_size() const noexcept
Returns the size() of the largest possible string.
reference operator[](size_type __pos)
Subscript access to the data contained in the string.
basic_string & insert(size_type __pos, size_type __n, _CharT __c)
Insert multiple characters.
basic_string & append(const _CharT *__s, size_type __n)
Append a C substring.
_If_sv< _Tp, size_type > find_last_not_of(const _Tp &__svt, size_type __pos=npos) const noexcept(is_same< _Tp, __sv_type >::value)
Find last position of a character not in a string_view.
basic_string(const _CharT *__s, size_type __n, const _Alloc &__a=_Alloc())
Construct string initialized by a character array.
basic_string & assign(const basic_string &__str, size_type __pos, size_type __n=npos)
Set value to a substring of a string.
basic_string & append(const _CharT *__s)
Append a C string.
size_type find_first_not_of(const _CharT *__s, size_type __pos=0) const noexcept
Find position of a character not in C string.
reference at(size_type __n)
Provides access to the data contained in the string.
_If_sv< _Tp, size_type > find_first_of(const _Tp &__svt, size_type __pos=0) const noexcept(is_same< _Tp, __sv_type >::value)
Find position of a character of a string_view.
iterator insert(iterator __p, _CharT __c)
Insert one character.
Thrown as part of forced unwinding.
Uniform interface to C++98 and C++11 allocators.