libstdc++
basic_string.tcc
Go to the documentation of this file.
1// Components for manipulating sequences of characters -*- C++ -*-
2
3// Copyright (C) 1997-2023 Free Software Foundation, Inc.
4//
5// This file is part of the GNU ISO C++ Library. This library is free
6// software; you can redistribute it and/or modify it under the
7// terms of the GNU General Public License as published by the
8// Free Software Foundation; either version 3, or (at your option)
9// any later version.
10
11// This library is distributed in the hope that it will be useful,
12// but WITHOUT ANY WARRANTY; without even the implied warranty of
13// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14// GNU General Public License for more details.
15
16// Under Section 7 of GPL version 3, you are granted additional
17// permissions described in the GCC Runtime Library Exception, version
18// 3.1, as published by the Free Software Foundation.
19
20// You should have received a copy of the GNU General Public License and
21// a copy of the GCC Runtime Library Exception along with this program;
22// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
23// <http://www.gnu.org/licenses/>.
24
25/** @file bits/basic_string.tcc
26 * This is an internal header file, included by other library headers.
27 * Do not attempt to use it directly. @headername{string}
28 */
29
30//
31// ISO C++ 14882: 21 Strings library
32//
33
34// Written by Jason Merrill based upon the specification by Takanori Adachi
35// in ANSI X3J16/94-0013R2. Rewritten by Nathan Myers to ISO-14882.
36// Non-reference-counted implementation written by Paolo Carlini and
37// updated by Jonathan Wakely for ISO-14882-2011.
38
39#ifndef _BASIC_STRING_TCC
40#define _BASIC_STRING_TCC 1
41
42#pragma GCC system_header
43
44#include <bits/cxxabi_forced.h>
45
46namespace std _GLIBCXX_VISIBILITY(default)
47{
48_GLIBCXX_BEGIN_NAMESPACE_VERSION
49
50#if _GLIBCXX_USE_CXX11_ABI
51
52 template<typename _CharT, typename _Traits, typename _Alloc>
53 const typename basic_string<_CharT, _Traits, _Alloc>::size_type
54 basic_string<_CharT, _Traits, _Alloc>::npos;
55
56 template<typename _CharT, typename _Traits, typename _Alloc>
57 _GLIBCXX20_CONSTEXPR
58 void
59 basic_string<_CharT, _Traits, _Alloc>::
60 swap(basic_string& __s) _GLIBCXX_NOEXCEPT
61 {
62 if (this == std::__addressof(__s))
63 return;
64
65 _Alloc_traits::_S_on_swap(_M_get_allocator(), __s._M_get_allocator());
66
67 if (_M_is_local())
68 if (__s._M_is_local())
69 {
70 if (length() && __s.length())
71 {
72 _CharT __tmp_data[_S_local_capacity + 1];
73 traits_type::copy(__tmp_data, __s._M_local_buf,
74 __s.length() + 1);
75 traits_type::copy(__s._M_local_buf, _M_local_buf,
76 length() + 1);
77 traits_type::copy(_M_local_buf, __tmp_data,
78 __s.length() + 1);
79 }
80 else if (__s.length())
81 {
82 traits_type::copy(_M_local_buf, __s._M_local_buf,
83 __s.length() + 1);
84 _M_length(__s.length());
85 __s._M_set_length(0);
86 return;
87 }
88 else if (length())
89 {
90 traits_type::copy(__s._M_local_buf, _M_local_buf,
91 length() + 1);
92 __s._M_length(length());
93 _M_set_length(0);
94 return;
95 }
96 }
97 else
98 {
99 const size_type __tmp_capacity = __s._M_allocated_capacity;
100 traits_type::copy(__s._M_local_buf, _M_local_buf,
101 length() + 1);
102 _M_data(__s._M_data());
103 __s._M_data(__s._M_local_buf);
104 _M_capacity(__tmp_capacity);
105 }
106 else
107 {
108 const size_type __tmp_capacity = _M_allocated_capacity;
109 if (__s._M_is_local())
110 {
111 traits_type::copy(_M_local_buf, __s._M_local_buf,
112 __s.length() + 1);
113 __s._M_data(_M_data());
114 _M_data(_M_local_buf);
115 }
116 else
117 {
118 pointer __tmp_ptr = _M_data();
119 _M_data(__s._M_data());
120 __s._M_data(__tmp_ptr);
121 _M_capacity(__s._M_allocated_capacity);
122 }
123 __s._M_capacity(__tmp_capacity);
124 }
125
126 const size_type __tmp_length = length();
127 _M_length(__s.length());
128 __s._M_length(__tmp_length);
129 }
130
131 template<typename _CharT, typename _Traits, typename _Alloc>
132 _GLIBCXX20_CONSTEXPR
133 typename basic_string<_CharT, _Traits, _Alloc>::pointer
134 basic_string<_CharT, _Traits, _Alloc>::
135 _M_create(size_type& __capacity, size_type __old_capacity)
136 {
137 // _GLIBCXX_RESOLVE_LIB_DEFECTS
138 // 83. String::npos vs. string::max_size()
139 if (__capacity > max_size())
140 std::__throw_length_error(__N("basic_string::_M_create"));
141
142 // The below implements an exponential growth policy, necessary to
143 // meet amortized linear time requirements of the library: see
144 // http://gcc.gnu.org/ml/libstdc++/2001-07/msg00085.html.
145 if (__capacity > __old_capacity && __capacity < 2 * __old_capacity)
146 {
147 __capacity = 2 * __old_capacity;
148 // Never allocate a string bigger than max_size.
149 if (__capacity > max_size())
150 __capacity = max_size();
151 }
152
153 // NB: Need an array of char_type[__capacity], plus a terminating
154 // null char_type() element.
155 return _Alloc_traits::allocate(_M_get_allocator(), __capacity + 1);
156 }
157
158 // NB: This is the special case for Input Iterators, used in
159 // istreambuf_iterators, etc.
160 // Input Iterators have a cost structure very different from
161 // pointers, calling for a different coding style.
162 template<typename _CharT, typename _Traits, typename _Alloc>
163 template<typename _InIterator>
164 _GLIBCXX20_CONSTEXPR
165 void
166 basic_string<_CharT, _Traits, _Alloc>::
167 _M_construct(_InIterator __beg, _InIterator __end,
168 std::input_iterator_tag)
169 {
170 size_type __len = 0;
171 size_type __capacity = size_type(_S_local_capacity);
172
173 pointer __p = _M_use_local_data();
174
175 while (__beg != __end && __len < __capacity)
176 {
177 __p[__len++] = *__beg;
178 ++__beg;
179 }
180
181 struct _Guard
182 {
183 _GLIBCXX20_CONSTEXPR
184 explicit _Guard(basic_string* __s) : _M_guarded(__s) { }
185
186 _GLIBCXX20_CONSTEXPR
187 ~_Guard() { if (_M_guarded) _M_guarded->_M_dispose(); }
188
189 basic_string* _M_guarded;
190 } __guard(this);
191
192 while (__beg != __end)
193 {
194 if (__len == __capacity)
195 {
196 // Allocate more space.
197 __capacity = __len + 1;
198 pointer __another = _M_create(__capacity, __len);
199 this->_S_copy(__another, _M_data(), __len);
200 _M_dispose();
201 _M_data(__another);
202 _M_capacity(__capacity);
203 }
204 traits_type::assign(_M_data()[__len++], *__beg);
205 ++__beg;
206 }
207
208 __guard._M_guarded = 0;
209
210 _M_set_length(__len);
211 }
212
213 template<typename _CharT, typename _Traits, typename _Alloc>
214 template<typename _InIterator>
215 _GLIBCXX20_CONSTEXPR
216 void
217 basic_string<_CharT, _Traits, _Alloc>::
218 _M_construct(_InIterator __beg, _InIterator __end,
219 std::forward_iterator_tag)
220 {
221 size_type __dnew = static_cast<size_type>(std::distance(__beg, __end));
222
223 if (__dnew > size_type(_S_local_capacity))
224 {
225 _M_data(_M_create(__dnew, size_type(0)));
226 _M_capacity(__dnew);
227 }
228 else
229 _M_use_local_data();
230
231 // Check for out_of_range and length_error exceptions.
232 struct _Guard
233 {
234 _GLIBCXX20_CONSTEXPR
235 explicit _Guard(basic_string* __s) : _M_guarded(__s) { }
236
237 _GLIBCXX20_CONSTEXPR
238 ~_Guard() { if (_M_guarded) _M_guarded->_M_dispose(); }
239
240 basic_string* _M_guarded;
241 } __guard(this);
242
243 this->_S_copy_chars(_M_data(), __beg, __end);
244
245 __guard._M_guarded = 0;
246
247 _M_set_length(__dnew);
248 }
249
250 template<typename _CharT, typename _Traits, typename _Alloc>
251 _GLIBCXX20_CONSTEXPR
252 void
253 basic_string<_CharT, _Traits, _Alloc>::
254 _M_construct(size_type __n, _CharT __c)
255 {
256 if (__n > size_type(_S_local_capacity))
257 {
258 _M_data(_M_create(__n, size_type(0)));
259 _M_capacity(__n);
260 }
261 else
262 _M_use_local_data();
263
264 if (__n)
265 this->_S_assign(_M_data(), __n, __c);
266
267 _M_set_length(__n);
268 }
269
270 template<typename _CharT, typename _Traits, typename _Alloc>
271 _GLIBCXX20_CONSTEXPR
272 void
273 basic_string<_CharT, _Traits, _Alloc>::
274 _M_assign(const basic_string& __str)
275 {
276 if (this != std::__addressof(__str))
277 {
278 const size_type __rsize = __str.length();
279 const size_type __capacity = capacity();
280
281 if (__rsize > __capacity)
282 {
283 size_type __new_capacity = __rsize;
284 pointer __tmp = _M_create(__new_capacity, __capacity);
285 _M_dispose();
286 _M_data(__tmp);
287 _M_capacity(__new_capacity);
288 }
289
290 if (__rsize)
291 this->_S_copy(_M_data(), __str._M_data(), __rsize);
292
293 _M_set_length(__rsize);
294 }
295 }
296
297 template<typename _CharT, typename _Traits, typename _Alloc>
298 _GLIBCXX20_CONSTEXPR
299 void
300 basic_string<_CharT, _Traits, _Alloc>::
301 reserve(size_type __res)
302 {
303 const size_type __capacity = capacity();
304 // _GLIBCXX_RESOLVE_LIB_DEFECTS
305 // 2968. Inconsistencies between basic_string reserve and
306 // vector/unordered_map/unordered_set reserve functions
307 // P0966 reserve should not shrink
308 if (__res <= __capacity)
309 return;
310
311 pointer __tmp = _M_create(__res, __capacity);
312 this->_S_copy(__tmp, _M_data(), length() + 1);
313 _M_dispose();
314 _M_data(__tmp);
315 _M_capacity(__res);
316 }
317
318 template<typename _CharT, typename _Traits, typename _Alloc>
319 _GLIBCXX20_CONSTEXPR
320 void
321 basic_string<_CharT, _Traits, _Alloc>::
322 _M_mutate(size_type __pos, size_type __len1, const _CharT* __s,
323 size_type __len2)
324 {
325 const size_type __how_much = length() - __pos - __len1;
326
327 size_type __new_capacity = length() + __len2 - __len1;
328 pointer __r = _M_create(__new_capacity, capacity());
329
330 if (__pos)
331 this->_S_copy(__r, _M_data(), __pos);
332 if (__s && __len2)
333 this->_S_copy(__r + __pos, __s, __len2);
334 if (__how_much)
335 this->_S_copy(__r + __pos + __len2,
336 _M_data() + __pos + __len1, __how_much);
337
338 _M_dispose();
339 _M_data(__r);
340 _M_capacity(__new_capacity);
341 }
342
343 template<typename _CharT, typename _Traits, typename _Alloc>
344 _GLIBCXX20_CONSTEXPR
345 void
346 basic_string<_CharT, _Traits, _Alloc>::
347 _M_erase(size_type __pos, size_type __n)
348 {
349 const size_type __how_much = length() - __pos - __n;
350
351 if (__how_much && __n)
352 this->_S_move(_M_data() + __pos, _M_data() + __pos + __n, __how_much);
353
354 _M_set_length(length() - __n);
355 }
356
357 template<typename _CharT, typename _Traits, typename _Alloc>
358 _GLIBCXX20_CONSTEXPR
359 void
360 basic_string<_CharT, _Traits, _Alloc>::
361 reserve()
362 {
363 if (_M_is_local())
364 return;
365
366 const size_type __length = length();
367 const size_type __capacity = _M_allocated_capacity;
368
369 if (__length <= size_type(_S_local_capacity))
370 {
371 this->_S_copy(_M_use_local_data(), _M_data(), __length + 1);
372 _M_destroy(__capacity);
373 _M_data(_M_local_data());
374 }
375#if __cpp_exceptions
376 else if (__length < __capacity)
377 try
378 {
379 pointer __tmp
380 = _Alloc_traits::allocate(_M_get_allocator(), __length + 1);
381 this->_S_copy(__tmp, _M_data(), __length + 1);
382 _M_dispose();
383 _M_data(__tmp);
384 _M_capacity(__length);
385 }
386 catch (const __cxxabiv1::__forced_unwind&)
387 { throw; }
388 catch (...)
389 { /* swallow the exception */ }
390#endif
391 }
392
393 template<typename _CharT, typename _Traits, typename _Alloc>
394 _GLIBCXX20_CONSTEXPR
395 void
396 basic_string<_CharT, _Traits, _Alloc>::
397 resize(size_type __n, _CharT __c)
398 {
399 const size_type __size = this->size();
400 if (__size < __n)
401 this->append(__n - __size, __c);
402 else if (__n < __size)
403 this->_M_set_length(__n);
404 }
405
406 template<typename _CharT, typename _Traits, typename _Alloc>
407 _GLIBCXX20_CONSTEXPR
408 basic_string<_CharT, _Traits, _Alloc>&
409 basic_string<_CharT, _Traits, _Alloc>::
410 _M_append(const _CharT* __s, size_type __n)
411 {
412 const size_type __len = __n + this->size();
413
414 if (__len <= this->capacity())
415 {
416 if (__n)
417 this->_S_copy(this->_M_data() + this->size(), __s, __n);
418 }
419 else
420 this->_M_mutate(this->size(), size_type(0), __s, __n);
421
422 this->_M_set_length(__len);
423 return *this;
424 }
425
426 template<typename _CharT, typename _Traits, typename _Alloc>
427 template<typename _InputIterator>
428 _GLIBCXX20_CONSTEXPR
429 basic_string<_CharT, _Traits, _Alloc>&
430 basic_string<_CharT, _Traits, _Alloc>::
431 _M_replace_dispatch(const_iterator __i1, const_iterator __i2,
432 _InputIterator __k1, _InputIterator __k2,
433 std::__false_type)
434 {
435 // _GLIBCXX_RESOLVE_LIB_DEFECTS
436 // 2788. unintentionally require a default constructible allocator
437 const basic_string __s(__k1, __k2, this->get_allocator());
438 const size_type __n1 = __i2 - __i1;
439 return _M_replace(__i1 - begin(), __n1, __s._M_data(),
440 __s.size());
441 }
442
443 template<typename _CharT, typename _Traits, typename _Alloc>
444 _GLIBCXX20_CONSTEXPR
445 basic_string<_CharT, _Traits, _Alloc>&
446 basic_string<_CharT, _Traits, _Alloc>::
447 _M_replace_aux(size_type __pos1, size_type __n1, size_type __n2,
448 _CharT __c)
449 {
450 _M_check_length(__n1, __n2, "basic_string::_M_replace_aux");
451
452 const size_type __old_size = this->size();
453 const size_type __new_size = __old_size + __n2 - __n1;
454
455 if (__new_size <= this->capacity())
456 {
457 pointer __p = this->_M_data() + __pos1;
458
459 const size_type __how_much = __old_size - __pos1 - __n1;
460 if (__how_much && __n1 != __n2)
461 this->_S_move(__p + __n2, __p + __n1, __how_much);
462 }
463 else
464 this->_M_mutate(__pos1, __n1, 0, __n2);
465
466 if (__n2)
467 this->_S_assign(this->_M_data() + __pos1, __n2, __c);
468
469 this->_M_set_length(__new_size);
470 return *this;
471 }
472
473 template<typename _CharT, typename _Traits, typename _Alloc>
474 __attribute__((__noinline__, __noclone__, __cold__)) void
475 basic_string<_CharT, _Traits, _Alloc>::
476 _M_replace_cold(pointer __p, size_type __len1, const _CharT* __s,
477 const size_type __len2, const size_type __how_much)
478 {
479 // Work in-place.
480 if (__len2 && __len2 <= __len1)
481 this->_S_move(__p, __s, __len2);
482 if (__how_much && __len1 != __len2)
483 this->_S_move(__p + __len2, __p + __len1, __how_much);
484 if (__len2 > __len1)
485 {
486 if (__s + __len2 <= __p + __len1)
487 this->_S_move(__p, __s, __len2);
488 else if (__s >= __p + __len1)
489 {
490 // Hint to middle end that __p and __s overlap
491 // (PR 98465).
492 const size_type __poff = (__s - __p) + (__len2 - __len1);
493 this->_S_copy(__p, __p + __poff, __len2);
494 }
495 else
496 {
497 const size_type __nleft = (__p + __len1) - __s;
498 this->_S_move(__p, __s, __nleft);
499 this->_S_copy(__p + __nleft, __p + __len2, __len2 - __nleft);
500 }
501 }
502 }
503
504 template<typename _CharT, typename _Traits, typename _Alloc>
505 _GLIBCXX20_CONSTEXPR
506 basic_string<_CharT, _Traits, _Alloc>&
507 basic_string<_CharT, _Traits, _Alloc>::
508 _M_replace(size_type __pos, size_type __len1, const _CharT* __s,
509 const size_type __len2)
510 {
511 _M_check_length(__len1, __len2, "basic_string::_M_replace");
512
513 const size_type __old_size = this->size();
514 const size_type __new_size = __old_size + __len2 - __len1;
515
516 if (__new_size <= this->capacity())
517 {
518 pointer __p = this->_M_data() + __pos;
519
520 const size_type __how_much = __old_size - __pos - __len1;
521#if __cpp_lib_is_constant_evaluated
522 if (std::is_constant_evaluated())
523 {
524 auto __newp = _Alloc_traits::allocate(_M_get_allocator(),
525 __new_size);
526 _S_copy(__newp, this->_M_data(), __pos);
527 _S_copy(__newp + __pos, __s, __len2);
528 _S_copy(__newp + __pos + __len2, __p + __len1, __how_much);
529 _S_copy(this->_M_data(), __newp, __new_size);
530 this->_M_get_allocator().deallocate(__newp, __new_size);
531 }
532 else
533#endif
534 if (__builtin_expect(_M_disjunct(__s), true))
535 {
536 if (__how_much && __len1 != __len2)
537 this->_S_move(__p + __len2, __p + __len1, __how_much);
538 if (__len2)
539 this->_S_copy(__p, __s, __len2);
540 }
541 else
542 _M_replace_cold(__p, __len1, __s, __len2, __how_much);
543 }
544 else
545 this->_M_mutate(__pos, __len1, __s, __len2);
546
547 this->_M_set_length(__new_size);
548 return *this;
549 }
550
551 template<typename _CharT, typename _Traits, typename _Alloc>
552 _GLIBCXX20_CONSTEXPR
553 typename basic_string<_CharT, _Traits, _Alloc>::size_type
554 basic_string<_CharT, _Traits, _Alloc>::
555 copy(_CharT* __s, size_type __n, size_type __pos) const
556 {
557 _M_check(__pos, "basic_string::copy");
558 __n = _M_limit(__pos, __n);
559 __glibcxx_requires_string_len(__s, __n);
560 if (__n)
561 _S_copy(__s, _M_data() + __pos, __n);
562 // 21.3.5.7 par 3: do not append null. (good.)
563 return __n;
564 }
565
566#if __cplusplus > 202002L
567 template<typename _CharT, typename _Traits, typename _Alloc>
568 template<typename _Operation>
569 constexpr void
570 basic_string<_CharT, _Traits, _Alloc>::
571 resize_and_overwrite(size_type __n, _Operation __op)
572 {
573 const size_type __capacity = capacity();
574 _CharT* __p;
575 if (__n > __capacity)
576 {
577 __p = _M_create(__n, __capacity);
578 this->_S_copy(__p, _M_data(), length()); // exclude trailing null
579#if __cpp_lib_is_constant_evaluated
580 if (std::is_constant_evaluated())
581 traits_type::assign(__p + length(), __n - length(), _CharT());
582#endif
583 _M_dispose();
584 _M_data(__p);
585 _M_capacity(__n);
586 }
587 else
588 __p = _M_data();
589 struct _Terminator {
590 constexpr ~_Terminator() { _M_this->_M_set_length(_M_r); }
591 basic_string* _M_this;
592 size_type _M_r;
593 };
594 _Terminator __term{this};
595 auto __r = std::move(__op)(auto(__p), auto(__n));
596 static_assert(ranges::__detail::__is_integer_like<decltype(__r)>);
597 _GLIBCXX_DEBUG_ASSERT(__r >= 0 && __r <= __n);
598 __term._M_r = size_type(__r);
599 if (__term._M_r > __n)
600 __builtin_unreachable();
601 }
602#endif // C++23
603
604#endif // _GLIBCXX_USE_CXX11_ABI
605
606#if __cpp_lib_constexpr_string >= 201907L
607# define _GLIBCXX_STRING_CONSTEXPR constexpr
608#else
609# define _GLIBCXX_STRING_CONSTEXPR
610#endif
611 template<typename _CharT, typename _Traits, typename _Alloc>
612 _GLIBCXX_STRING_CONSTEXPR
613 typename basic_string<_CharT, _Traits, _Alloc>::size_type
614 basic_string<_CharT, _Traits, _Alloc>::
615 find(const _CharT* __s, size_type __pos, size_type __n) const
616 _GLIBCXX_NOEXCEPT
617 {
618 __glibcxx_requires_string_len(__s, __n);
619 const size_type __size = this->size();
620
621 if (__n == 0)
622 return __pos <= __size ? __pos : npos;
623 if (__pos >= __size)
624 return npos;
625
626 const _CharT __elem0 = __s[0];
627 const _CharT* const __data = data();
628 const _CharT* __first = __data + __pos;
629 const _CharT* const __last = __data + __size;
630 size_type __len = __size - __pos;
631
632 while (__len >= __n)
633 {
634 // Find the first occurrence of __elem0:
635 __first = traits_type::find(__first, __len - __n + 1, __elem0);
636 if (!__first)
637 return npos;
638 // Compare the full strings from the first occurrence of __elem0.
639 // We already know that __first[0] == __s[0] but compare them again
640 // anyway because __s is probably aligned, which helps memcmp.
641 if (traits_type::compare(__first, __s, __n) == 0)
642 return __first - __data;
643 __len = __last - ++__first;
644 }
645 return npos;
646 }
647
648 template<typename _CharT, typename _Traits, typename _Alloc>
649 _GLIBCXX_STRING_CONSTEXPR
650 typename basic_string<_CharT, _Traits, _Alloc>::size_type
651 basic_string<_CharT, _Traits, _Alloc>::
652 find(_CharT __c, size_type __pos) const _GLIBCXX_NOEXCEPT
653 {
654 size_type __ret = npos;
655 const size_type __size = this->size();
656 if (__pos < __size)
657 {
658 const _CharT* __data = _M_data();
659 const size_type __n = __size - __pos;
660 const _CharT* __p = traits_type::find(__data + __pos, __n, __c);
661 if (__p)
662 __ret = __p - __data;
663 }
664 return __ret;
665 }
666
667 template<typename _CharT, typename _Traits, typename _Alloc>
668 _GLIBCXX_STRING_CONSTEXPR
669 typename basic_string<_CharT, _Traits, _Alloc>::size_type
670 basic_string<_CharT, _Traits, _Alloc>::
671 rfind(const _CharT* __s, size_type __pos, size_type __n) const
672 _GLIBCXX_NOEXCEPT
673 {
674 __glibcxx_requires_string_len(__s, __n);
675 const size_type __size = this->size();
676 if (__n <= __size)
677 {
678 __pos = std::min(size_type(__size - __n), __pos);
679 const _CharT* __data = _M_data();
680 do
681 {
682 if (traits_type::compare(__data + __pos, __s, __n) == 0)
683 return __pos;
684 }
685 while (__pos-- > 0);
686 }
687 return npos;
688 }
689
690 template<typename _CharT, typename _Traits, typename _Alloc>
691 _GLIBCXX_STRING_CONSTEXPR
692 typename basic_string<_CharT, _Traits, _Alloc>::size_type
693 basic_string<_CharT, _Traits, _Alloc>::
694 rfind(_CharT __c, size_type __pos) const _GLIBCXX_NOEXCEPT
695 {
696 size_type __size = this->size();
697 if (__size)
698 {
699 if (--__size > __pos)
700 __size = __pos;
701 for (++__size; __size-- > 0; )
702 if (traits_type::eq(_M_data()[__size], __c))
703 return __size;
704 }
705 return npos;
706 }
707
708 template<typename _CharT, typename _Traits, typename _Alloc>
709 _GLIBCXX_STRING_CONSTEXPR
710 typename basic_string<_CharT, _Traits, _Alloc>::size_type
711 basic_string<_CharT, _Traits, _Alloc>::
712 find_first_of(const _CharT* __s, size_type __pos, size_type __n) const
713 _GLIBCXX_NOEXCEPT
714 {
715 __glibcxx_requires_string_len(__s, __n);
716 for (; __n && __pos < this->size(); ++__pos)
717 {
718 const _CharT* __p = traits_type::find(__s, __n, _M_data()[__pos]);
719 if (__p)
720 return __pos;
721 }
722 return npos;
723 }
724
725 template<typename _CharT, typename _Traits, typename _Alloc>
726 _GLIBCXX_STRING_CONSTEXPR
727 typename basic_string<_CharT, _Traits, _Alloc>::size_type
728 basic_string<_CharT, _Traits, _Alloc>::
729 find_last_of(const _CharT* __s, size_type __pos, size_type __n) const
730 _GLIBCXX_NOEXCEPT
731 {
732 __glibcxx_requires_string_len(__s, __n);
733 size_type __size = this->size();
734 if (__size && __n)
735 {
736 if (--__size > __pos)
737 __size = __pos;
738 do
739 {
740 if (traits_type::find(__s, __n, _M_data()[__size]))
741 return __size;
742 }
743 while (__size-- != 0);
744 }
745 return npos;
746 }
747
748 template<typename _CharT, typename _Traits, typename _Alloc>
749 _GLIBCXX_STRING_CONSTEXPR
750 typename basic_string<_CharT, _Traits, _Alloc>::size_type
751 basic_string<_CharT, _Traits, _Alloc>::
752 find_first_not_of(const _CharT* __s, size_type __pos, size_type __n) const
753 _GLIBCXX_NOEXCEPT
754 {
755 __glibcxx_requires_string_len(__s, __n);
756 for (; __pos < this->size(); ++__pos)
757 if (!traits_type::find(__s, __n, _M_data()[__pos]))
758 return __pos;
759 return npos;
760 }
761
762 template<typename _CharT, typename _Traits, typename _Alloc>
763 _GLIBCXX_STRING_CONSTEXPR
764 typename basic_string<_CharT, _Traits, _Alloc>::size_type
765 basic_string<_CharT, _Traits, _Alloc>::
766 find_first_not_of(_CharT __c, size_type __pos) const _GLIBCXX_NOEXCEPT
767 {
768 for (; __pos < this->size(); ++__pos)
769 if (!traits_type::eq(_M_data()[__pos], __c))
770 return __pos;
771 return npos;
772 }
773
774 template<typename _CharT, typename _Traits, typename _Alloc>
775 _GLIBCXX_STRING_CONSTEXPR
776 typename basic_string<_CharT, _Traits, _Alloc>::size_type
777 basic_string<_CharT, _Traits, _Alloc>::
778 find_last_not_of(const _CharT* __s, size_type __pos, size_type __n) const
779 _GLIBCXX_NOEXCEPT
780 {
781 __glibcxx_requires_string_len(__s, __n);
782 size_type __size = this->size();
783 if (__size)
784 {
785 if (--__size > __pos)
786 __size = __pos;
787 do
788 {
789 if (!traits_type::find(__s, __n, _M_data()[__size]))
790 return __size;
791 }
792 while (__size--);
793 }
794 return npos;
795 }
796
797 template<typename _CharT, typename _Traits, typename _Alloc>
798 _GLIBCXX_STRING_CONSTEXPR
799 typename basic_string<_CharT, _Traits, _Alloc>::size_type
800 basic_string<_CharT, _Traits, _Alloc>::
801 find_last_not_of(_CharT __c, size_type __pos) const _GLIBCXX_NOEXCEPT
802 {
803 size_type __size = this->size();
804 if (__size)
805 {
806 if (--__size > __pos)
807 __size = __pos;
808 do
809 {
810 if (!traits_type::eq(_M_data()[__size], __c))
811 return __size;
812 }
813 while (__size--);
814 }
815 return npos;
816 }
817
818#undef _GLIBCXX_STRING_CONSTEXPR
819
820 // 21.3.7.9 basic_string::getline and operators
821 template<typename _CharT, typename _Traits, typename _Alloc>
822 basic_istream<_CharT, _Traits>&
823 operator>>(basic_istream<_CharT, _Traits>& __in,
824 basic_string<_CharT, _Traits, _Alloc>& __str)
825 {
826 typedef basic_istream<_CharT, _Traits> __istream_type;
827 typedef basic_string<_CharT, _Traits, _Alloc> __string_type;
828 typedef typename __istream_type::ios_base __ios_base;
829 typedef typename __istream_type::int_type __int_type;
830 typedef typename __string_type::size_type __size_type;
831 typedef ctype<_CharT> __ctype_type;
832 typedef typename __ctype_type::ctype_base __ctype_base;
833
834 __size_type __extracted = 0;
835 typename __ios_base::iostate __err = __ios_base::goodbit;
836 typename __istream_type::sentry __cerb(__in, false);
837 if (__cerb)
838 {
839 __try
840 {
841 // Avoid reallocation for common case.
842 __str.erase();
843 _CharT __buf[128];
844 __size_type __len = 0;
845 const streamsize __w = __in.width();
846 const __size_type __n = __w > 0 ? static_cast<__size_type>(__w)
847 : __str.max_size();
848 const __ctype_type& __ct = use_facet<__ctype_type>(__in.getloc());
849 const __int_type __eof = _Traits::eof();
850 __int_type __c = __in.rdbuf()->sgetc();
851
852 while (__extracted < __n
853 && !_Traits::eq_int_type(__c, __eof)
854 && !__ct.is(__ctype_base::space,
855 _Traits::to_char_type(__c)))
856 {
857 if (__len == sizeof(__buf) / sizeof(_CharT))
858 {
859 __str.append(__buf, sizeof(__buf) / sizeof(_CharT));
860 __len = 0;
861 }
862 __buf[__len++] = _Traits::to_char_type(__c);
863 ++__extracted;
864 __c = __in.rdbuf()->snextc();
865 }
866 __str.append(__buf, __len);
867
868 if (__extracted < __n && _Traits::eq_int_type(__c, __eof))
869 __err |= __ios_base::eofbit;
870 __in.width(0);
871 }
872 __catch(__cxxabiv1::__forced_unwind&)
873 {
874 __in._M_setstate(__ios_base::badbit);
875 __throw_exception_again;
876 }
877 __catch(...)
878 {
879 // _GLIBCXX_RESOLVE_LIB_DEFECTS
880 // 91. Description of operator>> and getline() for string<>
881 // might cause endless loop
882 __in._M_setstate(__ios_base::badbit);
883 }
884 }
885 // 211. operator>>(istream&, string&) doesn't set failbit
886 if (!__extracted)
887 __err |= __ios_base::failbit;
888 if (__err)
889 __in.setstate(__err);
890 return __in;
891 }
892
893 template<typename _CharT, typename _Traits, typename _Alloc>
894 basic_istream<_CharT, _Traits>&
895 getline(basic_istream<_CharT, _Traits>& __in,
896 basic_string<_CharT, _Traits, _Alloc>& __str, _CharT __delim)
897 {
898 typedef basic_istream<_CharT, _Traits> __istream_type;
899 typedef basic_string<_CharT, _Traits, _Alloc> __string_type;
900 typedef typename __istream_type::ios_base __ios_base;
901 typedef typename __istream_type::int_type __int_type;
902 typedef typename __string_type::size_type __size_type;
903
904 __size_type __extracted = 0;
905 const __size_type __n = __str.max_size();
906 typename __ios_base::iostate __err = __ios_base::goodbit;
907 typename __istream_type::sentry __cerb(__in, true);
908 if (__cerb)
909 {
910 __try
911 {
912 __str.erase();
913 const __int_type __idelim = _Traits::to_int_type(__delim);
914 const __int_type __eof = _Traits::eof();
915 __int_type __c = __in.rdbuf()->sgetc();
916
917 while (__extracted < __n
918 && !_Traits::eq_int_type(__c, __eof)
919 && !_Traits::eq_int_type(__c, __idelim))
920 {
921 __str += _Traits::to_char_type(__c);
922 ++__extracted;
923 __c = __in.rdbuf()->snextc();
924 }
925
926 if (_Traits::eq_int_type(__c, __eof))
927 __err |= __ios_base::eofbit;
928 else if (_Traits::eq_int_type(__c, __idelim))
929 {
930 ++__extracted;
931 __in.rdbuf()->sbumpc();
932 }
933 else
934 __err |= __ios_base::failbit;
935 }
936 __catch(__cxxabiv1::__forced_unwind&)
937 {
938 __in._M_setstate(__ios_base::badbit);
939 __throw_exception_again;
940 }
941 __catch(...)
942 {
943 // _GLIBCXX_RESOLVE_LIB_DEFECTS
944 // 91. Description of operator>> and getline() for string<>
945 // might cause endless loop
946 __in._M_setstate(__ios_base::badbit);
947 }
948 }
949 if (!__extracted)
950 __err |= __ios_base::failbit;
951 if (__err)
952 __in.setstate(__err);
953 return __in;
954 }
955
956 // Inhibit implicit instantiations for required instantiations,
957 // which are defined via explicit instantiations elsewhere.
958#if _GLIBCXX_EXTERN_TEMPLATE
959 // The explicit instantiation definitions in src/c++11/string-inst.cc and
960 // src/c++17/string-inst.cc only instantiate the members required for C++17
961 // and earlier standards (so not C++20's starts_with and ends_with).
962 // Suppress the explicit instantiation declarations for C++20, so C++20
963 // code will implicitly instantiate std::string and std::wstring as needed.
964# if __cplusplus <= 201703L && _GLIBCXX_EXTERN_TEMPLATE > 0
965 extern template class basic_string<char>;
966# elif ! _GLIBCXX_USE_CXX11_ABI
967 // Still need to prevent implicit instantiation of the COW empty rep,
968 // to ensure the definition in libstdc++.so is unique (PR 86138).
969 extern template basic_string<char>::size_type
970 basic_string<char>::_Rep::_S_empty_rep_storage[];
971# elif _GLIBCXX_EXTERN_TEMPLATE > 0
972 // Export _M_replace_cold even for C++20.
973 extern template void
974 basic_string<char>::_M_replace_cold(char *, size_type, const char*,
975 const size_type, const size_type);
976# endif
977
978 extern template
979 basic_istream<char>&
980 operator>>(basic_istream<char>&, string&);
981 extern template
982 basic_ostream<char>&
983 operator<<(basic_ostream<char>&, const string&);
984 extern template
985 basic_istream<char>&
986 getline(basic_istream<char>&, string&, char);
987 extern template
988 basic_istream<char>&
989 getline(basic_istream<char>&, string&);
990
991#ifdef _GLIBCXX_USE_WCHAR_T
992# if __cplusplus <= 201703L && _GLIBCXX_EXTERN_TEMPLATE > 0
993 extern template class basic_string<wchar_t>;
994# elif ! _GLIBCXX_USE_CXX11_ABI
995 extern template basic_string<wchar_t>::size_type
996 basic_string<wchar_t>::_Rep::_S_empty_rep_storage[];
997# elif _GLIBCXX_EXTERN_TEMPLATE > 0
998 // Export _M_replace_cold even for C++20.
999 extern template void
1000 basic_string<wchar_t>::_M_replace_cold(wchar_t*, size_type, const wchar_t*,
1001 const size_type, const size_type);
1002# endif
1003
1004 extern template
1005 basic_istream<wchar_t>&
1006 operator>>(basic_istream<wchar_t>&, wstring&);
1007 extern template
1008 basic_ostream<wchar_t>&
1009 operator<<(basic_ostream<wchar_t>&, const wstring&);
1010 extern template
1011 basic_istream<wchar_t>&
1012 getline(basic_istream<wchar_t>&, wstring&, wchar_t);
1013 extern template
1014 basic_istream<wchar_t>&
1015 getline(basic_istream<wchar_t>&, wstring&);
1016#endif // _GLIBCXX_USE_WCHAR_T
1017#endif // _GLIBCXX_EXTERN_TEMPLATE
1018
1019_GLIBCXX_END_NAMESPACE_VERSION
1020} // namespace std
1021
1022#endif
std::is_constant_evaluated
constexpr bool is_constant_evaluated() noexcept
Returns true only when called during constant evaluation.
Definition: type_traits:3644
std::move
constexpr std::remove_reference< _Tp >::type && move(_Tp &&__t) noexcept
Convert a value to an rvalue.
Definition: move.h:104
std::__addressof
constexpr _Tp * __addressof(_Tp &__r) noexcept
Same as C++11 std::addressof.
Definition: move.h:49
std::begin
_Tp * begin(valarray< _Tp > &__va) noexcept
Return an iterator pointing to the first element of the valarray.
Definition: valarray:1221
std::min
constexpr const _Tp & min(const _Tp &, const _Tp &)
This does what you think it does.
Definition: stl_algobase.h:233
std::wstring
basic_string< wchar_t > wstring
A string of wchar_t.
Definition: stringfwd.h:80
std
ISO C++ entities toplevel namespace is std.
std::streamsize
ptrdiff_t streamsize
Integral type for I/O operation counts and buffer sizes.
Definition: postypes.h:68
std::getline
basic_istream< _CharT, _Traits > & getline(basic_istream< _CharT, _Traits > &__is, basic_string< _CharT, _Traits, _Alloc > &__str, _CharT __delim)
Read a line from stream into a string.
Definition: basic_string.tcc:895
std::distance
constexpr iterator_traits< _InputIterator >::difference_type distance(_InputIterator __first, _InputIterator __last)
A generalization of pointer arithmetic.
Definition: stl_iterator_base_funcs.h:148
std::size
constexpr auto size(const _Container &__cont) noexcept(noexcept(__cont.size())) -> decltype(__cont.size())
Return the size of a container.
Definition: range_access.h:264
std::operator>>
std::basic_istream< _CharT, _Traits > & operator>>(std::basic_istream< _CharT, _Traits > &__is, bitset< _Nb > &__x)
Global I/O operators for bitsets.
Definition: bitset:1593
std::operator<<
std::basic_ostream< _CharT, _Traits > & operator<<(std::basic_ostream< _CharT, _Traits > &__os, const bitset< _Nb > &__x)
Global I/O operators for bitsets.
Definition: bitset:1683
std::data
constexpr auto data(_Container &__cont) noexcept(noexcept(__cont.data())) -> decltype(__cont.data())
Return the data pointer of a container.
Definition: range_access.h:314
std::basic_ios::setstate
void setstate(iostate __state)
Sets additional flags in the error state.
Definition: basic_ios.h:157
std::basic_ios::rdbuf
basic_streambuf< _CharT, _Traits > * rdbuf() const
Accessing the underlying buffer.
Definition: basic_ios.h:321
std::basic_istream
Template class basic_istream.
Definition: istream:61
std::basic_string
Managing sequences of characters and character-like objects.
Definition: cow_string.h:115
std::basic_string::swap
void swap(basic_string &__s) noexcept(/*conditional */)
Swap contents with another string.
Definition: cow_string.h:3511
std::basic_string::find_first_of
size_type find_first_of(const basic_string &__str, size_type __pos=0) const noexcept
Find position of a character of string.
Definition: cow_string.h:2418
std::basic_string::find
size_type find(const _CharT *__s, size_type __pos, size_type __n) const noexcept
Find position of a C substring.
Definition: basic_string.tcc:615
std::basic_string::find_last_not_of
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.
Definition: cow_string.h:2667
std::basic_string::find_first_not_of
size_type find_first_not_of(const basic_string &__str, size_type __pos=0) const noexcept
Find position of a character not in string.
Definition: cow_string.h:2585
std::basic_string::copy
size_type copy(_CharT *__s, size_type __n, size_type __pos=0) const
Copy substring into C string.
Definition: cow_string.h:3707
std::basic_string::find_last_of
size_type find_last_of(const basic_string &__str, size_type __pos=npos) const noexcept
Find last position of a character of string.
Definition: cow_string.h:2502
std::basic_string::rfind
size_type rfind(const basic_string &__str, size_type __pos=npos) const noexcept
Find last position of a string.
Definition: cow_string.h:2339
std::basic_string::resize
void resize(size_type __n, _CharT __c)
Resizes the string to the specified number of characters.
Definition: cow_string.h:3633
std::basic_string::reserve
void reserve()
Equivalent to shrink_to_fit().
Definition: cow_string.h:3686
std::basic_string::append
basic_string & append(const basic_string &__str)
Append a string to this string.
Definition: cow_string.h:3305
std::basic_string::npos
static const size_type npos
Value returned by various member functions when they fail.
Definition: cow_string.h:328
std::basic_string::max_size
size_type max_size() const noexcept
Returns the size() of the largest possible string.
Definition: cow_string.h:931
std::basic_string::erase
basic_string & erase(size_type __pos=0, size_type __n=npos)
Remove characters.
Definition: cow_string.h:1716
__cxxabiv1::__forced_unwind
Thrown as part of forced unwinding.
Definition: cxxabi_forced.h:49
std::ios_base::width
streamsize width() const
Flags access.
Definition: ios_base.h:755
std::ios_base::getloc
locale getloc() const
Locale access.
Definition: ios_base.h:806
std::ctype
Primary class template ctype facet.
Definition: locale_facets.h:616
std::input_iterator_tag
Marking input iterators.
Definition: stl_iterator_base_types.h:93
std::forward_iterator_tag
Forward iterators support a superset of input iterator operations.
Definition: stl_iterator_base_types.h:99