1 // SGI's rope implementation -*- C++ -*-
3 // Copyright (C) 2001, 2002 Free Software Foundation, Inc.
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 2, or (at your option)
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.
16 // You should have received a copy of the GNU General Public License along
17 // with this library; see the file COPYING. If not, write to the Free
18 // Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
21 // As a special exception, you may use this file as part of a free software
22 // library without restriction. Specifically, if other files instantiate
23 // templates or use macros or inline functions from this file, or you compile
24 // this file and link it with other files to produce an executable, this
25 // file does not by itself cause the resulting executable to be covered by
26 // the GNU General Public License. This exception does not however
27 // invalidate any other reasons why the executable file might be covered by
28 // the GNU General Public License.
31 * Copyright (c) 1997-1998
32 * Silicon Graphics Computer Systems, Inc.
34 * Permission to use, copy, modify, distribute and sell this software
35 * and its documentation for any purpose is hereby granted without fee,
36 * provided that the above copyright notice appear in all copies and
37 * that both that copyright notice and this permission notice appear
38 * in supporting documentation. Silicon Graphics makes no
39 * representations about the suitability of this software for any
40 * purpose. It is provided "as is" without express or implied warranty.
43 /** @file ext/stl_rope.h
44 * This file is a GNU extension to the Standard C++ Library (possibly
45 * containing extensions from the HP/SGI STL subset). You should only
46 * include this header if you are using GCC 3 or later.
49 // rope<_CharT,_Alloc> is a sequence of _CharT.
50 // Ropes appear to be mutable, but update operations
51 // really copy enough of the data structure to leave the original
52 // valid. Thus ropes can be logically copied by just copying
55 #ifndef __SGI_STL_INTERNAL_ROPE_H
56 # define __SGI_STL_INTERNAL_ROPE_H
59 # define __GC_CONST const
61 # include <bits/stl_threads.h>
62 # define __GC_CONST // constant except for deallocation
65 #include <ext/memory> // For uninitialized_copy_n
73 using std::reverse_iterator;
74 using std::_Alloc_traits;
76 using std::_Refcount_Base;
78 // The _S_eos function is used for those functions that
79 // convert to/from C-like strings to detect the end of the string.
81 // The end-of-C-string character.
82 // This is what the draft standard says it should be.
83 template <class _CharT>
84 inline _CharT _S_eos(_CharT*) { return _CharT(); }
86 // Test for basic character types.
87 // For basic character types leaves having a trailing eos.
88 template <class _CharT>
89 inline bool _S_is_basic_char_type(_CharT*) { return false; }
90 template <class _CharT>
91 inline bool _S_is_one_byte_char_type(_CharT*) { return false; }
93 inline bool _S_is_basic_char_type(char*) { return true; }
94 inline bool _S_is_one_byte_char_type(char*) { return true; }
95 inline bool _S_is_basic_char_type(wchar_t*) { return true; }
97 // Store an eos iff _CharT is a basic character type.
98 // Do not reference _S_eos if it isn't.
99 template <class _CharT>
100 inline void _S_cond_store_eos(_CharT&) {}
102 inline void _S_cond_store_eos(char& __c) { __c = 0; }
103 inline void _S_cond_store_eos(wchar_t& __c) { __c = 0; }
105 // char_producers are logically functions that generate a section of
106 // a string. These can be convereted to ropes. The resulting rope
107 // invokes the char_producer on demand. This allows, for example,
108 // files to be viewed as ropes without reading the entire file.
109 template <class _CharT>
110 class char_producer {
112 virtual ~char_producer() {};
113 virtual void operator()(size_t __start_pos, size_t __len,
114 _CharT* __buffer) = 0;
115 // Buffer should really be an arbitrary output iterator.
116 // That way we could flatten directly into an ostream, etc.
117 // This is thoroughly impossible, since iterator types don't
118 // have runtime descriptions.
123 // Sequence must provide an append operation that appends an
124 // array to the sequence. Sequence buffers are useful only if
125 // appending an entire array is cheaper than appending element by element.
126 // This is true for many string representations.
127 // This should perhaps inherit from ostream<sequence::value_type>
128 // and be implemented correspondingly, so that they can be used
129 // for formatted. For the sake of portability, we don't do this yet.
131 // For now, sequence buffers behave as output iterators. But they also
132 // behave a little like basic_ostringstream<sequence::value_type> and a
133 // little like containers.
135 template<class _Sequence, size_t _Buf_sz = 100>
136 class sequence_buffer : public iterator<std::output_iterator_tag,void,void,void,void>
139 typedef typename _Sequence::value_type value_type;
141 _Sequence* _M_prefix;
142 value_type _M_buffer[_Buf_sz];
146 _M_prefix->append(_M_buffer, _M_buffer + _M_buf_count);
149 ~sequence_buffer() { flush(); }
150 sequence_buffer() : _M_prefix(0), _M_buf_count(0) {}
151 sequence_buffer(const sequence_buffer& __x) {
152 _M_prefix = __x._M_prefix;
153 _M_buf_count = __x._M_buf_count;
154 copy(__x._M_buffer, __x._M_buffer + __x._M_buf_count, _M_buffer);
156 sequence_buffer(sequence_buffer& __x) {
158 _M_prefix = __x._M_prefix;
161 sequence_buffer(_Sequence& __s) : _M_prefix(&__s), _M_buf_count(0) {}
162 sequence_buffer& operator= (sequence_buffer& __x) {
164 _M_prefix = __x._M_prefix;
168 sequence_buffer& operator= (const sequence_buffer& __x) {
169 _M_prefix = __x._M_prefix;
170 _M_buf_count = __x._M_buf_count;
171 copy(__x._M_buffer, __x._M_buffer + __x._M_buf_count, _M_buffer);
174 void push_back(value_type __x)
176 if (_M_buf_count < _Buf_sz) {
177 _M_buffer[_M_buf_count] = __x;
185 void append(value_type* __s, size_t __len)
187 if (__len + _M_buf_count <= _Buf_sz) {
188 size_t __i = _M_buf_count;
190 for (; __j < __len; __i++, __j++) {
191 _M_buffer[__i] = __s[__j];
193 _M_buf_count += __len;
194 } else if (0 == _M_buf_count) {
195 _M_prefix->append(__s, __s + __len);
201 sequence_buffer& write(value_type* __s, size_t __len)
206 sequence_buffer& put(value_type __x)
211 sequence_buffer& operator=(const value_type& __rhs)
216 sequence_buffer& operator*() { return *this; }
217 sequence_buffer& operator++() { return *this; }
218 sequence_buffer& operator++(int) { return *this; }
221 // The following should be treated as private, at least for now.
222 template<class _CharT>
223 class _Rope_char_consumer {
225 // If we had member templates, these should not be virtual.
226 // For now we need to use run-time parametrization where
227 // compile-time would do. Hence this should all be private
229 // The symmetry with char_producer is accidental and temporary.
230 virtual ~_Rope_char_consumer() {};
231 virtual bool operator()(const _CharT* __buffer, size_t __len) = 0;
234 // First a lot of forward declarations. The standard seems to require
235 // much stricter "declaration before use" than many of the implementations
237 template<class _CharT, class _Alloc=allocator<_CharT> > class rope;
238 template<class _CharT, class _Alloc> struct _Rope_RopeConcatenation;
239 template<class _CharT, class _Alloc> struct _Rope_RopeLeaf;
240 template<class _CharT, class _Alloc> struct _Rope_RopeFunction;
241 template<class _CharT, class _Alloc> struct _Rope_RopeSubstring;
242 template<class _CharT, class _Alloc> class _Rope_iterator;
243 template<class _CharT, class _Alloc> class _Rope_const_iterator;
244 template<class _CharT, class _Alloc> class _Rope_char_ref_proxy;
245 template<class _CharT, class _Alloc> class _Rope_char_ptr_proxy;
247 template<class _CharT, class _Alloc>
248 bool operator== (const _Rope_char_ptr_proxy<_CharT,_Alloc>& __x,
249 const _Rope_char_ptr_proxy<_CharT,_Alloc>& __y);
251 template<class _CharT, class _Alloc>
252 _Rope_const_iterator<_CharT,_Alloc> operator-
253 (const _Rope_const_iterator<_CharT,_Alloc>& __x,
256 template<class _CharT, class _Alloc>
257 _Rope_const_iterator<_CharT,_Alloc> operator+
258 (const _Rope_const_iterator<_CharT,_Alloc>& __x,
261 template<class _CharT, class _Alloc>
262 _Rope_const_iterator<_CharT,_Alloc> operator+
264 const _Rope_const_iterator<_CharT,_Alloc>& __x);
266 template<class _CharT, class _Alloc>
268 (const _Rope_const_iterator<_CharT,_Alloc>& __x,
269 const _Rope_const_iterator<_CharT,_Alloc>& __y);
271 template<class _CharT, class _Alloc>
273 (const _Rope_const_iterator<_CharT,_Alloc>& __x,
274 const _Rope_const_iterator<_CharT,_Alloc>& __y);
276 template<class _CharT, class _Alloc>
278 (const _Rope_const_iterator<_CharT,_Alloc>& __x,
279 const _Rope_const_iterator<_CharT,_Alloc>& __y);
281 template<class _CharT, class _Alloc>
282 _Rope_iterator<_CharT,_Alloc> operator-
283 (const _Rope_iterator<_CharT,_Alloc>& __x,
286 template<class _CharT, class _Alloc>
287 _Rope_iterator<_CharT,_Alloc> operator+
288 (const _Rope_iterator<_CharT,_Alloc>& __x,
291 template<class _CharT, class _Alloc>
292 _Rope_iterator<_CharT,_Alloc> operator+
294 const _Rope_iterator<_CharT,_Alloc>& __x);
296 template<class _CharT, class _Alloc>
298 (const _Rope_iterator<_CharT,_Alloc>& __x,
299 const _Rope_iterator<_CharT,_Alloc>& __y);
301 template<class _CharT, class _Alloc>
303 (const _Rope_iterator<_CharT,_Alloc>& __x,
304 const _Rope_iterator<_CharT,_Alloc>& __y);
306 template<class _CharT, class _Alloc>
308 (const _Rope_iterator<_CharT,_Alloc>& __x,
309 const _Rope_iterator<_CharT,_Alloc>& __y);
311 template<class _CharT, class _Alloc>
312 rope<_CharT,_Alloc> operator+ (const rope<_CharT,_Alloc>& __left,
313 const rope<_CharT,_Alloc>& __right);
315 template<class _CharT, class _Alloc>
316 rope<_CharT,_Alloc> operator+ (const rope<_CharT,_Alloc>& __left,
317 const _CharT* __right);
319 template<class _CharT, class _Alloc>
320 rope<_CharT,_Alloc> operator+ (const rope<_CharT,_Alloc>& __left,
323 // Some helpers, so we can use power on ropes.
324 // See below for why this isn't local to the implementation.
326 // This uses a nonstandard refcount convention.
327 // The result has refcount 0.
328 template<class _CharT, class _Alloc>
329 struct _Rope_Concat_fn
330 : public std::binary_function<rope<_CharT,_Alloc>, rope<_CharT,_Alloc>,
331 rope<_CharT,_Alloc> > {
332 rope<_CharT,_Alloc> operator() (const rope<_CharT,_Alloc>& __x,
333 const rope<_CharT,_Alloc>& __y) {
338 template <class _CharT, class _Alloc>
341 identity_element(_Rope_Concat_fn<_CharT, _Alloc>)
343 return rope<_CharT,_Alloc>();
348 // What follows should really be local to rope. Unfortunately,
349 // that doesn't work, since it makes it impossible to define generic
350 // equality on rope iterators. According to the draft standard, the
351 // template parameters for such an equality operator cannot be inferred
352 // from the occurrence of a member class as a parameter.
353 // (SGI compilers in fact allow this, but the __result wouldn't be
355 // Similarly, some of the static member functions are member functions
356 // only to avoid polluting the global namespace, and to circumvent
357 // restrictions on type inference for template functions.
361 // The internal data structure for representing a rope. This is
362 // private to the implementation. A rope is really just a pointer
365 // A few basic functions for manipulating this data structure
366 // are members of _RopeRep. Most of the more complex algorithms
367 // are implemented as rope members.
369 // Some of the static member functions of _RopeRep have identically
370 // named functions in rope that simply invoke the _RopeRep versions.
372 // A macro to introduce various allocation and deallocation functions
373 // These need to be defined differently depending on whether or not
374 // we are using standard conforming allocators, and whether the allocator
375 // instances have real state. Thus this macro is invoked repeatedly
376 // with different definitions of __ROPE_DEFINE_ALLOC.
377 // __ROPE_DEFINE_ALLOC(type,name) defines
378 // type * name_allocate(size_t) and
379 // void name_deallocate(tipe *, size_t)
380 // Both functions may or may not be static.
382 #define __ROPE_DEFINE_ALLOCS(__a) \
383 __ROPE_DEFINE_ALLOC(_CharT,_Data) /* character data */ \
384 typedef _Rope_RopeConcatenation<_CharT,__a> __C; \
385 __ROPE_DEFINE_ALLOC(__C,_C) \
386 typedef _Rope_RopeLeaf<_CharT,__a> __L; \
387 __ROPE_DEFINE_ALLOC(__L,_L) \
388 typedef _Rope_RopeFunction<_CharT,__a> __F; \
389 __ROPE_DEFINE_ALLOC(__F,_F) \
390 typedef _Rope_RopeSubstring<_CharT,__a> __S; \
391 __ROPE_DEFINE_ALLOC(__S,_S)
393 // Internal rope nodes potentially store a copy of the allocator
394 // instance used to allocate them. This is mostly redundant.
395 // But the alternative would be to pass allocator instances around
396 // in some form to nearly all internal functions, since any pointer
397 // assignment may result in a zero reference count and thus require
399 // The _Rope_rep_base class encapsulates
400 // the differences between SGI-style allocators and standard-conforming
403 #define __STATIC_IF_SGI_ALLOC /* not static */
405 // Base class for ordinary allocators.
406 template <class _CharT, class _Allocator, bool _IsStatic>
407 class _Rope_rep_alloc_base {
409 typedef typename _Alloc_traits<_CharT,_Allocator>::allocator_type
411 allocator_type get_allocator() const { return _M_data_allocator; }
412 _Rope_rep_alloc_base(size_t __size, const allocator_type& __a)
413 : _M_size(__size), _M_data_allocator(__a) {}
414 size_t _M_size; // This is here only to avoid wasting space
415 // for an otherwise empty base class.
419 allocator_type _M_data_allocator;
421 # define __ROPE_DEFINE_ALLOC(_Tp, __name) \
423 _Alloc_traits<_Tp,_Allocator>::allocator_type __name##Allocator; \
424 /*static*/ _Tp * __name##_allocate(size_t __n) \
425 { return __name##Allocator(_M_data_allocator).allocate(__n); } \
426 void __name##_deallocate(_Tp* __p, size_t __n) \
427 { __name##Allocator(_M_data_allocator).deallocate(__p, __n); }
428 __ROPE_DEFINE_ALLOCS(_Allocator);
429 # undef __ROPE_DEFINE_ALLOC
432 // Specialization for allocators that have the property that we don't
433 // actually have to store an allocator object.
434 template <class _CharT, class _Allocator>
435 class _Rope_rep_alloc_base<_CharT,_Allocator,true> {
437 typedef typename _Alloc_traits<_CharT,_Allocator>::allocator_type
439 allocator_type get_allocator() const { return allocator_type(); }
440 _Rope_rep_alloc_base(size_t __size, const allocator_type&)
446 # define __ROPE_DEFINE_ALLOC(_Tp, __name) \
448 _Alloc_traits<_Tp,_Allocator>::_Alloc_type __name##Alloc; \
450 _Alloc_traits<_Tp,_Allocator>::allocator_type __name##Allocator; \
451 static _Tp* __name##_allocate(size_t __n) \
452 { return __name##Alloc::allocate(__n); } \
453 void __name##_deallocate(_Tp *__p, size_t __n) \
454 { __name##Alloc::deallocate(__p, __n); }
455 __ROPE_DEFINE_ALLOCS(_Allocator);
456 # undef __ROPE_DEFINE_ALLOC
459 template <class _CharT, class _Alloc>
460 struct _Rope_rep_base
461 : public _Rope_rep_alloc_base<_CharT,_Alloc,
462 _Alloc_traits<_CharT,_Alloc>::_S_instanceless>
464 typedef _Rope_rep_alloc_base<_CharT,_Alloc,
465 _Alloc_traits<_CharT,_Alloc>::_S_instanceless>
467 typedef typename _Base::allocator_type allocator_type;
468 _Rope_rep_base(size_t __size, const allocator_type& __a)
469 : _Base(__size, __a) {}
473 template<class _CharT, class _Alloc>
474 struct _Rope_RopeRep : public _Rope_rep_base<_CharT,_Alloc>
480 enum { _S_max_rope_depth = 45 };
481 enum _Tag {_S_leaf, _S_concat, _S_substringfn, _S_function};
483 bool _M_is_balanced:8;
484 unsigned char _M_depth;
485 __GC_CONST _CharT* _M_c_string;
486 /* Flattened version of string, if needed. */
488 /* If it's not 0, then the memory is owned */
490 /* In the case of a leaf, this may point to */
491 /* the same memory as the data field. */
492 typedef typename _Rope_rep_base<_CharT,_Alloc>::allocator_type
494 _Rope_RopeRep(_Tag __t, int __d, bool __b, size_t __size,
496 : _Rope_rep_base<_CharT,_Alloc>(__size, __a),
500 _M_tag(__t), _M_is_balanced(__b), _M_depth(__d), _M_c_string(0)
505 static void _S_free_string(__GC_CONST _CharT*, size_t __len,
507 # define __STL_FREE_STRING(__s, __l, __a) _S_free_string(__s, __l, __a);
508 // Deallocate data section of a leaf.
509 // This shouldn't be a member function.
510 // But its hard to do anything else at the
511 // moment, because it's templatized w.r.t.
513 // Does nothing if __GC is defined.
515 void _M_free_c_string();
517 // Deallocate t. Assumes t is not 0.
518 void _M_unref_nonnil()
520 if (0 == _M_decr()) _M_free_tree();
526 static void _S_unref(_Rope_RopeRep* __t)
529 __t->_M_unref_nonnil();
532 static void _S_ref(_Rope_RopeRep* __t)
534 if (0 != __t) __t->_M_incr();
536 static void _S_free_if_unref(_Rope_RopeRep* __t)
538 if (0 != __t && 0 == __t->_M_ref_count) __t->_M_free_tree();
541 void _M_unref_nonnil() {}
542 void _M_ref_nonnil() {}
543 static void _S_unref(_Rope_RopeRep*) {}
544 static void _S_ref(_Rope_RopeRep*) {}
545 static void _S_free_if_unref(_Rope_RopeRep*) {}
550 template<class _CharT, class _Alloc>
551 struct _Rope_RopeLeaf : public _Rope_RopeRep<_CharT,_Alloc> {
553 // Apparently needed by VC++
554 // The data fields of leaves are allocated with some
555 // extra space, to accommodate future growth and for basic
556 // character types, to hold a trailing eos character.
557 enum { _S_alloc_granularity = 8 };
558 static size_t _S_rounded_up_size(size_t __n) {
559 size_t __size_with_eos;
561 if (_S_is_basic_char_type((_CharT*)0)) {
562 __size_with_eos = __n + 1;
564 __size_with_eos = __n;
567 return __size_with_eos;
569 // Allow slop for in-place expansion.
570 return (__size_with_eos + _S_alloc_granularity-1)
571 &~ (_S_alloc_granularity-1);
574 __GC_CONST _CharT* _M_data; /* Not necessarily 0 terminated. */
575 /* The allocated size is */
576 /* _S_rounded_up_size(size), except */
577 /* in the GC case, in which it */
578 /* doesn't matter. */
579 typedef typename _Rope_rep_base<_CharT,_Alloc>::allocator_type
581 _Rope_RopeLeaf(__GC_CONST _CharT* __d, size_t __size, allocator_type __a)
582 : _Rope_RopeRep<_CharT,_Alloc>(_S_leaf, 0, true, __size, __a),
585 if (_S_is_basic_char_type((_CharT *)0)) {
586 // already eos terminated.
590 // The constructor assumes that d has been allocated with
591 // the proper allocator and the properly padded size.
592 // In contrast, the destructor deallocates the data:
595 if (_M_data != _M_c_string) {
598 __STL_FREE_STRING(_M_data, _M_size, get_allocator());
603 template<class _CharT, class _Alloc>
604 struct _Rope_RopeConcatenation : public _Rope_RopeRep<_CharT,_Alloc> {
606 _Rope_RopeRep<_CharT,_Alloc>* _M_left;
607 _Rope_RopeRep<_CharT,_Alloc>* _M_right;
608 typedef typename _Rope_rep_base<_CharT,_Alloc>::allocator_type
610 _Rope_RopeConcatenation(_Rope_RopeRep<_CharT,_Alloc>* __l,
611 _Rope_RopeRep<_CharT,_Alloc>* __r,
614 : _Rope_RopeRep<_CharT,_Alloc>(_S_concat,
615 std::max(__l->_M_depth, __r->_M_depth) + 1,
617 __l->_M_size + __r->_M_size, __a),
618 _M_left(__l), _M_right(__r)
621 ~_Rope_RopeConcatenation() {
623 _M_left->_M_unref_nonnil();
624 _M_right->_M_unref_nonnil();
629 template<class _CharT, class _Alloc>
630 struct _Rope_RopeFunction : public _Rope_RopeRep<_CharT,_Alloc> {
632 char_producer<_CharT>* _M_fn;
634 bool _M_delete_when_done; // Char_producer is owned by the
635 // rope and should be explicitly
636 // deleted when the rope becomes
639 // In the GC case, we either register the rope for
640 // finalization, or not. Thus the field is unnecessary;
641 // the information is stored in the collector data structures.
642 // We do need a finalization procedure to be invoked by the
644 static void _S_fn_finalization_proc(void * __tree, void *) {
645 delete ((_Rope_RopeFunction *)__tree) -> _M_fn;
648 typedef typename _Rope_rep_base<_CharT,_Alloc>::allocator_type
650 _Rope_RopeFunction(char_producer<_CharT>* __f, size_t __size,
651 bool __d, allocator_type __a)
652 : _Rope_RopeRep<_CharT,_Alloc>(_S_function, 0, true, __size, __a)
655 , _M_delete_when_done(__d)
660 GC_REGISTER_FINALIZER(
661 this, _Rope_RopeFunction::_S_fn_finalization_proc, 0, 0, 0);
666 ~_Rope_RopeFunction() {
668 if (_M_delete_when_done) {
674 // Substring results are usually represented using just
675 // concatenation nodes. But in the case of very long flat ropes
676 // or ropes with a functional representation that isn't practical.
677 // In that case, we represent the __result as a special case of
678 // RopeFunction, whose char_producer points back to the rope itself.
679 // In all cases except repeated substring operations and
680 // deallocation, we treat the __result as a RopeFunction.
681 template<class _CharT, class _Alloc>
682 struct _Rope_RopeSubstring : public _Rope_RopeFunction<_CharT,_Alloc>,
683 public char_producer<_CharT> {
685 // XXX this whole class should be rewritten.
686 _Rope_RopeRep<_CharT,_Alloc>* _M_base; // not 0
688 virtual void operator()(size_t __start_pos, size_t __req_len,
690 switch(_M_base->_M_tag) {
694 char_producer<_CharT>* __fn =
695 ((_Rope_RopeFunction<_CharT,_Alloc>*)_M_base)->_M_fn;
696 (*__fn)(__start_pos + _M_start, __req_len, __buffer);
701 __GC_CONST _CharT* __s =
702 ((_Rope_RopeLeaf<_CharT,_Alloc>*)_M_base)->_M_data;
703 uninitialized_copy_n(__s + __start_pos + _M_start, __req_len,
711 typedef typename _Rope_rep_base<_CharT,_Alloc>::allocator_type
713 _Rope_RopeSubstring(_Rope_RopeRep<_CharT,_Alloc>* __b, size_t __s,
714 size_t __l, allocator_type __a)
715 : _Rope_RopeFunction<_CharT,_Alloc>(this, __l, false, __a),
716 char_producer<_CharT>(),
721 _M_base->_M_ref_nonnil();
723 _M_tag = _S_substringfn;
725 virtual ~_Rope_RopeSubstring()
728 _M_base->_M_unref_nonnil();
729 // _M_free_c_string(); -- done by parent class
735 // Self-destructing pointers to Rope_rep.
736 // These are not conventional smart pointers. Their
737 // only purpose in life is to ensure that unref is called
738 // on the pointer either at normal exit or if an exception
739 // is raised. It is the caller's responsibility to
740 // adjust reference counts when these pointers are initialized
741 // or assigned to. (This convention significantly reduces
742 // the number of potentially expensive reference count
745 template<class _CharT, class _Alloc>
746 struct _Rope_self_destruct_ptr {
747 _Rope_RopeRep<_CharT,_Alloc>* _M_ptr;
748 ~_Rope_self_destruct_ptr()
749 { _Rope_RopeRep<_CharT,_Alloc>::_S_unref(_M_ptr); }
751 _Rope_self_destruct_ptr() : _M_ptr(0) {};
753 _Rope_self_destruct_ptr() {};
755 _Rope_self_destruct_ptr(_Rope_RopeRep<_CharT,_Alloc>* __p) : _M_ptr(__p) {}
756 _Rope_RopeRep<_CharT,_Alloc>& operator*() { return *_M_ptr; }
757 _Rope_RopeRep<_CharT,_Alloc>* operator->() { return _M_ptr; }
758 operator _Rope_RopeRep<_CharT,_Alloc>*() { return _M_ptr; }
759 _Rope_self_destruct_ptr& operator= (_Rope_RopeRep<_CharT,_Alloc>* __x)
760 { _M_ptr = __x; return *this; }
764 // Dereferencing a nonconst iterator has to return something
765 // that behaves almost like a reference. It's not possible to
766 // return an actual reference since assignment requires extra
767 // work. And we would get into the same problems as with the
768 // CD2 version of basic_string.
769 template<class _CharT, class _Alloc>
770 class _Rope_char_ref_proxy {
771 friend class rope<_CharT,_Alloc>;
772 friend class _Rope_iterator<_CharT,_Alloc>;
773 friend class _Rope_char_ptr_proxy<_CharT,_Alloc>;
775 typedef _Rope_RopeRep<_CharT,_Alloc>* _Self_destruct_ptr;
777 typedef _Rope_self_destruct_ptr<_CharT,_Alloc> _Self_destruct_ptr;
779 typedef _Rope_RopeRep<_CharT,_Alloc> _RopeRep;
780 typedef rope<_CharT,_Alloc> _My_rope;
783 bool _M_current_valid;
784 _My_rope* _M_root; // The whole rope.
786 _Rope_char_ref_proxy(_My_rope* __r, size_t __p)
787 : _M_pos(__p), _M_current_valid(false), _M_root(__r) {}
788 _Rope_char_ref_proxy(const _Rope_char_ref_proxy& __x)
789 : _M_pos(__x._M_pos), _M_current_valid(false), _M_root(__x._M_root) {}
790 // Don't preserve cache if the reference can outlive the
791 // expression. We claim that's not possible without calling
792 // a copy constructor or generating reference to a proxy
793 // reference. We declare the latter to have undefined semantics.
794 _Rope_char_ref_proxy(_My_rope* __r, size_t __p, _CharT __c)
795 : _M_pos(__p), _M_current(__c), _M_current_valid(true), _M_root(__r) {}
796 inline operator _CharT () const;
797 _Rope_char_ref_proxy& operator= (_CharT __c);
798 _Rope_char_ptr_proxy<_CharT,_Alloc> operator& () const;
799 _Rope_char_ref_proxy& operator= (const _Rope_char_ref_proxy& __c) {
800 return operator=((_CharT)__c);
804 template<class _CharT, class __Alloc>
805 inline void swap(_Rope_char_ref_proxy <_CharT, __Alloc > __a,
806 _Rope_char_ref_proxy <_CharT, __Alloc > __b) {
812 template<class _CharT, class _Alloc>
813 class _Rope_char_ptr_proxy {
814 // XXX this class should be rewritten.
815 friend class _Rope_char_ref_proxy<_CharT,_Alloc>;
817 rope<_CharT,_Alloc>* _M_root; // The whole rope.
819 _Rope_char_ptr_proxy(const _Rope_char_ref_proxy<_CharT,_Alloc>& __x)
820 : _M_pos(__x._M_pos), _M_root(__x._M_root) {}
821 _Rope_char_ptr_proxy(const _Rope_char_ptr_proxy& __x)
822 : _M_pos(__x._M_pos), _M_root(__x._M_root) {}
823 _Rope_char_ptr_proxy() {}
824 _Rope_char_ptr_proxy(_CharT* __x) : _M_root(0), _M_pos(0) {
826 _Rope_char_ptr_proxy&
827 operator= (const _Rope_char_ptr_proxy& __x) {
829 _M_root = __x._M_root;
832 template<class _CharT2, class _Alloc2>
833 friend bool operator== (const _Rope_char_ptr_proxy<_CharT2,_Alloc2>& __x,
834 const _Rope_char_ptr_proxy<_CharT2,_Alloc2>& __y);
835 _Rope_char_ref_proxy<_CharT,_Alloc> operator*() const {
836 return _Rope_char_ref_proxy<_CharT,_Alloc>(_M_root, _M_pos);
842 // Unlike in the C version, we cache only part of the stack
843 // for rope iterators, since they must be efficiently copyable.
844 // When we run out of cache, we have to reconstruct the iterator
846 // Pointers from iterators are not included in reference counts.
847 // Iterators are assumed to be thread private. Ropes can
850 template<class _CharT, class _Alloc>
851 class _Rope_iterator_base
852 : public iterator<std::random_access_iterator_tag, _CharT>
854 friend class rope<_CharT,_Alloc>;
856 typedef _Alloc _allocator_type; // used in _Rope_rotate, VC++ workaround
857 typedef _Rope_RopeRep<_CharT,_Alloc> _RopeRep;
858 // Borland doesn't want this to be protected.
860 enum { _S_path_cache_len = 4 }; // Must be <= 9.
861 enum { _S_iterator_buf_len = 15 };
862 size_t _M_current_pos;
863 _RopeRep* _M_root; // The whole rope.
864 size_t _M_leaf_pos; // Starting position for current leaf
865 __GC_CONST _CharT* _M_buf_start;
867 // containing current char.
868 __GC_CONST _CharT* _M_buf_ptr;
869 // Pointer to current char in buffer.
870 // != 0 ==> buffer valid.
871 __GC_CONST _CharT* _M_buf_end;
872 // One past __last valid char in buffer.
873 // What follows is the path cache. We go out of our
874 // way to make this compact.
875 // Path_end contains the bottom section of the path from
876 // the root to the current leaf.
877 const _RopeRep* _M_path_end[_S_path_cache_len];
878 int _M_leaf_index; // Last valid __pos in path_end;
879 // _M_path_end[0] ... _M_path_end[leaf_index-1]
880 // point to concatenation nodes.
881 unsigned char _M_path_directions;
882 // (path_directions >> __i) & 1 is 1
883 // iff we got from _M_path_end[leaf_index - __i - 1]
884 // to _M_path_end[leaf_index - __i] by going to the
885 // __right. Assumes path_cache_len <= 9.
886 _CharT _M_tmp_buf[_S_iterator_buf_len];
887 // Short buffer for surrounding chars.
888 // This is useful primarily for
889 // RopeFunctions. We put the buffer
890 // here to avoid locking in the
891 // multithreaded case.
892 // The cached path is generally assumed to be valid
893 // only if the buffer is valid.
894 static void _S_setbuf(_Rope_iterator_base& __x);
895 // Set buffer contents given
897 static void _S_setcache(_Rope_iterator_base& __x);
898 // Set buffer contents and
900 static void _S_setcache_for_incr(_Rope_iterator_base& __x);
901 // As above, but assumes path
902 // cache is valid for previous posn.
903 _Rope_iterator_base() {}
904 _Rope_iterator_base(_RopeRep* __root, size_t __pos)
905 : _M_current_pos(__pos), _M_root(__root), _M_buf_ptr(0) {}
906 void _M_incr(size_t __n);
907 void _M_decr(size_t __n);
909 size_t index() const { return _M_current_pos; }
910 _Rope_iterator_base(const _Rope_iterator_base& __x) {
911 if (0 != __x._M_buf_ptr) {
914 _M_current_pos = __x._M_current_pos;
915 _M_root = __x._M_root;
921 template<class _CharT, class _Alloc> class _Rope_iterator;
923 template<class _CharT, class _Alloc>
924 class _Rope_const_iterator : public _Rope_iterator_base<_CharT,_Alloc> {
925 friend class rope<_CharT,_Alloc>;
927 typedef _Rope_RopeRep<_CharT,_Alloc> _RopeRep;
928 // The one from the base class may not be directly visible.
929 _Rope_const_iterator(const _RopeRep* __root, size_t __pos):
930 _Rope_iterator_base<_CharT,_Alloc>(
931 const_cast<_RopeRep*>(__root), __pos)
932 // Only nonconst iterators modify root ref count
935 typedef _CharT reference; // Really a value. Returning a reference
936 // Would be a mess, since it would have
937 // to be included in refcount.
938 typedef const _CharT* pointer;
941 _Rope_const_iterator() {};
942 _Rope_const_iterator(const _Rope_const_iterator& __x) :
943 _Rope_iterator_base<_CharT,_Alloc>(__x) { }
944 _Rope_const_iterator(const _Rope_iterator<_CharT,_Alloc>& __x);
945 _Rope_const_iterator(const rope<_CharT,_Alloc>& __r, size_t __pos) :
946 _Rope_iterator_base<_CharT,_Alloc>(__r._M_tree_ptr, __pos) {}
947 _Rope_const_iterator& operator= (const _Rope_const_iterator& __x) {
948 if (0 != __x._M_buf_ptr) {
949 *(static_cast<_Rope_iterator_base<_CharT,_Alloc>*>(this)) = __x;
951 _M_current_pos = __x._M_current_pos;
952 _M_root = __x._M_root;
957 reference operator*() {
958 if (0 == _M_buf_ptr) _S_setcache(*this);
961 _Rope_const_iterator& operator++() {
962 __GC_CONST _CharT* __next;
963 if (0 != _M_buf_ptr && (__next = _M_buf_ptr + 1) < _M_buf_end) {
971 _Rope_const_iterator& operator+=(ptrdiff_t __n) {
979 _Rope_const_iterator& operator--() {
983 _Rope_const_iterator& operator-=(ptrdiff_t __n) {
991 _Rope_const_iterator operator++(int) {
992 size_t __old_pos = _M_current_pos;
994 return _Rope_const_iterator<_CharT,_Alloc>(_M_root, __old_pos);
995 // This makes a subsequent dereference expensive.
996 // Perhaps we should instead copy the iterator
997 // if it has a valid cache?
999 _Rope_const_iterator operator--(int) {
1000 size_t __old_pos = _M_current_pos;
1002 return _Rope_const_iterator<_CharT,_Alloc>(_M_root, __old_pos);
1004 template<class _CharT2, class _Alloc2>
1005 friend _Rope_const_iterator<_CharT2,_Alloc2> operator-
1006 (const _Rope_const_iterator<_CharT2,_Alloc2>& __x,
1008 template<class _CharT2, class _Alloc2>
1009 friend _Rope_const_iterator<_CharT2,_Alloc2> operator+
1010 (const _Rope_const_iterator<_CharT2,_Alloc2>& __x,
1012 template<class _CharT2, class _Alloc2>
1013 friend _Rope_const_iterator<_CharT2,_Alloc2> operator+
1015 const _Rope_const_iterator<_CharT2,_Alloc2>& __x);
1016 reference operator[](size_t __n) {
1017 return rope<_CharT,_Alloc>::_S_fetch(_M_root, _M_current_pos + __n);
1020 template<class _CharT2, class _Alloc2>
1021 friend bool operator==
1022 (const _Rope_const_iterator<_CharT2,_Alloc2>& __x,
1023 const _Rope_const_iterator<_CharT2,_Alloc2>& __y);
1024 template<class _CharT2, class _Alloc2>
1025 friend bool operator<
1026 (const _Rope_const_iterator<_CharT2,_Alloc2>& __x,
1027 const _Rope_const_iterator<_CharT2,_Alloc2>& __y);
1028 template<class _CharT2, class _Alloc2>
1029 friend ptrdiff_t operator-
1030 (const _Rope_const_iterator<_CharT2,_Alloc2>& __x,
1031 const _Rope_const_iterator<_CharT2,_Alloc2>& __y);
1034 template<class _CharT, class _Alloc>
1035 class _Rope_iterator : public _Rope_iterator_base<_CharT,_Alloc> {
1036 friend class rope<_CharT,_Alloc>;
1038 typedef typename _Rope_iterator_base<_CharT,_Alloc>::_RopeRep _RopeRep;
1039 rope<_CharT,_Alloc>* _M_root_rope;
1040 // root is treated as a cached version of this,
1041 // and is used to detect changes to the underlying
1043 // Root is included in the reference count.
1044 // This is necessary so that we can detect changes reliably.
1045 // Unfortunately, it requires careful bookkeeping for the
1047 _Rope_iterator(rope<_CharT,_Alloc>* __r, size_t __pos)
1048 : _Rope_iterator_base<_CharT,_Alloc>(__r->_M_tree_ptr, __pos),
1050 { _RopeRep::_S_ref(_M_root); if (!(__r -> empty()))_S_setcache(*this); }
1054 typedef _Rope_char_ref_proxy<_CharT,_Alloc> reference;
1055 typedef _Rope_char_ref_proxy<_CharT,_Alloc>* pointer;
1058 rope<_CharT,_Alloc>& container() { return *_M_root_rope; }
1060 _M_root = 0; // Needed for reference counting.
1062 _Rope_iterator(const _Rope_iterator& __x) :
1063 _Rope_iterator_base<_CharT,_Alloc>(__x) {
1064 _M_root_rope = __x._M_root_rope;
1065 _RopeRep::_S_ref(_M_root);
1067 _Rope_iterator(rope<_CharT,_Alloc>& __r, size_t __pos);
1069 _RopeRep::_S_unref(_M_root);
1071 _Rope_iterator& operator= (const _Rope_iterator& __x) {
1072 _RopeRep* __old = _M_root;
1074 _RopeRep::_S_ref(__x._M_root);
1075 if (0 != __x._M_buf_ptr) {
1076 _M_root_rope = __x._M_root_rope;
1077 *(static_cast<_Rope_iterator_base<_CharT,_Alloc>*>(this)) = __x;
1079 _M_current_pos = __x._M_current_pos;
1080 _M_root = __x._M_root;
1081 _M_root_rope = __x._M_root_rope;
1084 _RopeRep::_S_unref(__old);
1087 reference operator*() {
1089 if (0 == _M_buf_ptr) {
1090 return _Rope_char_ref_proxy<_CharT,_Alloc>(
1091 _M_root_rope, _M_current_pos);
1093 return _Rope_char_ref_proxy<_CharT,_Alloc>(
1094 _M_root_rope, _M_current_pos, *_M_buf_ptr);
1097 _Rope_iterator& operator++() {
1101 _Rope_iterator& operator+=(ptrdiff_t __n) {
1109 _Rope_iterator& operator--() {
1113 _Rope_iterator& operator-=(ptrdiff_t __n) {
1121 _Rope_iterator operator++(int) {
1122 size_t __old_pos = _M_current_pos;
1124 return _Rope_iterator<_CharT,_Alloc>(_M_root_rope, __old_pos);
1126 _Rope_iterator operator--(int) {
1127 size_t __old_pos = _M_current_pos;
1129 return _Rope_iterator<_CharT,_Alloc>(_M_root_rope, __old_pos);
1131 reference operator[](ptrdiff_t __n) {
1132 return _Rope_char_ref_proxy<_CharT,_Alloc>(
1133 _M_root_rope, _M_current_pos + __n);
1136 template<class _CharT2, class _Alloc2>
1137 friend bool operator==
1138 (const _Rope_iterator<_CharT2,_Alloc2>& __x,
1139 const _Rope_iterator<_CharT2,_Alloc2>& __y);
1140 template<class _CharT2, class _Alloc2>
1141 friend bool operator<
1142 (const _Rope_iterator<_CharT2,_Alloc2>& __x,
1143 const _Rope_iterator<_CharT2,_Alloc2>& __y);
1144 template<class _CharT2, class _Alloc2>
1145 friend ptrdiff_t operator-
1146 (const _Rope_iterator<_CharT2,_Alloc2>& __x,
1147 const _Rope_iterator<_CharT2,_Alloc2>& __y);
1148 template<class _CharT2, class _Alloc2>
1149 friend _Rope_iterator<_CharT2,_Alloc2> operator-
1150 (const _Rope_iterator<_CharT2,_Alloc2>& __x,
1152 template<class _CharT2, class _Alloc2>
1153 friend _Rope_iterator<_CharT2,_Alloc2> operator+
1154 (const _Rope_iterator<_CharT2,_Alloc2>& __x,
1156 template<class _CharT2, class _Alloc2>
1157 friend _Rope_iterator<_CharT2,_Alloc2> operator+
1159 const _Rope_iterator<_CharT2,_Alloc2>& __x);
1162 // The rope base class encapsulates
1163 // the differences between SGI-style allocators and standard-conforming
1166 // Base class for ordinary allocators.
1167 template <class _CharT, class _Allocator, bool _IsStatic>
1168 class _Rope_alloc_base {
1170 typedef _Rope_RopeRep<_CharT,_Allocator> _RopeRep;
1171 typedef typename _Alloc_traits<_CharT,_Allocator>::allocator_type
1173 allocator_type get_allocator() const { return _M_data_allocator; }
1174 _Rope_alloc_base(_RopeRep *__t, const allocator_type& __a)
1175 : _M_tree_ptr(__t), _M_data_allocator(__a) {}
1176 _Rope_alloc_base(const allocator_type& __a)
1177 : _M_data_allocator(__a) {}
1180 // The only data members of a rope:
1181 allocator_type _M_data_allocator;
1182 _RopeRep* _M_tree_ptr;
1184 # define __ROPE_DEFINE_ALLOC(_Tp, __name) \
1186 _Alloc_traits<_Tp,_Allocator>::allocator_type __name##Allocator; \
1187 _Tp* __name##_allocate(size_t __n) const \
1188 { return __name##Allocator(_M_data_allocator).allocate(__n); } \
1189 void __name##_deallocate(_Tp *__p, size_t __n) const \
1190 { __name##Allocator(_M_data_allocator).deallocate(__p, __n); }
1191 __ROPE_DEFINE_ALLOCS(_Allocator)
1192 # undef __ROPE_DEFINE_ALLOC
1195 // Specialization for allocators that have the property that we don't
1196 // actually have to store an allocator object.
1197 template <class _CharT, class _Allocator>
1198 class _Rope_alloc_base<_CharT,_Allocator,true> {
1200 typedef _Rope_RopeRep<_CharT,_Allocator> _RopeRep;
1201 typedef typename _Alloc_traits<_CharT,_Allocator>::allocator_type
1203 allocator_type get_allocator() const { return allocator_type(); }
1204 _Rope_alloc_base(_RopeRep *__t, const allocator_type&)
1205 : _M_tree_ptr(__t) {}
1206 _Rope_alloc_base(const allocator_type&) {}
1209 // The only data member of a rope:
1210 _RopeRep *_M_tree_ptr;
1212 # define __ROPE_DEFINE_ALLOC(_Tp, __name) \
1214 _Alloc_traits<_Tp,_Allocator>::_Alloc_type __name##Alloc; \
1216 _Alloc_traits<_Tp,_Allocator>::allocator_type __name##Allocator; \
1217 static _Tp* __name##_allocate(size_t __n) \
1218 { return __name##Alloc::allocate(__n); } \
1219 static void __name##_deallocate(_Tp *__p, size_t __n) \
1220 { __name##Alloc::deallocate(__p, __n); }
1221 __ROPE_DEFINE_ALLOCS(_Allocator)
1222 # undef __ROPE_DEFINE_ALLOC
1225 template <class _CharT, class _Alloc>
1227 : public _Rope_alloc_base<_CharT,_Alloc,
1228 _Alloc_traits<_CharT,_Alloc>::_S_instanceless>
1230 typedef _Rope_alloc_base<_CharT,_Alloc,
1231 _Alloc_traits<_CharT,_Alloc>::_S_instanceless>
1233 typedef typename _Base::allocator_type allocator_type;
1234 typedef _Rope_RopeRep<_CharT,_Alloc> _RopeRep;
1235 // The one in _Base may not be visible due to template rules.
1236 _Rope_base(_RopeRep* __t, const allocator_type& __a) : _Base(__t, __a) {}
1237 _Rope_base(const allocator_type& __a) : _Base(__a) {}
1241 template <class _CharT, class _Alloc>
1242 class rope : public _Rope_base<_CharT,_Alloc> {
1244 typedef _CharT value_type;
1245 typedef ptrdiff_t difference_type;
1246 typedef size_t size_type;
1247 typedef _CharT const_reference;
1248 typedef const _CharT* const_pointer;
1249 typedef _Rope_iterator<_CharT,_Alloc> iterator;
1250 typedef _Rope_const_iterator<_CharT,_Alloc> const_iterator;
1251 typedef _Rope_char_ref_proxy<_CharT,_Alloc> reference;
1252 typedef _Rope_char_ptr_proxy<_CharT,_Alloc> pointer;
1254 friend class _Rope_iterator<_CharT,_Alloc>;
1255 friend class _Rope_const_iterator<_CharT,_Alloc>;
1256 friend struct _Rope_RopeRep<_CharT,_Alloc>;
1257 friend class _Rope_iterator_base<_CharT,_Alloc>;
1258 friend class _Rope_char_ptr_proxy<_CharT,_Alloc>;
1259 friend class _Rope_char_ref_proxy<_CharT,_Alloc>;
1260 friend struct _Rope_RopeSubstring<_CharT,_Alloc>;
1263 typedef _Rope_base<_CharT,_Alloc> _Base;
1264 typedef typename _Base::allocator_type allocator_type;
1265 using _Base::_M_tree_ptr;
1266 typedef __GC_CONST _CharT* _Cstrptr;
1268 static _CharT _S_empty_c_str[1];
1270 static bool _S_is0(_CharT __c) { return __c == _S_eos((_CharT*)0); }
1271 enum { _S_copy_max = 23 };
1272 // For strings shorter than _S_copy_max, we copy to
1275 typedef _Rope_RopeRep<_CharT,_Alloc> _RopeRep;
1276 typedef _Rope_RopeConcatenation<_CharT,_Alloc> _RopeConcatenation;
1277 typedef _Rope_RopeLeaf<_CharT,_Alloc> _RopeLeaf;
1278 typedef _Rope_RopeFunction<_CharT,_Alloc> _RopeFunction;
1279 typedef _Rope_RopeSubstring<_CharT,_Alloc> _RopeSubstring;
1281 // Retrieve a character at the indicated position.
1282 static _CharT _S_fetch(_RopeRep* __r, size_type __pos);
1285 // Obtain a pointer to the character at the indicated position.
1286 // The pointer can be used to change the character.
1287 // If such a pointer cannot be produced, as is frequently the
1288 // case, 0 is returned instead.
1289 // (Returns nonzero only if all nodes in the path have a refcount
1291 static _CharT* _S_fetch_ptr(_RopeRep* __r, size_type __pos);
1294 static bool _S_apply_to_pieces(
1295 // should be template parameter
1296 _Rope_char_consumer<_CharT>& __c,
1297 const _RopeRep* __r,
1298 size_t __begin, size_t __end);
1299 // begin and end are assumed to be in range.
1302 static void _S_unref(_RopeRep* __t)
1304 _RopeRep::_S_unref(__t);
1306 static void _S_ref(_RopeRep* __t)
1308 _RopeRep::_S_ref(__t);
1311 static void _S_unref(_RopeRep*) {}
1312 static void _S_ref(_RopeRep*) {}
1317 typedef _Rope_RopeRep<_CharT,_Alloc>* _Self_destruct_ptr;
1319 typedef _Rope_self_destruct_ptr<_CharT,_Alloc> _Self_destruct_ptr;
1322 // _Result is counted in refcount.
1323 static _RopeRep* _S_substring(_RopeRep* __base,
1324 size_t __start, size_t __endp1);
1326 static _RopeRep* _S_concat_char_iter(_RopeRep* __r,
1327 const _CharT* __iter, size_t __slen);
1328 // Concatenate rope and char ptr, copying __s.
1329 // Should really take an arbitrary iterator.
1330 // Result is counted in refcount.
1331 static _RopeRep* _S_destr_concat_char_iter(_RopeRep* __r,
1332 const _CharT* __iter, size_t __slen)
1333 // As above, but one reference to __r is about to be
1334 // destroyed. Thus the pieces may be recycled if all
1335 // relevant reference counts are 1.
1337 // We can't really do anything since refcounts are unavailable.
1338 { return _S_concat_char_iter(__r, __iter, __slen); }
1343 static _RopeRep* _S_concat(_RopeRep* __left, _RopeRep* __right);
1344 // General concatenation on _RopeRep. _Result
1345 // has refcount of 1. Adjusts argument refcounts.
1348 void apply_to_pieces( size_t __begin, size_t __end,
1349 _Rope_char_consumer<_CharT>& __c) const {
1350 _S_apply_to_pieces(__c, _M_tree_ptr, __begin, __end);
1356 static size_t _S_rounded_up_size(size_t __n) {
1357 return _RopeLeaf::_S_rounded_up_size(__n);
1360 static size_t _S_allocated_capacity(size_t __n) {
1361 if (_S_is_basic_char_type((_CharT*)0)) {
1362 return _S_rounded_up_size(__n) - 1;
1364 return _S_rounded_up_size(__n);
1368 // Allocate and construct a RopeLeaf using the supplied allocator
1369 // Takes ownership of s instead of copying.
1370 static _RopeLeaf* _S_new_RopeLeaf(__GC_CONST _CharT *__s,
1371 size_t __size, allocator_type __a)
1373 _RopeLeaf* __space = _LAllocator(__a).allocate(1);
1374 return new(__space) _RopeLeaf(__s, __size, __a);
1377 static _RopeConcatenation* _S_new_RopeConcatenation(
1378 _RopeRep* __left, _RopeRep* __right,
1381 _RopeConcatenation* __space = _CAllocator(__a).allocate(1);
1382 return new(__space) _RopeConcatenation(__left, __right, __a);
1385 static _RopeFunction* _S_new_RopeFunction(char_producer<_CharT>* __f,
1386 size_t __size, bool __d, allocator_type __a)
1388 _RopeFunction* __space = _FAllocator(__a).allocate(1);
1389 return new(__space) _RopeFunction(__f, __size, __d, __a);
1392 static _RopeSubstring* _S_new_RopeSubstring(
1393 _Rope_RopeRep<_CharT,_Alloc>* __b, size_t __s,
1394 size_t __l, allocator_type __a)
1396 _RopeSubstring* __space = _SAllocator(__a).allocate(1);
1397 return new(__space) _RopeSubstring(__b, __s, __l, __a);
1401 _RopeLeaf* _S_RopeLeaf_from_unowned_char_ptr(const _CharT *__s,
1402 size_t __size, allocator_type __a)
1403 # define __STL_ROPE_FROM_UNOWNED_CHAR_PTR(__s, __size, __a) \
1404 _S_RopeLeaf_from_unowned_char_ptr(__s, __size, __a)
1406 if (0 == __size) return 0;
1407 _CharT* __buf = __a.allocate(_S_rounded_up_size(__size));
1409 uninitialized_copy_n(__s, __size, __buf);
1410 _S_cond_store_eos(__buf[__size]);
1412 return _S_new_RopeLeaf(__buf, __size, __a);
1416 _RopeRep::__STL_FREE_STRING(__buf, __size, __a);
1417 __throw_exception_again;
1422 // Concatenation of nonempty strings.
1423 // Always builds a concatenation node.
1424 // Rebalances if the result is too deep.
1425 // Result has refcount 1.
1426 // Does not increment left and right ref counts even though
1427 // they are referenced.
1429 _S_tree_concat(_RopeRep* __left, _RopeRep* __right);
1431 // Concatenation helper functions
1433 _S_leaf_concat_char_iter(_RopeLeaf* __r,
1434 const _CharT* __iter, size_t __slen);
1435 // Concatenate by copying leaf.
1436 // should take an arbitrary iterator
1437 // result has refcount 1.
1439 static _RopeLeaf* _S_destr_leaf_concat_char_iter
1440 (_RopeLeaf* __r, const _CharT* __iter, size_t __slen);
1441 // A version that potentially clobbers __r if __r->_M_ref_count == 1.
1446 static size_t _S_char_ptr_len(const _CharT* __s);
1447 // slightly generalized strlen
1449 rope(_RopeRep* __t, const allocator_type& __a = allocator_type())
1450 : _Base(__t,__a) { }
1453 // Copy __r to the _CharT buffer.
1454 // Returns __buffer + __r->_M_size.
1455 // Assumes that buffer is uninitialized.
1456 static _CharT* _S_flatten(_RopeRep* __r, _CharT* __buffer);
1458 // Again, with explicit starting position and length.
1459 // Assumes that buffer is uninitialized.
1460 static _CharT* _S_flatten(_RopeRep* __r,
1461 size_t __start, size_t __len,
1464 static const unsigned long
1465 _S_min_len[_RopeRep::_S_max_rope_depth + 1];
1467 static bool _S_is_balanced(_RopeRep* __r)
1468 { return (__r->_M_size >= _S_min_len[__r->_M_depth]); }
1470 static bool _S_is_almost_balanced(_RopeRep* __r)
1471 { return (__r->_M_depth == 0 ||
1472 __r->_M_size >= _S_min_len[__r->_M_depth - 1]); }
1474 static bool _S_is_roughly_balanced(_RopeRep* __r)
1475 { return (__r->_M_depth <= 1 ||
1476 __r->_M_size >= _S_min_len[__r->_M_depth - 2]); }
1478 // Assumes the result is not empty.
1479 static _RopeRep* _S_concat_and_set_balanced(_RopeRep* __left,
1482 _RopeRep* __result = _S_concat(__left, __right);
1483 if (_S_is_balanced(__result)) __result->_M_is_balanced = true;
1487 // The basic rebalancing operation. Logically copies the
1488 // rope. The result has refcount of 1. The client will
1489 // usually decrement the reference count of __r.
1490 // The result is within height 2 of balanced by the above
1492 static _RopeRep* _S_balance(_RopeRep* __r);
1494 // Add all unbalanced subtrees to the forest of balanceed trees.
1495 // Used only by balance.
1496 static void _S_add_to_forest(_RopeRep*__r, _RopeRep** __forest);
1498 // Add __r to forest, assuming __r is already balanced.
1499 static void _S_add_leaf_to_forest(_RopeRep* __r, _RopeRep** __forest);
1501 // Print to stdout, exposing structure
1502 static void _S_dump(_RopeRep* __r, int __indent = 0);
1504 // Return -1, 0, or 1 if __x < __y, __x == __y, or __x > __y resp.
1505 static int _S_compare(const _RopeRep* __x, const _RopeRep* __y);
1508 bool empty() const { return 0 == _M_tree_ptr; }
1510 // Comparison member function. This is public only for those
1511 // clients that need a ternary comparison. Others
1512 // should use the comparison operators below.
1513 int compare(const rope& __y) const {
1514 return _S_compare(_M_tree_ptr, __y._M_tree_ptr);
1517 rope(const _CharT* __s, const allocator_type& __a = allocator_type())
1518 : _Base(__STL_ROPE_FROM_UNOWNED_CHAR_PTR(__s, _S_char_ptr_len(__s),
1522 rope(const _CharT* __s, size_t __len,
1523 const allocator_type& __a = allocator_type())
1524 : _Base(__STL_ROPE_FROM_UNOWNED_CHAR_PTR(__s, __len, __a), __a)
1527 // Should perhaps be templatized with respect to the iterator type
1528 // and use Sequence_buffer. (It should perhaps use sequence_buffer
1530 rope(const _CharT *__s, const _CharT *__e,
1531 const allocator_type& __a = allocator_type())
1532 : _Base(__STL_ROPE_FROM_UNOWNED_CHAR_PTR(__s, __e - __s, __a), __a)
1535 rope(const const_iterator& __s, const const_iterator& __e,
1536 const allocator_type& __a = allocator_type())
1537 : _Base(_S_substring(__s._M_root, __s._M_current_pos,
1538 __e._M_current_pos), __a)
1541 rope(const iterator& __s, const iterator& __e,
1542 const allocator_type& __a = allocator_type())
1543 : _Base(_S_substring(__s._M_root, __s._M_current_pos,
1544 __e._M_current_pos), __a)
1547 rope(_CharT __c, const allocator_type& __a = allocator_type())
1550 _CharT* __buf = _Data_allocate(_S_rounded_up_size(1));
1552 std::_Construct(__buf, __c);
1554 _M_tree_ptr = _S_new_RopeLeaf(__buf, 1, __a);
1558 _RopeRep::__STL_FREE_STRING(__buf, 1, __a);
1559 __throw_exception_again;
1563 rope(size_t __n, _CharT __c,
1564 const allocator_type& __a = allocator_type());
1566 rope(const allocator_type& __a = allocator_type())
1569 // Construct a rope from a function that can compute its members
1570 rope(char_producer<_CharT> *__fn, size_t __len, bool __delete_fn,
1571 const allocator_type& __a = allocator_type())
1574 _M_tree_ptr = (0 == __len) ?
1575 0 : _S_new_RopeFunction(__fn, __len, __delete_fn, __a);
1578 rope(const rope& __x, const allocator_type& __a = allocator_type())
1579 : _Base(__x._M_tree_ptr, __a)
1581 _S_ref(_M_tree_ptr);
1586 _S_unref(_M_tree_ptr);
1589 rope& operator=(const rope& __x)
1591 _RopeRep* __old = _M_tree_ptr;
1592 _M_tree_ptr = __x._M_tree_ptr;
1593 _S_ref(_M_tree_ptr);
1600 _S_unref(_M_tree_ptr);
1604 void push_back(_CharT __x)
1606 _RopeRep* __old = _M_tree_ptr;
1607 _M_tree_ptr = _S_destr_concat_char_iter(_M_tree_ptr, &__x, 1);
1613 _RopeRep* __old = _M_tree_ptr;
1615 _S_substring(_M_tree_ptr, 0, _M_tree_ptr->_M_size - 1);
1621 return _S_fetch(_M_tree_ptr, _M_tree_ptr->_M_size - 1);
1624 void push_front(_CharT __x)
1626 _RopeRep* __old = _M_tree_ptr;
1628 __STL_ROPE_FROM_UNOWNED_CHAR_PTR(&__x, 1, get_allocator());
1630 _M_tree_ptr = _S_concat(__left, _M_tree_ptr);
1637 __throw_exception_again;
1643 _RopeRep* __old = _M_tree_ptr;
1644 _M_tree_ptr = _S_substring(_M_tree_ptr, 1, _M_tree_ptr->_M_size);
1648 _CharT front() const
1650 return _S_fetch(_M_tree_ptr, 0);
1655 _RopeRep* __old = _M_tree_ptr;
1656 _M_tree_ptr = _S_balance(_M_tree_ptr);
1660 void copy(_CharT* __buffer) const {
1661 _Destroy(__buffer, __buffer + size());
1662 _S_flatten(_M_tree_ptr, __buffer);
1665 // This is the copy function from the standard, but
1666 // with the arguments reordered to make it consistent with the
1667 // rest of the interface.
1668 // Note that this guaranteed not to compile if the draft standard
1669 // order is assumed.
1670 size_type copy(size_type __pos, size_type __n, _CharT* __buffer) const
1672 size_t __size = size();
1673 size_t __len = (__pos + __n > __size? __size - __pos : __n);
1675 _Destroy(__buffer, __buffer + __len);
1676 _S_flatten(_M_tree_ptr, __pos, __len, __buffer);
1680 // Print to stdout, exposing structure. May be useful for
1681 // performance debugging.
1683 _S_dump(_M_tree_ptr);
1686 // Convert to 0 terminated string in new allocated memory.
1687 // Embedded 0s in the input do not terminate the copy.
1688 const _CharT* c_str() const;
1690 // As above, but lso use the flattened representation as the
1691 // the new rope representation.
1692 const _CharT* replace_with_c_str();
1694 // Reclaim memory for the c_str generated flattened string.
1695 // Intentionally undocumented, since it's hard to say when this
1696 // is safe for multiple threads.
1697 void delete_c_str () {
1698 if (0 == _M_tree_ptr) return;
1699 if (_RopeRep::_S_leaf == _M_tree_ptr->_M_tag &&
1700 ((_RopeLeaf*)_M_tree_ptr)->_M_data ==
1701 _M_tree_ptr->_M_c_string) {
1702 // Representation shared
1706 _M_tree_ptr->_M_free_c_string();
1708 _M_tree_ptr->_M_c_string = 0;
1711 _CharT operator[] (size_type __pos) const {
1712 return _S_fetch(_M_tree_ptr, __pos);
1715 _CharT at(size_type __pos) const {
1716 // if (__pos >= size()) throw out_of_range; // XXX
1717 return (*this)[__pos];
1720 const_iterator begin() const {
1721 return(const_iterator(_M_tree_ptr, 0));
1724 // An easy way to get a const iterator from a non-const container.
1725 const_iterator const_begin() const {
1726 return(const_iterator(_M_tree_ptr, 0));
1729 const_iterator end() const {
1730 return(const_iterator(_M_tree_ptr, size()));
1733 const_iterator const_end() const {
1734 return(const_iterator(_M_tree_ptr, size()));
1737 size_type size() const {
1738 return(0 == _M_tree_ptr? 0 : _M_tree_ptr->_M_size);
1741 size_type length() const {
1745 size_type max_size() const {
1746 return _S_min_len[_RopeRep::_S_max_rope_depth-1] - 1;
1747 // Guarantees that the result can be sufficirntly
1748 // balanced. Longer ropes will probably still work,
1749 // but it's harder to make guarantees.
1752 typedef reverse_iterator<const_iterator> const_reverse_iterator;
1754 const_reverse_iterator rbegin() const {
1755 return const_reverse_iterator(end());
1758 const_reverse_iterator const_rbegin() const {
1759 return const_reverse_iterator(end());
1762 const_reverse_iterator rend() const {
1763 return const_reverse_iterator(begin());
1766 const_reverse_iterator const_rend() const {
1767 return const_reverse_iterator(begin());
1770 template<class _CharT2, class _Alloc2>
1771 friend rope<_CharT2,_Alloc2>
1772 operator+ (const rope<_CharT2,_Alloc2>& __left,
1773 const rope<_CharT2,_Alloc2>& __right);
1775 template<class _CharT2, class _Alloc2>
1776 friend rope<_CharT2,_Alloc2>
1777 operator+ (const rope<_CharT2,_Alloc2>& __left,
1778 const _CharT2* __right);
1780 template<class _CharT2, class _Alloc2>
1781 friend rope<_CharT2,_Alloc2>
1782 operator+ (const rope<_CharT2,_Alloc2>& __left, _CharT2 __right);
1783 // The symmetric cases are intentionally omitted, since they're presumed
1784 // to be less common, and we don't handle them as well.
1786 // The following should really be templatized.
1787 // The first argument should be an input iterator or
1788 // forward iterator with value_type _CharT.
1789 rope& append(const _CharT* __iter, size_t __n) {
1790 _RopeRep* __result =
1791 _S_destr_concat_char_iter(_M_tree_ptr, __iter, __n);
1792 _S_unref(_M_tree_ptr);
1793 _M_tree_ptr = __result;
1797 rope& append(const _CharT* __c_string) {
1798 size_t __len = _S_char_ptr_len(__c_string);
1799 append(__c_string, __len);
1803 rope& append(const _CharT* __s, const _CharT* __e) {
1804 _RopeRep* __result =
1805 _S_destr_concat_char_iter(_M_tree_ptr, __s, __e - __s);
1806 _S_unref(_M_tree_ptr);
1807 _M_tree_ptr = __result;
1811 rope& append(const_iterator __s, const_iterator __e) {
1812 _Self_destruct_ptr __appendee(_S_substring(
1813 __s._M_root, __s._M_current_pos, __e._M_current_pos));
1814 _RopeRep* __result =
1815 _S_concat(_M_tree_ptr, (_RopeRep*)__appendee);
1816 _S_unref(_M_tree_ptr);
1817 _M_tree_ptr = __result;
1821 rope& append(_CharT __c) {
1822 _RopeRep* __result =
1823 _S_destr_concat_char_iter(_M_tree_ptr, &__c, 1);
1824 _S_unref(_M_tree_ptr);
1825 _M_tree_ptr = __result;
1829 rope& append() { return append(_CharT()); } // XXX why?
1831 rope& append(const rope& __y) {
1832 _RopeRep* __result = _S_concat(_M_tree_ptr, __y._M_tree_ptr);
1833 _S_unref(_M_tree_ptr);
1834 _M_tree_ptr = __result;
1838 rope& append(size_t __n, _CharT __c) {
1839 rope<_CharT,_Alloc> __last(__n, __c);
1840 return append(__last);
1843 void swap(rope& __b) {
1844 _RopeRep* __tmp = _M_tree_ptr;
1845 _M_tree_ptr = __b._M_tree_ptr;
1846 __b._M_tree_ptr = __tmp;
1851 // Result is included in refcount.
1852 static _RopeRep* replace(_RopeRep* __old, size_t __pos1,
1853 size_t __pos2, _RopeRep* __r) {
1854 if (0 == __old) { _S_ref(__r); return __r; }
1855 _Self_destruct_ptr __left(
1856 _S_substring(__old, 0, __pos1));
1857 _Self_destruct_ptr __right(
1858 _S_substring(__old, __pos2, __old->_M_size));
1862 __result = _S_concat(__left, __right);
1864 _Self_destruct_ptr __left_result(_S_concat(__left, __r));
1865 __result = _S_concat(__left_result, __right);
1871 void insert(size_t __p, const rope& __r) {
1872 _RopeRep* __result =
1873 replace(_M_tree_ptr, __p, __p, __r._M_tree_ptr);
1874 _S_unref(_M_tree_ptr);
1875 _M_tree_ptr = __result;
1878 void insert(size_t __p, size_t __n, _CharT __c) {
1879 rope<_CharT,_Alloc> __r(__n,__c);
1883 void insert(size_t __p, const _CharT* __i, size_t __n) {
1884 _Self_destruct_ptr __left(_S_substring(_M_tree_ptr, 0, __p));
1885 _Self_destruct_ptr __right(_S_substring(_M_tree_ptr, __p, size()));
1886 _Self_destruct_ptr __left_result(
1887 _S_concat_char_iter(__left, __i, __n));
1888 // _S_ destr_concat_char_iter should be safe here.
1889 // But as it stands it's probably not a win, since __left
1890 // is likely to have additional references.
1891 _RopeRep* __result = _S_concat(__left_result, __right);
1892 _S_unref(_M_tree_ptr);
1893 _M_tree_ptr = __result;
1896 void insert(size_t __p, const _CharT* __c_string) {
1897 insert(__p, __c_string, _S_char_ptr_len(__c_string));
1900 void insert(size_t __p, _CharT __c) {
1901 insert(__p, &__c, 1);
1904 void insert(size_t __p) {
1905 _CharT __c = _CharT();
1906 insert(__p, &__c, 1);
1909 void insert(size_t __p, const _CharT* __i, const _CharT* __j) {
1914 void insert(size_t __p, const const_iterator& __i,
1915 const const_iterator& __j) {
1920 void insert(size_t __p, const iterator& __i,
1921 const iterator& __j) {
1926 // (position, length) versions of replace operations:
1928 void replace(size_t __p, size_t __n, const rope& __r) {
1929 _RopeRep* __result =
1930 replace(_M_tree_ptr, __p, __p + __n, __r._M_tree_ptr);
1931 _S_unref(_M_tree_ptr);
1932 _M_tree_ptr = __result;
1935 void replace(size_t __p, size_t __n,
1936 const _CharT* __i, size_t __i_len) {
1937 rope __r(__i, __i_len);
1938 replace(__p, __n, __r);
1941 void replace(size_t __p, size_t __n, _CharT __c) {
1943 replace(__p, __n, __r);
1946 void replace(size_t __p, size_t __n, const _CharT* __c_string) {
1947 rope __r(__c_string);
1948 replace(__p, __n, __r);
1951 void replace(size_t __p, size_t __n,
1952 const _CharT* __i, const _CharT* __j) {
1954 replace(__p, __n, __r);
1957 void replace(size_t __p, size_t __n,
1958 const const_iterator& __i, const const_iterator& __j) {
1960 replace(__p, __n, __r);
1963 void replace(size_t __p, size_t __n,
1964 const iterator& __i, const iterator& __j) {
1966 replace(__p, __n, __r);
1969 // Single character variants:
1970 void replace(size_t __p, _CharT __c) {
1971 iterator __i(this, __p);
1975 void replace(size_t __p, const rope& __r) {
1976 replace(__p, 1, __r);
1979 void replace(size_t __p, const _CharT* __i, size_t __i_len) {
1980 replace(__p, 1, __i, __i_len);
1983 void replace(size_t __p, const _CharT* __c_string) {
1984 replace(__p, 1, __c_string);
1987 void replace(size_t __p, const _CharT* __i, const _CharT* __j) {
1988 replace(__p, 1, __i, __j);
1991 void replace(size_t __p, const const_iterator& __i,
1992 const const_iterator& __j) {
1993 replace(__p, 1, __i, __j);
1996 void replace(size_t __p, const iterator& __i,
1997 const iterator& __j) {
1998 replace(__p, 1, __i, __j);
2001 // Erase, (position, size) variant.
2002 void erase(size_t __p, size_t __n) {
2003 _RopeRep* __result = replace(_M_tree_ptr, __p, __p + __n, 0);
2004 _S_unref(_M_tree_ptr);
2005 _M_tree_ptr = __result;
2008 // Erase, single character
2009 void erase(size_t __p) {
2010 erase(__p, __p + 1);
2013 // Insert, iterator variants.
2014 iterator insert(const iterator& __p, const rope& __r)
2015 { insert(__p.index(), __r); return __p; }
2016 iterator insert(const iterator& __p, size_t __n, _CharT __c)
2017 { insert(__p.index(), __n, __c); return __p; }
2018 iterator insert(const iterator& __p, _CharT __c)
2019 { insert(__p.index(), __c); return __p; }
2020 iterator insert(const iterator& __p )
2021 { insert(__p.index()); return __p; }
2022 iterator insert(const iterator& __p, const _CharT* c_string)
2023 { insert(__p.index(), c_string); return __p; }
2024 iterator insert(const iterator& __p, const _CharT* __i, size_t __n)
2025 { insert(__p.index(), __i, __n); return __p; }
2026 iterator insert(const iterator& __p, const _CharT* __i,
2028 { insert(__p.index(), __i, __j); return __p; }
2029 iterator insert(const iterator& __p,
2030 const const_iterator& __i, const const_iterator& __j)
2031 { insert(__p.index(), __i, __j); return __p; }
2032 iterator insert(const iterator& __p,
2033 const iterator& __i, const iterator& __j)
2034 { insert(__p.index(), __i, __j); return __p; }
2036 // Replace, range variants.
2037 void replace(const iterator& __p, const iterator& __q,
2039 { replace(__p.index(), __q.index() - __p.index(), __r); }
2040 void replace(const iterator& __p, const iterator& __q, _CharT __c)
2041 { replace(__p.index(), __q.index() - __p.index(), __c); }
2042 void replace(const iterator& __p, const iterator& __q,
2043 const _CharT* __c_string)
2044 { replace(__p.index(), __q.index() - __p.index(), __c_string); }
2045 void replace(const iterator& __p, const iterator& __q,
2046 const _CharT* __i, size_t __n)
2047 { replace(__p.index(), __q.index() - __p.index(), __i, __n); }
2048 void replace(const iterator& __p, const iterator& __q,
2049 const _CharT* __i, const _CharT* __j)
2050 { replace(__p.index(), __q.index() - __p.index(), __i, __j); }
2051 void replace(const iterator& __p, const iterator& __q,
2052 const const_iterator& __i, const const_iterator& __j)
2053 { replace(__p.index(), __q.index() - __p.index(), __i, __j); }
2054 void replace(const iterator& __p, const iterator& __q,
2055 const iterator& __i, const iterator& __j)
2056 { replace(__p.index(), __q.index() - __p.index(), __i, __j); }
2058 // Replace, iterator variants.
2059 void replace(const iterator& __p, const rope& __r)
2060 { replace(__p.index(), __r); }
2061 void replace(const iterator& __p, _CharT __c)
2062 { replace(__p.index(), __c); }
2063 void replace(const iterator& __p, const _CharT* __c_string)
2064 { replace(__p.index(), __c_string); }
2065 void replace(const iterator& __p, const _CharT* __i, size_t __n)
2066 { replace(__p.index(), __i, __n); }
2067 void replace(const iterator& __p, const _CharT* __i, const _CharT* __j)
2068 { replace(__p.index(), __i, __j); }
2069 void replace(const iterator& __p, const_iterator __i,
2071 { replace(__p.index(), __i, __j); }
2072 void replace(const iterator& __p, iterator __i, iterator __j)
2073 { replace(__p.index(), __i, __j); }
2075 // Iterator and range variants of erase
2076 iterator erase(const iterator& __p, const iterator& __q) {
2077 size_t __p_index = __p.index();
2078 erase(__p_index, __q.index() - __p_index);
2079 return iterator(this, __p_index);
2081 iterator erase(const iterator& __p) {
2082 size_t __p_index = __p.index();
2083 erase(__p_index, 1);
2084 return iterator(this, __p_index);
2087 rope substr(size_t __start, size_t __len = 1) const {
2088 return rope<_CharT,_Alloc>(
2089 _S_substring(_M_tree_ptr, __start, __start + __len));
2092 rope substr(iterator __start, iterator __end) const {
2093 return rope<_CharT,_Alloc>(
2094 _S_substring(_M_tree_ptr, __start.index(), __end.index()));
2097 rope substr(iterator __start) const {
2098 size_t __pos = __start.index();
2099 return rope<_CharT,_Alloc>(
2100 _S_substring(_M_tree_ptr, __pos, __pos + 1));
2103 rope substr(const_iterator __start, const_iterator __end) const {
2104 // This might eventually take advantage of the cache in the
2106 return rope<_CharT,_Alloc>(
2107 _S_substring(_M_tree_ptr, __start.index(), __end.index()));
2110 rope<_CharT,_Alloc> substr(const_iterator __start) {
2111 size_t __pos = __start.index();
2112 return rope<_CharT,_Alloc>(
2113 _S_substring(_M_tree_ptr, __pos, __pos + 1));
2116 static const size_type npos;
2118 size_type find(_CharT __c, size_type __pos = 0) const;
2119 size_type find(const _CharT* __s, size_type __pos = 0) const {
2120 size_type __result_pos;
2121 const_iterator __result =
2122 std::search(const_begin() + __pos, const_end(),
2123 __s, __s + _S_char_ptr_len(__s));
2124 __result_pos = __result.index();
2125 # ifndef __STL_OLD_ROPE_SEMANTICS
2126 if (__result_pos == size()) __result_pos = npos;
2128 return __result_pos;
2131 iterator mutable_begin() {
2132 return(iterator(this, 0));
2135 iterator mutable_end() {
2136 return(iterator(this, size()));
2139 typedef reverse_iterator<iterator> reverse_iterator;
2141 reverse_iterator mutable_rbegin() {
2142 return reverse_iterator(mutable_end());
2145 reverse_iterator mutable_rend() {
2146 return reverse_iterator(mutable_begin());
2149 reference mutable_reference_at(size_type __pos) {
2150 return reference(this, __pos);
2154 reference operator[] (size_type __pos) {
2155 return _char_ref_proxy(this, __pos);
2158 reference at(size_type __pos) {
2159 // if (__pos >= size()) throw out_of_range; // XXX
2160 return (*this)[__pos];
2163 void resize(size_type __n, _CharT __c) {}
2164 void resize(size_type __n) {}
2165 void reserve(size_type __res_arg = 0) {}
2166 size_type capacity() const {
2170 // Stuff below this line is dangerous because it's error prone.
2171 // I would really like to get rid of it.
2172 // copy function with funny arg ordering.
2173 size_type copy(_CharT* __buffer, size_type __n,
2174 size_type __pos = 0) const {
2175 return copy(__pos, __n, __buffer);
2178 iterator end() { return mutable_end(); }
2180 iterator begin() { return mutable_begin(); }
2182 reverse_iterator rend() { return mutable_rend(); }
2184 reverse_iterator rbegin() { return mutable_rbegin(); }
2188 const_iterator end() { return const_end(); }
2190 const_iterator begin() { return const_begin(); }
2192 const_reverse_iterator rend() { return const_rend(); }
2194 const_reverse_iterator rbegin() { return const_rbegin(); }
2200 template <class _CharT, class _Alloc>
2201 const typename rope<_CharT, _Alloc>::size_type rope<_CharT, _Alloc>::npos =
2204 template <class _CharT, class _Alloc>
2205 inline bool operator== (const _Rope_const_iterator<_CharT,_Alloc>& __x,
2206 const _Rope_const_iterator<_CharT,_Alloc>& __y) {
2207 return (__x._M_current_pos == __y._M_current_pos &&
2208 __x._M_root == __y._M_root);
2211 template <class _CharT, class _Alloc>
2212 inline bool operator< (const _Rope_const_iterator<_CharT,_Alloc>& __x,
2213 const _Rope_const_iterator<_CharT,_Alloc>& __y) {
2214 return (__x._M_current_pos < __y._M_current_pos);
2217 template <class _CharT, class _Alloc>
2218 inline bool operator!= (const _Rope_const_iterator<_CharT,_Alloc>& __x,
2219 const _Rope_const_iterator<_CharT,_Alloc>& __y) {
2220 return !(__x == __y);
2223 template <class _CharT, class _Alloc>
2224 inline bool operator> (const _Rope_const_iterator<_CharT,_Alloc>& __x,
2225 const _Rope_const_iterator<_CharT,_Alloc>& __y) {
2229 template <class _CharT, class _Alloc>
2230 inline bool operator<= (const _Rope_const_iterator<_CharT,_Alloc>& __x,
2231 const _Rope_const_iterator<_CharT,_Alloc>& __y) {
2232 return !(__y < __x);
2235 template <class _CharT, class _Alloc>
2236 inline bool operator>= (const _Rope_const_iterator<_CharT,_Alloc>& __x,
2237 const _Rope_const_iterator<_CharT,_Alloc>& __y) {
2238 return !(__x < __y);
2241 template <class _CharT, class _Alloc>
2242 inline ptrdiff_t operator-(const _Rope_const_iterator<_CharT,_Alloc>& __x,
2243 const _Rope_const_iterator<_CharT,_Alloc>& __y) {
2244 return (ptrdiff_t)__x._M_current_pos - (ptrdiff_t)__y._M_current_pos;
2247 template <class _CharT, class _Alloc>
2248 inline _Rope_const_iterator<_CharT,_Alloc>
2249 operator-(const _Rope_const_iterator<_CharT,_Alloc>& __x, ptrdiff_t __n) {
2250 return _Rope_const_iterator<_CharT,_Alloc>(
2251 __x._M_root, __x._M_current_pos - __n);
2254 template <class _CharT, class _Alloc>
2255 inline _Rope_const_iterator<_CharT,_Alloc>
2256 operator+(const _Rope_const_iterator<_CharT,_Alloc>& __x, ptrdiff_t __n) {
2257 return _Rope_const_iterator<_CharT,_Alloc>(
2258 __x._M_root, __x._M_current_pos + __n);
2261 template <class _CharT, class _Alloc>
2262 inline _Rope_const_iterator<_CharT,_Alloc>
2263 operator+(ptrdiff_t __n, const _Rope_const_iterator<_CharT,_Alloc>& __x) {
2264 return _Rope_const_iterator<_CharT,_Alloc>(
2265 __x._M_root, __x._M_current_pos + __n);
2268 template <class _CharT, class _Alloc>
2269 inline bool operator== (const _Rope_iterator<_CharT,_Alloc>& __x,
2270 const _Rope_iterator<_CharT,_Alloc>& __y) {
2271 return (__x._M_current_pos == __y._M_current_pos &&
2272 __x._M_root_rope == __y._M_root_rope);
2275 template <class _CharT, class _Alloc>
2276 inline bool operator< (const _Rope_iterator<_CharT,_Alloc>& __x,
2277 const _Rope_iterator<_CharT,_Alloc>& __y) {
2278 return (__x._M_current_pos < __y._M_current_pos);
2281 template <class _CharT, class _Alloc>
2282 inline bool operator!= (const _Rope_iterator<_CharT,_Alloc>& __x,
2283 const _Rope_iterator<_CharT,_Alloc>& __y) {
2284 return !(__x == __y);
2287 template <class _CharT, class _Alloc>
2288 inline bool operator> (const _Rope_iterator<_CharT,_Alloc>& __x,
2289 const _Rope_iterator<_CharT,_Alloc>& __y) {
2293 template <class _CharT, class _Alloc>
2294 inline bool operator<= (const _Rope_iterator<_CharT,_Alloc>& __x,
2295 const _Rope_iterator<_CharT,_Alloc>& __y) {
2296 return !(__y < __x);
2299 template <class _CharT, class _Alloc>
2300 inline bool operator>= (const _Rope_iterator<_CharT,_Alloc>& __x,
2301 const _Rope_iterator<_CharT,_Alloc>& __y) {
2302 return !(__x < __y);
2305 template <class _CharT, class _Alloc>
2306 inline ptrdiff_t operator-(const _Rope_iterator<_CharT,_Alloc>& __x,
2307 const _Rope_iterator<_CharT,_Alloc>& __y) {
2308 return (ptrdiff_t)__x._M_current_pos - (ptrdiff_t)__y._M_current_pos;
2311 template <class _CharT, class _Alloc>
2312 inline _Rope_iterator<_CharT,_Alloc>
2313 operator-(const _Rope_iterator<_CharT,_Alloc>& __x,
2315 return _Rope_iterator<_CharT,_Alloc>(
2316 __x._M_root_rope, __x._M_current_pos - __n);
2319 template <class _CharT, class _Alloc>
2320 inline _Rope_iterator<_CharT,_Alloc>
2321 operator+(const _Rope_iterator<_CharT,_Alloc>& __x,
2323 return _Rope_iterator<_CharT,_Alloc>(
2324 __x._M_root_rope, __x._M_current_pos + __n);
2327 template <class _CharT, class _Alloc>
2328 inline _Rope_iterator<_CharT,_Alloc>
2329 operator+(ptrdiff_t __n, const _Rope_iterator<_CharT,_Alloc>& __x) {
2330 return _Rope_iterator<_CharT,_Alloc>(
2331 __x._M_root_rope, __x._M_current_pos + __n);
2334 template <class _CharT, class _Alloc>
2337 operator+ (const rope<_CharT,_Alloc>& __left,
2338 const rope<_CharT,_Alloc>& __right)
2340 return rope<_CharT,_Alloc>(
2341 rope<_CharT,_Alloc>::_S_concat(__left._M_tree_ptr, __right._M_tree_ptr));
2342 // Inlining this should make it possible to keep __left and
2343 // __right in registers.
2346 template <class _CharT, class _Alloc>
2348 rope<_CharT,_Alloc>&
2349 operator+= (rope<_CharT,_Alloc>& __left,
2350 const rope<_CharT,_Alloc>& __right)
2352 __left.append(__right);
2356 template <class _CharT, class _Alloc>
2359 operator+ (const rope<_CharT,_Alloc>& __left,
2360 const _CharT* __right) {
2361 size_t __rlen = rope<_CharT,_Alloc>::_S_char_ptr_len(__right);
2362 return rope<_CharT,_Alloc>(
2363 rope<_CharT,_Alloc>::_S_concat_char_iter(
2364 __left._M_tree_ptr, __right, __rlen));
2367 template <class _CharT, class _Alloc>
2369 rope<_CharT,_Alloc>&
2370 operator+= (rope<_CharT,_Alloc>& __left,
2371 const _CharT* __right) {
2372 __left.append(__right);
2376 template <class _CharT, class _Alloc>
2379 operator+ (const rope<_CharT,_Alloc>& __left, _CharT __right) {
2380 return rope<_CharT,_Alloc>(
2381 rope<_CharT,_Alloc>::_S_concat_char_iter(
2382 __left._M_tree_ptr, &__right, 1));
2385 template <class _CharT, class _Alloc>
2387 rope<_CharT,_Alloc>&
2388 operator+= (rope<_CharT,_Alloc>& __left, _CharT __right) {
2389 __left.append(__right);
2393 template <class _CharT, class _Alloc>
2395 operator< (const rope<_CharT,_Alloc>& __left,
2396 const rope<_CharT,_Alloc>& __right) {
2397 return __left.compare(__right) < 0;
2400 template <class _CharT, class _Alloc>
2402 operator== (const rope<_CharT,_Alloc>& __left,
2403 const rope<_CharT,_Alloc>& __right) {
2404 return __left.compare(__right) == 0;
2407 template <class _CharT, class _Alloc>
2408 inline bool operator== (const _Rope_char_ptr_proxy<_CharT,_Alloc>& __x,
2409 const _Rope_char_ptr_proxy<_CharT,_Alloc>& __y) {
2410 return (__x._M_pos == __y._M_pos && __x._M_root == __y._M_root);
2413 template <class _CharT, class _Alloc>
2415 operator!= (const rope<_CharT,_Alloc>& __x, const rope<_CharT,_Alloc>& __y) {
2416 return !(__x == __y);
2419 template <class _CharT, class _Alloc>
2421 operator> (const rope<_CharT,_Alloc>& __x, const rope<_CharT,_Alloc>& __y) {
2425 template <class _CharT, class _Alloc>
2427 operator<= (const rope<_CharT,_Alloc>& __x, const rope<_CharT,_Alloc>& __y) {
2428 return !(__y < __x);
2431 template <class _CharT, class _Alloc>
2433 operator>= (const rope<_CharT,_Alloc>& __x, const rope<_CharT,_Alloc>& __y) {
2434 return !(__x < __y);
2437 template <class _CharT, class _Alloc>
2438 inline bool operator!= (const _Rope_char_ptr_proxy<_CharT,_Alloc>& __x,
2439 const _Rope_char_ptr_proxy<_CharT,_Alloc>& __y) {
2440 return !(__x == __y);
2443 template<class _CharT, class _Traits, class _Alloc>
2444 std::basic_ostream<_CharT, _Traits>& operator<<
2445 (std::basic_ostream<_CharT, _Traits>& __o,
2446 const rope<_CharT, _Alloc>& __r);
2448 typedef rope<char> crope;
2449 typedef rope<wchar_t> wrope;
2451 inline crope::reference __mutable_reference_at(crope& __c, size_t __i)
2453 return __c.mutable_reference_at(__i);
2456 inline wrope::reference __mutable_reference_at(wrope& __c, size_t __i)
2458 return __c.mutable_reference_at(__i);
2461 template <class _CharT, class _Alloc>
2462 inline void swap(rope<_CharT,_Alloc>& __x, rope<_CharT,_Alloc>& __y) {
2466 // Hash functions should probably be revisited later:
2467 template<> struct hash<crope>
2469 size_t operator()(const crope& __str) const
2471 size_t __size = __str.size();
2473 if (0 == __size) return 0;
2474 return 13*__str[0] + 5*__str[__size - 1] + __size;
2479 template<> struct hash<wrope>
2481 size_t operator()(const wrope& __str) const
2483 size_t __size = __str.size();
2485 if (0 == __size) return 0;
2486 return 13*__str[0] + 5*__str[__size - 1] + __size;
2490 } // namespace __gnu_cxx
2492 # include <ext/ropeimpl.h>
2494 # endif /* __SGI_STL_INTERNAL_ROPE_H */