33#define _COW_STRING_H 1
35#if ! _GLIBCXX_USE_CXX11_ABI
39#ifdef __cpp_lib_is_constant_evaluated
41# define __cpp_lib_constexpr_string 201811L
42#elif __cplusplus >= 201703L && _GLIBCXX_HAVE_IS_CONSTANT_EVALUATED
44# define __cpp_lib_constexpr_string 201611L
47namespace std _GLIBCXX_VISIBILITY(default)
49_GLIBCXX_BEGIN_NAMESPACE_VERSION
115 template<
typename _CharT,
typename _Traits,
typename _Alloc>
119 rebind<_CharT>::other _CharT_alloc_type;
124 typedef _Traits traits_type;
125 typedef typename _Traits::char_type value_type;
126 typedef _Alloc allocator_type;
127 typedef typename _CharT_alloc_traits::size_type size_type;
128 typedef typename _CharT_alloc_traits::difference_type difference_type;
129#if __cplusplus < 201103L
130 typedef typename _CharT_alloc_type::reference reference;
131 typedef typename _CharT_alloc_type::const_reference const_reference;
133 typedef value_type& reference;
134 typedef const value_type& const_reference;
136 typedef typename _CharT_alloc_traits::pointer pointer;
137 typedef typename _CharT_alloc_traits::const_pointer const_pointer;
138 typedef __gnu_cxx::__normal_iterator<pointer, basic_string> iterator;
139 typedef __gnu_cxx::__normal_iterator<const_pointer, basic_string>
146 typedef iterator __const_iterator;
166 size_type _M_capacity;
167 _Atomic_word _M_refcount;
170 struct _Rep : _Rep_base
174 rebind<char>::other _Raw_bytes_alloc;
189 static const size_type _S_max_size;
190 static const _CharT _S_terminal;
194 static size_type _S_empty_rep_storage[];
197 _S_empty_rep() _GLIBCXX_NOEXCEPT
202 void* __p =
reinterpret_cast<void*
>(&_S_empty_rep_storage);
203 return *
reinterpret_cast<_Rep*
>(__p);
207 _M_is_leaked()
const _GLIBCXX_NOEXCEPT
209#if defined(__GTHREADS)
214 return __atomic_load_n(&this->_M_refcount, __ATOMIC_RELAXED) < 0;
216 return this->_M_refcount < 0;
221 _M_is_shared()
const _GLIBCXX_NOEXCEPT
223#if defined(__GTHREADS)
229 if (!__gnu_cxx::__is_single_threaded())
230 return __atomic_load_n(&this->_M_refcount, __ATOMIC_ACQUIRE) > 0;
232 return this->_M_refcount > 0;
236 _M_set_leaked() _GLIBCXX_NOEXCEPT
237 { this->_M_refcount = -1; }
240 _M_set_sharable() _GLIBCXX_NOEXCEPT
241 { this->_M_refcount = 0; }
244 _M_set_length_and_sharable(size_type __n) _GLIBCXX_NOEXCEPT
246#if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
247 if (__builtin_expect(
this != &_S_empty_rep(),
false))
250 this->_M_set_sharable();
251 this->_M_length = __n;
252 traits_type::assign(this->_M_refdata()[__n], _S_terminal);
260 {
return reinterpret_cast<_CharT*
>(
this + 1); }
263 _M_grab(
const _Alloc& __alloc1,
const _Alloc& __alloc2)
265 return (!_M_is_leaked() && __alloc1 == __alloc2)
266 ? _M_refcopy() : _M_clone(__alloc1);
271 _S_create(size_type, size_type,
const _Alloc&);
274 _M_dispose(
const _Alloc& __a) _GLIBCXX_NOEXCEPT
276#if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
277 if (__builtin_expect(
this != &_S_empty_rep(),
false))
281 _GLIBCXX_SYNCHRONIZATION_HAPPENS_BEFORE(&this->_M_refcount);
290 if (__gnu_cxx::__exchange_and_add_dispatch(&this->_M_refcount,
293 _GLIBCXX_SYNCHRONIZATION_HAPPENS_AFTER(&this->_M_refcount);
300 _M_destroy(
const _Alloc&)
throw();
305#if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
306 if (__builtin_expect(
this != &_S_empty_rep(),
false))
308 __gnu_cxx::__atomic_add_dispatch(&this->_M_refcount, 1);
313 _M_clone(
const _Alloc&, size_type __res = 0);
317 struct _Alloc_hider : _Alloc
319 _Alloc_hider(_CharT* __dat,
const _Alloc& __a) _GLIBCXX_NOEXCEPT
320 : _Alloc(__a), _M_p(__dat) { }
330 static const size_type
npos =
static_cast<size_type
>(-1);
334 mutable _Alloc_hider _M_dataplus;
337 _M_data() const _GLIBCXX_NOEXCEPT
338 {
return _M_dataplus._M_p; }
341 _M_data(_CharT* __p) _GLIBCXX_NOEXCEPT
342 {
return (_M_dataplus._M_p = __p); }
345 _M_rep() const _GLIBCXX_NOEXCEPT
346 {
return &((
reinterpret_cast<_Rep*
> (_M_data()))[-1]); }
351 _M_ibegin() const _GLIBCXX_NOEXCEPT
352 {
return iterator(_M_data()); }
355 _M_iend() const _GLIBCXX_NOEXCEPT
356 {
return iterator(_M_data() + this->
size()); }
361 if (!_M_rep()->_M_is_leaked())
366 _M_check(size_type __pos,
const char* __s)
const
368 if (__pos > this->
size())
369 __throw_out_of_range_fmt(__N(
"%s: __pos (which is %zu) > "
370 "this->size() (which is %zu)"),
371 __s, __pos, this->
size());
376 _M_check_length(size_type __n1, size_type __n2,
const char* __s)
const
379 __throw_length_error(__N(__s));
384 _M_limit(size_type __pos, size_type __off)
const _GLIBCXX_NOEXCEPT
386 const bool __testoff = __off < this->
size() - __pos;
387 return __testoff ? __off : this->
size() - __pos;
392 _M_disjunct(
const _CharT* __s)
const _GLIBCXX_NOEXCEPT
394 return (less<const _CharT*>()(__s, _M_data())
395 || less<const _CharT*>()(_M_data() + this->
size(), __s));
401 _M_copy(_CharT* __d,
const _CharT* __s, size_type __n) _GLIBCXX_NOEXCEPT
404 traits_type::assign(*__d, *__s);
406 traits_type::copy(__d, __s, __n);
410 _M_move(_CharT* __d,
const _CharT* __s, size_type __n) _GLIBCXX_NOEXCEPT
413 traits_type::assign(*__d, *__s);
415 traits_type::move(__d, __s, __n);
419 _M_assign(_CharT* __d, size_type __n, _CharT __c) _GLIBCXX_NOEXCEPT
422 traits_type::assign(*__d, __c);
424 traits_type::assign(__d, __n, __c);
429 template<
class _Iterator>
431 _S_copy_chars(_CharT* __p, _Iterator __k1, _Iterator __k2)
433 for (; __k1 != __k2; ++__k1, (void)++__p)
434 traits_type::assign(*__p, *__k1);
438 _S_copy_chars(_CharT* __p, iterator __k1, iterator __k2) _GLIBCXX_NOEXCEPT
439 { _S_copy_chars(__p, __k1.base(), __k2.base()); }
442 _S_copy_chars(_CharT* __p, const_iterator __k1, const_iterator __k2)
444 { _S_copy_chars(__p, __k1.base(), __k2.base()); }
447 _S_copy_chars(_CharT* __p, _CharT* __k1, _CharT* __k2) _GLIBCXX_NOEXCEPT
448 { _M_copy(__p, __k1, __k2 - __k1); }
451 _S_copy_chars(_CharT* __p,
const _CharT* __k1,
const _CharT* __k2)
453 { _M_copy(__p, __k1, __k2 - __k1); }
456 _S_compare(size_type __n1, size_type __n2) _GLIBCXX_NOEXCEPT
458 const difference_type __d = difference_type(__n1 - __n2);
460 if (__d > __gnu_cxx::__numeric_traits<int>::__max)
461 return __gnu_cxx::__numeric_traits<int>::__max;
462 else if (__d < __gnu_cxx::__numeric_traits<int>::__min)
463 return __gnu_cxx::__numeric_traits<int>::__min;
469 _M_mutate(size_type __pos, size_type __len1, size_type __len2);
475 _S_empty_rep() _GLIBCXX_NOEXCEPT
476 {
return _Rep::_S_empty_rep(); }
478#if __cplusplus >= 201703L
480 typedef basic_string_view<_CharT, _Traits> __sv_type;
482 template<
typename _Tp,
typename _Res>
484 __and_<is_convertible<const _Tp&, __sv_type>,
485 __not_<is_convertible<const _Tp*, const basic_string*>>,
486 __not_<is_convertible<const _Tp&, const _CharT*>>>::value,
491 _S_to_string_view(__sv_type __svt)
noexcept
500 explicit __sv_wrapper(__sv_type __sv) noexcept : _M_sv(__sv) { }
524#if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
526 : _M_dataplus(_S_empty_rep()._M_refdata(), _Alloc())
528 : _M_dataplus(_S_construct(size_type(), _CharT(), _Alloc()), _Alloc())
537 : _M_dataplus(_S_construct(size_type(), _CharT(), __a), __a)
546 : _M_dataplus(__str._M_rep()->_M_grab(_Alloc(__str.
get_allocator()),
560 const _Alloc& __a = _Alloc());
578 size_type __n,
const _Alloc& __a);
590 const _Alloc& __a = _Alloc())
591 : _M_dataplus(_S_construct(__s, __s + __n, __a), __a)
599#if __cpp_deduction_guides && ! defined _GLIBCXX_DEFINING_STRING_INSTANTIATIONS
602 template<
typename = _RequireAllocator<_Alloc>>
605 : _M_dataplus(_S_construct(__s, __s ? __s + traits_type::
length(__s) :
606 __s +
npos, __a), __a)
616 : _M_dataplus(_S_construct(__n, __c, __a), __a)
619#if __cplusplus >= 201103L
628 : _M_dataplus(
std::move(__str._M_dataplus))
630#if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
632 __str._M_data(_S_empty_rep()._M_refdata());
638 if (_M_rep()->_M_is_shared())
639 __gnu_cxx::__atomic_add_dispatch(&_M_rep()->_M_refcount, 1);
641 _M_rep()->_M_refcount = 1;
651 : _M_dataplus(_S_construct(__l.
begin(), __l.
end(), __a), __a)
655 : _M_dataplus(__str._M_rep()->_M_grab(__a, __str.
get_allocator()), __a)
659 : _M_dataplus(__str._M_data(), __a)
663#if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
664 __str._M_data(_S_empty_rep()._M_refdata());
666 __str._M_data(_S_construct(size_type(), _CharT(), __a));
670 _M_dataplus._M_p = _S_construct(__str.
begin(), __str.
end(), __a);
674#if __cplusplus >= 202100L
685 template<
class _InputIterator>
687 const _Alloc& __a = _Alloc())
688 : _M_dataplus(_S_construct(__beg, __end, __a), __a)
691#if __cplusplus >= 201703L
699 template<
typename _Tp,
702 const _Alloc& __a = _Alloc())
710 template<
typename _Tp,
typename = _If_sv<_Tp,
void>>
713 :
basic_string(__sv_wrapper(_S_to_string_view(__t)), __a) { }
728 {
return this->
assign(__str); }
736 {
return this->
assign(__s); }
752#if __cplusplus >= 201103L
776 this->
assign(__l.begin(), __l.size());
781#if __cplusplus >= 201703L
786 template<
typename _Tp>
787 _If_sv<_Tp, basic_string&>
789 {
return this->
assign(__svt); }
808 return iterator(_M_data());
817 {
return const_iterator(_M_data()); }
827 return iterator(_M_data() + this->
size());
835 end() const _GLIBCXX_NOEXCEPT
836 {
return const_iterator(_M_data() + this->
size()); }
852 const_reverse_iterator
870 const_reverse_iterator
874#if __cplusplus >= 201103L
881 {
return const_iterator(this->_M_data()); }
889 {
return const_iterator(this->_M_data() + this->
size()); }
896 const_reverse_iterator
905 const_reverse_iterator
918#if _GLIBCXX_FULLY_DYNAMIC_STRING == 0 && __OPTIMIZE__
919 if (_S_empty_rep()._M_length != 0)
920 __builtin_unreachable();
922 return _M_rep()->_M_length;
934 {
return _Rep::_S_max_size; }
961 { this->
resize(__n, _CharT()); }
963#if __cplusplus >= 201103L
964#pragma GCC diagnostic push
965#pragma GCC diagnostic ignored "-Wdeprecated-declarations"
970#pragma GCC diagnostic pop
979 {
return _M_rep()->_M_capacity; }
1002#if __cplusplus > 201703L
1003 [[deprecated(
"use shrink_to_fit() instead")]]
1011#if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
1015 if (_M_rep()->_M_is_shared())
1018 _M_data(_S_empty_rep()._M_refdata());
1021 _M_rep()->_M_set_length_and_sharable(0);
1027 { _M_mutate(0, this->
size(), 0); }
1034 _GLIBCXX_NODISCARD
bool
1036 {
return this->
size() == 0; }
1052 __glibcxx_assert(__pos <=
size());
1053 return _M_data()[__pos];
1071 __glibcxx_assert(__pos <=
size());
1073 _GLIBCXX_DEBUG_PEDASSERT(__cplusplus >= 201103L || __pos <
size());
1075 return _M_data()[__pos];
1091 if (__n >= this->
size())
1092 __throw_out_of_range_fmt(__N(
"basic_string::at: __n "
1093 "(which is %zu) >= this->size() "
1096 return _M_data()[__n];
1114 __throw_out_of_range_fmt(__N(
"basic_string::at: __n "
1115 "(which is %zu) >= this->size() "
1119 return _M_data()[__n];
1122#if __cplusplus >= 201103L
1130 __glibcxx_assert(!
empty());
1141 __glibcxx_assert(!
empty());
1152 __glibcxx_assert(!
empty());
1163 __glibcxx_assert(!
empty());
1176 {
return this->
append(__str); }
1185 {
return this->
append(__s); }
1199#if __cplusplus >= 201103L
1207 {
return this->
append(__l.begin(), __l.size()); }
1210#if __cplusplus >= 201703L
1216 template<
typename _Tp>
1217 _If_sv<_Tp, basic_string&>
1219 {
return this->
append(__svt); }
1263 __glibcxx_requires_string(__s);
1264 return this->
append(__s, traits_type::length(__s));
1278#if __cplusplus >= 201103L
1286 {
return this->
append(__l.begin(), __l.size()); }
1297 template<
class _InputIterator>
1299 append(_InputIterator __first, _InputIterator __last)
1300 {
return this->
replace(_M_iend(), _M_iend(), __first, __last); }
1302#if __cplusplus >= 201703L
1308 template<
typename _Tp>
1309 _If_sv<_Tp, basic_string&>
1313 return this->
append(__sv.data(), __sv.size());
1324 template<
typename _Tp>
1325 _If_sv<_Tp, basic_string&>
1329 return append(__sv.data()
1330 + std::__sv_check(__sv.size(), __pos,
"basic_string::append"),
1331 std::__sv_limit(__sv.size(), __pos, __n));
1342 const size_type __len = 1 + this->
size();
1343 if (__len > this->
capacity() || _M_rep()->_M_is_shared())
1345 traits_type::assign(_M_data()[this->
size()], __c);
1346 _M_rep()->_M_set_length_and_sharable(__len);
1357#if __cplusplus >= 201103L
1390 {
return this->
assign(__str._M_data()
1391 + __str._M_check(__pos,
"basic_string::assign"),
1392 __str._M_limit(__pos, __n)); }
1419 __glibcxx_requires_string(__s);
1420 return this->
assign(__s, traits_type::length(__s));
1434 {
return _M_replace_aux(size_type(0), this->
size(), __n, __c); }
1444 template<
class _InputIterator>
1446 assign(_InputIterator __first, _InputIterator __last)
1447 {
return this->
replace(_M_ibegin(), _M_iend(), __first, __last); }
1449#if __cplusplus >= 201103L
1457 {
return this->
assign(__l.begin(), __l.size()); }
1460#if __cplusplus >= 201703L
1466 template<
typename _Tp>
1467 _If_sv<_Tp, basic_string&>
1471 return this->
assign(__sv.data(), __sv.size());
1481 template<
typename _Tp>
1482 _If_sv<_Tp, basic_string&>
1486 return assign(__sv.data()
1487 + std::__sv_check(__sv.size(), __pos,
"basic_string::assign"),
1488 std::__sv_limit(__sv.size(), __pos, __n));
1506 insert(iterator __p, size_type __n, _CharT __c)
1507 { this->
replace(__p, __p, __n, __c); }
1521 template<
class _InputIterator>
1523 insert(iterator __p, _InputIterator __beg, _InputIterator __end)
1524 { this->
replace(__p, __p, __beg, __end); }
1526#if __cplusplus >= 201103L
1536 _GLIBCXX_DEBUG_PEDASSERT(__p >= _M_ibegin() && __p <= _M_iend());
1537 this->
insert(__p - _M_ibegin(), __l.begin(), __l.size());
1555 {
return this->
insert(__pos1, __str, size_type(0), __str.
size()); }
1577 size_type __pos2, size_type __n =
npos)
1578 {
return this->
insert(__pos1, __str._M_data()
1579 + __str._M_check(__pos2,
"basic_string::insert"),
1580 __str._M_limit(__pos2, __n)); }
1599 insert(size_type __pos,
const _CharT* __s, size_type __n);
1619 __glibcxx_requires_string(__s);
1620 return this->
insert(__pos, __s, traits_type::length(__s));
1640 insert(size_type __pos, size_type __n, _CharT __c)
1641 {
return _M_replace_aux(_M_check(__pos,
"basic_string::insert"),
1642 size_type(0), __n, __c); }
1660 _GLIBCXX_DEBUG_PEDASSERT(__p >= _M_ibegin() && __p <= _M_iend());
1661 const size_type __pos = __p - _M_ibegin();
1662 _M_replace_aux(__pos, size_type(0), size_type(1), __c);
1663 _M_rep()->_M_set_leaked();
1664 return iterator(_M_data() + __pos);
1667#if __cplusplus >= 201703L
1674 template<
typename _Tp>
1675 _If_sv<_Tp, basic_string&>
1679 return this->
insert(__pos, __sv.data(), __sv.size());
1690 template<
typename _Tp>
1691 _If_sv<_Tp, basic_string&>
1693 size_type __pos2, size_type __n =
npos)
1696 return this->
replace(__pos1, size_type(0), __sv.data()
1697 + std::__sv_check(__sv.size(), __pos2,
"basic_string::insert"),
1698 std::__sv_limit(__sv.size(), __pos2, __n));
1720 _M_mutate(_M_check(__pos,
"basic_string::erase"),
1721 _M_limit(__pos, __n), size_type(0));
1736 _GLIBCXX_DEBUG_PEDASSERT(__position >= _M_ibegin()
1737 && __position < _M_iend());
1738 const size_type __pos = __position - _M_ibegin();
1739 _M_mutate(__pos, size_type(1), size_type(0));
1740 _M_rep()->_M_set_leaked();
1741 return iterator(_M_data() + __pos);
1754 erase(iterator __first, iterator __last);
1756#if __cplusplus >= 201103L
1765 __glibcxx_assert(!
empty());
1789 {
return this->
replace(__pos, __n, __str._M_data(), __str.
size()); }
1811 size_type __pos2, size_type __n2 =
npos)
1812 {
return this->
replace(__pos1, __n1, __str._M_data()
1813 + __str._M_check(__pos2,
"basic_string::replace"),
1814 __str._M_limit(__pos2, __n2)); }
1835 replace(size_type __pos, size_type __n1,
const _CharT* __s,
1855 replace(size_type __pos, size_type __n1,
const _CharT* __s)
1857 __glibcxx_requires_string(__s);
1858 return this->
replace(__pos, __n1, __s, traits_type::length(__s));
1879 replace(size_type __pos, size_type __n1, size_type __n2, _CharT __c)
1880 {
return _M_replace_aux(_M_check(__pos,
"basic_string::replace"),
1881 _M_limit(__pos, __n1), __n2, __c); }
1898 {
return this->
replace(__i1, __i2, __str._M_data(), __str.
size()); }
1916 replace(iterator __i1, iterator __i2,
const _CharT* __s, size_type __n)
1918 _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2
1919 && __i2 <= _M_iend());
1920 return this->
replace(__i1 - _M_ibegin(), __i2 - __i1, __s, __n);
1937 replace(iterator __i1, iterator __i2,
const _CharT* __s)
1939 __glibcxx_requires_string(__s);
1940 return this->
replace(__i1, __i2, __s, traits_type::length(__s));
1958 replace(iterator __i1, iterator __i2, size_type __n, _CharT __c)
1960 _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2
1961 && __i2 <= _M_iend());
1962 return _M_replace_aux(__i1 - _M_ibegin(), __i2 - __i1, __n, __c);
1980 template<
class _InputIterator>
1983 _InputIterator __k1, _InputIterator __k2)
1985 _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2
1986 && __i2 <= _M_iend());
1987 __glibcxx_requires_valid_range(__k1, __k2);
1988 typedef typename std::__is_integer<_InputIterator>::__type _Integral;
1989 return _M_replace_dispatch(__i1, __i2, __k1, __k2, _Integral());
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,
2006 const _CharT* __k1,
const _CharT* __k2)
2008 _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2
2009 && __i2 <= _M_iend());
2010 __glibcxx_requires_valid_range(__k1, __k2);
2011 return this->
replace(__i1 - _M_ibegin(), __i2 - __i1,
2016 replace(iterator __i1, iterator __i2, iterator __k1, 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);
2026 replace(iterator __i1, iterator __i2,
2027 const_iterator __k1, const_iterator __k2)
2029 _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2
2030 && __i2 <= _M_iend());
2031 __glibcxx_requires_valid_range(__k1, __k2);
2032 return this->
replace(__i1 - _M_ibegin(), __i2 - __i1,
2033 __k1.base(), __k2 - __k1);
2036#if __cplusplus >= 201103L
2053 {
return this->
replace(__i1, __i2, __l.begin(), __l.end()); }
2056#if __cplusplus >= 201703L
2064 template<
typename _Tp>
2065 _If_sv<_Tp, basic_string&>
2066 replace(size_type __pos, size_type __n,
const _Tp& __svt)
2069 return this->
replace(__pos, __n, __sv.data(), __sv.size());
2081 template<
typename _Tp>
2082 _If_sv<_Tp, basic_string&>
2083 replace(size_type __pos1, size_type __n1,
const _Tp& __svt,
2084 size_type __pos2, size_type __n2 =
npos)
2087 return this->
replace(__pos1, __n1,
2089 + std::__sv_check(__sv.size(), __pos2,
"basic_string::replace"),
2090 std::__sv_limit(__sv.size(), __pos2, __n2));
2102 template<
typename _Tp>
2103 _If_sv<_Tp, basic_string&>
2104 replace(const_iterator __i1, const_iterator __i2,
const _Tp& __svt)
2107 return this->
replace(__i1 -
begin(), __i2 - __i1, __sv);
2112 template<
class _Integer>
2115 _Integer __val, __true_type)
2116 {
return _M_replace_aux(__i1 - _M_ibegin(), __i2 - __i1, __n, __val); }
2118 template<
class _InputIterator>
2120 _M_replace_dispatch(iterator __i1, iterator __i2, _InputIterator __k1,
2121 _InputIterator __k2, __false_type);
2124 _M_replace_aux(size_type __pos1, size_type __n1, size_type __n2,
2128 _M_replace_safe(size_type __pos1, size_type __n1,
const _CharT* __s,
2133 template<
class _InIterator>
2135 _S_construct_aux(_InIterator __beg, _InIterator __end,
2136 const _Alloc& __a, __false_type)
2138 typedef typename iterator_traits<_InIterator>::iterator_category _Tag;
2139 return _S_construct(__beg, __end, __a, _Tag());
2144 template<
class _Integer>
2146 _S_construct_aux(_Integer __beg, _Integer __end,
2147 const _Alloc& __a, __true_type)
2148 {
return _S_construct_aux_2(
static_cast<size_type
>(__beg),
2152 _S_construct_aux_2(size_type __req, _CharT __c,
const _Alloc& __a)
2153 {
return _S_construct(__req, __c, __a); }
2155 template<
class _InIterator>
2157 _S_construct(_InIterator __beg, _InIterator __end,
const _Alloc& __a)
2159 typedef typename std::__is_integer<_InIterator>::__type _Integral;
2160 return _S_construct_aux(__beg, __end, __a, _Integral());
2164 template<
class _InIterator>
2166 _S_construct(_InIterator __beg, _InIterator __end,
const _Alloc& __a,
2167 input_iterator_tag);
2171 template<
class _FwdIterator>
2173 _S_construct(_FwdIterator __beg, _FwdIterator __end,
const _Alloc& __a,
2174 forward_iterator_tag);
2177 _S_construct(size_type __req, _CharT __c,
const _Alloc& __a);
2194 copy(_CharT* __s, size_type __n, size_type __pos = 0)
const;
2216 {
return _M_data(); }
2228 {
return _M_data(); }
2230#if __cplusplus >= 201703L
2250 {
return _M_dataplus; }
2265 find(
const _CharT* __s, size_type __pos, size_type __n)
const
2281 {
return this->
find(__str.
data(), __pos, __str.
size()); }
2294 find(
const _CharT* __s, size_type __pos = 0) const _GLIBCXX_NOEXCEPT
2296 __glibcxx_requires_string(__s);
2297 return this->
find(__s, __pos, traits_type::length(__s));
2311 find(_CharT __c, size_type __pos = 0) const _GLIBCXX_NOEXCEPT;
2313#if __cplusplus >= 201703L
2320 template<
typename _Tp>
2321 _If_sv<_Tp, size_type>
2322 find(
const _Tp& __svt, size_type __pos = 0) const
2326 return this->
find(__sv.data(), __pos, __sv.size());
2358 rfind(
const _CharT* __s, size_type __pos, size_type __n)
const
2372 rfind(
const _CharT* __s, size_type __pos =
npos)
const _GLIBCXX_NOEXCEPT
2374 __glibcxx_requires_string(__s);
2375 return this->
rfind(__s, __pos, traits_type::length(__s));
2389 rfind(_CharT __c, size_type __pos =
npos)
const _GLIBCXX_NOEXCEPT;
2391#if __cplusplus >= 201703L
2398 template<
typename _Tp>
2399 _If_sv<_Tp, size_type>
2404 return this->
rfind(__sv.data(), __pos, __sv.size());
2437 find_first_of(
const _CharT* __s, size_type __pos, size_type __n)
const
2454 __glibcxx_requires_string(__s);
2455 return this->
find_first_of(__s, __pos, traits_type::length(__s));
2472 {
return this->
find(__c, __pos); }
2474#if __cplusplus >= 201703L
2482 template<
typename _Tp>
2483 _If_sv<_Tp, size_type>
2488 return this->
find_first_of(__sv.data(), __pos, __sv.size());
2521 find_last_of(
const _CharT* __s, size_type __pos, size_type __n)
const
2538 __glibcxx_requires_string(__s);
2539 return this->
find_last_of(__s, __pos, traits_type::length(__s));
2556 {
return this->
rfind(__c, __pos); }
2558#if __cplusplus >= 201703L
2566 template<
typename _Tp>
2567 _If_sv<_Tp, size_type>
2572 return this->
find_last_of(__sv.data(), __pos, __sv.size());
2605 size_type __n)
const _GLIBCXX_NOEXCEPT;
2621 __glibcxx_requires_string(__s);
2639#if __cplusplus >= 201703L
2647 template<
typename _Tp>
2648 _If_sv<_Tp, size_type>
2687 size_type __n)
const _GLIBCXX_NOEXCEPT;
2703 __glibcxx_requires_string(__s);
2721#if __cplusplus >= 201703L
2729 template<
typename _Tp>
2730 _If_sv<_Tp, size_type>
2754 _M_check(__pos,
"basic_string::substr"), __n); }
2773 const size_type __size = this->
size();
2774 const size_type __osize = __str.
size();
2775 const size_type __len =
std::min(__size, __osize);
2777 int __r = traits_type::compare(_M_data(), __str.
data(), __len);
2779 __r = _S_compare(__size, __osize);
2783#if __cplusplus >= 201703L
2789 template<
typename _Tp>
2795 const size_type __size = this->
size();
2796 const size_type __osize = __sv.size();
2797 const size_type __len =
std::min(__size, __osize);
2799 int __r = traits_type::compare(_M_data(), __sv.data(), __len);
2801 __r = _S_compare(__size, __osize);
2813 template<
typename _Tp>
2815 compare(size_type __pos, size_type __n,
const _Tp& __svt)
const
2819 return __sv_type(*this).substr(__pos, __n).compare(__sv);
2832 template<
typename _Tp>
2834 compare(size_type __pos1, size_type __n1,
const _Tp& __svt,
2835 size_type __pos2, size_type __n2 =
npos)
const
2840 .substr(__pos1, __n1).compare(__sv.substr(__pos2, __n2));
2866 _M_check(__pos,
"basic_string::compare");
2867 __n = _M_limit(__pos, __n);
2868 const size_type __osize = __str.
size();
2869 const size_type __len =
std::min(__n, __osize);
2870 int __r = traits_type::compare(_M_data() + __pos, __str.
data(), __len);
2872 __r = _S_compare(__n, __osize);
2901 size_type __pos2, size_type __n2 =
npos)
const
2903 _M_check(__pos1,
"basic_string::compare");
2904 __str._M_check(__pos2,
"basic_string::compare");
2905 __n1 = _M_limit(__pos1, __n1);
2906 __n2 = __str._M_limit(__pos2, __n2);
2907 const size_type __len =
std::min(__n1, __n2);
2908 int __r = traits_type::compare(_M_data() + __pos1,
2909 __str.
data() + __pos2, __len);
2911 __r = _S_compare(__n1, __n2);
2930 compare(
const _CharT* __s)
const _GLIBCXX_NOEXCEPT
2932 __glibcxx_requires_string(__s);
2933 const size_type __size = this->
size();
2934 const size_type __osize = traits_type::length(__s);
2935 const size_type __len =
std::min(__size, __osize);
2936 int __r = traits_type::compare(_M_data(), __s, __len);
2938 __r = _S_compare(__size, __osize);
2964 compare(size_type __pos, size_type __n1,
const _CharT* __s)
const
2966 __glibcxx_requires_string(__s);
2967 _M_check(__pos,
"basic_string::compare");
2968 __n1 = _M_limit(__pos, __n1);
2969 const size_type __osize = traits_type::length(__s);
2970 const size_type __len =
std::min(__n1, __osize);
2971 int __r = traits_type::compare(_M_data() + __pos, __s, __len);
2973 __r = _S_compare(__n1, __osize);
3002 compare(size_type __pos, size_type __n1,
const _CharT* __s,
3003 size_type __n2)
const
3005 __glibcxx_requires_string_len(__s, __n2);
3006 _M_check(__pos,
"basic_string::compare");
3007 __n1 = _M_limit(__pos, __n1);
3008 const size_type __len =
std::min(__n1, __n2);
3009 int __r = traits_type::compare(_M_data() + __pos, __s, __len);
3011 __r = _S_compare(__n1, __n2);
3015#if __cplusplus > 201703L
3018 {
return __sv_type(this->
data(), this->
size()).starts_with(__x); }
3021 starts_with(_CharT __x)
const noexcept
3022 {
return __sv_type(this->
data(), this->
size()).starts_with(__x); }
3024 [[__gnu__::__nonnull__]]
3026 starts_with(
const _CharT* __x)
const noexcept
3027 {
return __sv_type(this->
data(), this->
size()).starts_with(__x); }
3030 ends_with(basic_string_view<_CharT, _Traits> __x)
const noexcept
3031 {
return __sv_type(this->
data(), this->
size()).ends_with(__x); }
3034 ends_with(_CharT __x)
const noexcept
3035 {
return __sv_type(this->
data(), this->
size()).ends_with(__x); }
3037 [[__gnu__::__nonnull__]]
3039 ends_with(
const _CharT* __x)
const noexcept
3040 {
return __sv_type(this->
data(), this->
size()).ends_with(__x); }
3043#if __cplusplus > 202011L
3045 contains(basic_string_view<_CharT, _Traits> __x)
const noexcept
3046 {
return __sv_type(this->
data(), this->
size()).contains(__x); }
3049 contains(_CharT __x)
const noexcept
3050 {
return __sv_type(this->
data(), this->
size()).contains(__x); }
3052 [[__gnu__::__nonnull__]]
3054 contains(
const _CharT* __x)
const noexcept
3055 {
return __sv_type(this->
data(), this->
size()).contains(__x); }
3058# ifdef _GLIBCXX_TM_TS_INTERNAL
3060 ::_txnal_cow_string_C1_for_exceptions(
void* that,
const char* s,
3063 ::_txnal_cow_string_c_str(
const void *that);
3065 ::_txnal_cow_string_D1(
void *that);
3067 ::_txnal_cow_string_D1_commit(
void *that);
3071 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3072 const typename basic_string<_CharT, _Traits, _Alloc>::size_type
3073 basic_string<_CharT, _Traits, _Alloc>::
3074 _Rep::_S_max_size = (((npos -
sizeof(_Rep_base))/
sizeof(_CharT)) - 1) / 4;
3076 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3078 basic_string<_CharT, _Traits, _Alloc>::
3079 _Rep::_S_terminal = _CharT();
3081 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3082 const typename basic_string<_CharT, _Traits, _Alloc>::size_type
3087 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3088 typename basic_string<_CharT, _Traits, _Alloc>::size_type
3089 basic_string<_CharT, _Traits, _Alloc>::_Rep::_S_empty_rep_storage[
3090 (
sizeof(_Rep_base) +
sizeof(_CharT) +
sizeof(size_type) - 1) /
3097 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3098 template<
typename _InIterator>
3100 basic_string<_CharT, _Traits, _Alloc>::
3101 _S_construct(_InIterator __beg, _InIterator __end,
const _Alloc& __a,
3104#if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
3105 if (__beg == __end && __a == _Alloc())
3106 return _S_empty_rep()._M_refdata();
3110 size_type __len = 0;
3111 while (__beg != __end && __len <
sizeof(__buf) /
sizeof(_CharT))
3113 __buf[__len++] = *__beg;
3116 _Rep* __r = _Rep::_S_create(__len, size_type(0), __a);
3117 _M_copy(__r->_M_refdata(), __buf, __len);
3120 while (__beg != __end)
3122 if (__len == __r->_M_capacity)
3125 _Rep* __another = _Rep::_S_create(__len + 1, __len, __a);
3126 _M_copy(__another->_M_refdata(), __r->_M_refdata(), __len);
3127 __r->_M_destroy(__a);
3130 __r->_M_refdata()[__len++] = *__beg;
3136 __r->_M_destroy(__a);
3137 __throw_exception_again;
3139 __r->_M_set_length_and_sharable(__len);
3140 return __r->_M_refdata();
3143 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3144 template <
typename _InIterator>
3146 basic_string<_CharT, _Traits, _Alloc>::
3147 _S_construct(_InIterator __beg, _InIterator __end,
const _Alloc& __a,
3148 forward_iterator_tag)
3150#if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
3151 if (__beg == __end && __a == _Alloc())
3152 return _S_empty_rep()._M_refdata();
3155 if (__gnu_cxx::__is_null_pointer(__beg) && __beg != __end)
3156 __throw_logic_error(__N(
"basic_string::_S_construct null not valid"));
3158 const size_type __dnew =
static_cast<size_type
>(
std::distance(__beg,
3161 _Rep* __r = _Rep::_S_create(__dnew, size_type(0), __a);
3163 { _S_copy_chars(__r->_M_refdata(), __beg, __end); }
3166 __r->_M_destroy(__a);
3167 __throw_exception_again;
3169 __r->_M_set_length_and_sharable(__dnew);
3170 return __r->_M_refdata();
3173 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3175 basic_string<_CharT, _Traits, _Alloc>::
3176 _S_construct(size_type __n, _CharT __c,
const _Alloc& __a)
3178#if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
3179 if (__n == 0 && __a == _Alloc())
3180 return _S_empty_rep()._M_refdata();
3183 _Rep* __r = _Rep::_S_create(__n, size_type(0), __a);
3185 _M_assign(__r->_M_refdata(), __n, __c);
3187 __r->_M_set_length_and_sharable(__n);
3188 return __r->_M_refdata();
3191 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3194 : _M_dataplus(_S_construct(__str._M_data()
3195 + __str._M_check(__pos,
3196 "basic_string::basic_string"),
3197 __str._M_data() + __str._M_limit(__pos, npos)
3201 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3204 : _M_dataplus(_S_construct(__str._M_data()
3205 + __str._M_check(__pos,
3206 "basic_string::basic_string"),
3207 __str._M_data() + __str._M_limit(__pos, __n)
3208 + __pos, _Alloc()), _Alloc())
3211 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3214 size_type __n,
const _Alloc& __a)
3215 : _M_dataplus(_S_construct(__str._M_data()
3216 + __str._M_check(__pos,
3217 "basic_string::basic_string"),
3218 __str._M_data() + __str._M_limit(__pos, __n)
3222 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3227 if (_M_rep() != __str._M_rep())
3230 const allocator_type __a = this->get_allocator();
3231 _CharT* __tmp = __str._M_rep()->_M_grab(__a, __str.
get_allocator());
3232 _M_rep()->_M_dispose(__a);
3238 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3241 assign(
const _CharT* __s, size_type __n)
3243 __glibcxx_requires_string_len(__s, __n);
3244 _M_check_length(this->
size(), __n,
"basic_string::assign");
3245 if (_M_disjunct(__s) || _M_rep()->_M_is_shared())
3246 return _M_replace_safe(size_type(0), this->
size(), __s, __n);
3250 const size_type __pos = __s - _M_data();
3252 _M_copy(_M_data(), __s, __n);
3254 _M_move(_M_data(), __s, __n);
3255 _M_rep()->_M_set_length_and_sharable(__n);
3260 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3263 append(size_type __n, _CharT __c)
3267 _M_check_length(size_type(0), __n,
"basic_string::append");
3268 const size_type __len = __n + this->
size();
3269 if (__len > this->capacity() || _M_rep()->_M_is_shared())
3270 this->reserve(__len);
3271 _M_assign(_M_data() + this->
size(), __n, __c);
3272 _M_rep()->_M_set_length_and_sharable(__len);
3277 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3280 append(
const _CharT* __s, size_type __n)
3282 __glibcxx_requires_string_len(__s, __n);
3285 _M_check_length(size_type(0), __n,
"basic_string::append");
3286 const size_type __len = __n + this->
size();
3287 if (__len > this->capacity() || _M_rep()->_M_is_shared())
3289 if (_M_disjunct(__s))
3290 this->reserve(__len);
3293 const size_type __off = __s - _M_data();
3294 this->reserve(__len);
3295 __s = _M_data() + __off;
3298 _M_copy(_M_data() + this->
size(), __s, __n);
3299 _M_rep()->_M_set_length_and_sharable(__len);
3304 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3309 const size_type __size = __str.
size();
3312 const size_type __len = __size + this->
size();
3313 if (__len > this->capacity() || _M_rep()->_M_is_shared())
3314 this->reserve(__len);
3315 _M_copy(_M_data() + this->
size(), __str._M_data(), __size);
3316 _M_rep()->_M_set_length_and_sharable(__len);
3321 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3326 __str._M_check(__pos,
"basic_string::append");
3327 __n = __str._M_limit(__pos, __n);
3330 const size_type __len = __n + this->
size();
3331 if (__len > this->capacity() || _M_rep()->_M_is_shared())
3332 this->reserve(__len);
3333 _M_copy(_M_data() + this->
size(), __str._M_data() + __pos, __n);
3334 _M_rep()->_M_set_length_and_sharable(__len);
3339 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3342 insert(size_type __pos,
const _CharT* __s, size_type __n)
3344 __glibcxx_requires_string_len(__s, __n);
3345 _M_check(__pos,
"basic_string::insert");
3346 _M_check_length(size_type(0), __n,
"basic_string::insert");
3347 if (_M_disjunct(__s) || _M_rep()->_M_is_shared())
3348 return _M_replace_safe(__pos, size_type(0), __s, __n);
3352 const size_type __off = __s - _M_data();
3353 _M_mutate(__pos, 0, __n);
3354 __s = _M_data() + __off;
3355 _CharT* __p = _M_data() + __pos;
3356 if (__s + __n <= __p)
3357 _M_copy(__p, __s, __n);
3358 else if (__s >= __p)
3359 _M_copy(__p, __s + __n, __n);
3362 const size_type __nleft = __p - __s;
3363 _M_copy(__p, __s, __nleft);
3364 _M_copy(__p + __nleft, __p + __n, __n - __nleft);
3370 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3371 typename basic_string<_CharT, _Traits, _Alloc>::iterator
3373 erase(iterator __first, iterator __last)
3375 _GLIBCXX_DEBUG_PEDASSERT(__first >= _M_ibegin() && __first <= __last
3376 && __last <= _M_iend());
3381 const size_type __size = __last - __first;
3384 const size_type __pos = __first - _M_ibegin();
3385 _M_mutate(__pos, __size, size_type(0));
3386 _M_rep()->_M_set_leaked();
3387 return iterator(_M_data() + __pos);
3393 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3396 replace(size_type __pos, size_type __n1,
const _CharT* __s,
3399 __glibcxx_requires_string_len(__s, __n2);
3400 _M_check(__pos,
"basic_string::replace");
3401 __n1 = _M_limit(__pos, __n1);
3402 _M_check_length(__n1, __n2,
"basic_string::replace");
3404 if (_M_disjunct(__s) || _M_rep()->_M_is_shared())
3405 return _M_replace_safe(__pos, __n1, __s, __n2);
3406 else if ((__left = __s + __n2 <= _M_data() + __pos)
3407 || _M_data() + __pos + __n1 <= __s)
3410 size_type __off = __s - _M_data();
3411 __left ? __off : (__off += __n2 - __n1);
3412 _M_mutate(__pos, __n1, __n2);
3413 _M_copy(_M_data() + __pos, _M_data() + __off, __n2);
3420 return _M_replace_safe(__pos, __n1, __tmp._M_data(), __n2);
3424 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3429 const size_type __size =
sizeof(_Rep_base)
3430 + (this->_M_capacity + 1) *
sizeof(_CharT);
3431 _Raw_bytes_alloc(__a).deallocate(
reinterpret_cast<char*
>(
this), __size);
3434 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3436 basic_string<_CharT, _Traits, _Alloc>::
3446 if (_M_rep()->_M_is_shared())
3448 _M_rep()->_M_set_leaked();
3451 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3453 basic_string<_CharT, _Traits, _Alloc>::
3454 _M_mutate(size_type __pos, size_type __len1, size_type __len2)
3456 const size_type __old_size = this->
size();
3457 const size_type __new_size = __old_size + __len2 - __len1;
3458 const size_type __how_much = __old_size - __pos - __len1;
3460 if (__new_size > this->capacity() || _M_rep()->_M_is_shared())
3463 const allocator_type __a = get_allocator();
3464 _Rep* __r = _Rep::_S_create(__new_size, this->capacity(), __a);
3467 _M_copy(__r->_M_refdata(), _M_data(), __pos);
3469 _M_copy(__r->_M_refdata() + __pos + __len2,
3470 _M_data() + __pos + __len1, __how_much);
3472 _M_rep()->_M_dispose(__a);
3473 _M_data(__r->_M_refdata());
3475 else if (__how_much && __len1 != __len2)
3478 _M_move(_M_data() + __pos + __len2,
3479 _M_data() + __pos + __len1, __how_much);
3481 _M_rep()->_M_set_length_and_sharable(__new_size);
3484 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3489 const size_type __capacity = capacity();
3495 if (__res <= __capacity)
3497 if (!_M_rep()->_M_is_shared())
3504 const allocator_type __a = get_allocator();
3505 _CharT* __tmp = _M_rep()->_M_clone(__a, __res - this->
size());
3506 _M_rep()->_M_dispose(__a);
3510 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3516 if (_M_rep()->_M_is_leaked())
3517 _M_rep()->_M_set_sharable();
3518 if (__s._M_rep()->_M_is_leaked())
3519 __s._M_rep()->_M_set_sharable();
3520 if (this->get_allocator() == __s.get_allocator())
3522 _CharT* __tmp = _M_data();
3523 _M_data(__s._M_data());
3530 __s.get_allocator());
3531 const basic_string __tmp2(__s._M_ibegin(), __s._M_iend(),
3532 this->get_allocator());
3538 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3541 _S_create(size_type __capacity, size_type __old_capacity,
3542 const _Alloc& __alloc)
3546 if (__capacity > _S_max_size)
3547 __throw_length_error(__N(
"basic_string::_S_create"));
3572 const size_type __pagesize = 4096;
3573 const size_type __malloc_header_size = 4 *
sizeof(
void*);
3581 if (__capacity > __old_capacity && __capacity < 2 * __old_capacity)
3582 __capacity = 2 * __old_capacity;
3587 size_type __size = (__capacity + 1) *
sizeof(_CharT) +
sizeof(_Rep);
3589 const size_type __adj_size = __size + __malloc_header_size;
3590 if (__adj_size > __pagesize && __capacity > __old_capacity)
3592 const size_type __extra = __pagesize - __adj_size % __pagesize;
3593 __capacity += __extra /
sizeof(_CharT);
3595 if (__capacity > _S_max_size)
3596 __capacity = _S_max_size;
3597 __size = (__capacity + 1) *
sizeof(_CharT) +
sizeof(_Rep);
3602 void* __place = _Raw_bytes_alloc(__alloc).allocate(__size);
3603 _Rep *__p =
new (__place) _Rep;
3604 __p->_M_capacity = __capacity;
3612 __p->_M_set_sharable();
3616 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3618 basic_string<_CharT, _Traits, _Alloc>::_Rep::
3619 _M_clone(
const _Alloc& __alloc, size_type __res)
3622 const size_type __requested_cap = this->_M_length + __res;
3623 _Rep* __r = _Rep::_S_create(__requested_cap, this->_M_capacity,
3625 if (this->_M_length)
3626 _M_copy(__r->_M_refdata(), _M_refdata(), this->_M_length);
3628 __r->_M_set_length_and_sharable(this->_M_length);
3629 return __r->_M_refdata();
3632 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3635 resize(size_type __n, _CharT __c)
3637 const size_type __size = this->
size();
3638 _M_check_length(__size, __n,
"basic_string::resize");
3640 this->append(__n - __size, __c);
3641 else if (__n < __size)
3646 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3647 template<
typename _InputIterator>
3651 _InputIterator __k2, __false_type)
3654 const size_type __n1 = __i2 - __i1;
3655 _M_check_length(__n1, __s.size(),
"basic_string::_M_replace_dispatch");
3656 return _M_replace_safe(__i1 - _M_ibegin(), __n1, __s._M_data(),
3660 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3661 basic_string<_CharT, _Traits, _Alloc>&
3662 basic_string<_CharT, _Traits, _Alloc>::
3663 _M_replace_aux(size_type __pos1, size_type __n1, size_type __n2,
3666 _M_check_length(__n1, __n2,
"basic_string::_M_replace_aux");
3667 _M_mutate(__pos1, __n1, __n2);
3669 _M_assign(_M_data() + __pos1, __n2, __c);
3673 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3674 basic_string<_CharT, _Traits, _Alloc>&
3675 basic_string<_CharT, _Traits, _Alloc>::
3676 _M_replace_safe(size_type __pos1, size_type __n1,
const _CharT* __s,
3679 _M_mutate(__pos1, __n1, __n2);
3681 _M_copy(_M_data() + __pos1, __s, __n2);
3685 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3691 if (length() < capacity() || _M_rep()->_M_is_shared())
3694 const allocator_type __a = get_allocator();
3695 _CharT* __tmp = _M_rep()->_M_clone(__a);
3696 _M_rep()->_M_dispose(__a);
3706 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3707 typename basic_string<_CharT, _Traits, _Alloc>::size_type
3709 copy(_CharT* __s, size_type __n, size_type __pos)
const
3711 _M_check(__pos,
"basic_string::copy");
3712 __n = _M_limit(__pos, __n);
3713 __glibcxx_requires_string_len(__s, __n);
3715 _M_copy(__s, _M_data() + __pos, __n);
3719_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.
int compare(size_type __pos1, size_type __n1, const basic_string &__str, size_type __pos2, size_type __n2=npos) const
Compare substring to a substring.
const_reverse_iterator crbegin() const noexcept
void swap(basic_string &__s) noexcept(/*conditional */)
Swap contents with another string.
_If_sv< _Tp, basic_string & > operator=(const _Tp &__svt)
Set value to string constructed from a string_view.
basic_string & operator=(const _CharT *__s)
Copy contents of s into this string.
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
basic_string & operator+=(initializer_list< _CharT > __l)
Append an initializer_list of characters.
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(iterator __i1, iterator __i2, const _CharT *__s, size_type __n)
Replace range of characters with C substring.
basic_string & assign(initializer_list< _CharT > __l)
Set value to an initializer_list of characters.
size_type find_first_of(const basic_string &__str, size_type __pos=0) const noexcept
Find position of a character of string.
iterator erase(iterator __first, iterator __last)
Remove a range of characters.
_If_sv< _Tp, basic_string & > insert(size_type __pos1, const _Tp &__svt, size_type __pos2, size_type __n=npos)
Insert a string_view.
_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 _CharT * data() const noexcept
Return const pointer to contents.
basic_string(const _Alloc &__a)
Construct an empty string using allocator a.
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 & > insert(size_type __pos, const _Tp &__svt)
Insert a string_view.
int compare(const _CharT *__s) const noexcept
Compare to a C string.
void insert(iterator __p, initializer_list< _CharT > __l)
Insert an initializer_list of characters.
basic_string & insert(size_type __pos1, const basic_string &__str)
Insert value of a string.
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.
int compare(size_type __pos, size_type __n, const basic_string &__str) const
Compare substring to a string.
basic_string(const basic_string &__str)
Construct string with copy of value of str.
int compare(const basic_string &__str) const
Compare to a string.
int compare(size_type __pos, size_type __n1, const _CharT *__s) const
Compare substring to a C string.
_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.
int compare(size_type __pos, size_type __n1, const _CharT *__s, size_type __n2) const
Compare substring against a character array.
_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, basic_string & > replace(const_iterator __i1, const_iterator __i2, const _Tp &__svt)
Replace range of characters with string_view.
basic_string & replace(iterator __i1, iterator __i2, const basic_string &__str)
Replace range of characters with 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.
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 & 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.
_If_sv< _Tp, basic_string & > assign(const _Tp &__svt)
Set value from a string_view.
reverse_iterator rbegin()
basic_string & insert(size_type __pos1, const basic_string &__str, size_type __pos2, size_type __n=npos)
Insert a substring.
basic_string(initializer_list< _CharT > __l, const _Alloc &__a=_Alloc())
Construct string from an initializer list.
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.
basic_string & replace(iterator __i1, iterator __i2, _InputIterator __k1, _InputIterator __k2)
Replace range of characters with range.
basic_string & assign(basic_string &&__str) noexcept(allocator_traits< _Alloc >::is_always_equal::value)
Set value to contents of another string.
_If_sv< _Tp, basic_string & > operator+=(const _Tp &__svt)
Append a string_view.
void pop_back()
Remove the last character.
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 & insert(size_type __pos, const _CharT *__s, size_type __n)
Insert a C substring.
basic_string & operator+=(const basic_string &__str)
Append a string to this string.
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 & operator+=(const _CharT *__s)
Append a C string.
basic_string(size_type __n, _CharT __c, const _Alloc &__a=_Alloc())
Construct string as multiple characters.
void shrink_to_fit() noexcept
A non-binding request to reduce capacity() to size().
void resize(size_type __n, _CharT __c)
Resizes the string to the specified number of characters.
void reserve()
Equivalent to shrink_to_fit().
_If_sv< _Tp, int > compare(const _Tp &__svt) const noexcept(is_same< _Tp, __sv_type >::value)
Compare to a string_view.
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
const_iterator end() const noexcept
_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.
size_type find_last_of(_CharT __c, size_type __pos=npos) const noexcept
Find last position of a character.
_If_sv< _Tp, basic_string & > replace(size_type __pos, size_type __n, const _Tp &__svt)
Replace range of characters with string_view.
basic_string & append(const basic_string &__str)
Append a string to this string.
const_iterator begin() const noexcept
basic_string & operator=(basic_string &&__str) noexcept(/*conditional */)
Move assign the value of str to this string.
basic_string & replace(iterator __i1, iterator __i2, initializer_list< _CharT > __l)
Replace range of characters with initializer_list.
basic_string & operator+=(_CharT __c)
Append a character.
const_reverse_iterator crend() const noexcept
basic_string & operator=(const basic_string &__str)
Assign the value of str to this string.
basic_string & operator=(_CharT __c)
Set value to string of length 1.
void resize(size_type __n)
Resizes the string to the specified number of characters.
const_reverse_iterator rbegin() const noexcept
basic_string & assign(_InputIterator __first, _InputIterator __last)
Set value to a range of characters.
basic_string & append(initializer_list< _CharT > __l)
Append an initializer_list of characters.
basic_string & append(_InputIterator __first, _InputIterator __last)
Append a range of characters.
const_reference operator[](size_type __pos) const noexcept
Subscript access to the data contained in the string.
_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.
basic_string(const _CharT *__s, const _Alloc &__a=_Alloc())
Construct string as copy of a C string.
size_type find_first_of(_CharT __c, size_type __pos=0) const noexcept
Find position of a character.
_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.
basic_string & assign(size_type __n, _CharT __c)
Set value to multiple characters.
basic_string & replace(iterator __i1, iterator __i2, const _CharT *__s)
Replace range of characters with C string.
bool empty() const noexcept
_If_sv< _Tp, basic_string & > append(const _Tp &__svt)
Append a string_view.
_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 & insert(size_type __pos, const _CharT *__s)
Insert a C string.
basic_string & assign(const basic_string &__str, size_type __pos, size_type __n=npos)
Set value to a substring of a string.
const _CharT * c_str() const noexcept
Return const pointer to null-terminated contents.
_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 & replace(size_type __pos, size_type __n1, const _CharT *__s)
Replace characters with value of a C string.
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 & assign(const _CharT *__s)
Set value to contents of a C string.
basic_string & replace(size_type __pos, size_type __n1, size_type __n2, _CharT __c)
Replace characters with multiple characters.
const_iterator cbegin() const noexcept
basic_string & replace(iterator __i1, iterator __i2, size_type __n, _CharT __c)
Replace range of characters with multiple characters.
basic_string & operator=(initializer_list< _CharT > __l)
Set value to string constructed from initializer list.
~basic_string() noexcept
Destroy the string instance.
size_type capacity() const noexcept
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.
_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.
_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 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 & erase(size_type __pos=0, size_type __n=npos)
Remove characters.
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.
basic_string & append(const _CharT *__s, size_type __n)
Append a C substring.
_CharT * data() noexcept
Return non-const pointer to contents.
basic_string(const _CharT *__s, size_type __n, const _Alloc &__a=_Alloc())
Construct string initialized by a character array.
basic_string & append(const _CharT *__s)
Append a 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.
basic_string & replace(size_type __pos, size_type __n, const basic_string &__str)
Replace characters with value from another 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.
iterator insert(iterator __p, _CharT __c)
Insert one character.
Thrown as part of forced unwinding.
Uniform interface to C++98 and C++11 allocators.