33#define _COW_STRING_H 1
35#if ! _GLIBCXX_USE_CXX11_ABI
39namespace std _GLIBCXX_VISIBILITY(default)
41_GLIBCXX_BEGIN_NAMESPACE_VERSION
107 template<
typename _CharT,
typename _Traits,
typename _Alloc>
110 typedef typename __gnu_cxx::__alloc_traits<_Alloc>::template
111 rebind<_CharT>::other _CharT_alloc_type;
112 typedef __gnu_cxx::__alloc_traits<_CharT_alloc_type> _CharT_alloc_traits;
116 typedef _Traits traits_type;
117 typedef typename _Traits::char_type value_type;
118 typedef _Alloc allocator_type;
119 typedef typename _CharT_alloc_traits::size_type size_type;
120 typedef typename _CharT_alloc_traits::difference_type difference_type;
121#if __cplusplus < 201103L
122 typedef typename _CharT_alloc_type::reference reference;
123 typedef typename _CharT_alloc_type::const_reference const_reference;
125 typedef value_type& reference;
126 typedef const value_type& const_reference;
128 typedef typename _CharT_alloc_traits::pointer pointer;
129 typedef typename _CharT_alloc_traits::const_pointer const_pointer;
130 typedef __gnu_cxx::__normal_iterator<pointer, basic_string> iterator;
131 typedef __gnu_cxx::__normal_iterator<const_pointer, basic_string>
133 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
134 typedef std::reverse_iterator<iterator> reverse_iterator;
138 typedef iterator __const_iterator;
158 size_type _M_capacity;
159 _Atomic_word _M_refcount;
162 struct _Rep : _Rep_base
165 typedef typename __gnu_cxx::__alloc_traits<_Alloc>::template
166 rebind<char>::other _Raw_bytes_alloc;
181 static const size_type _S_max_size;
182 static const _CharT _S_terminal;
186 static size_type _S_empty_rep_storage[];
189 _S_empty_rep() _GLIBCXX_NOEXCEPT
194 void* __p =
reinterpret_cast<void*
>(&_S_empty_rep_storage);
195 return *
reinterpret_cast<_Rep*
>(__p);
199 _M_is_leaked() const _GLIBCXX_NOEXCEPT
201#if defined(__GTHREADS)
206 return __atomic_load_n(&this->_M_refcount, __ATOMIC_RELAXED) < 0;
208 return this->_M_refcount < 0;
213 _M_is_shared() const _GLIBCXX_NOEXCEPT
215#if defined(__GTHREADS)
221 if (!__gnu_cxx::__is_single_threaded())
222 return __atomic_load_n(&this->_M_refcount, __ATOMIC_ACQUIRE) > 0;
224 return this->_M_refcount > 0;
228 _M_set_leaked() _GLIBCXX_NOEXCEPT
229 { this->_M_refcount = -1; }
232 _M_set_sharable() _GLIBCXX_NOEXCEPT
233 { this->_M_refcount = 0; }
236 _M_set_length_and_sharable(size_type __n) _GLIBCXX_NOEXCEPT
238#if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
239 if (__builtin_expect(
this != &_S_empty_rep(),
false))
242 this->_M_set_sharable();
243 this->_M_length = __n;
244 traits_type::assign(this->_M_refdata()[__n], _S_terminal);
252 {
return reinterpret_cast<_CharT*
>(
this + 1); }
255 _M_grab(
const _Alloc& __alloc1,
const _Alloc& __alloc2)
257 return (!_M_is_leaked() && __alloc1 == __alloc2)
258 ? _M_refcopy() : _M_clone(__alloc1);
263 _S_create(size_type, size_type,
const _Alloc&);
266 _M_dispose(
const _Alloc& __a) _GLIBCXX_NOEXCEPT
268#if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
269 if (__builtin_expect(
this != &_S_empty_rep(),
false))
273 _GLIBCXX_SYNCHRONIZATION_HAPPENS_BEFORE(&this->_M_refcount);
282 if (__gnu_cxx::__exchange_and_add_dispatch(&this->_M_refcount,
285 _GLIBCXX_SYNCHRONIZATION_HAPPENS_AFTER(&this->_M_refcount);
292 _M_destroy(
const _Alloc&)
throw();
297#if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
298 if (__builtin_expect(
this != &_S_empty_rep(),
false))
300 __gnu_cxx::__atomic_add_dispatch(&this->_M_refcount, 1);
305 _M_clone(
const _Alloc&, size_type __res = 0);
309 struct _Alloc_hider : _Alloc
311 _Alloc_hider(_CharT* __dat,
const _Alloc& __a) _GLIBCXX_NOEXCEPT
312 : _Alloc(__a), _M_p(__dat) { }
322 static const size_type
npos =
static_cast<size_type
>(-1);
326 mutable _Alloc_hider _M_dataplus;
329 _M_data() const _GLIBCXX_NOEXCEPT
330 {
return _M_dataplus._M_p; }
333 _M_data(_CharT* __p) _GLIBCXX_NOEXCEPT
334 {
return (_M_dataplus._M_p = __p); }
337 _M_rep() const _GLIBCXX_NOEXCEPT
338 {
return &((
reinterpret_cast<_Rep*
> (_M_data()))[-1]); }
343 _M_ibegin() const _GLIBCXX_NOEXCEPT
344 {
return iterator(_M_data()); }
347 _M_iend() const _GLIBCXX_NOEXCEPT
348 {
return iterator(_M_data() + this->
size()); }
353 if (!_M_rep()->_M_is_leaked())
358 _M_check(size_type __pos,
const char* __s)
const
360 if (__pos > this->
size())
361 __throw_out_of_range_fmt(__N(
"%s: __pos (which is %zu) > "
362 "this->size() (which is %zu)"),
363 __s, __pos, this->
size());
368 _M_check_length(size_type __n1, size_type __n2,
const char* __s)
const
371 __throw_length_error(__N(__s));
376 _M_limit(size_type __pos, size_type __off)
const _GLIBCXX_NOEXCEPT
378 const bool __testoff = __off < this->
size() - __pos;
379 return __testoff ? __off : this->
size() - __pos;
384 _M_disjunct(
const _CharT* __s)
const _GLIBCXX_NOEXCEPT
386 return (less<const _CharT*>()(__s, _M_data())
387 || less<const _CharT*>()(_M_data() + this->
size(), __s));
393 _M_copy(_CharT* __d,
const _CharT* __s, size_type __n) _GLIBCXX_NOEXCEPT
396 traits_type::assign(*__d, *__s);
398 traits_type::copy(__d, __s, __n);
402 _M_move(_CharT* __d,
const _CharT* __s, size_type __n) _GLIBCXX_NOEXCEPT
405 traits_type::assign(*__d, *__s);
407 traits_type::move(__d, __s, __n);
411 _M_assign(_CharT* __d, size_type __n, _CharT __c) _GLIBCXX_NOEXCEPT
414 traits_type::assign(*__d, __c);
416 traits_type::assign(__d, __n, __c);
421 template<
class _Iterator>
423 _S_copy_chars(_CharT* __p, _Iterator __k1, _Iterator __k2)
425 for (; __k1 != __k2; ++__k1, (void)++__p)
426 traits_type::assign(*__p, *__k1);
430 _S_copy_chars(_CharT* __p, iterator __k1, iterator __k2) _GLIBCXX_NOEXCEPT
431 { _S_copy_chars(__p, __k1.base(), __k2.base()); }
434 _S_copy_chars(_CharT* __p, const_iterator __k1, const_iterator __k2)
436 { _S_copy_chars(__p, __k1.base(), __k2.base()); }
439 _S_copy_chars(_CharT* __p, _CharT* __k1, _CharT* __k2) _GLIBCXX_NOEXCEPT
440 { _M_copy(__p, __k1, __k2 - __k1); }
443 _S_copy_chars(_CharT* __p,
const _CharT* __k1,
const _CharT* __k2)
445 { _M_copy(__p, __k1, __k2 - __k1); }
448 _S_compare(size_type __n1, size_type __n2) _GLIBCXX_NOEXCEPT
450 const difference_type __d = difference_type(__n1 - __n2);
452 if (__d > __gnu_cxx::__numeric_traits<int>::__max)
453 return __gnu_cxx::__numeric_traits<int>::__max;
454 else if (__d < __gnu_cxx::__numeric_traits<int>::__min)
455 return __gnu_cxx::__numeric_traits<int>::__min;
461 _M_mutate(size_type __pos, size_type __len1, size_type __len2);
467 _S_empty_rep() _GLIBCXX_NOEXCEPT
468 {
return _Rep::_S_empty_rep(); }
470#ifdef __glibcxx_string_view
472 typedef basic_string_view<_CharT, _Traits> __sv_type;
474 template<
typename _Tp,
typename _Res>
476 __and_<is_convertible<const _Tp&, __sv_type>,
477 __not_<is_convertible<const _Tp*, const basic_string*>>,
478 __not_<is_convertible<const _Tp&, const _CharT*>>>::value,
483 _S_to_string_view(__sv_type __svt)
noexcept
492 explicit __sv_wrapper(__sv_type __sv) noexcept : _M_sv(__sv) { }
516#if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
519#if __cpp_concepts && __glibcxx_type_trait_variable_templates
520 requires is_default_constructible_v<_Alloc>
522#if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
523 : _M_dataplus(_S_empty_rep()._M_refdata(), _Alloc())
525 : _M_dataplus(_S_construct(size_type(), _CharT(), _Alloc()), _Alloc())
534 : _M_dataplus(_S_construct(size_type(), _CharT(), __a), __a)
543 : _M_dataplus(__str._M_rep()->_M_grab(_Alloc(__str.
get_allocator()),
557 const _Alloc& __a = _Alloc());
575 size_type __n,
const _Alloc& __a);
587 const _Alloc& __a = _Alloc())
588 : _M_dataplus(_S_construct(__s, __s + __n, __a), __a)
596#if __cpp_deduction_guides && ! defined _GLIBCXX_DEFINING_STRING_INSTANTIATIONS
599 template<
typename = _RequireAllocator<_Alloc>>
602 : _M_dataplus(_S_construct(__s, __s ? __s + traits_type::
length(__s) :
603 __s +
npos, __a), __a)
613 : _M_dataplus(_S_construct(__n, __c, __a), __a)
616#if __cplusplus >= 201103L
625 : _M_dataplus(
std::move(__str._M_dataplus))
627#if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
629 __str._M_data(_S_empty_rep()._M_refdata());
635 if (_M_rep()->_M_is_shared())
636 __gnu_cxx::__atomic_add_dispatch(&_M_rep()->_M_refcount, 1);
638 _M_rep()->_M_refcount = 1;
648 : _M_dataplus(_S_construct(__l.
begin(), __l.
end(), __a), __a)
652 : _M_dataplus(__str._M_rep()->_M_grab(__a, __str.
get_allocator()), __a)
656 : _M_dataplus(__str._M_data(), __a)
658 if (__a == __str.get_allocator())
660#if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
661 __str._M_data(_S_empty_rep()._M_refdata());
663 __str._M_data(_S_construct(size_type(), _CharT(), __a));
667 _M_dataplus._M_p = _S_construct(__str.begin(), __str.end(), __a);
671#if __cplusplus >= 202100L
682 template<
class _InputIterator>
684 const _Alloc& __a = _Alloc())
685 : _M_dataplus(_S_construct(__beg, __end, __a), __a)
688#ifdef __glibcxx_string_view
696 template<
typename _Tp,
699 const _Alloc& __a = _Alloc())
707 template<
typename _Tp,
typename = _If_sv<_Tp,
void>>
709 basic_string(
const _Tp& __t,
const _Alloc& __a = _Alloc())
710 :
basic_string(__sv_wrapper(_S_to_string_view(__t)), __a) { }
725 {
return this->
assign(__str); }
733 {
return this->
assign(__s); }
749#if __cplusplus >= 201103L
773 this->
assign(__l.begin(), __l.size());
778#ifdef __glibcxx_string_view
783 template<
typename _Tp>
784 _If_sv<_Tp, basic_string&>
786 {
return this->
assign(__svt); }
792 operator __sv_type() const noexcept
793 {
return __sv_type(
data(),
size()); }
805 return iterator(_M_data());
814 {
return const_iterator(_M_data()); }
824 return iterator(_M_data() + this->
size());
832 end() const _GLIBCXX_NOEXCEPT
833 {
return const_iterator(_M_data() + this->
size()); }
842 {
return reverse_iterator(this->
end()); }
849 const_reverse_iterator
851 {
return const_reverse_iterator(this->
end()); }
860 {
return reverse_iterator(this->
begin()); }
867 const_reverse_iterator
869 {
return const_reverse_iterator(this->
begin()); }
871#if __cplusplus >= 201103L
878 {
return const_iterator(this->_M_data()); }
886 {
return const_iterator(this->_M_data() + this->
size()); }
893 const_reverse_iterator
895 {
return const_reverse_iterator(this->
end()); }
902 const_reverse_iterator
904 {
return const_reverse_iterator(this->
begin()); }
915#if _GLIBCXX_FULLY_DYNAMIC_STRING == 0 && __OPTIMIZE__
916 if (_S_empty_rep()._M_length != 0)
917 __builtin_unreachable();
919 return _M_rep()->_M_length;
931 {
return _Rep::_S_max_size; }
958 { this->
resize(__n, _CharT()); }
960#if __cplusplus >= 201103L
961#pragma GCC diagnostic push
962#pragma GCC diagnostic ignored "-Wdeprecated-declarations"
967#pragma GCC diagnostic pop
970#ifdef __glibcxx_string_resize_and_overwrite
1000 template<
typename _Operation>
1002 resize_and_overwrite(size_type __n, _Operation __op);
1005#if __cplusplus >= 201103L
1007 template<
typename _Operation>
1018 {
return _M_rep()->_M_capacity; }
1041#if __cplusplus > 201703L
1042 [[deprecated(
"use shrink_to_fit() instead")]]
1050#if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
1054 if (_M_rep()->_M_is_shared())
1057 _M_data(_S_empty_rep()._M_refdata());
1060 _M_rep()->_M_set_length_and_sharable(0);
1066 { _M_mutate(0, this->
size(), 0); }
1073 _GLIBCXX_NODISCARD
bool
1075 {
return this->
size() == 0; }
1091 __glibcxx_assert(__pos <=
size());
1092 return _M_data()[__pos];
1110 __glibcxx_assert(__pos <=
size());
1112 _GLIBCXX_DEBUG_PEDASSERT(__cplusplus >= 201103L || __pos <
size());
1114 return _M_data()[__pos];
1130 if (__n >= this->
size())
1131 __throw_out_of_range_fmt(__N(
"basic_string::at: __n "
1132 "(which is %zu) >= this->size() "
1135 return _M_data()[__n];
1153 __throw_out_of_range_fmt(__N(
"basic_string::at: __n "
1154 "(which is %zu) >= this->size() "
1158 return _M_data()[__n];
1161#if __cplusplus >= 201103L
1169 __glibcxx_assert(!
empty());
1180 __glibcxx_assert(!
empty());
1191 __glibcxx_assert(!
empty());
1202 __glibcxx_assert(!
empty());
1215 {
return this->
append(__str); }
1224 {
return this->
append(__s); }
1238#if __cplusplus >= 201103L
1246 {
return this->
append(__l.begin(), __l.size()); }
1249#ifdef __glibcxx_string_view
1255 template<
typename _Tp>
1256 _If_sv<_Tp, basic_string&>
1258 {
return this->
append(__svt); }
1302 __glibcxx_requires_string(__s);
1303 return this->
append(__s, traits_type::length(__s));
1317#if __cplusplus >= 201103L
1325 {
return this->
append(__l.begin(), __l.size()); }
1336 template<
class _InputIterator>
1338 append(_InputIterator __first, _InputIterator __last)
1339 {
return this->
replace(_M_iend(), _M_iend(), __first, __last); }
1341#ifdef __glibcxx_string_view
1347 template<
typename _Tp>
1348 _If_sv<_Tp, basic_string&>
1351 __sv_type __sv = __svt;
1352 return this->
append(__sv.data(), __sv.size());
1363 template<
typename _Tp>
1364 _If_sv<_Tp, basic_string&>
1365 append(
const _Tp& __svt, size_type __pos, size_type __n =
npos)
1367 __sv_type __sv = __svt;
1368 return append(__sv.data()
1369 + std::__sv_check(__sv.size(), __pos,
"basic_string::append"),
1370 std::__sv_limit(__sv.size(), __pos, __n));
1381 const size_type __len = 1 + this->
size();
1382 if (__len > this->
capacity() || _M_rep()->_M_is_shared())
1384 traits_type::assign(_M_data()[this->
size()], __c);
1385 _M_rep()->_M_set_length_and_sharable(__len);
1396#if __cplusplus >= 201103L
1429 {
return this->
assign(__str._M_data()
1430 + __str._M_check(__pos,
"basic_string::assign"),
1431 __str._M_limit(__pos, __n)); }
1458 __glibcxx_requires_string(__s);
1459 return this->
assign(__s, traits_type::length(__s));
1473 {
return _M_replace_aux(size_type(0), this->
size(), __n, __c); }
1483 template<
class _InputIterator>
1485 assign(_InputIterator __first, _InputIterator __last)
1486 {
return this->
replace(_M_ibegin(), _M_iend(), __first, __last); }
1488#if __cplusplus >= 201103L
1496 {
return this->
assign(__l.begin(), __l.size()); }
1499#ifdef __glibcxx_string_view
1505 template<
typename _Tp>
1506 _If_sv<_Tp, basic_string&>
1509 __sv_type __sv = __svt;
1510 return this->
assign(__sv.data(), __sv.size());
1520 template<
typename _Tp>
1521 _If_sv<_Tp, basic_string&>
1522 assign(
const _Tp& __svt, size_type __pos, size_type __n =
npos)
1524 __sv_type __sv = __svt;
1525 return assign(__sv.data()
1526 + std::__sv_check(__sv.size(), __pos,
"basic_string::assign"),
1527 std::__sv_limit(__sv.size(), __pos, __n));
1545 insert(iterator __p, size_type __n, _CharT __c)
1546 { this->
replace(__p, __p, __n, __c); }
1560 template<
class _InputIterator>
1562 insert(iterator __p, _InputIterator __beg, _InputIterator __end)
1563 { this->
replace(__p, __p, __beg, __end); }
1565#if __cplusplus >= 201103L
1575 _GLIBCXX_DEBUG_PEDASSERT(__p >= _M_ibegin() && __p <= _M_iend());
1576 this->
insert(__p - _M_ibegin(), __l.begin(), __l.size());
1594 {
return this->
insert(__pos1, __str, size_type(0), __str.size()); }
1616 size_type __pos2, size_type __n =
npos)
1617 {
return this->
insert(__pos1, __str._M_data()
1618 + __str._M_check(__pos2,
"basic_string::insert"),
1619 __str._M_limit(__pos2, __n)); }
1638 insert(size_type __pos,
const _CharT* __s, size_type __n);
1658 __glibcxx_requires_string(__s);
1659 return this->
insert(__pos, __s, traits_type::length(__s));
1679 insert(size_type __pos, size_type __n, _CharT __c)
1680 {
return _M_replace_aux(_M_check(__pos,
"basic_string::insert"),
1681 size_type(0), __n, __c); }
1699 _GLIBCXX_DEBUG_PEDASSERT(__p >= _M_ibegin() && __p <= _M_iend());
1700 const size_type __pos = __p - _M_ibegin();
1701 _M_replace_aux(__pos, size_type(0), size_type(1), __c);
1702 _M_rep()->_M_set_leaked();
1703 return iterator(_M_data() + __pos);
1706#ifdef __glibcxx_string_view
1713 template<
typename _Tp>
1714 _If_sv<_Tp, basic_string&>
1717 __sv_type __sv = __svt;
1718 return this->
insert(__pos, __sv.data(), __sv.size());
1729 template<
typename _Tp>
1730 _If_sv<_Tp, basic_string&>
1731 insert(size_type __pos1,
const _Tp& __svt,
1732 size_type __pos2, size_type __n =
npos)
1734 __sv_type __sv = __svt;
1735 return this->
replace(__pos1, size_type(0), __sv.data()
1736 + std::__sv_check(__sv.size(), __pos2,
"basic_string::insert"),
1737 std::__sv_limit(__sv.size(), __pos2, __n));
1759 _M_mutate(_M_check(__pos,
"basic_string::erase"),
1760 _M_limit(__pos, __n), size_type(0));
1775 _GLIBCXX_DEBUG_PEDASSERT(__position >= _M_ibegin()
1776 && __position < _M_iend());
1777 const size_type __pos = __position - _M_ibegin();
1778 _M_mutate(__pos, size_type(1), size_type(0));
1779 _M_rep()->_M_set_leaked();
1780 return iterator(_M_data() + __pos);
1793 erase(iterator __first, iterator __last);
1795#if __cplusplus >= 201103L
1804 __glibcxx_assert(!
empty());
1828 {
return this->
replace(__pos, __n, __str._M_data(), __str.size()); }
1850 size_type __pos2, size_type __n2 =
npos)
1851 {
return this->
replace(__pos1, __n1, __str._M_data()
1852 + __str._M_check(__pos2,
"basic_string::replace"),
1853 __str._M_limit(__pos2, __n2)); }
1874 replace(size_type __pos, size_type __n1,
const _CharT* __s,
1894 replace(size_type __pos, size_type __n1,
const _CharT* __s)
1896 __glibcxx_requires_string(__s);
1897 return this->
replace(__pos, __n1, __s, traits_type::length(__s));
1918 replace(size_type __pos, size_type __n1, size_type __n2, _CharT __c)
1919 {
return _M_replace_aux(_M_check(__pos,
"basic_string::replace"),
1920 _M_limit(__pos, __n1), __n2, __c); }
1937 {
return this->
replace(__i1, __i2, __str._M_data(), __str.size()); }
1955 replace(iterator __i1, iterator __i2,
const _CharT* __s, size_type __n)
1957 _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2
1958 && __i2 <= _M_iend());
1959 return this->
replace(__i1 - _M_ibegin(), __i2 - __i1, __s, __n);
1976 replace(iterator __i1, iterator __i2,
const _CharT* __s)
1978 __glibcxx_requires_string(__s);
1979 return this->
replace(__i1, __i2, __s, traits_type::length(__s));
1997 replace(iterator __i1, iterator __i2, size_type __n, _CharT __c)
1999 _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2
2000 && __i2 <= _M_iend());
2001 return _M_replace_aux(__i1 - _M_ibegin(), __i2 - __i1, __n, __c);
2019 template<
class _InputIterator>
2022 _InputIterator __k1, _InputIterator __k2)
2024 _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2
2025 && __i2 <= _M_iend());
2026 __glibcxx_requires_valid_range(__k1, __k2);
2027 typedef typename std::__is_integer<_InputIterator>::__type _Integral;
2028 return _M_replace_dispatch(__i1, __i2, __k1, __k2, _Integral());
2036 _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2
2037 && __i2 <= _M_iend());
2038 __glibcxx_requires_valid_range(__k1, __k2);
2039 return this->
replace(__i1 - _M_ibegin(), __i2 - __i1,
2044 replace(iterator __i1, iterator __i2,
2045 const _CharT* __k1,
const _CharT* __k2)
2047 _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2
2048 && __i2 <= _M_iend());
2049 __glibcxx_requires_valid_range(__k1, __k2);
2050 return this->
replace(__i1 - _M_ibegin(), __i2 - __i1,
2055 replace(iterator __i1, iterator __i2, iterator __k1, iterator __k2)
2057 _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2
2058 && __i2 <= _M_iend());
2059 __glibcxx_requires_valid_range(__k1, __k2);
2060 return this->
replace(__i1 - _M_ibegin(), __i2 - __i1,
2061 __k1.base(), __k2 - __k1);
2065 replace(iterator __i1, iterator __i2,
2066 const_iterator __k1, const_iterator __k2)
2068 _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2
2069 && __i2 <= _M_iend());
2070 __glibcxx_requires_valid_range(__k1, __k2);
2071 return this->
replace(__i1 - _M_ibegin(), __i2 - __i1,
2072 __k1.base(), __k2 - __k1);
2075#if __cplusplus >= 201103L
2092 {
return this->
replace(__i1, __i2, __l.begin(), __l.end()); }
2095#ifdef __glibcxx_string_view
2103 template<
typename _Tp>
2104 _If_sv<_Tp, basic_string&>
2107 __sv_type __sv = __svt;
2108 return this->
replace(__pos, __n, __sv.data(), __sv.size());
2120 template<
typename _Tp>
2121 _If_sv<_Tp, basic_string&>
2122 replace(size_type __pos1, size_type __n1,
const _Tp& __svt,
2123 size_type __pos2, size_type __n2 =
npos)
2125 __sv_type __sv = __svt;
2126 return this->
replace(__pos1, __n1,
2128 + std::__sv_check(__sv.size(), __pos2,
"basic_string::replace"),
2129 std::__sv_limit(__sv.size(), __pos2, __n2));
2141 template<
typename _Tp>
2142 _If_sv<_Tp, basic_string&>
2143 replace(const_iterator __i1, const_iterator __i2,
const _Tp& __svt)
2145 __sv_type __sv = __svt;
2146 return this->
replace(__i1 -
begin(), __i2 - __i1, __sv);
2151 template<
class _Integer>
2153 _M_replace_dispatch(iterator __i1, iterator __i2, _Integer __n,
2154 _Integer __val, __true_type)
2155 {
return _M_replace_aux(__i1 - _M_ibegin(), __i2 - __i1, __n, __val); }
2157 template<
class _InputIterator>
2159 _M_replace_dispatch(iterator __i1, iterator __i2, _InputIterator __k1,
2160 _InputIterator __k2, __false_type);
2163 _M_replace_aux(size_type __pos1, size_type __n1, size_type __n2,
2167 _M_replace_safe(size_type __pos1, size_type __n1,
const _CharT* __s,
2172 template<
class _InIterator>
2174 _S_construct_aux(_InIterator __beg, _InIterator __end,
2175 const _Alloc& __a, __false_type)
2177 typedef typename iterator_traits<_InIterator>::iterator_category _Tag;
2178 return _S_construct(__beg, __end, __a, _Tag());
2183 template<
class _Integer>
2185 _S_construct_aux(_Integer __beg, _Integer __end,
2186 const _Alloc& __a, __true_type)
2187 {
return _S_construct_aux_2(
static_cast<size_type
>(__beg),
2191 _S_construct_aux_2(size_type __req, _CharT __c,
const _Alloc& __a)
2192 {
return _S_construct(__req, __c, __a); }
2194 template<
class _InIterator>
2196 _S_construct(_InIterator __beg, _InIterator __end,
const _Alloc& __a)
2198 typedef typename std::__is_integer<_InIterator>::__type _Integral;
2199 return _S_construct_aux(__beg, __end, __a, _Integral());
2203 template<
class _InIterator>
2205 _S_construct(_InIterator __beg, _InIterator __end,
const _Alloc& __a,
2206 input_iterator_tag);
2210 template<
class _FwdIterator>
2212 _S_construct(_FwdIterator __beg, _FwdIterator __end,
const _Alloc& __a,
2213 forward_iterator_tag);
2216 _S_construct(size_type __req, _CharT __c,
const _Alloc& __a);
2233 copy(_CharT* __s, size_type __n, size_type __pos = 0)
const;
2255 {
return _M_data(); }
2267 {
return _M_data(); }
2269#if __cplusplus >= 201703L
2294 {
return _M_dataplus; }
2309 find(
const _CharT* __s, size_type __pos, size_type __n)
const
2325 {
return this->
find(__str.data(), __pos, __str.size()); }
2338 find(
const _CharT* __s, size_type __pos = 0) const _GLIBCXX_NOEXCEPT
2340 __glibcxx_requires_string(__s);
2341 return this->
find(__s, __pos, traits_type::length(__s));
2355 find(_CharT __c, size_type __pos = 0) const _GLIBCXX_NOEXCEPT;
2357#ifdef __glibcxx_string_view
2364 template<
typename _Tp>
2365 _If_sv<_Tp, size_type>
2366 find(
const _Tp& __svt, size_type __pos = 0) const
2367 noexcept(
is_same<_Tp, __sv_type>::value)
2369 __sv_type __sv = __svt;
2370 return this->
find(__sv.data(), __pos, __sv.size());
2387 {
return this->
rfind(__str.data(), __pos, __str.size()); }
2402 rfind(
const _CharT* __s, size_type __pos, size_type __n)
const
2416 rfind(
const _CharT* __s, size_type __pos =
npos)
const _GLIBCXX_NOEXCEPT
2418 __glibcxx_requires_string(__s);
2419 return this->
rfind(__s, __pos, traits_type::length(__s));
2433 rfind(_CharT __c, size_type __pos =
npos)
const _GLIBCXX_NOEXCEPT;
2435#ifdef __glibcxx_string_view
2442 template<
typename _Tp>
2443 _If_sv<_Tp, size_type>
2444 rfind(
const _Tp& __svt, size_type __pos =
npos)
const
2447 __sv_type __sv = __svt;
2448 return this->
rfind(__sv.data(), __pos, __sv.size());
2466 {
return this->
find_first_of(__str.data(), __pos, __str.size()); }
2498 __glibcxx_requires_string(__s);
2499 return this->
find_first_of(__s, __pos, traits_type::length(__s));
2516 {
return this->
find(__c, __pos); }
2518#ifdef __glibcxx_string_view
2526 template<
typename _Tp>
2527 _If_sv<_Tp, size_type>
2529 noexcept(
is_same<_Tp, __sv_type>::value)
2531 __sv_type __sv = __svt;
2532 return this->
find_first_of(__sv.data(), __pos, __sv.size());
2550 {
return this->
find_last_of(__str.data(), __pos, __str.size()); }
2582 __glibcxx_requires_string(__s);
2583 return this->
find_last_of(__s, __pos, traits_type::length(__s));
2600 {
return this->
rfind(__c, __pos); }
2602#ifdef __glibcxx_string_view
2610 template<
typename _Tp>
2611 _If_sv<_Tp, size_type>
2615 __sv_type __sv = __svt;
2616 return this->
find_last_of(__sv.data(), __pos, __sv.size());
2649 size_type __n)
const _GLIBCXX_NOEXCEPT;
2665 __glibcxx_requires_string(__s);
2683#ifdef __glibcxx_string_view
2691 template<
typename _Tp>
2692 _If_sv<_Tp, size_type>
2694 noexcept(
is_same<_Tp, __sv_type>::value)
2696 __sv_type __sv = __svt;
2731 size_type __n)
const _GLIBCXX_NOEXCEPT;
2747 __glibcxx_requires_string(__s);
2765#ifdef __glibcxx_string_view
2773 template<
typename _Tp>
2774 _If_sv<_Tp, size_type>
2778 __sv_type __sv = __svt;
2798 _M_check(__pos,
"basic_string::substr"), __n); }
2817 const size_type __size = this->
size();
2818 const size_type __osize = __str.size();
2819 const size_type __len =
std::min(__size, __osize);
2821 int __r = traits_type::compare(_M_data(), __str.data(), __len);
2823 __r = _S_compare(__size, __osize);
2827#ifdef __glibcxx_string_view
2833 template<
typename _Tp>
2835 compare(
const _Tp& __svt)
const
2838 __sv_type __sv = __svt;
2840 const size_type __osize = __sv.size();
2843 int __r = traits_type::compare(_M_data(), __sv.data(), __len);
2845 __r = _S_compare(__size, __osize);
2857 template<
typename _Tp>
2859 compare(size_type __pos, size_type __n,
const _Tp& __svt)
const
2860 noexcept(is_same<_Tp, __sv_type>::value)
2862 __sv_type __sv = __svt;
2863 return __sv_type(*this).substr(__pos, __n).compare(__sv);
2876 template<
typename _Tp>
2878 compare(size_type __pos1, size_type __n1,
const _Tp& __svt,
2879 size_type __pos2, size_type __n2 =
npos)
const
2880 noexcept(is_same<_Tp, __sv_type>::value)
2882 __sv_type __sv = __svt;
2883 return __sv_type(*
this)
2884 .substr(__pos1, __n1).compare(__sv.substr(__pos2, __n2));
2910 _M_check(__pos,
"basic_string::compare");
2911 __n = _M_limit(__pos, __n);
2912 const size_type __osize = __str.size();
2913 const size_type __len =
std::min(__n, __osize);
2914 int __r = traits_type::compare(_M_data() + __pos, __str.data(), __len);
2916 __r = _S_compare(__n, __osize);
2945 size_type __pos2, size_type __n2 =
npos)
const
2947 _M_check(__pos1,
"basic_string::compare");
2948 __str._M_check(__pos2,
"basic_string::compare");
2949 __n1 = _M_limit(__pos1, __n1);
2950 __n2 = __str._M_limit(__pos2, __n2);
2951 const size_type __len =
std::min(__n1, __n2);
2952 int __r = traits_type::compare(_M_data() + __pos1,
2953 __str.data() + __pos2, __len);
2955 __r = _S_compare(__n1, __n2);
2974 compare(
const _CharT* __s)
const _GLIBCXX_NOEXCEPT
2976 __glibcxx_requires_string(__s);
2977 const size_type __size = this->
size();
2978 const size_type __osize = traits_type::length(__s);
2979 const size_type __len =
std::min(__size, __osize);
2980 int __r = traits_type::compare(_M_data(), __s, __len);
2982 __r = _S_compare(__size, __osize);
3008 compare(size_type __pos, size_type __n1,
const _CharT* __s)
const
3010 __glibcxx_requires_string(__s);
3011 _M_check(__pos,
"basic_string::compare");
3012 __n1 = _M_limit(__pos, __n1);
3013 const size_type __osize = traits_type::length(__s);
3014 const size_type __len =
std::min(__n1, __osize);
3015 int __r = traits_type::compare(_M_data() + __pos, __s, __len);
3017 __r = _S_compare(__n1, __osize);
3046 compare(size_type __pos, size_type __n1,
const _CharT* __s,
3047 size_type __n2)
const
3049 __glibcxx_requires_string_len(__s, __n2);
3050 _M_check(__pos,
"basic_string::compare");
3051 __n1 = _M_limit(__pos, __n1);
3052 const size_type __len =
std::min(__n1, __n2);
3053 int __r = traits_type::compare(_M_data() + __pos, __s, __len);
3055 __r = _S_compare(__n1, __n2);
3059#if __cplusplus > 201703L
3062 {
return __sv_type(this->
data(), this->
size()).starts_with(__x); }
3065 starts_with(_CharT __x)
const noexcept
3066 {
return __sv_type(this->
data(), this->
size()).starts_with(__x); }
3068 [[__gnu__::__nonnull__]]
3070 starts_with(
const _CharT* __x)
const noexcept
3071 {
return __sv_type(this->
data(), this->
size()).starts_with(__x); }
3074 ends_with(basic_string_view<_CharT, _Traits> __x)
const noexcept
3075 {
return __sv_type(this->
data(), this->
size()).ends_with(__x); }
3078 ends_with(_CharT __x)
const noexcept
3079 {
return __sv_type(this->
data(), this->
size()).ends_with(__x); }
3081 [[__gnu__::__nonnull__]]
3083 ends_with(
const _CharT* __x)
const noexcept
3084 {
return __sv_type(this->
data(), this->
size()).ends_with(__x); }
3087#if __cplusplus > 202011L
3089 contains(basic_string_view<_CharT, _Traits> __x)
const noexcept
3090 {
return __sv_type(this->
data(), this->
size()).contains(__x); }
3093 contains(_CharT __x)
const noexcept
3094 {
return __sv_type(this->
data(), this->
size()).contains(__x); }
3096 [[__gnu__::__nonnull__]]
3098 contains(
const _CharT* __x)
const noexcept
3099 {
return __sv_type(this->
data(), this->
size()).contains(__x); }
3102# ifdef _GLIBCXX_TM_TS_INTERNAL
3104 ::_txnal_cow_string_C1_for_exceptions(
void* that,
const char* s,
3107 ::_txnal_cow_string_c_str(
const void *that);
3109 ::_txnal_cow_string_D1(
void *that);
3111 ::_txnal_cow_string_D1_commit(
void *that);
3115 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3116 const typename basic_string<_CharT, _Traits, _Alloc>::size_type
3118 _Rep::_S_max_size = (((npos -
sizeof(_Rep_base))/
sizeof(_CharT)) - 1) / 4;
3120 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3123 _Rep::_S_terminal = _CharT();
3125 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3126 const typename basic_string<_CharT, _Traits, _Alloc>::size_type
3131 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3132 typename basic_string<_CharT, _Traits, _Alloc>::size_type
3133 basic_string<_CharT, _Traits, _Alloc>::_Rep::_S_empty_rep_storage[
3134 (
sizeof(_Rep_base) +
sizeof(_CharT) +
sizeof(
size_type) - 1) /
3141 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3142 template<
typename _InIterator>
3145 _S_construct(_InIterator __beg, _InIterator __end,
const _Alloc& __a,
3148#if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
3149 if (__beg == __end && __a == _Alloc())
3150 return _S_empty_rep()._M_refdata();
3155 while (__beg != __end && __len <
sizeof(__buf) /
sizeof(_CharT))
3157 __buf[__len++] = *__beg;
3160 _Rep* __r = _Rep::_S_create(__len,
size_type(0), __a);
3161 _M_copy(__r->_M_refdata(), __buf, __len);
3164 while (__beg != __end)
3166 if (__len == __r->_M_capacity)
3169 _Rep* __another = _Rep::_S_create(__len + 1, __len, __a);
3170 _M_copy(__another->_M_refdata(), __r->_M_refdata(), __len);
3171 __r->_M_destroy(__a);
3174 __r->_M_refdata()[__len++] = *__beg;
3180 __r->_M_destroy(__a);
3181 __throw_exception_again;
3183 __r->_M_set_length_and_sharable(__len);
3184 return __r->_M_refdata();
3187 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3188 template <
typename _InIterator>
3191 _S_construct(_InIterator __beg, _InIterator __end,
const _Alloc& __a,
3194#if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
3195 if (__beg == __end && __a == _Alloc())
3196 return _S_empty_rep()._M_refdata();
3199 if (__gnu_cxx::__is_null_pointer(__beg) && __beg != __end)
3200 __throw_logic_error(__N(
"basic_string::_S_construct null not valid"));
3205 _Rep* __r = _Rep::_S_create(__dnew,
size_type(0), __a);
3207 { _S_copy_chars(__r->_M_refdata(), __beg, __end); }
3210 __r->_M_destroy(__a);
3211 __throw_exception_again;
3213 __r->_M_set_length_and_sharable(__dnew);
3214 return __r->_M_refdata();
3217 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3222#if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
3223 if (__n == 0 && __a == _Alloc())
3224 return _S_empty_rep()._M_refdata();
3227 _Rep* __r = _Rep::_S_create(__n,
size_type(0), __a);
3229 _M_assign(__r->_M_refdata(), __n, __c);
3231 __r->_M_set_length_and_sharable(__n);
3232 return __r->_M_refdata();
3235 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3238 : _M_dataplus(_S_construct(__str._M_data()
3239 + __str._M_check(__pos,
3240 "basic_string::basic_string"),
3241 __str._M_data() + __str._M_limit(__pos, npos)
3245 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3248 : _M_dataplus(_S_construct(__str._M_data()
3249 + __str._M_check(__pos,
3250 "basic_string::basic_string"),
3251 __str._M_data() + __str._M_limit(__pos, __n)
3252 + __pos, _Alloc()), _Alloc())
3255 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3259 : _M_dataplus(_S_construct(__str._M_data()
3260 + __str._M_check(__pos,
3261 "basic_string::basic_string"),
3262 __str._M_data() + __str._M_limit(__pos, __n)
3266 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3271 if (_M_rep() != __str._M_rep())
3274 const allocator_type __a = this->get_allocator();
3275 _CharT* __tmp = __str._M_rep()->_M_grab(__a, __str.get_allocator());
3276 _M_rep()->_M_dispose(__a);
3282 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3287 __glibcxx_requires_string_len(__s, __n);
3288 _M_check_length(this->
size(), __n,
"basic_string::assign");
3289 if (_M_disjunct(__s) || _M_rep()->_M_is_shared())
3290 return _M_replace_safe(
size_type(0), this->
size(), __s, __n);
3294 const size_type __pos = __s - _M_data();
3296 _M_copy(_M_data(), __s, __n);
3298 _M_move(_M_data(), __s, __n);
3299 _M_rep()->_M_set_length_and_sharable(__n);
3304 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3311 _M_check_length(
size_type(0), __n,
"basic_string::append");
3313 if (__len > this->capacity() || _M_rep()->_M_is_shared())
3314 this->reserve(__len);
3315 _M_assign(_M_data() + this->
size(), __n, __c);
3316 _M_rep()->_M_set_length_and_sharable(__len);
3321 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3326 __glibcxx_requires_string_len(__s, __n);
3329 _M_check_length(
size_type(0), __n,
"basic_string::append");
3331 if (__len > this->capacity() || _M_rep()->_M_is_shared())
3333 if (_M_disjunct(__s))
3334 this->reserve(__len);
3337 const size_type __off = __s - _M_data();
3338 this->reserve(__len);
3339 __s = _M_data() + __off;
3342 _M_copy(_M_data() + this->
size(), __s, __n);
3343 _M_rep()->_M_set_length_and_sharable(__len);
3348 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3357 if (__len > this->capacity() || _M_rep()->_M_is_shared())
3358 this->reserve(__len);
3359 _M_copy(_M_data() + this->
size(), __str._M_data(), __size);
3360 _M_rep()->_M_set_length_and_sharable(__len);
3365 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3370 __str._M_check(__pos,
"basic_string::append");
3371 __n = __str._M_limit(__pos, __n);
3375 if (__len > this->capacity() || _M_rep()->_M_is_shared())
3376 this->reserve(__len);
3377 _M_copy(_M_data() + this->
size(), __str._M_data() + __pos, __n);
3378 _M_rep()->_M_set_length_and_sharable(__len);
3383 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3388 __glibcxx_requires_string_len(__s, __n);
3389 _M_check(__pos,
"basic_string::insert");
3390 _M_check_length(
size_type(0), __n,
"basic_string::insert");
3391 if (_M_disjunct(__s) || _M_rep()->_M_is_shared())
3392 return _M_replace_safe(__pos,
size_type(0), __s, __n);
3396 const size_type __off = __s - _M_data();
3397 _M_mutate(__pos, 0, __n);
3398 __s = _M_data() + __off;
3399 _CharT* __p = _M_data() + __pos;
3400 if (__s + __n <= __p)
3401 _M_copy(__p, __s, __n);
3402 else if (__s >= __p)
3403 _M_copy(__p, __s + __n, __n);
3407 _M_copy(__p, __s, __nleft);
3408 _M_copy(__p + __nleft, __p + __n, __n - __nleft);
3414 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3415 typename basic_string<_CharT, _Traits, _Alloc>::iterator
3417 erase(iterator __first, iterator __last)
3419 _GLIBCXX_DEBUG_PEDASSERT(__first >= _M_ibegin() && __first <= __last
3420 && __last <= _M_iend());
3425 const size_type __size = __last - __first;
3428 const size_type __pos = __first - _M_ibegin();
3429 _M_mutate(__pos, __size, size_type(0));
3430 _M_rep()->_M_set_leaked();
3431 return iterator(_M_data() + __pos);
3437 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3443 __glibcxx_requires_string_len(__s, __n2);
3444 _M_check(__pos,
"basic_string::replace");
3445 __n1 = _M_limit(__pos, __n1);
3446 _M_check_length(__n1, __n2,
"basic_string::replace");
3448 if (_M_disjunct(__s) || _M_rep()->_M_is_shared())
3449 return _M_replace_safe(__pos, __n1, __s, __n2);
3450 else if ((__left = __s + __n2 <= _M_data() + __pos)
3451 || _M_data() + __pos + __n1 <= __s)
3455 __left ? __off : (__off += __n2 - __n1);
3456 _M_mutate(__pos, __n1, __n2);
3457 _M_copy(_M_data() + __pos, _M_data() + __off, __n2);
3463 const basic_string __tmp(__s, __n2);
3464 return _M_replace_safe(__pos, __n1, __tmp._M_data(), __n2);
3468 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3473 const size_type __size =
sizeof(_Rep_base)
3474 + (this->_M_capacity + 1) *
sizeof(_CharT);
3475 _Raw_bytes_alloc(__a).deallocate(
reinterpret_cast<char*
>(
this), __size);
3478 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3490 if (_M_rep()->_M_is_shared())
3492 _M_rep()->_M_set_leaked();
3495 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3501 const size_type __new_size = __old_size + __len2 - __len1;
3502 const size_type __how_much = __old_size - __pos - __len1;
3504 if (__new_size > this->capacity() || _M_rep()->_M_is_shared())
3507 const allocator_type __a = get_allocator();
3508 _Rep* __r = _Rep::_S_create(__new_size, this->capacity(), __a);
3511 _M_copy(__r->_M_refdata(), _M_data(), __pos);
3513 _M_copy(__r->_M_refdata() + __pos + __len2,
3514 _M_data() + __pos + __len1, __how_much);
3516 _M_rep()->_M_dispose(__a);
3517 _M_data(__r->_M_refdata());
3519 else if (__how_much && __len1 != __len2)
3522 _M_move(_M_data() + __pos + __len2,
3523 _M_data() + __pos + __len1, __how_much);
3525 _M_rep()->_M_set_length_and_sharable(__new_size);
3528 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3533 const size_type __capacity =
capacity();
3539 if (__res <= __capacity)
3541 if (!_M_rep()->_M_is_shared())
3549 _CharT* __tmp = _M_rep()->_M_clone(__a, __res - this->
size());
3550 _M_rep()->_M_dispose(__a);
3554 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3560 if (_M_rep()->_M_is_leaked())
3561 _M_rep()->_M_set_sharable();
3562 if (__s._M_rep()->_M_is_leaked())
3563 __s._M_rep()->_M_set_sharable();
3566 _CharT* __tmp = _M_data();
3567 _M_data(__s._M_data());
3574 __s.get_allocator());
3575 const basic_string __tmp2(__s._M_ibegin(), __s._M_iend(),
3576 this->get_allocator());
3582 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3583 typename basic_string<_CharT, _Traits, _Alloc>::_Rep*
3586 const _Alloc& __alloc)
3590 if (__capacity > _S_max_size)
3591 __throw_length_error(__N(
"basic_string::_S_create"));
3617 const size_type __malloc_header_size = 4 *
sizeof(
void*);
3625 if (__capacity > __old_capacity && __capacity < 2 * __old_capacity)
3626 __capacity = 2 * __old_capacity;
3631 size_type __size = (__capacity + 1) *
sizeof(_CharT) +
sizeof(_Rep);
3633 const size_type __adj_size = __size + __malloc_header_size;
3634 if (__adj_size > __pagesize && __capacity > __old_capacity)
3636 const size_type __extra = __pagesize - __adj_size % __pagesize;
3637 __capacity += __extra /
sizeof(_CharT);
3639 if (__capacity > _S_max_size)
3640 __capacity = _S_max_size;
3641 __size = (__capacity + 1) *
sizeof(_CharT) +
sizeof(_Rep);
3646 void* __place = _Raw_bytes_alloc(__alloc).
allocate(__size);
3647 _Rep *__p =
new (__place) _Rep;
3648 __p->_M_capacity = __capacity;
3656 __p->_M_set_sharable();
3660 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3663 _M_clone(
const _Alloc& __alloc, size_type __res)
3666 const size_type __requested_cap = this->_M_length + __res;
3667 _Rep* __r = _Rep::_S_create(__requested_cap, this->_M_capacity,
3669 if (this->_M_length)
3670 _M_copy(__r->_M_refdata(), _M_refdata(), this->_M_length);
3672 __r->_M_set_length_and_sharable(this->_M_length);
3673 return __r->_M_refdata();
3676 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3679 resize(size_type __n, _CharT __c)
3681 const size_type __size = this->
size();
3682 _M_check_length(__size, __n,
"basic_string::resize");
3684 this->
append(__n - __size, __c);
3685 else if (__n < __size)
3690 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3691 template<
typename _InputIterator>
3695 _InputIterator __k2, __false_type)
3699 _M_check_length(__n1, __s.size(),
"basic_string::_M_replace_dispatch");
3700 return _M_replace_safe(__i1 - _M_ibegin(), __n1, __s._M_data(),
3704 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3706 basic_string<_CharT, _Traits, _Alloc>::
3707 _M_replace_aux(size_type __pos1, size_type __n1, size_type __n2,
3710 _M_check_length(__n1, __n2,
"basic_string::_M_replace_aux");
3711 _M_mutate(__pos1, __n1, __n2);
3713 _M_assign(_M_data() + __pos1, __n2, __c);
3717 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3723 _M_mutate(__pos1, __n1, __n2);
3725 _M_copy(_M_data() + __pos1, __s, __n2);
3729 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3739 _CharT* __tmp = _M_rep()->_M_clone(__a);
3740 _M_rep()->_M_dispose(__a);
3750 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3751 typename basic_string<_CharT, _Traits, _Alloc>::size_type
3753 copy(_CharT* __s, size_type __n, size_type __pos)
const
3755 _M_check(__pos,
"basic_string::copy");
3756 __n = _M_limit(__pos, __n);
3757 __glibcxx_requires_string_len(__s, __n);
3759 _M_copy(__s, _M_data() + __pos, __n);
3764#ifdef __glibcxx_string_resize_and_overwrite
3765 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3766 template<
typename _Operation>
3767 [[__gnu__::__always_inline__]]
3771 { resize_and_overwrite<_Operation&>(__n, __op); }
3774#if __cplusplus >= 201103L
3775 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3776 template<
typename _Operation>
3779#ifdef __glibcxx_string_resize_and_overwrite
3780 resize_and_overwrite(
const size_type __n, _Operation __op)
3785 const size_type __capacity =
capacity();
3787 if (__n > __capacity || _M_rep()->_M_is_shared())
3790 struct _Terminator {
3791 ~_Terminator() { _M_this->_M_rep()->_M_set_length_and_sharable(_M_r); }
3792 basic_string* _M_this;
3795 _Terminator __term{
this, 0};
3796 auto __r =
std::move(__op)(__p + 0, __n + 0);
3797#ifdef __cpp_lib_concepts
3798 static_assert(ranges::__detail::__is_integer_like<
decltype(__r)>);
3800 static_assert(__gnu_cxx::__is_integer_nonstrict<
decltype(__r)>::__value,
3801 "resize_and_overwrite operation must return an integer");
3803 _GLIBCXX_DEBUG_ASSERT(__r >= 0 && size_type(__r) <= __n);
3804 __term._M_r = size_type(__r);
3805 if (__term._M_r > __n)
3806 __builtin_unreachable();
3811_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.
A non-owning reference to a string.
static constexpr pointer allocate(_Alloc &__a, size_type __n)
Allocate memory.
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
basic_string & insert(size_type __pos, const _CharT *__s, size_type __n)
Insert a C substring.
void swap(basic_string &__s) noexcept(/*conditional */)
Swap contents with another string.
basic_string & operator=(const _CharT *__s)
Copy contents of s into this string.
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.
constexpr basic_string() noexcept(/*conditional */)
Default constructor creates an empty 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.
basic_string & append(size_type __n, _CharT __c)
Append multiple characters.
size_type find_first_of(const basic_string &__str, size_type __pos=0) const noexcept
Find position of a character of string.
constexpr size_type size() const noexcept
Returns the number of characters in the string, not including any null-termination.
iterator erase(iterator __first, iterator __last)
Remove a range of characters.
constexpr void clear() noexcept
const _CharT * data() const noexcept
Return const pointer to contents.
size_type find_last_of(const _CharT *__s, size_type __pos, size_type __n) const noexcept
Find last position of a character of C substring.
basic_string(const _Alloc &__a)
Construct an empty string using allocator a.
constexpr 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.
size_type find_last_of(const _CharT *__s, size_type __pos=npos) const noexcept
Find last position of a character of C string.
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.
void __resize_and_overwrite(size_type __n, _Operation __op)
Non-standard version of resize_and_overwrite for C++11 and above.
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.
void reserve(size_type __res_arg)
Attempt to preallocate enough memory for specified number of characters.
iterator erase(iterator __position)
Remove one character.
constexpr 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.
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.
size_type copy(_CharT *__s, size_type __n, size_type __pos=0) const
Copy substring into C string.
int compare(size_type __pos, size_type __n, const basic_string &__str) const
Compare substring to a string.
constexpr const _CharT * data() const noexcept
Return const pointer to contents.
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.
constexpr basic_string substr(size_type __pos=0, size_type __n=npos) const
Get a substring.
basic_string & assign(const _CharT *__s, size_type __n)
Set value to a C substring.
int compare(size_type __pos, size_type __n1, const _CharT *__s, size_type __n2) const
Compare substring against a character array.
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.
constexpr basic_string & assign(const basic_string &__str)
Set value to contents of another string.
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.
constexpr size_type length() const noexcept
basic_string(const basic_string &__str, size_type __pos, size_type __n, const _Alloc &__a)
Construct string as copy of a 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.
void pop_back()
Remove the last character.
basic_string(basic_string &&__str) noexcept
Move construct string.
constexpr 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.
size_type find_first_not_of(_CharT __c, size_type __pos=0) const noexcept
Find position of a different character.
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.
constexpr size_type find_first_of(const basic_string &__str, size_type __pos=0) const noexcept
Find position of a character of 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.
_CharT * data() noexcept(false)
Return non-const pointer to contents.
size_type find(_CharT __c, size_type __pos=0) const noexcept
Find position of a character.
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
constexpr void __resize_and_overwrite(size_type __n, _Operation __op)
Non-standard version of resize_and_overwrite for C++11 and above.
basic_string & replace(size_type __pos, size_type __n1, const _CharT *__s, size_type __n2)
Replace characters with value of a C substring.
size_type find_last_of(_CharT __c, size_type __pos=npos) const noexcept
Find last position of a character.
constexpr size_type rfind(const basic_string &__str, size_type __pos=npos) const noexcept
Find last position of a string.
constexpr 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.
constexpr basic_string & operator=(const basic_string &__str)
Assign the value of str to this string.
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
constexpr size_type find_last_of(const basic_string &__str, size_type __pos=npos) const noexcept
Find last position of a character of string.
size_type find_last_not_of(_CharT __c, size_type __pos=npos) const noexcept
Find last position of a different character.
constexpr iterator end() noexcept
constexpr iterator begin() noexcept
basic_string & append(const _CharT *__s, size_type __n)
Append a C substring.
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(const basic_string &__str, size_type __pos, size_type __n=npos)
Append a substring.
basic_string & append(_InputIterator __first, _InputIterator __last)
Append a range of characters.
basic_string & assign(const basic_string &__str)
Set value to contents of another string.
basic_string(const _CharT *__s, const _Alloc &__a=_Alloc())
Construct string as copy of a C string.
constexpr void push_back(_CharT __c)
Append a single character.
size_type find_first_of(_CharT __c, size_type __pos=0) const noexcept
Find position of a character.
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
constexpr size_type find_first_not_of(const basic_string &__str, size_type __pos=0) const noexcept
Find position of a character not in string.
basic_string & insert(size_type __pos, const _CharT *__s)
Insert a C string.
constexpr iterator insert(const_iterator __p, size_type __n, _CharT __c)
Insert multiple characters.
basic_string & assign(const basic_string &__str, size_type __pos, size_type __n=npos)
Set value to a substring of a string.
constexpr size_type capacity() const noexcept
const _CharT * c_str() const noexcept
Return const pointer to null-terminated contents.
basic_string & replace(size_type __pos, size_type __n1, const _CharT *__s)
Replace characters with value of a C string.
constexpr bool empty() const noexcept
size_type find(const _CharT *__s, size_type __pos, size_type __n) const noexcept
Find position of a C substring.
static const size_type npos
Value returned by various member functions when they fail.
constexpr basic_string & erase(size_type __pos=0, size_type __n=npos)
Remove characters.
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 & append(const basic_string &__str)
Append a string to this string.
size_type find_first_not_of(const _CharT *__s, size_type __pos, size_type __n) const noexcept
Find position of a character not in C substring.
basic_string & replace(size_type __pos, size_type __n1, size_type __n2, _CharT __c)
Replace characters with multiple characters.
const_iterator cbegin() const noexcept
constexpr allocator_type get_allocator() const noexcept
constexpr basic_string & replace(size_type __pos, size_type __n, const basic_string &__str)
Replace characters with value from another string.
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.
size_type find_first_of(const _CharT *__s, size_type __pos, size_type __n) const noexcept
Find position of a character of C substring.
void insert(iterator __p, _InputIterator __beg, _InputIterator __end)
Insert a range of characters.
constexpr int compare(const basic_string &__str) const
Compare to a string.
size_type find_first_of(const _CharT *__s, size_type __pos=0) const noexcept
Find position of a character of C string.
size_type rfind(_CharT __c, size_type __pos=npos) const noexcept
Find last position of a character.
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.
constexpr size_type max_size() const noexcept
Returns the size() of the largest possible string.
basic_string(const _CharT *__s, size_type __n, const _Alloc &__a=_Alloc())
Construct string initialized by a character array.
constexpr void swap(basic_string &__s) noexcept
Swap contents with another string.
basic_string & append(const _CharT *__s)
Append a C string.
constexpr const_reference operator[](size_type __pos) const noexcept
Subscript access to the data contained in the string.
basic_string & replace(size_type __pos, size_type __n, const basic_string &__str)
Replace characters with value from another string.
size_type rfind(const _CharT *__s, size_type __pos, size_type __n) const noexcept
Find last position of a C substring.
constexpr basic_string & operator+=(const basic_string &__str)
Append a string to this 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.
size_type find_last_not_of(const _CharT *__s, size_type __pos, size_type __n) const noexcept
Find last position of a character not in C substring.
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.
Forward iterators support a superset of input iterator operations.