1 // Components for manipulating sequences of characters -*- C++ -*-
3 // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002
4 // Free Software Foundation, Inc.
6 // This file is part of the GNU ISO C++ Library. This library is free
7 // software; you can redistribute it and/or modify it under the
8 // terms of the GNU General Public License as published by the
9 // Free Software Foundation; either version 2, or (at your option)
12 // This library is distributed in the hope that it will be useful,
13 // but WITHOUT ANY WARRANTY; without even the implied warranty of
14 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 // GNU General Public License for more details.
17 // You should have received a copy of the GNU General Public License along
18 // with this library; see the file COPYING. If not, write to the Free
19 // Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
22 // As a special exception, you may use this file as part of a free software
23 // library without restriction. Specifically, if other files instantiate
24 // templates or use macros or inline functions from this file, or you compile
25 // this file and link it with other files to produce an executable, this
26 // file does not by itself cause the resulting executable to be covered by
27 // the GNU General Public License. This exception does not however
28 // invalidate any other reasons why the executable file might be covered by
29 // the GNU General Public License.
32 // ISO C++ 14882: 21 Strings library
35 /** @file basic_string.h
36 * This is an internal header file, included by other library headers.
37 * You should not attempt to use it directly.
40 #ifndef _CPP_BITS_STRING_H
41 #define _CPP_BITS_STRING_H 1
43 #pragma GCC system_header
45 #include <bits/atomicity.h>
49 // Documentation? What's that?
50 // Nathan Myers <ncm@cantrip.org>.
52 // A string looks like this:
56 // [basic_string<char_type>] _M_capacity
57 // _M_dataplus _M_state
58 // _M_p ----------------> unnamed array of char_type
60 // Where the _M_p points to the first character in the string, and
61 // you cast it to a pointer-to-_Rep and subtract 1 to get a
62 // pointer to the header.
64 // This approach has the enormous advantage that a string object
65 // requires only one allocation. All the ugliness is confined
66 // within a single pair of inline functions, which each compile to
67 // a single "add" instruction: _Rep::_M_data(), and
68 // string::_M_rep(); and the allocation function which gets a
69 // block of raw bytes and with room enough and constructs a _Rep
70 // object at the front.
72 // The reason you want _M_data pointing to the character array and
73 // not the _Rep is so that the debugger can see the string
74 // contents. (Probably we should add a non-inline member to get
75 // the _Rep for the debugger to use, so users can check the actual
78 // Note that the _Rep object is a POD so that you can have a
79 // static "empty string" _Rep object already "constructed" before
80 // static constructors have run. The reference-count encoding is
81 // chosen so that a 0 indicates one reference, so you never try to
82 // destroy the empty-string _Rep object.
84 // All but the last paragraph is considered pretty conventional
85 // for a C++ string implementation.
87 // 21.3 Template class basic_string
88 template<typename _CharT, typename _Traits, typename _Alloc>
93 typedef _Traits traits_type;
94 typedef typename _Traits::char_type value_type;
95 typedef _Alloc allocator_type;
96 typedef typename _Alloc::size_type size_type;
97 typedef typename _Alloc::difference_type difference_type;
98 typedef typename _Alloc::reference reference;
99 typedef typename _Alloc::const_reference const_reference;
100 typedef typename _Alloc::pointer pointer;
101 typedef typename _Alloc::const_pointer const_pointer;
102 typedef __normal_iterator<pointer, basic_string> iterator;
103 typedef __normal_iterator<const_pointer, basic_string> const_iterator;
104 typedef reverse_iterator<const_iterator> const_reverse_iterator;
105 typedef reverse_iterator<iterator> reverse_iterator;
108 // _Rep: string representation
110 // 1. String really contains _M_length + 1 characters; last is set
111 // to 0 only on call to c_str(). We avoid instantiating
112 // _CharT() where the interface does not require it.
113 // 2. _M_capacity >= _M_length
114 // Allocated memory is always _M_capacity + (1 * sizeof(_CharT)).
115 // 3. _M_references has three states:
116 // -1: leaked, one reference, no ref-copies allowed, non-const.
117 // 0: one reference, non-const.
118 // n>0: n + 1 references, operations require a lock, const.
119 // 4. All fields==0 is an empty string, given the extra storage
120 // beyond-the-end for a null terminator; thus, the shared
121 // empty string representation needs no constructor.
125 typedef typename _Alloc::template rebind<char>::other _Raw_bytes_alloc;
127 // (Public) Data members:
129 // The maximum number of individual char_type elements of an
130 // individual string is determined by _S_max_size. This is the
131 // value that will be returned by max_size(). (Whereas npos
132 // is the maximum number of bytes the allocator can allocate.)
133 // If one was to divvy up the theoretical largest size string,
134 // with a terminating character and m _CharT elements, it'd
136 // npos = sizeof(_Rep) + (m * sizeof(_CharT)) + sizeof(_CharT)
138 // m = ((npos - sizeof(_Rep))/sizeof(CharT)) - 1
139 // In addition, this implementation quarters this ammount.
140 static const size_type _S_max_size;
141 static const _CharT _S_terminal;
144 size_type _M_capacity;
145 _Atomic_word _M_references;
149 { return _M_references < 0; }
153 { return _M_references > 0; }
157 { _M_references = -1; }
161 { _M_references = 0; }
165 { return reinterpret_cast<_CharT*> (this + 1); }
168 operator[](size_t __s) throw()
169 { return _M_refdata() [__s]; }
172 _M_grab(const _Alloc& __alloc1, const _Alloc& __alloc2)
173 { return (!_M_is_leaked() && __alloc1 == __alloc2) ?
174 _M_refcopy() : _M_clone(__alloc1); }
178 _S_create(size_t, const _Alloc&);
181 _M_dispose(const _Alloc& __a)
183 if (__exchange_and_add(&_M_references, -1) <= 0)
188 _M_destroy(const _Alloc&) throw();
193 __atomic_add(&_M_references, 1);
198 _M_clone(const _Alloc&, size_type __res = 0);
201 // Use empty-base optimization: http://www.cantrip.org/emptyopt.html
202 struct _Alloc_hider : _Alloc
204 _Alloc_hider(_CharT* __dat, const _Alloc& __a)
205 : _Alloc(__a), _M_p(__dat) { }
207 _CharT* _M_p; // The actual data.
211 // Data Members (public):
212 // NB: This is an unsigned type, and thus represents the maximum
213 // size that the allocator can hold.
214 static const size_type npos = static_cast<size_type>(-1);
217 // Data Members (private):
218 mutable _Alloc_hider _M_dataplus;
220 // The following storage is init'd to 0 by the linker, resulting
221 // (carefully) in an empty string with one reference.
222 static size_type _S_empty_rep_storage[(sizeof(_Rep) + sizeof(_CharT) + sizeof(size_type) - 1)/sizeof(size_type)];
226 { return _M_dataplus._M_p; }
230 { return (_M_dataplus._M_p = __p); }
234 { return &((reinterpret_cast<_Rep*> (_M_data()))[-1]); }
236 // For the internal use we have functions similar to `begin'/`end'
237 // but they do not call _M_leak.
239 _M_ibegin() const { return iterator(_M_data()); }
242 _M_iend() const { return iterator(_M_data() + this->size()); }
245 _M_leak() // for use in begin() & non-const op[]
247 if (!_M_rep()->_M_is_leaked())
252 _M_check(size_type __pos) const
254 if (__pos > this->size())
255 __throw_out_of_range("basic_string::_M_check");
256 return _M_ibegin() + __pos;
259 // NB: _M_fold doesn't check for a bad __pos1 value.
261 _M_fold(size_type __pos, size_type __off) const
263 bool __testoff = __off < this->size() - __pos;
264 size_type __newoff = __testoff ? __off : this->size() - __pos;
265 return (_M_ibegin() + __pos + __newoff);
268 // _S_copy_chars is a separate template to permit specialization
269 // to optimize for the common case of pointers as iterators.
270 template<class _Iterator>
272 _S_copy_chars(_CharT* __p, _Iterator __k1, _Iterator __k2)
274 for (; __k1 != __k2; ++__k1, ++__p)
275 traits_type::assign(*__p, *__k1); // These types are off.
279 _S_copy_chars(_CharT* __p, iterator __k1, iterator __k2)
280 { _S_copy_chars(__p, __k1.base(), __k2.base()); }
283 _S_copy_chars(_CharT* __p, const_iterator __k1, const_iterator __k2)
284 { _S_copy_chars(__p, __k1.base(), __k2.base()); }
287 _S_copy_chars(_CharT* __p, _CharT* __k1, _CharT* __k2)
288 { traits_type::copy(__p, __k1, __k2 - __k1); }
291 _S_copy_chars(_CharT* __p, const _CharT* __k1, const _CharT* __k2)
292 { traits_type::copy(__p, __k1, __k2 - __k1); }
295 _M_mutate(size_type __pos, size_type __len1, size_type __len2);
302 { return *reinterpret_cast<_Rep*>(&_S_empty_rep_storage); }
305 // Construct/copy/destroy:
306 // NB: We overload ctors in some cases instead of using default
307 // arguments, per 17.4.4.4 para. 2 item 2.
313 basic_string(const _Alloc& __a);
315 // NB: per LWG issue 42, semantics different from IS:
316 basic_string(const basic_string& __str);
317 basic_string(const basic_string& __str, size_type __pos,
318 size_type __n = npos);
319 basic_string(const basic_string& __str, size_type __pos,
320 size_type __n, const _Alloc& __a);
322 basic_string(const _CharT* __s, size_type __n,
323 const _Alloc& __a = _Alloc());
324 basic_string(const _CharT* __s, const _Alloc& __a = _Alloc());
325 basic_string(size_type __n, _CharT __c, const _Alloc& __a = _Alloc());
327 template<class _InputIterator>
328 basic_string(_InputIterator __beg, _InputIterator __end,
329 const _Alloc& __a = _Alloc());
332 { _M_rep()->_M_dispose(this->get_allocator()); }
335 operator=(const basic_string& __str) { return this->assign(__str); }
338 operator=(const _CharT* __s) { return this->assign(__s); }
341 operator=(_CharT __c) { return this->assign(1, __c); }
348 return iterator(_M_data());
353 { return const_iterator(_M_data()); }
359 return iterator(_M_data() + this->size());
364 { return const_iterator(_M_data() + this->size()); }
368 { return reverse_iterator(this->end()); }
370 const_reverse_iterator
372 { return const_reverse_iterator(this->end()); }
376 { return reverse_iterator(this->begin()); }
378 const_reverse_iterator
380 { return const_reverse_iterator(this->begin()); }
385 size() const { return _M_rep()->_M_length; }
388 length() const { return _M_rep()->_M_length; }
391 max_size() const { return _Rep::_S_max_size; }
394 resize(size_type __n, _CharT __c);
397 resize(size_type __n) { this->resize(__n, _CharT()); }
400 capacity() const { return _M_rep()->_M_capacity; }
403 reserve(size_type __res_arg = 0);
406 clear() { _M_mutate(0, this->size(), 0); }
409 empty() const { return this->size() == 0; }
413 operator[] (size_type __pos) const
414 { return _M_data()[__pos]; }
417 operator[](size_type __pos)
420 return _M_data()[__pos];
424 at(size_type __n) const
426 if (__n >= this->size())
427 __throw_out_of_range("basic_string::at");
428 return _M_data()[__n];
435 __throw_out_of_range("basic_string::at");
437 return _M_data()[__n];
442 operator+=(const basic_string& __str) { return this->append(__str); }
445 operator+=(const _CharT* __s) { return this->append(__s); }
448 operator+=(_CharT __c) { return this->append(size_type(1), __c); }
451 append(const basic_string& __str);
454 append(const basic_string& __str, size_type __pos, size_type __n);
457 append(const _CharT* __s, size_type __n);
460 append(const _CharT* __s)
461 { return this->append(__s, traits_type::length(__s)); }
464 append(size_type __n, _CharT __c);
466 template<class _InputIterator>
468 append(_InputIterator __first, _InputIterator __last)
469 { return this->replace(_M_iend(), _M_iend(), __first, __last); }
472 push_back(_CharT __c)
473 { this->replace(_M_iend(), _M_iend(), 1, __c); }
476 assign(const basic_string& __str);
479 assign(const basic_string& __str, size_type __pos, size_type __n)
481 const size_type __strsize = __str.size();
482 if (__pos > __strsize)
483 __throw_out_of_range("basic_string::assign");
484 const bool __testn = __n < __strsize - __pos;
485 const size_type __newsize = __testn ? __n : __strsize - __pos;
486 return this->assign(__str._M_data() + __pos, __newsize);
490 assign(const _CharT* __s, size_type __n)
492 if (__n > this->max_size())
493 __throw_length_error("basic_string::assign");
494 if (_M_rep()->_M_is_shared() || less<const _CharT*>()(__s, _M_data())
495 || less<const _CharT*>()(_M_data() + this->size(), __s))
496 return _M_replace_safe(_M_ibegin(), _M_iend(), __s, __s + __n);
500 const size_type __pos = __s - _M_data();
502 traits_type::copy(_M_data(), __s, __n);
504 traits_type::move(_M_data(), __s, __n);
505 _M_rep()->_M_length = __n;
506 _M_data()[__n] = _Rep::_S_terminal;
512 assign(const _CharT* __s)
513 { return this->assign(__s, traits_type::length(__s)); }
516 assign(size_type __n, _CharT __c)
517 { return this->replace(_M_ibegin(), _M_iend(), __n, __c); }
519 template<class _InputIterator>
521 assign(_InputIterator __first, _InputIterator __last)
522 { return this->replace(_M_ibegin(), _M_iend(), __first, __last); }
525 insert(iterator __p, size_type __n, _CharT __c)
526 { this->replace(__p, __p, __n, __c); }
528 template<class _InputIterator>
529 void insert(iterator __p, _InputIterator __beg, _InputIterator __end)
530 { this->replace(__p, __p, __beg, __end); }
533 insert(size_type __pos1, const basic_string& __str)
534 { return this->insert(__pos1, __str, 0, __str.size()); }
537 insert(size_type __pos1, const basic_string& __str,
538 size_type __pos2, size_type __n)
540 const size_type __strsize = __str.size();
541 if (__pos2 > __strsize)
542 __throw_out_of_range("basic_string::insert");
543 const bool __testn = __n < __strsize - __pos2;
544 const size_type __newsize = __testn ? __n : __strsize - __pos2;
545 return this->insert(__pos1, __str._M_data() + __pos2, __newsize);
549 insert(size_type __pos, const _CharT* __s, size_type __n)
551 const size_type __size = this->size();
553 __throw_out_of_range("basic_string::insert");
554 if (__size > this->max_size() - __n)
555 __throw_length_error("basic_string::insert");
556 if (_M_rep()->_M_is_shared() || less<const _CharT*>()(__s, _M_data())
557 || less<const _CharT*>()(_M_data() + __size, __s))
558 return _M_replace_safe(_M_ibegin() + __pos, _M_ibegin() + __pos,
562 // Work in-place. If _M_mutate reallocates the string, __s
563 // does not point anymore to valid data, therefore we save its
564 // offset, then we restore it.
565 const size_type __off = __s - _M_data();
566 _M_mutate(__pos, 0, __n);
567 __s = _M_data() + __off;
568 _CharT* __p = _M_data() + __pos;
569 if (__s + __n <= __p)
570 traits_type::copy(__p, __s, __n);
572 traits_type::copy(__p, __s + __n, __n);
575 traits_type::copy(__p, __s, __p - __s);
576 traits_type::copy(__p + (__p - __s), __p + __n, __n - (__p - __s));
583 insert(size_type __pos, const _CharT* __s)
584 { return this->insert(__pos, __s, traits_type::length(__s)); }
587 insert(size_type __pos, size_type __n, _CharT __c)
589 this->insert(_M_check(__pos), __n, __c);
594 insert(iterator __p, _CharT __c = _CharT())
596 size_type __pos = __p - _M_ibegin();
597 this->insert(_M_check(__pos), size_type(1), __c);
598 _M_rep()->_M_set_leaked();
599 return this->_M_ibegin() + __pos;
603 erase(size_type __pos = 0, size_type __n = npos)
605 return this->replace(_M_check(__pos), _M_fold(__pos, __n),
606 _M_data(), _M_data());
610 erase(iterator __position)
612 size_type __i = __position - _M_ibegin();
613 this->replace(__position, __position + 1, _M_data(), _M_data());
614 _M_rep()->_M_set_leaked();
615 return _M_ibegin() + __i;
619 erase(iterator __first, iterator __last)
621 size_type __i = __first - _M_ibegin();
622 this->replace(__first, __last, _M_data(), _M_data());
623 _M_rep()->_M_set_leaked();
624 return _M_ibegin() + __i;
628 replace(size_type __pos, size_type __n, const basic_string& __str)
629 { return this->replace(__pos, __n, __str._M_data(), __str.size()); }
632 replace(size_type __pos1, size_type __n1, const basic_string& __str,
633 size_type __pos2, size_type __n2);
636 replace(size_type __pos, size_type __n1, const _CharT* __s,
639 const size_type __size = this->size();
641 __throw_out_of_range("basic_string::replace");
642 if (__size - __n1 > this->max_size() - __n2)
643 __throw_length_error("basic_string::replace");
644 const bool __testn1 = __n1 < __size - __pos;
645 const size_type __foldn1 = __testn1 ? __n1 : __size - __pos;
646 if (_M_rep()->_M_is_shared() || less<const _CharT*>()(__s, _M_data())
647 || less<const _CharT*>()(_M_data() + __size, __s))
648 return _M_replace_safe(_M_ibegin() + __pos,
649 _M_ibegin() + __pos + __foldn1, __s, __s + __n2);
650 else return this->replace(_M_check(__pos), _M_fold(__pos, __n1),
655 replace(size_type __pos, size_type __n1, const _CharT* __s)
656 { return this->replace(__pos, __n1, __s, traits_type::length(__s)); }
659 replace(size_type __pos, size_type __n1, size_type __n2, _CharT __c)
660 { return this->replace(_M_check(__pos), _M_fold(__pos, __n1), __n2, __c); }
663 replace(iterator __i1, iterator __i2, const basic_string& __str)
664 { return this->replace(__i1, __i2, __str._M_data(), __str.size()); }
667 replace(iterator __i1, iterator __i2,
668 const _CharT* __s, size_type __n)
669 { return this->replace(__i1 - _M_ibegin(), __i2 - __i1, __s, __n); }
672 replace(iterator __i1, iterator __i2, const _CharT* __s)
673 { return this->replace(__i1, __i2, __s, traits_type::length(__s)); }
676 replace(iterator __i1, iterator __i2, size_type __n, _CharT __c);
678 template<class _InputIterator>
680 replace(iterator __i1, iterator __i2,
681 _InputIterator __k1, _InputIterator __k2)
682 { return _M_replace(__i1, __i2, __k1, __k2,
683 typename iterator_traits<_InputIterator>::iterator_category()); }
686 template<class _InputIterator>
688 _M_replace(iterator __i1, iterator __i2, _InputIterator __k1,
689 _InputIterator __k2, input_iterator_tag);
691 template<class _ForwardIterator>
693 _M_replace_safe(iterator __i1, iterator __i2, _ForwardIterator __k1,
694 _ForwardIterator __k2);
696 // _S_construct_aux is used to implement the 21.3.1 para 15 which
697 // requires special behaviour if _InIter is an integral type
698 template<class _InIter>
700 _S_construct_aux(_InIter __beg, _InIter __end, const _Alloc& __a,
703 typedef typename iterator_traits<_InIter>::iterator_category _Tag;
704 return _S_construct(__beg, __end, __a, _Tag());
707 template<class _InIter>
709 _S_construct_aux(_InIter __beg, _InIter __end, const _Alloc& __a,
712 return _S_construct(static_cast<size_type>(__beg),
713 static_cast<value_type>(__end), __a);
716 template<class _InIter>
718 _S_construct(_InIter __beg, _InIter __end, const _Alloc& __a)
720 typedef typename _Is_integer<_InIter>::_Integral _Integral;
721 return _S_construct_aux(__beg, __end, __a, _Integral());
724 // For Input Iterators, used in istreambuf_iterators, etc.
725 template<class _InIter>
727 _S_construct(_InIter __beg, _InIter __end, const _Alloc& __a,
730 // For forward_iterators up to random_access_iterators, used for
731 // string::iterator, _CharT*, etc.
732 template<class _FwdIter>
734 _S_construct(_FwdIter __end, _FwdIter __beg, const _Alloc& __a,
735 forward_iterator_tag);
738 _S_construct(size_type __req, _CharT __c, const _Alloc& __a);
743 copy(_CharT* __s, size_type __n, size_type __pos = 0) const;
746 swap(basic_string<_CharT, _Traits, _Alloc>& __s);
748 // String operations:
752 // MT: This assumes concurrent writes are OK.
753 size_type __n = this->size();
754 traits_type::assign(_M_data()[__n], _Rep::_S_terminal);
759 data() const { return _M_data(); }
762 get_allocator() const { return _M_dataplus; }
765 find(const _CharT* __s, size_type __pos, size_type __n) const;
768 find(const basic_string& __str, size_type __pos = 0) const
769 { return this->find(__str.data(), __pos, __str.size()); }
772 find(const _CharT* __s, size_type __pos = 0) const
773 { return this->find(__s, __pos, traits_type::length(__s)); }
776 find(_CharT __c, size_type __pos = 0) const;
779 rfind(const basic_string& __str, size_type __pos = npos) const
780 { return this->rfind(__str.data(), __pos, __str.size()); }
783 rfind(const _CharT* __s, size_type __pos, size_type __n) const;
786 rfind(const _CharT* __s, size_type __pos = npos) const
787 { return this->rfind(__s, __pos, traits_type::length(__s)); }
790 rfind(_CharT __c, size_type __pos = npos) const;
793 find_first_of(const basic_string& __str, size_type __pos = 0) const
794 { return this->find_first_of(__str.data(), __pos, __str.size()); }
797 find_first_of(const _CharT* __s, size_type __pos, size_type __n) const;
800 find_first_of(const _CharT* __s, size_type __pos = 0) const
801 { return this->find_first_of(__s, __pos, traits_type::length(__s)); }
804 find_first_of(_CharT __c, size_type __pos = 0) const
805 { return this->find(__c, __pos); }
808 find_last_of(const basic_string& __str, size_type __pos = npos) const
809 { return this->find_last_of(__str.data(), __pos, __str.size()); }
812 find_last_of(const _CharT* __s, size_type __pos, size_type __n) const;
815 find_last_of(const _CharT* __s, size_type __pos = npos) const
816 { return this->find_last_of(__s, __pos, traits_type::length(__s)); }
819 find_last_of(_CharT __c, size_type __pos = npos) const
820 { return this->rfind(__c, __pos); }
823 find_first_not_of(const basic_string& __str, size_type __pos = 0) const
824 { return this->find_first_not_of(__str.data(), __pos, __str.size()); }
827 find_first_not_of(const _CharT* __s, size_type __pos,
828 size_type __n) const;
831 find_first_not_of(const _CharT* __s, size_type __pos = 0) const
832 { return this->find_first_not_of(__s, __pos, traits_type::length(__s)); }
835 find_first_not_of(_CharT __c, size_type __pos = 0) const;
838 find_last_not_of(const basic_string& __str, size_type __pos = npos) const
839 { return this->find_last_not_of(__str.data(), __pos, __str.size()); }
842 find_last_not_of(const _CharT* __s, size_type __pos,
843 size_type __n) const;
845 find_last_not_of(const _CharT* __s, size_type __pos = npos) const
846 { return this->find_last_not_of(__s, __pos, traits_type::length(__s)); }
849 find_last_not_of(_CharT __c, size_type __pos = npos) const;
852 substr(size_type __pos = 0, size_type __n = npos) const
854 if (__pos > this->size())
855 __throw_out_of_range("basic_string::substr");
856 return basic_string(*this, __pos, __n);
860 compare(const basic_string& __str) const
862 size_type __size = this->size();
863 size_type __osize = __str.size();
864 size_type __len = min(__size, __osize);
866 int __r = traits_type::compare(_M_data(), __str.data(), __len);
868 __r = __size - __osize;
873 compare(size_type __pos, size_type __n, const basic_string& __str) const;
876 compare(size_type __pos1, size_type __n1, const basic_string& __str,
877 size_type __pos2, size_type __n2) const;
880 compare(const _CharT* __s) const;
882 #ifdef _GLIBCPP_RESOLVE_LIB_DEFECTS
883 // 5. String::compare specification questionable
885 compare(size_type __pos, size_type __n1, const _CharT* __s) const;
888 compare(size_type __pos, size_type __n1, const _CharT* __s,
889 size_type __n2) const;
894 template<typename _CharT, typename _Traits, typename _Alloc>
895 inline basic_string<_CharT, _Traits, _Alloc>::
897 : _M_dataplus(_S_empty_rep()._M_refcopy(), _Alloc()) { }
900 template<typename _CharT, typename _Traits, typename _Alloc>
901 basic_string<_CharT, _Traits, _Alloc>
902 operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
903 const basic_string<_CharT, _Traits, _Alloc>& __rhs)
905 basic_string<_CharT, _Traits, _Alloc> __str(__lhs);
910 template<typename _CharT, typename _Traits, typename _Alloc>
911 basic_string<_CharT,_Traits,_Alloc>
912 operator+(const _CharT* __lhs,
913 const basic_string<_CharT,_Traits,_Alloc>& __rhs);
915 template<typename _CharT, typename _Traits, typename _Alloc>
916 basic_string<_CharT,_Traits,_Alloc>
917 operator+(_CharT __lhs, const basic_string<_CharT,_Traits,_Alloc>& __rhs);
919 template<typename _CharT, typename _Traits, typename _Alloc>
920 inline basic_string<_CharT, _Traits, _Alloc>
921 operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
924 basic_string<_CharT, _Traits, _Alloc> __str(__lhs);
929 template<typename _CharT, typename _Traits, typename _Alloc>
930 inline basic_string<_CharT, _Traits, _Alloc>
931 operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs, _CharT __rhs)
933 typedef basic_string<_CharT, _Traits, _Alloc> __string_type;
934 typedef typename __string_type::size_type __size_type;
935 __string_type __str(__lhs);
936 __str.append(__size_type(1), __rhs);
941 template<typename _CharT, typename _Traits, typename _Alloc>
943 operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
944 const basic_string<_CharT, _Traits, _Alloc>& __rhs)
945 { return __lhs.compare(__rhs) == 0; }
947 template<typename _CharT, typename _Traits, typename _Alloc>
949 operator==(const _CharT* __lhs,
950 const basic_string<_CharT, _Traits, _Alloc>& __rhs)
951 { return __rhs.compare(__lhs) == 0; }
953 template<typename _CharT, typename _Traits, typename _Alloc>
955 operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
957 { return __lhs.compare(__rhs) == 0; }
960 template<typename _CharT, typename _Traits, typename _Alloc>
962 operator!=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
963 const basic_string<_CharT, _Traits, _Alloc>& __rhs)
964 { return __rhs.compare(__lhs) != 0; }
966 template<typename _CharT, typename _Traits, typename _Alloc>
968 operator!=(const _CharT* __lhs,
969 const basic_string<_CharT, _Traits, _Alloc>& __rhs)
970 { return __rhs.compare(__lhs) != 0; }
972 template<typename _CharT, typename _Traits, typename _Alloc>
974 operator!=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
976 { return __lhs.compare(__rhs) != 0; }
979 template<typename _CharT, typename _Traits, typename _Alloc>
981 operator<(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
982 const basic_string<_CharT, _Traits, _Alloc>& __rhs)
983 { return __lhs.compare(__rhs) < 0; }
985 template<typename _CharT, typename _Traits, typename _Alloc>
987 operator<(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
989 { return __lhs.compare(__rhs) < 0; }
991 template<typename _CharT, typename _Traits, typename _Alloc>
993 operator<(const _CharT* __lhs,
994 const basic_string<_CharT, _Traits, _Alloc>& __rhs)
995 { return __rhs.compare(__lhs) > 0; }
998 template<typename _CharT, typename _Traits, typename _Alloc>
1000 operator>(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
1001 const basic_string<_CharT, _Traits, _Alloc>& __rhs)
1002 { return __lhs.compare(__rhs) > 0; }
1004 template<typename _CharT, typename _Traits, typename _Alloc>
1006 operator>(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
1007 const _CharT* __rhs)
1008 { return __lhs.compare(__rhs) > 0; }
1010 template<typename _CharT, typename _Traits, typename _Alloc>
1012 operator>(const _CharT* __lhs,
1013 const basic_string<_CharT, _Traits, _Alloc>& __rhs)
1014 { return __rhs.compare(__lhs) < 0; }
1017 template<typename _CharT, typename _Traits, typename _Alloc>
1019 operator<=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
1020 const basic_string<_CharT, _Traits, _Alloc>& __rhs)
1021 { return __lhs.compare(__rhs) <= 0; }
1023 template<typename _CharT, typename _Traits, typename _Alloc>
1025 operator<=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
1026 const _CharT* __rhs)
1027 { return __lhs.compare(__rhs) <= 0; }
1029 template<typename _CharT, typename _Traits, typename _Alloc>
1031 operator<=(const _CharT* __lhs,
1032 const basic_string<_CharT, _Traits, _Alloc>& __rhs)
1033 { return __rhs.compare(__lhs) >= 0; }
1036 template<typename _CharT, typename _Traits, typename _Alloc>
1038 operator>=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
1039 const basic_string<_CharT, _Traits, _Alloc>& __rhs)
1040 { return __lhs.compare(__rhs) >= 0; }
1042 template<typename _CharT, typename _Traits, typename _Alloc>
1044 operator>=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
1045 const _CharT* __rhs)
1046 { return __lhs.compare(__rhs) >= 0; }
1048 template<typename _CharT, typename _Traits, typename _Alloc>
1050 operator>=(const _CharT* __lhs,
1051 const basic_string<_CharT, _Traits, _Alloc>& __rhs)
1052 { return __rhs.compare(__lhs) <= 0; }
1055 template<typename _CharT, typename _Traits, typename _Alloc>
1057 swap(basic_string<_CharT, _Traits, _Alloc>& __lhs,
1058 basic_string<_CharT, _Traits, _Alloc>& __rhs)
1059 { __lhs.swap(__rhs); }
1061 template<typename _CharT, typename _Traits, typename _Alloc>
1062 basic_istream<_CharT, _Traits>&
1063 operator>>(basic_istream<_CharT, _Traits>& __is,
1064 basic_string<_CharT, _Traits, _Alloc>& __str);
1066 template<typename _CharT, typename _Traits, typename _Alloc>
1067 basic_ostream<_CharT, _Traits>&
1068 operator<<(basic_ostream<_CharT, _Traits>& __os,
1069 const basic_string<_CharT, _Traits, _Alloc>& __str);
1071 template<typename _CharT, typename _Traits, typename _Alloc>
1072 basic_istream<_CharT,_Traits>&
1073 getline(basic_istream<_CharT, _Traits>& __is,
1074 basic_string<_CharT, _Traits, _Alloc>& __str, _CharT __delim);
1076 template<typename _CharT, typename _Traits, typename _Alloc>
1077 inline basic_istream<_CharT,_Traits>&
1078 getline(basic_istream<_CharT, _Traits>& __is,
1079 basic_string<_CharT, _Traits, _Alloc>& __str);
1082 #endif /* _CPP_BITS_STRING_H */