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>
111 rebind<_CharT>::other _CharT_alloc_type;
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;
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>
138 typedef iterator __const_iterator;
158 size_type _M_capacity;
159 _Atomic_word _M_refcount;
162 struct _Rep : _Rep_base
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[];
194 void* __p =
reinterpret_cast<void*
>(&_S_empty_rep_storage);
195 return *
reinterpret_cast<_Rep*
>(__p);
201#if defined(__GTHREADS)
208 return this->_M_refcount < 0;
215#if defined(__GTHREADS)
221 if (!__gnu_cxx::__is_single_threaded())
224 return this->_M_refcount > 0;
229 { this->_M_refcount = -1; }
233 { this->_M_refcount = 0; }
238#if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
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); }
258 ? _M_refcopy() : _M_clone(
__alloc1);
263 _S_create(size_type, size_type,
const _Alloc&);
268#if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
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
300 __gnu_cxx::__atomic_add_dispatch(&this->_M_refcount, 1);
305 _M_clone(
const _Alloc&, size_type
__res = 0);
309 struct _Alloc_hider : _Alloc
312 : _Alloc(__a), _M_p(
__dat) { }
322 static const size_type
npos =
static_cast<size_type
>(-1);
326 mutable _Alloc_hider _M_dataplus;
330 {
return _M_dataplus._M_p; }
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,
static_cast<_CharT
>(*__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
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)
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>>
613 : _M_dataplus(_S_construct(__n, __c, __a), __a)
616#if __cplusplus >= 201103L
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;
642#if __glibcxx_containers_ranges
647 template<__detail::__container_compatible_range<_CharT> _Rg>
651 if constexpr (ranges::forward_range<_Rg> || ranges::sized_range<_Rg>)
653 const auto __n =
static_cast<size_type
>(ranges::distance(
__rg));
658 pointer __p = _M_data();
659 if constexpr (
requires {
660 requires ranges::contiguous_range<_Rg>;
662 -> convertible_to<const _CharT*>;
667 auto __first = ranges::begin(__rg);
668 const auto __last = ranges::end(__rg);
669 for (; __first != __last; ++__first)
670 traits_type::assign(*__p++,
static_cast<_CharT
>(*__first));
672 _M_rep()->_M_set_length_and_sharable(__n);
676 auto __first = ranges::begin(__rg);
677 const auto __last = ranges::end(__rg);
678 for (; __first != __last; ++__first)
698 : _M_dataplus(__str._M_data(), __a)
702#if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
703 __str._M_data(_S_empty_rep()._M_refdata());
705 __str._M_data(_S_construct(size_type(), _CharT(), __a));
709 _M_dataplus._M_p = _S_construct(__str.
begin(), __str.
end(), __a);
713#if __cplusplus >= 202100L
724 template<
class _InputIterator>
726 const _Alloc& __a = _Alloc())
727 : _M_dataplus(_S_construct(
__beg, __end, __a), __a)
730#ifdef __glibcxx_string_view
738 template<
typename _Tp,
741 const _Alloc& __a = _Alloc())
749 template<
typename _Tp,
typename = _If_sv<_Tp,
void>>
751 basic_string(
const _Tp& __t,
const _Alloc& __a = _Alloc())
752 :
basic_string(__sv_wrapper(_S_to_string_view(__t)), __a) { }
767 {
return this->
assign(__str); }
775 {
return this->
assign(__s); }
791#if __cplusplus >= 201103L
820#ifdef __glibcxx_string_view
825 template<
typename _Tp>
828 {
return this->
assign(__svt); }
834 operator __sv_type() const noexcept
835 {
return __sv_type(
data(),
size()); }
847 return iterator(_M_data());
856 {
return const_iterator(_M_data()); }
866 return iterator(_M_data() + this->
size());
875 {
return const_iterator(_M_data() + this->
size()); }
891 const_reverse_iterator
909 const_reverse_iterator
913#if __cplusplus >= 201103L
920 {
return const_iterator(this->_M_data()); }
928 {
return const_iterator(this->_M_data() + this->
size()); }
935 const_reverse_iterator
944 const_reverse_iterator
957#if _GLIBCXX_FULLY_DYNAMIC_STRING == 0 && __OPTIMIZE__
958 if (_S_empty_rep()._M_length != 0)
961 return _M_rep()->_M_length;
973 {
return _Rep::_S_max_size; }
1000 { this->
resize(__n, _CharT()); }
1002#if __cplusplus >= 201103L
1003#pragma GCC diagnostic push
1004#pragma GCC diagnostic ignored "-Wdeprecated-declarations"
1009#pragma GCC diagnostic pop
1012#ifdef __glibcxx_string_resize_and_overwrite
1042 template<
typename _Operation>
1047#if __cplusplus >= 201103L
1049 template<
typename _Operation>
1060 {
return _M_rep()->_M_capacity; }
1083#if __cplusplus > 201703L
1084 [[deprecated(
"use shrink_to_fit() instead")]]
1092#if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
1096 if (_M_rep()->_M_is_shared())
1099 _M_data(_S_empty_rep()._M_refdata());
1102 _M_rep()->_M_set_length_and_sharable(0);
1108 { _M_mutate(0, this->
size(), 0); }
1115 _GLIBCXX_NODISCARD
bool
1117 {
return this->
size() == 0; }
1134 return _M_data()[
__pos];
1156 return _M_data()[
__pos];
1172 if (__n >= this->
size())
1173 __throw_out_of_range_fmt(__N(
"basic_string::at: __n "
1174 "(which is %zu) >= this->size() "
1177 return _M_data()[__n];
1195 __throw_out_of_range_fmt(__N(
"basic_string::at: __n "
1196 "(which is %zu) >= this->size() "
1200 return _M_data()[__n];
1203#if __cplusplus >= 201103L
1211 __glibcxx_assert(!
empty());
1222 __glibcxx_assert(!
empty());
1233 __glibcxx_assert(!
empty());
1244 __glibcxx_assert(!
empty());
1257 {
return this->
append(__str); }
1266 {
return this->
append(__s); }
1280#if __cplusplus >= 201103L
1288 {
return this->
append(__l.begin(),
__l.size()); }
1291#ifdef __glibcxx_string_view
1297 template<
typename _Tp>
1300 {
return this->
append(__svt); }
1344 __glibcxx_requires_string(
__s);
1345 return this->
append(__s, traits_type::length(
__s));
1359#if __glibcxx_containers_ranges
1364 template<__detail::__container_compatible_range<_CharT> _Rg>
1375#if __cplusplus >= 201103L
1383 {
return this->
append(__l.begin(),
__l.size()); }
1394 template<
class _InputIterator>
1397 {
return this->
replace(_M_iend(), _M_iend(), __first, __last); }
1399#ifdef __glibcxx_string_view
1405 template<
typename _Tp>
1410 return this->
append(__sv.data(),
__sv.size());
1421 template<
typename _Tp>
1422 _If_sv<_Tp, basic_string&>
1423 append(
const _Tp& __svt, size_type __pos, size_type __n =
npos)
1425 __sv_type __sv = __svt;
1426 return append(__sv.data()
1427 + std::__sv_check(__sv.size(), __pos,
"basic_string::append"),
1428 std::__sv_limit(__sv.size(), __pos, __n));
1439 const size_type
__len = 1 + this->
size();
1440 if (__len > this->
capacity() || _M_rep()->_M_is_shared())
1442 traits_type::assign(_M_data()[this->
size()], __c);
1443 _M_rep()->_M_set_length_and_sharable(
__len);
1454#if __cplusplus >= 201103L
1487 {
return this->
assign(__str._M_data()
1488 +
__str._M_check(
__pos,
"basic_string::assign"),
1516 __glibcxx_requires_string(
__s);
1517 return this->
assign(__s, traits_type::length(
__s));
1531 {
return _M_replace_aux(size_type(0), this->
size(), __n, __c); }
1541 template<
class _InputIterator>
1544 {
return this->
replace(_M_ibegin(), _M_iend(), __first, __last); }
1546#if __glibcxx_containers_ranges
1551 template<__detail::__container_compatible_range<_CharT> _Rg>
1562#if __cplusplus >= 201103L
1570 {
return this->
assign(__l.begin(),
__l.size()); }
1573#ifdef __glibcxx_string_view
1579 template<
typename _Tp>
1584 return this->
assign(__sv.data(),
__sv.size());
1594 template<
typename _Tp>
1595 _If_sv<_Tp, basic_string&>
1596 assign(
const _Tp& __svt, size_type __pos, size_type __n =
npos)
1598 __sv_type __sv = __svt;
1599 return assign(__sv.data()
1600 + std::__sv_check(__sv.size(), __pos,
"basic_string::assign"),
1601 std::__sv_limit(__sv.size(), __pos, __n));
1619 insert(iterator __p, size_type __n, _CharT __c)
1620 { this->
replace(__p, __p, __n, __c); }
1634 template<
class _InputIterator>
1639#if __glibcxx_containers_ranges
1644 template<__detail::__container_compatible_range<_CharT> _Rg>
1650 if constexpr (ranges::forward_range<_Rg>)
1651 if (ranges::empty(
__rg))
1662 return begin() + __pos;
1666#if __cplusplus >= 201103L
1676 _GLIBCXX_DEBUG_PEDASSERT(__p >= _M_ibegin() && __p <= _M_iend());
1677 this->
insert(__p - _M_ibegin(),
__l.begin(),
__l.size());
1759 __glibcxx_requires_string(
__s);
1760 return this->
insert(__pos,
__s, traits_type::length(
__s));
1781 {
return _M_replace_aux(_M_check(
__pos,
"basic_string::insert"),
1782 size_type(0), __n, __c); }
1800 _GLIBCXX_DEBUG_PEDASSERT(__p >= _M_ibegin() && __p <= _M_iend());
1801 const size_type
__pos = __p - _M_ibegin();
1802 _M_replace_aux(
__pos, size_type(0), size_type(1), __c);
1803 _M_rep()->_M_set_leaked();
1804 return iterator(_M_data() +
__pos);
1807#ifdef __glibcxx_string_view
1814 template<
typename _Tp>
1830 template<
typename _Tp>
1831 _If_sv<_Tp, basic_string&>
1832 insert(size_type __pos1,
const _Tp& __svt,
1833 size_type __pos2, size_type __n =
npos)
1835 __sv_type __sv = __svt;
1836 return this->
replace(__pos1, size_type(0), __sv.data()
1837 + std::__sv_check(__sv.size(), __pos2,
"basic_string::insert"),
1838 std::__sv_limit(__sv.size(), __pos2, __n));
1860 _M_mutate(_M_check(
__pos,
"basic_string::erase"),
1861 _M_limit(
__pos, __n), size_type(0));
1876 _GLIBCXX_DEBUG_PEDASSERT(
__position >= _M_ibegin()
1879 _M_mutate(
__pos, size_type(1), size_type(0));
1880 _M_rep()->_M_set_leaked();
1881 return iterator(_M_data() +
__pos);
1894 erase(iterator __first, iterator __last);
1896#if __cplusplus >= 201103L
1905 __glibcxx_assert(!
empty());
1953 +
__str._M_check(
__pos2,
"basic_string::replace"),
1997 __glibcxx_requires_string(
__s);
2020 {
return _M_replace_aux(_M_check(
__pos,
"basic_string::replace"),
2058 _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <=
__i1 &&
__i1 <=
__i2
2059 &&
__i2 <= _M_iend());
2079 __glibcxx_requires_string(
__s);
2100 _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <=
__i1 &&
__i1 <=
__i2
2101 &&
__i2 <= _M_iend());
2102 return _M_replace_aux(
__i1 - _M_ibegin(),
__i2 -
__i1, __n, __c);
2120 template<
class _InputIterator>
2125 _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <=
__i1 &&
__i1 <=
__i2
2126 &&
__i2 <= _M_iend());
2127 __glibcxx_requires_valid_range(
__k1,
__k2);
2128 typedef typename std::__is_integer<_InputIterator>::__type
_Integral;
2137 _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <=
__i1 &&
__i1 <=
__i2
2138 &&
__i2 <= _M_iend());
2139 __glibcxx_requires_valid_range(
__k1,
__k2);
2145 replace(iterator __i1, iterator __i2,
2146 const _CharT* __k1,
const _CharT* __k2)
2148 _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2
2149 && __i2 <= _M_iend());
2150 __glibcxx_requires_valid_range(__k1, __k2);
2151 return this->
replace(__i1 - _M_ibegin(), __i2 - __i1,
2156 replace(iterator __i1, iterator __i2, iterator __k1, iterator __k2)
2158 _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2
2159 && __i2 <= _M_iend());
2160 __glibcxx_requires_valid_range(__k1, __k2);
2161 return this->
replace(__i1 - _M_ibegin(), __i2 - __i1,
2162 __k1.base(), __k2 - __k1);
2166 replace(iterator __i1, iterator __i2,
2167 const_iterator __k1, const_iterator __k2)
2169 _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2
2170 && __i2 <= _M_iend());
2171 __glibcxx_requires_valid_range(__k1, __k2);
2172 return this->
replace(__i1 - _M_ibegin(), __i2 - __i1,
2173 __k1.base(), __k2 - __k1);
2176#if __glibcxx_containers_ranges
2181 template<__detail::__container_compatible_range<_CharT> _Rg>
2183 replace_with_range(const_iterator __i1, const_iterator __i2, _Rg&& __rg)
2197#if __cplusplus >= 201103L
2217#ifdef __glibcxx_string_view
2225 template<
typename _Tp>
2242 template<
typename _Tp>
2243 _If_sv<_Tp, basic_string&>
2244 replace(size_type __pos1, size_type __n1,
const _Tp& __svt,
2245 size_type __pos2, size_type __n2 =
npos)
2247 __sv_type __sv = __svt;
2248 return this->
replace(__pos1, __n1,
2250 + std::__sv_check(__sv.size(), __pos2,
"basic_string::replace"),
2251 std::__sv_limit(__sv.size(), __pos2, __n2));
2263 template<
typename _Tp>
2264 _If_sv<_Tp, basic_string&>
2265 replace(const_iterator __i1, const_iterator __i2,
const _Tp& __svt)
2267 __sv_type __sv = __svt;
2268 return this->
replace(__i1 -
begin(), __i2 - __i1, __sv);
2273 template<
class _Integer>
2275 _M_replace_dispatch(iterator __i1, iterator __i2, _Integer __n,
2276 _Integer __val, __true_type)
2277 {
return _M_replace_aux(__i1 - _M_ibegin(), __i2 - __i1, __n, __val); }
2279 template<
class _InputIterator>
2281 _M_replace_dispatch(iterator __i1, iterator __i2, _InputIterator __k1,
2282 _InputIterator __k2, __false_type);
2285 _M_replace_aux(size_type __pos1, size_type __n1, size_type __n2,
2289 _M_replace_safe(size_type __pos1, size_type __n1,
const _CharT* __s,
2294 template<
class _InIterator>
2296 _S_construct_aux(_InIterator __beg, _InIterator __end,
2297 const _Alloc& __a, __false_type)
2299 typedef typename iterator_traits<_InIterator>::iterator_category _Tag;
2300 return _S_construct(__beg, __end, __a, _Tag());
2305 template<
class _Integer>
2307 _S_construct_aux(_Integer __beg, _Integer __end,
2308 const _Alloc& __a, __true_type)
2309 {
return _S_construct_aux_2(
static_cast<size_type
>(__beg),
2313 _S_construct_aux_2(size_type __req, _CharT __c,
const _Alloc& __a)
2314 {
return _S_construct(__req, __c, __a); }
2316 template<
class _InIterator>
2318 _S_construct(_InIterator __beg, _InIterator __end,
const _Alloc& __a)
2320 typedef typename std::__is_integer<_InIterator>::__type _Integral;
2321 return _S_construct_aux(__beg, __end, __a, _Integral());
2325 template<
class _InIterator>
2327 _S_construct(_InIterator __beg, _InIterator __end,
const _Alloc& __a,
2328 input_iterator_tag);
2332 template<
class _FwdIterator>
2334 _S_construct(_FwdIterator __beg, _FwdIterator __end,
const _Alloc& __a,
2335 forward_iterator_tag);
2338 _S_construct(size_type __req, _CharT __c,
const _Alloc& __a);
2377 {
return _M_data(); }
2389 {
return _M_data(); }
2391#if __cplusplus >= 201703L
2416 {
return _M_dataplus; }
2431 find(
const _CharT*
__s, size_type
__pos, size_type __n)
const
2462 __glibcxx_requires_string(
__s);
2463 return this->
find(__s,
__pos, traits_type::length(
__s));
2479#ifdef __glibcxx_string_view
2486 template<
typename _Tp>
2524 rfind(
const _CharT*
__s, size_type
__pos, size_type __n)
const
2540 __glibcxx_requires_string(
__s);
2557#ifdef __glibcxx_string_view
2564 template<
typename _Tp>
2620 __glibcxx_requires_string(
__s);
2640#ifdef __glibcxx_string_view
2648 template<
typename _Tp>
2704 __glibcxx_requires_string(
__s);
2724#ifdef __glibcxx_string_view
2732 template<
typename _Tp>
2787 __glibcxx_requires_string(
__s);
2805#ifdef __glibcxx_string_view
2813 template<
typename _Tp>
2869 __glibcxx_requires_string(
__s);
2887#ifdef __glibcxx_string_view
2895 template<
typename _Tp>
2920 _M_check(
__pos,
"basic_string::substr"), __n); }
2943 int __r = traits_type::compare(_M_data(),
__str.data(),
__len);
2949#ifdef __glibcxx_string_view
2955 template<
typename _Tp>
2957 compare(
const _Tp&
__svt)
const
2965 int __r = traits_type::compare(_M_data(),
__sv.data(),
__len);
2979 template<
typename _Tp>
2981 compare(size_type __pos, size_type __n,
const _Tp& __svt)
const
2982 noexcept(is_same<_Tp, __sv_type>::value)
2984 __sv_type __sv = __svt;
2985 return __sv_type(*this).substr(__pos, __n).compare(__sv);
2998 template<
typename _Tp>
3000 compare(size_type __pos1, size_type __n1,
const _Tp& __svt,
3001 size_type __pos2, size_type __n2 =
npos)
const
3002 noexcept(is_same<_Tp, __sv_type>::value)
3004 __sv_type __sv = __svt;
3005 return __sv_type(*
this)
3006 .substr(__pos1, __n1).compare(__sv.substr(__pos2, __n2));
3032 _M_check(
__pos,
"basic_string::compare");
3033 __n = _M_limit(
__pos, __n);
3036 int __r = traits_type::compare(_M_data() +
__pos,
__str.data(),
__len);
3038 __r = _S_compare(__n,
__osize);
3069 _M_check(
__pos1,
"basic_string::compare");
3074 int __r = traits_type::compare(_M_data() +
__pos1,
3098 __glibcxx_requires_string(
__s);
3100 const size_type
__osize = traits_type::length(
__s);
3102 int __r = traits_type::compare(_M_data(),
__s,
__len);
3132 __glibcxx_requires_string(
__s);
3133 _M_check(
__pos,
"basic_string::compare");
3135 const size_type
__osize = traits_type::length(
__s);
3137 int __r = traits_type::compare(_M_data() +
__pos,
__s,
__len);
3169 size_type
__n2)
const
3171 __glibcxx_requires_string_len(
__s,
__n2);
3172 _M_check(
__pos,
"basic_string::compare");
3175 int __r = traits_type::compare(_M_data() +
__pos,
__s,
__len);
3181#if __cplusplus > 201703L
3187 starts_with(_CharT __x)
const noexcept
3188 {
return __sv_type(this->
data(), this->
size()).starts_with(__x); }
3190 [[__gnu__::__nonnull__]]
3192 starts_with(
const _CharT* __x)
const noexcept
3193 {
return __sv_type(this->
data(), this->
size()).starts_with(__x); }
3196 ends_with(basic_string_view<_CharT, _Traits> __x)
const noexcept
3197 {
return __sv_type(this->
data(), this->
size()).ends_with(__x); }
3200 ends_with(_CharT __x)
const noexcept
3201 {
return __sv_type(this->
data(), this->
size()).ends_with(__x); }
3203 [[__gnu__::__nonnull__]]
3205 ends_with(
const _CharT* __x)
const noexcept
3206 {
return __sv_type(this->
data(), this->
size()).ends_with(__x); }
3209#if __cplusplus > 202011L
3211 contains(basic_string_view<_CharT, _Traits> __x)
const noexcept
3212 {
return __sv_type(this->
data(), this->
size()).contains(__x); }
3215 contains(_CharT __x)
const noexcept
3216 {
return __sv_type(this->
data(), this->
size()).contains(__x); }
3218 [[__gnu__::__nonnull__]]
3220 contains(
const _CharT* __x)
const noexcept
3221 {
return __sv_type(this->
data(), this->
size()).contains(__x); }
3224# ifdef _GLIBCXX_TM_TS_INTERNAL
3226 ::_txnal_cow_string_C1_for_exceptions(
void* that,
const char* s,
3229 ::_txnal_cow_string_c_str(
const void *that);
3231 ::_txnal_cow_string_D1(
void *that);
3233 ::_txnal_cow_string_D1_commit(
void *that);
3237 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3238 const typename basic_string<_CharT, _Traits, _Alloc>::size_type
3239 basic_string<_CharT, _Traits, _Alloc>::
3240 _Rep::_S_max_size = (((npos -
sizeof(_Rep_base))/
sizeof(_CharT)) - 1) / 4;
3242 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3244 basic_string<_CharT, _Traits, _Alloc>::
3245 _Rep::_S_terminal = _CharT();
3247 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3248 const typename basic_string<_CharT, _Traits, _Alloc>::size_type
3253 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3254 typename basic_string<_CharT, _Traits, _Alloc>::size_type
3255 basic_string<_CharT, _Traits, _Alloc>::_Rep::_S_empty_rep_storage[
3256 (
sizeof(_Rep_base) +
sizeof(_CharT) +
sizeof(size_type) - 1) /
3263 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3264 template<
typename _InIterator>
3266 basic_string<_CharT, _Traits, _Alloc>::
3267 _S_construct(_InIterator __beg, _InIterator __end,
const _Alloc& __a,
3270#if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
3271 if (__beg == __end && __a == _Alloc())
3272 return _S_empty_rep()._M_refdata();
3276 size_type __len = 0;
3277 while (__beg != __end && __len <
sizeof(__buf) /
sizeof(_CharT))
3279 __buf[__len++] = *__beg;
3282 _Rep* __r = _Rep::_S_create(__len, size_type(0), __a);
3283 _M_copy(__r->_M_refdata(), __buf, __len);
3286 while (__beg != __end)
3288 if (__len == __r->_M_capacity)
3291 _Rep* __another = _Rep::_S_create(__len + 1, __len, __a);
3292 _M_copy(__another->_M_refdata(), __r->_M_refdata(), __len);
3293 __r->_M_destroy(__a);
3296 __r->_M_refdata()[__len++] = *__beg;
3302 __r->_M_destroy(__a);
3303 __throw_exception_again;
3305 __r->_M_set_length_and_sharable(__len);
3306 return __r->_M_refdata();
3309 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3310 template <
typename _InIterator>
3312 basic_string<_CharT, _Traits, _Alloc>::
3313 _S_construct(_InIterator __beg, _InIterator __end,
const _Alloc& __a,
3314 forward_iterator_tag)
3316#if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
3317 if (__beg == __end && __a == _Alloc())
3318 return _S_empty_rep()._M_refdata();
3321 if (__gnu_cxx::__is_null_pointer(__beg) && __beg != __end)
3322 __throw_logic_error(__N(
"basic_string::_S_construct null not valid"));
3324 const size_type __dnew =
static_cast<size_type
>(
std::distance(__beg,
3327 _Rep* __r = _Rep::_S_create(__dnew, size_type(0), __a);
3329 { _S_copy_chars(__r->_M_refdata(), __beg, __end); }
3332 __r->_M_destroy(__a);
3333 __throw_exception_again;
3335 __r->_M_set_length_and_sharable(__dnew);
3336 return __r->_M_refdata();
3339 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3341 basic_string<_CharT, _Traits, _Alloc>::
3342 _S_construct(size_type __n, _CharT __c,
const _Alloc& __a)
3344#if _GLIBCXX_FULLY_DYNAMIC_STRING == 0
3345 if (__n == 0 && __a == _Alloc())
3346 return _S_empty_rep()._M_refdata();
3349 _Rep* __r = _Rep::_S_create(__n, size_type(0), __a);
3351 _M_assign(__r->_M_refdata(), __n, __c);
3353 __r->_M_set_length_and_sharable(__n);
3354 return __r->_M_refdata();
3357 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3360 : _M_dataplus(_S_construct(
__str._M_data()
3362 "basic_string::basic_string"),
3367 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3370 : _M_dataplus(_S_construct(
__str._M_data()
3372 "basic_string::basic_string"),
3374 +
__pos, _Alloc()), _Alloc())
3377 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3380 size_type __n,
const _Alloc& __a)
3381 : _M_dataplus(_S_construct(
__str._M_data()
3383 "basic_string::basic_string"),
3388 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3393 if (_M_rep() !=
__str._M_rep())
3396 const allocator_type __a = this->get_allocator();
3398 _M_rep()->_M_dispose(__a);
3404 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3407 assign(
const _CharT*
__s, size_type __n)
3409 __glibcxx_requires_string_len(
__s, __n);
3410 _M_check_length(this->
size(), __n,
"basic_string::assign");
3411 if (_M_disjunct(
__s) || _M_rep()->_M_is_shared())
3412 return _M_replace_safe(size_type(0), this->
size(), __s, __n);
3416 const size_type
__pos =
__s - _M_data();
3418 _M_copy(_M_data(),
__s, __n);
3420 _M_move(_M_data(),
__s, __n);
3421 _M_rep()->_M_set_length_and_sharable(__n);
3426 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3429 append(size_type __n, _CharT __c)
3433 _M_check_length(size_type(0), __n,
"basic_string::append");
3434 const size_type
__len = __n + this->
size();
3435 if (__len > this->capacity() || _M_rep()->_M_is_shared())
3436 this->reserve(
__len);
3437 _M_assign(_M_data() + this->
size(), __n, __c);
3438 _M_rep()->_M_set_length_and_sharable(
__len);
3443 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3446 append(
const _CharT*
__s, size_type __n)
3448 __glibcxx_requires_string_len(
__s, __n);
3451 _M_check_length(size_type(0), __n,
"basic_string::append");
3452 const size_type
__len = __n + this->
size();
3453 if (__len > this->capacity() || _M_rep()->_M_is_shared())
3455 if (_M_disjunct(
__s))
3456 this->reserve(
__len);
3459 const size_type
__off =
__s - _M_data();
3460 this->reserve(
__len);
3464 _M_copy(_M_data() + this->
size(), __s, __n);
3465 _M_rep()->_M_set_length_and_sharable(
__len);
3470 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3479 if (__len > this->capacity() || _M_rep()->_M_is_shared())
3480 this->reserve(
__len);
3481 _M_copy(_M_data() + this->
size(), __str._M_data(),
__size);
3482 _M_rep()->_M_set_length_and_sharable(
__len);
3487 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3492 __str._M_check(
__pos,
"basic_string::append");
3496 const size_type
__len = __n + this->
size();
3497 if (__len > this->capacity() || _M_rep()->_M_is_shared())
3498 this->reserve(
__len);
3499 _M_copy(_M_data() + this->
size(), __str._M_data() +
__pos, __n);
3500 _M_rep()->_M_set_length_and_sharable(
__len);
3505 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3510 __glibcxx_requires_string_len(
__s, __n);
3511 _M_check(
__pos,
"basic_string::insert");
3512 _M_check_length(size_type(0), __n,
"basic_string::insert");
3513 if (_M_disjunct(
__s) || _M_rep()->_M_is_shared())
3514 return _M_replace_safe(
__pos, size_type(0),
__s, __n);
3518 const size_type
__off =
__s - _M_data();
3519 _M_mutate(
__pos, 0, __n);
3521 _CharT* __p = _M_data() +
__pos;
3522 if (
__s + __n <= __p)
3523 _M_copy(__p,
__s, __n);
3524 else if (
__s >= __p)
3525 _M_copy(__p,
__s + __n, __n);
3536 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3537 typename basic_string<_CharT, _Traits, _Alloc>::iterator
3539 erase(iterator __first, iterator __last)
3541 _GLIBCXX_DEBUG_PEDASSERT(__first >= _M_ibegin() && __first <= __last
3542 && __last <= _M_iend());
3547 const size_type
__size = __last - __first;
3550 const size_type
__pos = __first - _M_ibegin();
3552 _M_rep()->_M_set_leaked();
3553 return iterator(_M_data() +
__pos);
3559 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3565 __glibcxx_requires_string_len(
__s,
__n2);
3566 _M_check(
__pos,
"basic_string::replace");
3568 _M_check_length(
__n1,
__n2,
"basic_string::replace");
3570 if (_M_disjunct(
__s) || _M_rep()->_M_is_shared())
3590 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3595 const size_type
__size =
sizeof(_Rep_base)
3596 + (this->_M_capacity + 1) *
sizeof(_CharT);
3597 _Raw_bytes_alloc(__a).deallocate(
reinterpret_cast<char*
>(
this),
__size);
3600 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3602 basic_string<_CharT, _Traits, _Alloc>::
3612 if (_M_rep()->_M_is_shared())
3614 _M_rep()->_M_set_leaked();
3617 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3619 basic_string<_CharT, _Traits, _Alloc>::
3620 _M_mutate(size_type __pos, size_type __len1, size_type __len2)
3622 const size_type __old_size = this->
size();
3623 const size_type __new_size = __old_size + __len2 - __len1;
3624 const size_type __how_much = __old_size - __pos - __len1;
3626 if (__new_size > this->capacity() || _M_rep()->_M_is_shared())
3629 const allocator_type __a = get_allocator();
3630 _Rep* __r = _Rep::_S_create(__new_size, this->capacity(), __a);
3633 _M_copy(__r->_M_refdata(), _M_data(), __pos);
3635 _M_copy(__r->_M_refdata() + __pos + __len2,
3636 _M_data() + __pos + __len1, __how_much);
3638 _M_rep()->_M_dispose(__a);
3639 _M_data(__r->_M_refdata());
3641 else if (__how_much && __len1 != __len2)
3644 _M_move(_M_data() + __pos + __len2,
3645 _M_data() + __pos + __len1, __how_much);
3647 _M_rep()->_M_set_length_and_sharable(__new_size);
3650 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3663 if (!_M_rep()->_M_is_shared())
3670 const allocator_type __a = get_allocator();
3672 _M_rep()->_M_dispose(__a);
3676 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3682 if (_M_rep()->_M_is_leaked())
3683 _M_rep()->_M_set_sharable();
3684 if (
__s._M_rep()->_M_is_leaked())
3685 __s._M_rep()->_M_set_sharable();
3686 if (this->get_allocator() ==
__s.get_allocator())
3688 _CharT*
__tmp = _M_data();
3689 _M_data(
__s._M_data());
3696 __s.get_allocator());
3698 this->get_allocator());
3704 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3713 __throw_length_error(__N(
"basic_string::_S_create"));
3768 void* __place = _Raw_bytes_alloc(__alloc).allocate(__size);
3769 _Rep *__p =
new (__place) _Rep;
3770 __p->_M_capacity = __capacity;
3778 __p->_M_set_sharable();
3782 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3784 basic_string<_CharT, _Traits, _Alloc>::_Rep::
3785 _M_clone(
const _Alloc& __alloc, size_type __res)
3788 const size_type __requested_cap = this->_M_length + __res;
3789 _Rep* __r = _Rep::_S_create(__requested_cap, this->_M_capacity,
3791 if (this->_M_length)
3792 _M_copy(__r->_M_refdata(), _M_refdata(), this->_M_length);
3794 __r->_M_set_length_and_sharable(this->_M_length);
3795 return __r->_M_refdata();
3798 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3801 resize(size_type __n, _CharT __c)
3804 _M_check_length(
__size, __n,
"basic_string::resize");
3806 this->append(__n -
__size, __c);
3812 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3813 template<
typename _InputIterator>
3821 _M_check_length(
__n1,
__s.size(),
"basic_string::_M_replace_dispatch");
3822 return _M_replace_safe(
__i1 - _M_ibegin(),
__n1,
__s._M_data(),
3826 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3827 basic_string<_CharT, _Traits, _Alloc>&
3828 basic_string<_CharT, _Traits, _Alloc>::
3829 _M_replace_aux(size_type __pos1, size_type __n1, size_type __n2,
3832 _M_check_length(__n1, __n2,
"basic_string::_M_replace_aux");
3833 _M_mutate(__pos1, __n1, __n2);
3835 _M_assign(_M_data() + __pos1, __n2, __c);
3839 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3840 basic_string<_CharT, _Traits, _Alloc>&
3841 basic_string<_CharT, _Traits, _Alloc>::
3842 _M_replace_safe(size_type __pos1, size_type __n1,
const _CharT* __s,
3845 _M_mutate(__pos1, __n1, __n2);
3847 _M_copy(_M_data() + __pos1, __s, __n2);
3851 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3857 if (length() < capacity() || _M_rep()->_M_is_shared())
3860 const allocator_type __a = get_allocator();
3861 _CharT*
__tmp = _M_rep()->_M_clone(__a);
3862 _M_rep()->_M_dispose(__a);
3872 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3873 typename basic_string<_CharT, _Traits, _Alloc>::size_type
3875 copy(_CharT*
__s, size_type __n, size_type
__pos)
const
3877 _M_check(
__pos,
"basic_string::copy");
3878 __n = _M_limit(
__pos, __n);
3879 __glibcxx_requires_string_len(
__s, __n);
3881 _M_copy(
__s, _M_data() +
__pos, __n);
3886#ifdef __glibcxx_string_resize_and_overwrite
3887 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3888 template<
typename _Operation>
3889 [[__gnu__::__always_inline__]]
3896#if __cplusplus >= 201103L
3897 template<
typename _CharT,
typename _Traits,
typename _Alloc>
3898 template<
typename _Operation>
3900 basic_string<_CharT, _Traits, _Alloc>::
3901#ifdef __glibcxx_string_resize_and_overwrite
3902 resize_and_overwrite(
const size_type __n, _Operation __op)
3904 __resize_and_overwrite(
const size_type __n, _Operation __op)
3907 const size_type __capacity = capacity();
3909 if (__n > __capacity || _M_rep()->_M_is_shared())
3912 struct _Terminator {
3913 ~_Terminator() { _M_this->_M_rep()->_M_set_length_and_sharable(_M_r); }
3914 basic_string* _M_this;
3917 _Terminator __term{
this, 0};
3918 auto __r =
std::move(__op)(__p + 0, __n + 0);
3919#ifdef __cpp_lib_concepts
3920 static_assert(ranges::__detail::__is_integer_like<
decltype(__r)>);
3922 static_assert(__gnu_cxx::__is_integer_nonstrict<
decltype(__r)>::__value,
3923 "resize_and_overwrite operation must return an integer");
3925 _GLIBCXX_DEBUG_ASSERT(__r >= 0 && size_type(__r) <= __n);
3926 __term._M_r = size_type(__r);
3927 if (__term._M_r > __n)
3928 __builtin_unreachable();
3933_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.
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.
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.
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.
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.
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.
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.
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 & 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.
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().
_CharT * data() noexcept(false)
Return non-const pointer to contents.
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
size_type find_last_of(_CharT __c, size_type __pos=npos) const noexcept
Find last position of a character.
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.
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.
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
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.
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.
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.
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.
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.