1 // Main templates for the -*- C++ -*- string classes. 2 // Copyright (C) 1994, 1995, 1999 Free Software Foundation 3 4 // This file is part of the GNU ANSI C++ Library. This library is free 5 // software; you can redistribute it and/or modify it under the 6 // terms of the GNU General Public License as published by the 7 // Free Software Foundation; either version 2, or (at your option) 8 // any later version. 9 10 // This library is distributed in the hope that it will be useful, 11 // but WITHOUT ANY WARRANTY; without even the implied warranty of 12 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 13 // GNU General Public License for more details. 14 15 // You should have received a copy of the GNU General Public License 16 // along with this library; see the file COPYING. If not, write to the Free 17 // Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. 18 19 // As a special exception, if you link this library with files 20 // compiled with a GNU compiler to produce an executable, this does not cause 21 // the resulting executable to be covered by the GNU General Public License. 22 // This exception does not however invalidate any other reasons why 23 // the executable file might be covered by the GNU General Public License. 24 25 // Written by Jason Merrill based upon the specification by Takanori Adachi 26 // in ANSI X3J16/94-0013R2. 27 28 #ifndef __BASTRING__ 29 #define __BASTRING__ 30 31 #ifdef __GNUG__ 32 #pragma interface 33 #endif 34 35 #include <cstddef> 36 #include <std/straits.h> 37 38 // NOTE : This does NOT conform to the draft standard and is likely to change 39 #include <alloc.h> 40 41 #ifdef __HAIKU__ 42 # include <config/types.h> 43 #endif 44 45 extern "C++" { 46 class istream; class ostream; 47 48 #include <iterator> 49 50 #ifdef __STL_USE_EXCEPTIONS 51 52 extern void __out_of_range (const char *); 53 extern void __length_error (const char *); 54 55 #define OUTOFRANGE(cond) \ 56 do { if (cond) __out_of_range (#cond); } while (0) 57 #define LENGTHERROR(cond) \ 58 do { if (cond) __length_error (#cond); } while (0) 59 60 #else 61 62 #include <cassert> 63 #define OUTOFRANGE(cond) assert (!(cond)) 64 #define LENGTHERROR(cond) assert (!(cond)) 65 66 #endif 67 68 #ifdef __HAIKU__ 69 extern "C" __haiku_int32 atomic_add(volatile __haiku_int32* value, 70 __haiku_int32 addvalue); 71 #endif /* __HAIKU__ */ 72 73 template <class charT, class traits = string_char_traits<charT>, 74 class Allocator = alloc > 75 class basic_string 76 { 77 private: 78 struct Rep { 79 size_t len, res, ref; 80 bool selfish; 81 82 charT* data () { return reinterpret_cast<charT *>(this + 1); } 83 charT& operator[] (size_t s) { return data () [s]; } 84 #ifdef __HAIKU__ 85 charT* grab () { if (selfish) return clone (); atomic_add((volatile __haiku_int32*) &ref, 1); return data (); } 86 void release() { if (atomic_add((__haiku_int32*) &ref, -1) == 1) delete this; } 87 #else 88 charT* grab () { if (selfish) return clone (); ++ref; return data (); } 89 #if defined __i486__ || defined __i586__ || defined __i686__ 90 void release () 91 { 92 size_t __val; 93 // This opcode exists as a .byte instead of as a mnemonic for the 94 // benefit of SCO OpenServer 5. The system assembler (which is 95 // essentially required on this target) can't assemble xaddl in 96 //COFF mode. 97 asm (".byte 0xf0, 0x0f, 0xc1, 0x02" // lock; xaddl %eax, (%edx) 98 : "=a" (__val) 99 : "0" (-1), "m" (ref), "d" (&ref) 100 : "memory"); 101 102 if (__val == 1) 103 delete this; 104 } 105 #elif defined __sparcv9__ 106 void release () 107 { 108 size_t __newval, __oldval = ref; 109 do 110 { 111 __newval = __oldval - 1; 112 __asm__ ("cas [%4], %2, %0" 113 : "=r" (__oldval), "=m" (ref) 114 : "r" (__oldval), "m" (ref), "r"(&(ref)), "0" (__newval)); 115 } 116 while (__newval != __oldval); 117 118 if (__oldval == 0) 119 delete this; 120 } 121 #else 122 void release () { if (--ref == 0) delete this; } 123 #endif 124 #endif /* __HAIKU__ */ 125 inline static void * operator new (size_t, size_t); 126 inline static void operator delete (void *); 127 inline static Rep* create (size_t); 128 charT* clone (); 129 130 inline void copy (size_t, const charT *, size_t); 131 inline void move (size_t, const charT *, size_t); 132 inline void set (size_t, const charT, size_t); 133 134 inline static bool excess_slop (size_t, size_t); 135 inline static size_t frob_size (size_t); 136 137 private: 138 Rep &operator= (const Rep &); 139 }; 140 141 public: 142 // types: 143 typedef traits traits_type; 144 typedef typename traits::char_type value_type; 145 typedef Allocator allocator_type; 146 147 typedef size_t size_type; 148 typedef ptrdiff_t difference_type; 149 typedef charT& reference; 150 typedef const charT& const_reference; 151 typedef charT* pointer; 152 typedef const charT* const_pointer; 153 typedef pointer iterator; 154 typedef const_pointer const_iterator; 155 typedef ::reverse_iterator<iterator> reverse_iterator; 156 typedef ::reverse_iterator<const_iterator> const_reverse_iterator; 157 static const size_type npos = static_cast<size_type>(-1); 158 159 private: 160 Rep *rep () const { return reinterpret_cast<Rep *>(dat) - 1; } 161 void repup (Rep *p) { rep ()->release (); dat = p->data (); } 162 163 public: 164 const charT* data () const 165 { return rep ()->data(); } 166 size_type length () const 167 { return rep ()->len; } 168 size_type size () const 169 { return rep ()->len; } 170 size_type capacity () const 171 { return rep ()->res; } 172 size_type max_size () const 173 { return (npos - 1)/sizeof (charT); } // XXX 174 bool empty () const 175 { return size () == 0; } 176 177 // _lib.string.cons_ construct/copy/destroy: 178 basic_string& operator= (const basic_string& str) 179 { 180 if (&str != this) { rep ()->release (); dat = str.rep ()->grab (); } 181 return *this; 182 } 183 184 explicit basic_string (): dat (nilRep.grab ()) { } 185 basic_string (const basic_string& _str): dat (_str.rep ()->grab ()) { } 186 basic_string (const basic_string& _str, size_type pos, size_type n = npos) 187 : dat (nilRep.grab ()) { assign (_str, pos, n); } 188 basic_string (const charT* s, size_type n) 189 : dat (nilRep.grab ()) { assign (s, n); } 190 basic_string (const charT* s) 191 : dat (nilRep.grab ()) { assign (s); } 192 basic_string (size_type n, charT c) 193 : dat (nilRep.grab ()) { assign (n, c); } 194 #ifdef __STL_MEMBER_TEMPLATES 195 template<class InputIterator> 196 basic_string(InputIterator __begin, InputIterator __end) 197 #else 198 basic_string(const_iterator __begin, const_iterator __end) 199 #endif 200 : dat (nilRep.grab ()) { assign (__begin, __end); } 201 202 ~basic_string () 203 { rep ()->release (); } 204 205 void swap (basic_string &s) { charT *d = dat; dat = s.dat; s.dat = d; } 206 207 basic_string& append (const basic_string& _str, size_type pos = 0, 208 size_type n = npos) 209 { return replace (length (), 0, _str, pos, n); } 210 basic_string& append (const charT* s, size_type n) 211 { return replace (length (), 0, s, n); } 212 basic_string& append (const charT* s) 213 { return append (s, traits::length (s)); } 214 basic_string& append (size_type n, charT c) 215 { return replace (length (), 0, n, c); } 216 #ifdef __STL_MEMBER_TEMPLATES 217 template<class InputIterator> 218 basic_string& append(InputIterator first, InputIterator last) 219 #else 220 basic_string& append(const_iterator first, const_iterator last) 221 #endif 222 { return replace (iend (), iend (), first, last); } 223 224 void push_back(charT __c) 225 { append(1, __c); } 226 227 basic_string& assign (const basic_string& str, size_type pos = 0, 228 size_type n = npos) 229 { return replace (0, npos, str, pos, n); } 230 basic_string& assign (const charT* s, size_type n) 231 { return replace (0, npos, s, n); } 232 basic_string& assign (const charT* s) 233 { return assign (s, traits::length (s)); } 234 basic_string& assign (size_type n, charT c) 235 { return replace (0, npos, n, c); } 236 #ifdef __STL_MEMBER_TEMPLATES 237 template<class InputIterator> 238 basic_string& assign(InputIterator first, InputIterator last) 239 #else 240 basic_string& assign(const_iterator first, const_iterator last) 241 #endif 242 { return replace (ibegin (), iend (), first, last); } 243 244 basic_string& operator= (const charT* s) 245 { return assign (s); } 246 basic_string& operator= (charT c) 247 { return assign (1, c); } 248 249 basic_string& operator+= (const basic_string& rhs) 250 { return append (rhs); } 251 basic_string& operator+= (const charT* s) 252 { return append (s); } 253 basic_string& operator+= (charT c) 254 { return append (1, c); } 255 256 basic_string& insert (size_type pos1, const basic_string& str, 257 size_type pos2 = 0, size_type n = npos) 258 { return replace (pos1, 0, str, pos2, n); } 259 basic_string& insert (size_type pos, const charT* s, size_type n) 260 { return replace (pos, 0, s, n); } 261 basic_string& insert (size_type pos, const charT* s) 262 { return insert (pos, s, traits::length (s)); } 263 basic_string& insert (size_type pos, size_type n, charT c) 264 { return replace (pos, 0, n, c); } 265 iterator insert(iterator p, charT c) 266 { size_type __o = p - ibegin (); 267 insert (p - ibegin (), 1, c); selfish (); 268 return ibegin () + __o; } 269 iterator insert(iterator p, size_type n, charT c) 270 { size_type __o = p - ibegin (); 271 insert (p - ibegin (), n, c); selfish (); 272 return ibegin () + __o; } 273 #ifdef __STL_MEMBER_TEMPLATES 274 template<class InputIterator> 275 void insert(iterator p, InputIterator first, InputIterator last) 276 #else 277 void insert(iterator p, const_iterator first, const_iterator last) 278 #endif 279 { replace (p, p, first, last); } 280 281 basic_string& erase (size_type pos = 0, size_type n = npos) 282 { return replace (pos, n, (size_type)0, (charT)0); } 283 iterator erase(iterator p) 284 { size_type __o = p - begin(); 285 replace (__o, 1, (size_type)0, (charT)0); selfish (); 286 return ibegin() + __o; } 287 iterator erase(iterator f, iterator l) 288 { size_type __o = f - ibegin(); 289 replace (__o, l-f, (size_type)0, (charT)0);selfish (); 290 return ibegin() + __o; } 291 292 basic_string& replace (size_type pos1, size_type n1, const basic_string& str, 293 size_type pos2 = 0, size_type n2 = npos); 294 basic_string& replace (size_type pos, size_type n1, const charT* s, 295 size_type n2); 296 basic_string& replace (size_type pos, size_type n1, const charT* s) 297 { return replace (pos, n1, s, traits::length (s)); } 298 basic_string& replace (size_type pos, size_type n1, size_type n2, charT c); 299 basic_string& replace (size_type pos, size_type n, charT c) 300 { return replace (pos, n, 1, c); } 301 basic_string& replace (iterator i1, iterator i2, const basic_string& str) 302 { return replace (i1 - ibegin (), i2 - i1, str); } 303 basic_string& replace (iterator i1, iterator i2, const charT* s, size_type n) 304 { return replace (i1 - ibegin (), i2 - i1, s, n); } 305 basic_string& replace (iterator i1, iterator i2, const charT* s) 306 { return replace (i1 - ibegin (), i2 - i1, s); } 307 basic_string& replace (iterator i1, iterator i2, size_type n, charT c) 308 { return replace (i1 - ibegin (), i2 - i1, n, c); } 309 #ifdef __STL_MEMBER_TEMPLATES 310 template<class InputIterator> 311 basic_string& replace(iterator i1, iterator i2, 312 InputIterator j1, InputIterator j2); 313 #else 314 basic_string& replace(iterator i1, iterator i2, 315 const_iterator j1, const_iterator j2); 316 #endif 317 318 private: 319 static charT eos () { return traits::eos (); } 320 void unique () { if (rep ()->ref > 1) alloc (length (), true); } 321 void selfish () { unique (); rep ()->selfish = true; } 322 323 public: 324 charT operator[] (size_type pos) const 325 { 326 if (pos == length ()) 327 return eos (); 328 return data ()[pos]; 329 } 330 331 reference operator[] (size_type pos) 332 { selfish (); return (*rep ())[pos]; } 333 334 reference at (size_type pos) 335 { 336 OUTOFRANGE (pos >= length ()); 337 return (*this)[pos]; 338 } 339 const_reference at (size_type pos) const 340 { 341 OUTOFRANGE (pos >= length ()); 342 return data ()[pos]; 343 } 344 345 private: 346 void terminate () const 347 { traits::assign ((*rep ())[length ()], eos ()); } 348 349 public: 350 const charT* c_str () const 351 { if (length () == 0) return ""; terminate (); return data (); } 352 void resize (size_type n, charT c); 353 void resize (size_type n) 354 { resize (n, eos ()); } 355 void reserve (size_type) { } 356 357 size_type copy (charT* s, size_type n, size_type pos = 0) const; 358 359 size_type find (const basic_string& str, size_type pos = 0) const 360 { return find (str.data(), pos, str.length()); } 361 size_type find (const charT* s, size_type pos, size_type n) const; 362 size_type find (const charT* _s, size_type pos = 0) const 363 { return find (_s, pos, traits::length (_s)); } 364 size_type find (charT c, size_type pos = 0) const; 365 366 size_type rfind (const basic_string& str, size_type pos = npos) const 367 { return rfind (str.data(), pos, str.length()); } 368 size_type rfind (const charT* s, size_type pos, size_type n) const; 369 size_type rfind (const charT* s, size_type pos = npos) const 370 { return rfind (s, pos, traits::length (s)); } 371 size_type rfind (charT c, size_type pos = npos) const; 372 373 size_type find_first_of (const basic_string& str, size_type pos = 0) const 374 { return find_first_of (str.data(), pos, str.length()); } 375 size_type find_first_of (const charT* s, size_type pos, size_type n) const; 376 size_type find_first_of (const charT* s, size_type pos = 0) const 377 { return find_first_of (s, pos, traits::length (s)); } 378 size_type find_first_of (charT c, size_type pos = 0) const 379 { return find (c, pos); } 380 381 size_type find_last_of (const basic_string& str, size_type pos = npos) const 382 { return find_last_of (str.data(), pos, str.length()); } 383 size_type find_last_of (const charT* s, size_type pos, size_type n) const; 384 size_type find_last_of (const charT* s, size_type pos = npos) const 385 { return find_last_of (s, pos, traits::length (s)); } 386 size_type find_last_of (charT c, size_type pos = npos) const 387 { return rfind (c, pos); } 388 389 size_type find_first_not_of (const basic_string& str, size_type pos = 0) const 390 { return find_first_not_of (str.data(), pos, str.length()); } 391 size_type find_first_not_of (const charT* s, size_type pos, size_type n) const; 392 size_type find_first_not_of (const charT* s, size_type pos = 0) const 393 { return find_first_not_of (s, pos, traits::length (s)); } 394 size_type find_first_not_of (charT c, size_type pos = 0) const; 395 396 size_type find_last_not_of (const basic_string& str, size_type pos = npos) const 397 { return find_last_not_of (str.data(), pos, str.length()); } 398 size_type find_last_not_of (const charT* s, size_type pos, size_type n) const; 399 size_type find_last_not_of (const charT* s, size_type pos = npos) const 400 { return find_last_not_of (s, pos, traits::length (s)); } 401 size_type find_last_not_of (charT c, size_type pos = npos) const; 402 403 basic_string substr (size_type pos = 0, size_type n = npos) const 404 { return basic_string (*this, pos, n); } 405 406 int compare (const basic_string& str, size_type pos = 0, size_type n = npos) const; 407 // There is no 'strncmp' equivalent for charT pointers. 408 int compare (const charT* s, size_type pos, size_type n) const; 409 int compare (const charT* s, size_type pos = 0) const 410 { return compare (s, pos, traits::length (s)); } 411 412 iterator begin () { selfish (); return &(*this)[0]; } 413 iterator end () { selfish (); return &(*this)[length ()]; } 414 415 private: 416 iterator ibegin () const { return &(*rep ())[0]; } 417 iterator iend () const { return &(*rep ())[length ()]; } 418 419 public: 420 const_iterator begin () const { return ibegin (); } 421 const_iterator end () const { return iend (); } 422 423 reverse_iterator rbegin() { return reverse_iterator (end ()); } 424 const_reverse_iterator rbegin() const 425 { return const_reverse_iterator (end ()); } 426 reverse_iterator rend() { return reverse_iterator (begin ()); } 427 const_reverse_iterator rend() const 428 { return const_reverse_iterator (begin ()); } 429 430 private: 431 void alloc (size_type size, bool save); 432 static size_type _find (const charT* ptr, charT c, size_type xpos, size_type len); 433 inline bool check_realloc (size_type s) const; 434 435 static Rep nilRep; 436 charT *dat; 437 }; 438 439 #ifdef __STL_MEMBER_TEMPLATES 440 template <class charT, class traits, class Allocator> template <class InputIterator> 441 basic_string <charT, traits, Allocator>& basic_string <charT, traits, Allocator>:: 442 replace (iterator i1, iterator i2, InputIterator j1, InputIterator j2) 443 #else 444 template <class charT, class traits, class Allocator> 445 basic_string <charT, traits, Allocator>& basic_string <charT, traits, Allocator>:: 446 replace (iterator i1, iterator i2, const_iterator j1, const_iterator j2) 447 #endif 448 { 449 const size_type len = length (); 450 size_type pos = i1 - ibegin (); 451 size_type n1 = i2 - i1; 452 size_type n2 = j2 - j1; 453 454 OUTOFRANGE (pos > len); 455 if (n1 > len - pos) 456 n1 = len - pos; 457 LENGTHERROR (len - n1 > max_size () - n2); 458 size_t newlen = len - n1 + n2; 459 460 if (check_realloc (newlen)) 461 { 462 Rep *p = Rep::create (newlen); 463 p->copy (0, data (), pos); 464 p->copy (pos + n2, data () + pos + n1, len - (pos + n1)); 465 for (; j1 != j2; ++j1, ++pos) 466 traits::assign ((*p)[pos], *j1); 467 repup (p); 468 } 469 else 470 { 471 rep ()->move (pos + n2, data () + pos + n1, len - (pos + n1)); 472 for (; j1 != j2; ++j1, ++pos) 473 traits::assign ((*rep ())[pos], *j1); 474 } 475 rep ()->len = newlen; 476 477 return *this; 478 } 479 480 template <class charT, class traits, class Allocator> 481 inline basic_string <charT, traits, Allocator> 482 operator+ (const basic_string <charT, traits, Allocator>& lhs, 483 const basic_string <charT, traits, Allocator>& rhs) 484 { 485 basic_string <charT, traits, Allocator> _str (lhs); 486 _str.append (rhs); 487 return _str; 488 } 489 490 template <class charT, class traits, class Allocator> 491 inline basic_string <charT, traits, Allocator> 492 operator+ (const charT* lhs, const basic_string <charT, traits, Allocator>& rhs) 493 { 494 basic_string <charT, traits, Allocator> _str (lhs); 495 _str.append (rhs); 496 return _str; 497 } 498 499 template <class charT, class traits, class Allocator> 500 inline basic_string <charT, traits, Allocator> 501 operator+ (charT lhs, const basic_string <charT, traits, Allocator>& rhs) 502 { 503 basic_string <charT, traits, Allocator> _str (1, lhs); 504 _str.append (rhs); 505 return _str; 506 } 507 508 template <class charT, class traits, class Allocator> 509 inline basic_string <charT, traits, Allocator> 510 operator+ (const basic_string <charT, traits, Allocator>& lhs, const charT* rhs) 511 { 512 basic_string <charT, traits, Allocator> _str (lhs); 513 _str.append (rhs); 514 return _str; 515 } 516 517 template <class charT, class traits, class Allocator> 518 inline basic_string <charT, traits, Allocator> 519 operator+ (const basic_string <charT, traits, Allocator>& lhs, charT rhs) 520 { 521 basic_string <charT, traits, Allocator> str (lhs); 522 str.append (1, rhs); 523 return str; 524 } 525 526 template <class charT, class traits, class Allocator> 527 inline bool 528 operator== (const basic_string <charT, traits, Allocator>& lhs, 529 const basic_string <charT, traits, Allocator>& rhs) 530 { 531 return (lhs.compare (rhs) == 0); 532 } 533 534 template <class charT, class traits, class Allocator> 535 inline bool 536 operator== (const charT* lhs, const basic_string <charT, traits, Allocator>& rhs) 537 { 538 return (rhs.compare (lhs) == 0); 539 } 540 541 template <class charT, class traits, class Allocator> 542 inline bool 543 operator== (const basic_string <charT, traits, Allocator>& lhs, const charT* rhs) 544 { 545 return (lhs.compare (rhs) == 0); 546 } 547 548 template <class charT, class traits, class Allocator> 549 inline bool 550 operator!= (const charT* lhs, const basic_string <charT, traits, Allocator>& rhs) 551 { 552 return (rhs.compare (lhs) != 0); 553 } 554 555 template <class charT, class traits, class Allocator> 556 inline bool 557 operator!= (const basic_string <charT, traits, Allocator>& lhs, const charT* rhs) 558 { 559 return (lhs.compare (rhs) != 0); 560 } 561 562 template <class charT, class traits, class Allocator> 563 inline bool 564 operator< (const basic_string <charT, traits, Allocator>& lhs, 565 const basic_string <charT, traits, Allocator>& rhs) 566 { 567 return (lhs.compare (rhs) < 0); 568 } 569 570 template <class charT, class traits, class Allocator> 571 inline bool 572 operator< (const charT* lhs, const basic_string <charT, traits, Allocator>& rhs) 573 { 574 return (rhs.compare (lhs) > 0); 575 } 576 577 template <class charT, class traits, class Allocator> 578 inline bool 579 operator< (const basic_string <charT, traits, Allocator>& lhs, const charT* rhs) 580 { 581 return (lhs.compare (rhs) < 0); 582 } 583 584 template <class charT, class traits, class Allocator> 585 inline bool 586 operator> (const charT* lhs, const basic_string <charT, traits, Allocator>& rhs) 587 { 588 return (rhs.compare (lhs) < 0); 589 } 590 591 template <class charT, class traits, class Allocator> 592 inline bool 593 operator> (const basic_string <charT, traits, Allocator>& lhs, const charT* rhs) 594 { 595 return (lhs.compare (rhs) > 0); 596 } 597 598 template <class charT, class traits, class Allocator> 599 inline bool 600 operator<= (const charT* lhs, const basic_string <charT, traits, Allocator>& rhs) 601 { 602 return (rhs.compare (lhs) >= 0); 603 } 604 605 template <class charT, class traits, class Allocator> 606 inline bool 607 operator<= (const basic_string <charT, traits, Allocator>& lhs, const charT* rhs) 608 { 609 return (lhs.compare (rhs) <= 0); 610 } 611 612 template <class charT, class traits, class Allocator> 613 inline bool 614 operator>= (const charT* lhs, const basic_string <charT, traits, Allocator>& rhs) 615 { 616 return (rhs.compare (lhs) <= 0); 617 } 618 619 template <class charT, class traits, class Allocator> 620 inline bool 621 operator>= (const basic_string <charT, traits, Allocator>& lhs, const charT* rhs) 622 { 623 return (lhs.compare (rhs) >= 0); 624 } 625 626 template <class charT, class traits, class Allocator> 627 inline bool 628 operator!= (const basic_string <charT, traits, Allocator>& lhs, 629 const basic_string <charT, traits, Allocator>& rhs) 630 { 631 return (lhs.compare (rhs) != 0); 632 } 633 634 template <class charT, class traits, class Allocator> 635 inline bool 636 operator> (const basic_string <charT, traits, Allocator>& lhs, 637 const basic_string <charT, traits, Allocator>& rhs) 638 { 639 return (lhs.compare (rhs) > 0); 640 } 641 642 template <class charT, class traits, class Allocator> 643 inline bool 644 operator<= (const basic_string <charT, traits, Allocator>& lhs, 645 const basic_string <charT, traits, Allocator>& rhs) 646 { 647 return (lhs.compare (rhs) <= 0); 648 } 649 650 template <class charT, class traits, class Allocator> 651 inline bool 652 operator>= (const basic_string <charT, traits, Allocator>& lhs, 653 const basic_string <charT, traits, Allocator>& rhs) 654 { 655 return (lhs.compare (rhs) >= 0); 656 } 657 658 class istream; class ostream; 659 template <class charT, class traits, class Allocator> istream& 660 operator>> (istream&, basic_string <charT, traits, Allocator>&); 661 template <class charT, class traits, class Allocator> ostream& 662 operator<< (ostream&, const basic_string <charT, traits, Allocator>&); 663 template <class charT, class traits, class Allocator> istream& 664 getline (istream&, basic_string <charT, traits, Allocator>&, charT delim = '\n'); 665 666 } // extern "C++" 667 668 #include <std/bastring.cc> 669 670 #endif 671