williamr@2: /*
williamr@2:  * © Portions copyright (c) 2006-2007 Nokia Corporation.  All rights reserved.
williamr@2:  * Copyright (c) 1996,1997
williamr@2:  * Silicon Graphics Computer Systems, Inc.
williamr@2:  *
williamr@2:  * Copyright (c) 1999 
williamr@2:  * Boris Fomitchev
williamr@2:  *
williamr@2:  * This material is provided "as is", with absolutely no warranty expressed
williamr@2:  * or implied. Any use is at your own risk.
williamr@2:  *
williamr@2:  * Permission to use or copy this software for any purpose is hereby granted 
williamr@2:  * without fee, provided the above notices are retained on all copies.
williamr@2:  * Permission to modify the code and to distribute modified code is granted,
williamr@2:  * provided the above notices are retained, and a notice that the code was
williamr@2:  * modified is included with the above copyright notice.
williamr@2:  *
williamr@2:  */
williamr@2: 
williamr@2: /* NOTE: This is an internal header file, included by other STL headers.
williamr@2:  *   You should not attempt to use it directly.
williamr@2:  */
williamr@2: 
williamr@2: // Set buf_start, buf_end, and buf_ptr appropriately, filling tmp_buf
williamr@2: // if necessary.  Assumes path_end[leaf_index] and leaf_pos are correct.
williamr@2: // Results in a valid buf_ptr if the iterator can be legitimately
williamr@2: // dereferenced.
williamr@2: # ifndef _STLP_ROPEIMPL_H
williamr@2: # define _STLP_ROPEIMPL_H
williamr@2: 
williamr@2: #ifndef _STLP_INTERNAL_ROPE_H
williamr@2: # include <stl/_rope.h>
williamr@2: #endif
williamr@2: 
williamr@2: # ifndef _STLP_CSTDIO
williamr@2: #  include <cstdio>
williamr@2: # endif
williamr@2: 
williamr@2: #ifndef _STLP_IOSTREAM
williamr@2: # include <iostream>
williamr@2: #endif
williamr@2: 
williamr@2: # include <stl/_range_errors.h>
williamr@2: 
williamr@2: _STLP_BEGIN_NAMESPACE
williamr@2: 
williamr@2: # if defined ( _STLP_NESTED_TYPE_PARAM_BUG )
williamr@2: # define __allocator__ _Alloc
williamr@2: # else
williamr@2: # define __allocator__ allocator_type
williamr@2: # endif
williamr@2: 
williamr@2: template<class _CharT, class _Alloc>
williamr@2: _Rope_iterator<_CharT, _Alloc>::_Rope_iterator(rope<_CharT,_Alloc>* __r, size_t __pos)
williamr@2:   : _Rope_iterator_base<_CharT,_Alloc>(__r->_M_tree_ptr._M_data, __pos),
williamr@2:   _M_root_rope(__r) { _RopeRep::_S_ref(this->_M_root); }
williamr@2: 
williamr@2: template<class _CharT, class _Alloc>
williamr@2: _Rope_iterator<_CharT, _Alloc>::_Rope_iterator(rope<_CharT,_Alloc>& __r, size_t __pos): 
williamr@2:   _Rope_iterator_base<_CharT,_Alloc>(__r._M_tree_ptr._M_data, __pos), 
williamr@2:   _M_root_rope(&__r) {
williamr@2:   _RopeRep::_S_ref(this->_M_root); if (!(__r.empty()))_S_setcache(*this);
williamr@2: }
williamr@2: 
williamr@2: template<class _CharT, class _Alloc>
williamr@2: void 
williamr@2: _Rope_RopeRep<_CharT, _Alloc>::_M_free_c_string()
williamr@2: {
williamr@2:   _CharT* __cstr = _M_c_string;
williamr@2:   if (0 != __cstr) {
williamr@2:     size_t _p_size = _M_size._M_data + 1;
williamr@2:     _STLP_STD::_Destroy(__cstr, __cstr + _p_size);
williamr@2:     _M_size.deallocate(__cstr, _p_size);
williamr@2:   }
williamr@2: }
williamr@2: 
williamr@2: 
williamr@2: // Set buf_start, buf_end, and buf_ptr appropriately, filling tmp_buf
williamr@2: // if necessary.  Assumes _M_path_end[leaf_index] and leaf_pos are correct.
williamr@2: // Results in a valid buf_ptr if the iterator can be legitimately
williamr@2: // dereferenced.
williamr@2: template <class _CharT, class _Alloc>
williamr@2: void _Rope_iterator_base<_CharT,_Alloc>::_S_setbuf( 
williamr@2:   _Rope_iterator_base<_CharT,_Alloc>& __x)
williamr@2: {
williamr@2:     const _RopeRep* __leaf = __x._M_path_end[__x._M_leaf_index];
williamr@2:     size_t __leaf_pos = __x._M_leaf_pos;
williamr@2:     size_t __pos = __x._M_current_pos;
williamr@2: 
williamr@2:     switch(__leaf->_M_tag) {
williamr@2: 	case _RopeRep::_S_leaf:
williamr@2: 	    __x._M_buf_start = 
williamr@2: 	      ((_Rope_RopeLeaf<_CharT,_Alloc>*)__leaf)->_M_data;
williamr@2: 	    __x._M_buf_ptr = __x._M_buf_start + (__pos - __leaf_pos);
williamr@2: 	    __x._M_buf_end = __x._M_buf_start + __leaf->_M_size._M_data;
williamr@2: 	    break;
williamr@2: 	case _RopeRep::_S_function:
williamr@2: 	case _RopeRep::_S_substringfn:
williamr@2: 	    {
williamr@2: 		size_t __len = _S_iterator_buf_len;
williamr@2: 		size_t __buf_start_pos = __leaf_pos;
williamr@2: 		size_t __leaf_end = __leaf_pos + __leaf->_M_size._M_data;
williamr@2: 		char_producer<_CharT>* __fn =
williamr@2: 			((_Rope_RopeFunction<_CharT,_Alloc>*)__leaf)->_M_fn;
williamr@2: 
williamr@2: 		if (__buf_start_pos + __len <= __pos) {
williamr@2: 		    __buf_start_pos = __pos - __len/4;
williamr@2: 		    if (__buf_start_pos + __len > __leaf_end) {
williamr@2: 			__buf_start_pos = __leaf_end - __len;
williamr@2: 		    }
williamr@2: 		}
williamr@2: 		if (__buf_start_pos + __len > __leaf_end) {
williamr@2: 		    __len = __leaf_end - __buf_start_pos;
williamr@2: 		}
williamr@2: 		(*__fn)(__buf_start_pos - __leaf_pos, __len, __x._M_tmp_buf);
williamr@2: 		__x._M_buf_ptr = __x._M_tmp_buf + (__pos - __buf_start_pos);
williamr@2: 		__x._M_buf_start = __x._M_tmp_buf;
williamr@2: 		__x._M_buf_end = __x._M_tmp_buf + __len;
williamr@2: 	    }
williamr@2: 	    break;
williamr@2: 	default:
williamr@2:       _STLP_ASSERT(0)
williamr@2:         ;
williamr@2:     }
williamr@2: }
williamr@2: 
williamr@2: // Set path and buffer inside a rope iterator.  We assume that 
williamr@2: // pos and root are already set.
williamr@2: template <class _CharT, class _Alloc>
williamr@2: void _Rope_iterator_base<_CharT,_Alloc>::_S_setcache
williamr@2: (_Rope_iterator_base<_CharT,_Alloc>& __x)
williamr@2: {
williamr@2:     const _RopeRep* __path[_RopeRep::_S_max_rope_depth+1];
williamr@2:     const _RopeRep* __curr_rope;
williamr@2:     int __curr_depth = -1;  /* index into path    */
williamr@2:     size_t __curr_start_pos = 0;
williamr@2:     size_t __pos = __x._M_current_pos;
williamr@2:     unsigned char __dirns = 0; // Bit vector marking right turns in the path
williamr@2: 
williamr@2:     _STLP_ASSERT(__pos <= __x._M_root->_M_size._M_data)
williamr@2:     if (__pos >= __x._M_root->_M_size._M_data) {
williamr@2: 	__x._M_buf_ptr = 0;
williamr@2: 	return;
williamr@2:     }
williamr@2:     __curr_rope = __x._M_root;
williamr@2:     if (0 != __curr_rope->_M_c_string) {
williamr@2: 	/* Treat the root as a leaf. */
williamr@2: 	__x._M_buf_start = __curr_rope->_M_c_string;
williamr@2: 	__x._M_buf_end = __curr_rope->_M_c_string + __curr_rope->_M_size._M_data;
williamr@2: 	__x._M_buf_ptr = __curr_rope->_M_c_string + __pos;
williamr@2: 	__x._M_path_end[0] = __curr_rope;
williamr@2: 	__x._M_leaf_index = 0;
williamr@2: 	__x._M_leaf_pos = 0;
williamr@2: 	return;
williamr@2:     }
williamr@2:     for(;;) {
williamr@2: 	++__curr_depth;
williamr@2: 	_STLP_ASSERT(__curr_depth <= _RopeRep::_S_max_rope_depth)
williamr@2: 	__path[__curr_depth] = __curr_rope;
williamr@2: 	switch(__curr_rope->_M_tag) {
williamr@2: 	  case _RopeRep::_S_leaf:
williamr@2: 	  case _RopeRep::_S_function:
williamr@2: 	  case _RopeRep::_S_substringfn:
williamr@2: 	    __x._M_leaf_pos = __curr_start_pos;
williamr@2: 	    goto done;
williamr@2: 	  case _RopeRep::_S_concat:
williamr@2: 	    {
williamr@2: 		_Rope_RopeConcatenation<_CharT,_Alloc>* __c =
williamr@2: 			(_Rope_RopeConcatenation<_CharT,_Alloc>*)__curr_rope;
williamr@2: 		_RopeRep* __left = __c->_M_left;
williamr@2: 		size_t __left_len = __left->_M_size._M_data;
williamr@2: 		
williamr@2: 		__dirns <<= 1;
williamr@2: 		if (__pos >= __curr_start_pos + __left_len) {
williamr@2: 		    __dirns |= 1;
williamr@2: 		    __curr_rope = __c->_M_right;
williamr@2: 		    __curr_start_pos += __left_len;
williamr@2: 		} else {
williamr@2: 		    __curr_rope = __left;
williamr@2: 		}
williamr@2: 	    }
williamr@2: 	    break;
williamr@2: 	}
williamr@2:     }
williamr@2:   done:
williamr@2:     // Copy last section of path into _M_path_end.
williamr@2:       {
williamr@2: 	int __i = -1;
williamr@2: 	int __j = __curr_depth + 1 - _S_path_cache_len;
williamr@2: 
williamr@2: 	if (__j < 0) __j = 0;
williamr@2: 	while (__j <= __curr_depth) {
williamr@2: 	    __x._M_path_end[++__i] = __path[__j++];
williamr@2: 	}
williamr@2: 	__x._M_leaf_index = __i;
williamr@2:       }
williamr@2:       __x._M_path_directions = __dirns;
williamr@2:       _S_setbuf(__x);
williamr@2: }
williamr@2: 
williamr@2: // Specialized version of the above.  Assumes that
williamr@2: // the path cache is valid for the previous position.
williamr@2: template <class _CharT, class _Alloc>
williamr@2: void _Rope_iterator_base<_CharT,_Alloc>::_S_setcache_for_incr
williamr@2: (_Rope_iterator_base<_CharT,_Alloc>& __x)
williamr@2: {
williamr@2:     int __current_index = __x._M_leaf_index;
williamr@2:     const _RopeRep* __current_node = __x._M_path_end[__current_index];
williamr@2:     size_t __len = __current_node->_M_size._M_data;
williamr@2:     size_t __node_start_pos = __x._M_leaf_pos;
williamr@2:     unsigned char __dirns = __x._M_path_directions;
williamr@2:     _Rope_RopeConcatenation<_CharT,_Alloc>* __c;
williamr@2: 
williamr@2:     _STLP_ASSERT(__x._M_current_pos <= __x._M_root->_M_size._M_data)
williamr@2:     if (__x._M_current_pos - __node_start_pos < __len) {
williamr@2: 	/* More stuff in this leaf, we just didn't cache it. */
williamr@2: 	_S_setbuf(__x);
williamr@2: 	return;
williamr@2:     }
williamr@2:     _STLP_ASSERT(__node_start_pos + __len == __x._M_current_pos)
williamr@2:     //  node_start_pos is starting position of last_node.
williamr@2:     while (--__current_index >= 0) {
williamr@2: 	if (!(__dirns & 1) /* Path turned left */) 
williamr@2: 	  break;
williamr@2: 	__current_node = __x._M_path_end[__current_index];
williamr@2: 	__c = (_Rope_RopeConcatenation<_CharT,_Alloc>*)__current_node;
williamr@2: 	// Otherwise we were in the right child.  Thus we should pop
williamr@2: 	// the concatenation node.
williamr@2: 	__node_start_pos -= __c->_M_left->_M_size._M_data;
williamr@2: 	__dirns >>= 1;
williamr@2:     }
williamr@2:     if (__current_index < 0) {
williamr@2: 	// We underflowed the cache. Punt.
williamr@2: 	_S_setcache(__x);
williamr@2: 	return;
williamr@2:     }
williamr@2:     __current_node = __x._M_path_end[__current_index];
williamr@2:     __c = (_Rope_RopeConcatenation<_CharT,_Alloc>*)__current_node;
williamr@2:     // current_node is a concatenation node.  We are positioned on the first
williamr@2:     // character in its right child.
williamr@2:     // node_start_pos is starting position of current_node.
williamr@2:     __node_start_pos += __c->_M_left->_M_size._M_data;
williamr@2:     __current_node = __c->_M_right;
williamr@2:     __x._M_path_end[++__current_index] = __current_node;
williamr@2:     __dirns |= 1;
williamr@2:     while (_RopeRep::_S_concat == __current_node->_M_tag) {
williamr@2: 	++__current_index;
williamr@2: 	if (_S_path_cache_len == __current_index) {
williamr@2: 	    int __i;
williamr@2: 	    for (__i = 0; __i < _S_path_cache_len-1; __i++) {
williamr@2: 		__x._M_path_end[__i] = __x._M_path_end[__i+1];
williamr@2: 	    }
williamr@2: 	    --__current_index;
williamr@2: 	}
williamr@2: 	__current_node =
williamr@2: 	    ((_Rope_RopeConcatenation<_CharT,_Alloc>*)__current_node)->_M_left;
williamr@2: 	__x._M_path_end[__current_index] = __current_node;
williamr@2: 	__dirns <<= 1;
williamr@2: 	// node_start_pos is unchanged.
williamr@2:     }
williamr@2:     __x._M_leaf_index = __current_index;
williamr@2:     __x._M_leaf_pos = __node_start_pos;
williamr@2:     __x._M_path_directions = __dirns;
williamr@2:     _S_setbuf(__x);
williamr@2: }
williamr@2: 
williamr@2: template <class _CharT, class _Alloc>
williamr@2: void _Rope_iterator_base<_CharT,_Alloc>::_M_incr(size_t __n) {
williamr@2:     _M_current_pos += __n;
williamr@2:     if (0 != _M_buf_ptr) {
williamr@2:         size_t __chars_left = _M_buf_end - _M_buf_ptr;
williamr@2:         if (__chars_left > __n) {
williamr@2:             _M_buf_ptr += __n;
williamr@2:         } else if (__chars_left == __n) {
williamr@2:             _M_buf_ptr += __n;
williamr@2:             _S_setcache_for_incr(*this);
williamr@2:         } else {
williamr@2:             _M_buf_ptr = 0;
williamr@2:         }
williamr@2:     }
williamr@2: }
williamr@2: 
williamr@2: template <class _CharT, class _Alloc>
williamr@2: void _Rope_iterator_base<_CharT,_Alloc>::_M_decr(size_t __n) {
williamr@2:     if (0 != _M_buf_ptr) {
williamr@2:         size_t __chars_left = _M_buf_ptr - _M_buf_start;
williamr@2:         if (__chars_left >= __n) {
williamr@2:             _M_buf_ptr -= __n;
williamr@2:         } else {
williamr@2:             _M_buf_ptr = 0;
williamr@2:         }
williamr@2:     }
williamr@2:     _M_current_pos -= __n;
williamr@2: }
williamr@2: 
williamr@2: template <class _CharT, class _Alloc>
williamr@2: void _Rope_iterator<_CharT,_Alloc>::_M_check() {
williamr@2:     if (_M_root_rope->_M_tree_ptr._M_data != this->_M_root) {
williamr@2:         // _Rope was modified.  Get things fixed up.
williamr@2:         _RopeRep::_S_unref(this->_M_root);
williamr@2:         this->_M_root = _M_root_rope->_M_tree_ptr._M_data;
williamr@2:         _RopeRep::_S_ref(this->_M_root);
williamr@2:         this->_M_buf_ptr = 0;
williamr@2:     }
williamr@2: }
williamr@2: 
williamr@2: # ifndef _GC
williamr@2: //  There are several reasons for not doing this with virtual destructors
williamr@2: //  and a class specific delete operator:
williamr@2: //  - A class specific delete operator can't easily get access to
williamr@2: //    allocator instances if we need them.
williamr@2: //  - Any virtual function would need a 4 or byte vtable pointer;
williamr@2: //    this only requires a one byte tag per object.
williamr@2: template <class _CharT, class _Alloc>
williamr@2: void _Rope_RopeRep<_CharT,_Alloc>::_M_free_tree()
williamr@2: {
williamr@2:     switch(_M_tag) {
williamr@2: 	case _S_leaf:
williamr@2: 	    {
williamr@2: 	      typedef _Rope_RopeLeaf<_CharT,_Alloc> _Rope_RopeLeaf_T;
williamr@2:           _Rope_RopeLeaf_T* __l = (_Rope_RopeLeaf_T*)this;
williamr@2:           _STLP_STD::_Destroy(__l); // ->_Rope_RopeLeaf<_CharT,_Alloc>::~_Rope_RopeLeaf();
williamr@2: 	      _STLP_CREATE_ALLOCATOR(allocator_type,(const allocator_type&)_M_size, _Rope_RopeLeaf_T).deallocate(__l, 1);
williamr@2: 	        break;
williamr@2: 	    }
williamr@2: 	case _S_concat:
williamr@2: 	    {
williamr@2:                typedef _Rope_RopeConcatenation<_CharT,_Alloc> _Rope_RopeConcatenation_T;
williamr@2:                _Rope_RopeConcatenation_T* __c  = (_Rope_RopeConcatenation_T*)this;
williamr@2:                _STLP_STD::_Destroy(__c);
williamr@2:                _STLP_CREATE_ALLOCATOR(allocator_type,(const allocator_type&)_M_size, 
williamr@2:                                _Rope_RopeConcatenation_T).deallocate(__c, 1);
williamr@2: 	        break;
williamr@2: 	    }
williamr@2: 	case _S_function:
williamr@2: 	    {
williamr@2:             typedef _Rope_RopeFunction<_CharT,_Alloc> _Rope_RopeFunctionT;
williamr@2:               _Rope_RopeFunctionT* __f = (_Rope_RopeFunctionT*)this;
williamr@2:               _STLP_STD::_Destroy(__f);
williamr@2:               _STLP_CREATE_ALLOCATOR(allocator_type,(const allocator_type&)_M_size, 
williamr@2:                                  _Rope_RopeFunctionT).deallocate(__f, 1);
williamr@2: 	        break;
williamr@2: 	    }
williamr@2: 	case _S_substringfn:
williamr@2: 	    {
williamr@2:             typedef _Rope_RopeSubstring<_CharT,_Alloc> _Rope_RopeSubstring_T;
williamr@2:               _Rope_RopeSubstring_T* __ss = (_Rope_RopeSubstring_T*)this;
williamr@2:               _STLP_STD::_Destroy(__ss);
williamr@2:               _STLP_CREATE_ALLOCATOR(allocator_type,(const allocator_type&)_M_size, 
williamr@2:                               _Rope_RopeSubstring_T).deallocate(__ss, 1);
williamr@2: 		break;
williamr@2: 	    }
williamr@2:     }
williamr@2: }
williamr@2: #endif
williamr@2: 
williamr@2: # if defined ( _STLP_NESTED_TYPE_PARAM_BUG )
williamr@2: #   define __RopeLeaf__ _Rope_RopeLeaf<_CharT,_Alloc>
williamr@2: #   define __RopeRep__ _Rope_RopeRep<_CharT,_Alloc>
williamr@2: #   define _RopeLeaf _Rope_RopeLeaf<_CharT,_Alloc>
williamr@2: #   define _RopeRep _Rope_RopeRep<_CharT,_Alloc>
williamr@2: #   define size_type size_t
williamr@2: # else
williamr@2: #   define __RopeLeaf__ _STLP_TYPENAME_ON_RETURN_TYPE rope<_CharT,_Alloc>::_RopeLeaf
williamr@2: #   define __RopeRep__ _STLP_TYPENAME_ON_RETURN_TYPE rope<_CharT,_Alloc>::_RopeRep
williamr@2: # endif
williamr@2: 
williamr@2: // Concatenate a C string onto a leaf rope by copying the rope data.
williamr@2: // Used for short ropes.
williamr@2: template <class _CharT, class _Alloc>
williamr@2: __RopeLeaf__*
williamr@2: rope<_CharT,_Alloc>::_S_leaf_concat_char_iter
williamr@2: 		(_RopeLeaf* __r, const _CharT* __iter, size_t __len)
williamr@2: {
williamr@2:     size_t __old_len = __r->_M_size._M_data;
williamr@2:     _CharT* __new_data = __r->_M_size.allocate(_S_rounded_up_size(__old_len + __len));
williamr@2:     _RopeLeaf* __result;
williamr@2:     
williamr@2:     uninitialized_copy_n(__r->_M_data, __old_len, __new_data);
williamr@2:     uninitialized_copy_n(__iter, __len, __new_data + __old_len);
williamr@2:     _S_cond_store_eos(__new_data[__old_len + __len]);
williamr@2:     _STLP_TRY {
williamr@2: 	__result = _S_new_RopeLeaf(__new_data, __old_len + __len,
williamr@2: 				   __r->get_allocator());
williamr@2:     }
williamr@2:     _STLP_UNWIND(_RopeRep::_S_free_string(__new_data, __old_len + __len,
williamr@2: 					     __r->get_allocator()));
williamr@2:     return __result;
williamr@2: }
williamr@2: 
williamr@2: #ifndef __GC
williamr@2: // As above, but it's OK to clobber original if refcount is 1
williamr@2: template <class _CharT, class _Alloc>
williamr@2: __RopeLeaf__*
williamr@2: rope<_CharT,_Alloc>::_S_destr_leaf_concat_char_iter
williamr@2: 		(_RopeLeaf* __r, const _CharT* __iter, size_t __len)
williamr@2: {
williamr@2:     _STLP_ASSERT(__r->_M_ref_count >= 1)
williamr@2:     if (__r->_M_ref_count > 1)
williamr@2:       return _S_leaf_concat_char_iter(__r, __iter, __len);
williamr@2:     size_t __old_len = __r->_M_size._M_data;
williamr@2:     if (_S_allocated_capacity(__old_len) >= __old_len + __len) {
williamr@2: 	// The space has been partially initialized for the standard
williamr@2: 	// character types.  But that doesn't matter for those types.
williamr@2: 	uninitialized_copy_n(__iter, __len, __r->_M_data + __old_len);
williamr@2: 	if (_S_is_basic_char_type((_CharT*)0)) {
williamr@2: 	    _S_cond_store_eos(__r->_M_data[__old_len + __len]);
williamr@2: 	    _STLP_ASSERT(__r->_M_c_string == __r->_M_data)
williamr@2: 	} else if (__r->_M_c_string != __r->_M_data && 0 != __r->_M_c_string) {
williamr@2: 	    __r->_M_free_c_string();
williamr@2: 	    __r->_M_c_string = 0;
williamr@2: 	}
williamr@2: 	__r->_M_size._M_data = __old_len + __len;
williamr@2: 	_STLP_ASSERT(__r->_M_ref_count == 1)
williamr@2: 	__r->_M_ref_count = 2;
williamr@2: 	return __r;
williamr@2:     } else {
williamr@2: 	_RopeLeaf* __result = _S_leaf_concat_char_iter(__r, __iter, __len);
williamr@2: 	_STLP_ASSERT(__result->_M_ref_count == 1)
williamr@2: 	return __result;
williamr@2:     }
williamr@2: }
williamr@2: #endif
williamr@2: 
williamr@2: // Assumes left and right are not 0.
williamr@2: // Does not increment (nor decrement on exception) child reference counts.
williamr@2: // Result has ref count 1.
williamr@2: template <class _CharT, class _Alloc>
williamr@2: __RopeRep__*
williamr@2: rope<_CharT,_Alloc>::_S_tree_concat (_RopeRep* __left, _RopeRep* __right)
williamr@2: {
williamr@2:     _RopeConcatenation* __result =
williamr@2:       _S_new_RopeConcatenation(__left, __right, __left->get_allocator());
williamr@2:     size_t __depth = __result->_M_depth;
williamr@2:     
williamr@2:     _STLP_ASSERT(__left->get_allocator() == __right->get_allocator())
williamr@2:     if (__depth > 20 && (__result->_M_size._M_data < 1000 ||
williamr@2: 			 __depth > _RopeRep::_S_max_rope_depth)) {
williamr@2:         _RopeRep* __balanced;
williamr@2:       
williamr@2: 	_STLP_TRY {
williamr@2: 	   __balanced = _S_balance(__result);
williamr@2: #          ifndef __GC
williamr@2: 	     if (__result != __balanced) {
williamr@2: 		_STLP_ASSERT(1 == __result->_M_ref_count
williamr@2: 			     && 1 == __balanced->_M_ref_count)
williamr@2: 	     }
williamr@2: #          endif
williamr@2: 	   __result->_M_unref_nonnil();
williamr@2:         }
williamr@2:       _STLP_UNWIND((_STLP_CREATE_ALLOCATOR(allocator_type,(allocator_type&)__left->_M_size,
williamr@2:                                     _RopeConcatenation).deallocate(__result,1)));
williamr@2: 		// In case of exception, we need to deallocate
williamr@2: 		// otherwise dangling result node.  But caller
williamr@2: 		// still owns its children.  Thus unref is
williamr@2: 		// inappropriate.
williamr@2: 	return __balanced;
williamr@2:     } else {
williamr@2: 	return __result;
williamr@2:     }
williamr@2: }
williamr@2: 
williamr@2: template <class _CharT, class _Alloc>
williamr@2: __RopeRep__*
williamr@2: rope<_CharT,_Alloc>::_S_concat_char_iter
williamr@2: 		(_RopeRep* __r, const _CharT*__s, size_t __slen)
williamr@2: {
williamr@2:     _RopeRep* __result;
williamr@2:     if (0 == __slen) {
williamr@2: 	_S_ref(__r);
williamr@2: 	return __r;
williamr@2:     }
williamr@2:     if (0 == __r)
williamr@2:       return _STLP_ROPE_FROM_UNOWNED_CHAR_PTR(__s, __slen,
williamr@2: 					      /* __r->get_allocator()*/ allocator_type() );
williamr@2:     if (_RopeRep::_S_leaf == __r->_M_tag && 
williamr@2:           __r->_M_size._M_data + __slen <= _S_copy_max) {
williamr@2: 	__result = _S_leaf_concat_char_iter((_RopeLeaf*)__r, __s, __slen);
williamr@2: #       ifndef __GC
williamr@2: 	  _STLP_ASSERT(1 == __result->_M_ref_count)
williamr@2: #       endif
williamr@2: 	return __result;
williamr@2:     }
williamr@2:     if (_RopeRep::_S_concat == __r->_M_tag
williamr@2: 	&& _RopeRep::_S_leaf == ((_RopeConcatenation*)__r)->_M_right->_M_tag) {
williamr@2: 	_RopeLeaf* __right = 
williamr@2: 	  (_RopeLeaf* )(((_RopeConcatenation* )__r)->_M_right);
williamr@2: 	if (__right->_M_size._M_data + __slen <= _S_copy_max) {
williamr@2: 	  _RopeRep* __left = ((_RopeConcatenation*)__r)->_M_left;
williamr@2: 	  _RopeRep* __nright = 
williamr@2: 	    _S_leaf_concat_char_iter((_RopeLeaf*)__right, __s, __slen);
williamr@2: 	  __left->_M_ref_nonnil();
williamr@2: 	  _STLP_TRY {
williamr@2: 	    __result = _S_tree_concat(__left, __nright);
williamr@2:           }
williamr@2: 	  _STLP_UNWIND(_S_unref(__left); _S_unref(__nright));
williamr@2: #         ifndef __GC
williamr@2: 	    _STLP_ASSERT(1 == __result->_M_ref_count)
williamr@2: #         endif
williamr@2: 	  return __result;
williamr@2: 	}
williamr@2:     }
williamr@2:     _RopeRep* __nright =
williamr@2:       _STLP_ROPE_FROM_UNOWNED_CHAR_PTR(__s, __slen, __r->get_allocator());
williamr@2:     _STLP_TRY {
williamr@2:       __r->_M_ref_nonnil();
williamr@2:       __result = _S_tree_concat(__r, __nright);
williamr@2:     }
williamr@2:     _STLP_UNWIND(_S_unref(__r); _S_unref(__nright));
williamr@2: #   ifndef __GC
williamr@2:       _STLP_ASSERT(1 == __result->_M_ref_count)
williamr@2: #   endif
williamr@2:     return __result;
williamr@2: }
williamr@2: 
williamr@2: #ifndef __GC
williamr@2: template <class _CharT, class _Alloc>
williamr@2: __RopeRep__* 
williamr@2: rope<_CharT,_Alloc>::_S_destr_concat_char_iter(
williamr@2:   _RopeRep* __r, const _CharT* __s, size_t __slen)
williamr@2: {
williamr@2:     _RopeRep* __result;
williamr@2:     if (0 == __r)
williamr@2:       return _STLP_ROPE_FROM_UNOWNED_CHAR_PTR(__s, __slen,
williamr@2: 					      /* __r-> */allocator_type());
williamr@2:     size_t __count = __r->_M_ref_count;
williamr@2:     size_t __orig_size = __r->_M_size._M_data;
williamr@2:     _STLP_ASSERT(__count >= 1)
williamr@2:     if (__count > 1) return _S_concat_char_iter(__r, __s, __slen);
williamr@2:     if (0 == __slen) {
williamr@2: 	__r->_M_ref_count = 2;      // One more than before
williamr@2: 	return __r;
williamr@2:     }
williamr@2:     if (__orig_size + __slen <= _S_copy_max && 
williamr@2:           _RopeRep::_S_leaf == __r->_M_tag) {
williamr@2: 	__result = _S_destr_leaf_concat_char_iter((_RopeLeaf*)__r, __s, __slen);
williamr@2: 	return __result;
williamr@2:     }
williamr@2:     if (_RopeRep::_S_concat == __r->_M_tag) {
williamr@2: 	_RopeLeaf* __right = (_RopeLeaf*)(((_RopeConcatenation*)__r)->_M_right);
williamr@2: 	if (_RopeRep::_S_leaf == __right->_M_tag
williamr@2: 	    && __right->_M_size._M_data + __slen <= _S_copy_max) {
williamr@2: 	  _RopeRep* __new_right = 
williamr@2: 	    _S_destr_leaf_concat_char_iter(__right, __s, __slen);
williamr@2: 	  if (__right == __new_right) {
williamr@2: 	      _STLP_ASSERT(__new_right->_M_ref_count == 2)
williamr@2: 	      __new_right->_M_ref_count = 1;
williamr@2: 	  } else {
williamr@2: 	      _STLP_ASSERT(__new_right->_M_ref_count >= 1)
williamr@2: 	      __right->_M_unref_nonnil();
williamr@2: 	  }
williamr@2: 	  _STLP_ASSERT(__r->_M_ref_count == 1)
williamr@2: 	  __r->_M_ref_count = 2;    // One more than before.
williamr@2:       ((_RopeConcatenation*)__r)->_M_right = __new_right;
williamr@2:       // E.Musser : moved below
williamr@2:       //	  __r->_M_size._M_data = __orig_size + __slen;
williamr@2: 	  if (0 != __r->_M_c_string) {
williamr@2: 	      __r->_M_free_c_string();
williamr@2: 	      __r->_M_c_string = 0;
williamr@2: 	  }
williamr@2: 	  __r->_M_size._M_data = __orig_size + __slen;
williamr@2: 	  return __r;
williamr@2: 	}
williamr@2:     }
williamr@2:     _RopeRep* __right =
williamr@2:       _STLP_ROPE_FROM_UNOWNED_CHAR_PTR(__s, __slen, __r->get_allocator());
williamr@2:     __r->_M_ref_nonnil();
williamr@2:     _STLP_TRY {
williamr@2:       __result = _S_tree_concat(__r, __right);
williamr@2:     }
williamr@2:     _STLP_UNWIND(_S_unref(__r); _S_unref(__right))
williamr@2:     _STLP_ASSERT(1 == __result->_M_ref_count)
williamr@2:     return __result;
williamr@2: }
williamr@2: #endif /* !__GC */
williamr@2: 
williamr@2: template <class _CharT, class _Alloc>
williamr@2: __RopeRep__*
williamr@2: rope<_CharT,_Alloc>::_S_concat_rep(_RopeRep* __left, _RopeRep* __right)
williamr@2: {
williamr@2:     if (0 == __left) {
williamr@2: 	_S_ref(__right);
williamr@2: 	return __right;
williamr@2:     }
williamr@2:     if (0 == __right) {
williamr@2: 	__left->_M_ref_nonnil();
williamr@2: 	return __left;
williamr@2:     }
williamr@2:     if (_RopeRep::_S_leaf == __right->_M_tag) {
williamr@2: 	if (_RopeRep::_S_leaf == __left->_M_tag) {
williamr@2: 	  if (__right->_M_size._M_data + __left->_M_size._M_data <= _S_copy_max) {
williamr@2: 	    return _S_leaf_concat_char_iter((_RopeLeaf*)__left,
williamr@2: 					 ((_RopeLeaf*)__right)->_M_data,
williamr@2: 					 __right->_M_size._M_data);
williamr@2: 	  }
williamr@2: 	} else if (_RopeRep::_S_concat == __left->_M_tag
williamr@2: 		   && _RopeRep::_S_leaf ==
williamr@2: 		      ((_RopeConcatenation*)__left)->_M_right->_M_tag) {
williamr@2: 	  _RopeLeaf* __leftright =
williamr@2: 		    (_RopeLeaf*)(((_RopeConcatenation*)__left)->_M_right); 
williamr@2: 	  if (__leftright->_M_size._M_data + __right->_M_size._M_data <= _S_copy_max) {
williamr@2: 	    _RopeRep* __leftleft = ((_RopeConcatenation*)__left)->_M_left;
williamr@2: 	    _RopeRep* __rest = _S_leaf_concat_char_iter(__leftright,
williamr@2: 					   ((_RopeLeaf*)__right)->_M_data,
williamr@2: 					   __right->_M_size._M_data);
williamr@2: 	    __leftleft->_M_ref_nonnil();
williamr@2: 	    _STLP_TRY {
williamr@2: 	      return(_S_tree_concat(__leftleft, __rest));
williamr@2:             }
williamr@2: 	    _STLP_UNWIND(_S_unref(__leftleft); _S_unref(__rest))
williamr@2: 	  }
williamr@2: 	}
williamr@2:     }
williamr@2:     __left->_M_ref_nonnil();
williamr@2:     __right->_M_ref_nonnil();
williamr@2:     _STLP_TRY {
williamr@2:       return(_S_tree_concat(__left, __right));
williamr@2:     }
williamr@2:     _STLP_UNWIND(_S_unref(__left); _S_unref(__right));
williamr@2: #ifdef _STLP_THROW_RETURN_BUG
williamr@2: 	return 0;
williamr@2: #endif
williamr@2: }
williamr@2: 
williamr@2: template <class _CharT, class _Alloc>
williamr@2: __RopeRep__*
williamr@2: rope<_CharT,_Alloc>::_S_substring(_RopeRep* __base, 
williamr@2:                                size_t __start, size_t __endp1)
williamr@2: {
williamr@2:     if (0 == __base) return 0;
williamr@2:     size_t __len = __base->_M_size._M_data;
williamr@2:     size_t __adj_endp1;
williamr@2:     const size_t __lazy_threshold = 128;
williamr@2:     
williamr@2:     if (__endp1 >= __len) {
williamr@2: 	if (0 == __start) {
williamr@2: 	    __base->_M_ref_nonnil();
williamr@2: 	    return __base;
williamr@2: 	} else {
williamr@2: 	    __adj_endp1 = __len;
williamr@2: 	}
williamr@2:     } else {
williamr@2: 	__adj_endp1 = __endp1;
williamr@2:     }
williamr@2:     switch(__base->_M_tag) {
williamr@2: 	case _RopeRep::_S_concat:
williamr@2: 	    {
williamr@2: 		_RopeConcatenation* __c = (_RopeConcatenation*)__base;
williamr@2: 		_RopeRep* __left = __c->_M_left;
williamr@2: 		_RopeRep* __right = __c->_M_right;
williamr@2: 		size_t __left_len = __left->_M_size._M_data;
williamr@2: 		_RopeRep* __result;
williamr@2: 
williamr@2: 		if (__adj_endp1 <= __left_len) {
williamr@2: 		    return _S_substring(__left, __start, __endp1);
williamr@2: 		} else if (__start >= __left_len) {
williamr@2: 		    return _S_substring(__right, __start - __left_len,
williamr@2: 				  __adj_endp1 - __left_len);
williamr@2: 		}
williamr@2: 		_Self_destruct_ptr __left_result(
williamr@2: 		  _S_substring(__left, __start, __left_len));
williamr@2: 		_Self_destruct_ptr __right_result(
williamr@2: 		  _S_substring(__right, 0, __endp1 - __left_len));
williamr@2: 		_STLP_MPWFIX_TRY		//*TY 06/01/2000 - mpw forgets to call dtor on __left_result and __right_result without this try block
williamr@2: 		__result = _S_concat_rep(__left_result, __right_result);
williamr@2: #               ifndef __GC
williamr@2: 		  _STLP_ASSERT(1 == __result->_M_ref_count)
williamr@2: #               endif
williamr@2: 		return __result;
williamr@2: 		_STLP_MPWFIX_CATCH		//*TY 06/01/2000 - 
williamr@2: 	    }
williamr@2: 	case _RopeRep::_S_leaf:
williamr@2: 	    {
williamr@2: 		_RopeLeaf* __l = (_RopeLeaf*)__base;
williamr@2: 		_RopeLeaf* __result;
williamr@2: 		size_t __result_len;
williamr@2: 		if (__start >= __adj_endp1) return 0;
williamr@2: 		__result_len = __adj_endp1 - __start;
williamr@2: 		if (__result_len > __lazy_threshold) goto lazy;
williamr@2: #               ifdef __GC
williamr@2: 		    const _CharT* __section = __l->_M_data + __start;
williamr@2: 		    __result = _S_new_RopeLeaf(__section, __result_len,
williamr@2: 					  __base->get_allocator());
williamr@2: 		    __result->_M_c_string = 0;  // Not eos terminated.
williamr@2: #               else
williamr@2: 		    // We should sometimes create substring node instead.
williamr@2: 		    __result = _STLP_ROPE_FROM_UNOWNED_CHAR_PTR(
williamr@2: 					__l->_M_data + __start, __result_len,
williamr@2: 					__base->get_allocator());
williamr@2: #               endif
williamr@2: 		return __result;
williamr@2: 	    }
williamr@2: 	case _RopeRep::_S_substringfn:
williamr@2: 	    // Avoid introducing multiple layers of substring nodes.
williamr@2: 	    {
williamr@2: 		_RopeSubstring* __old = (_RopeSubstring*)__base;
williamr@2: 		size_t __result_len;
williamr@2: 		if (__start >= __adj_endp1) return 0;
williamr@2: 		__result_len = __adj_endp1 - __start;
williamr@2: 		if (__result_len > __lazy_threshold) {
williamr@2: 		    _RopeSubstring* __result =
williamr@2: 			_S_new_RopeSubstring(__old->_M_base,
williamr@2: 					  __start + __old->_M_start,
williamr@2: 					  __adj_endp1 - __start,
williamr@2: 					  __base->get_allocator());
williamr@2: 		    return __result;
williamr@2: 
williamr@2: 		} // *** else fall through: ***
williamr@2: 	    }
williamr@2: 	case _RopeRep::_S_function:
williamr@2: 	    {
williamr@2: 		_RopeFunction* __f = (_RopeFunction*)__base;
williamr@2: 		if (__start >= __adj_endp1) return 0;
williamr@2: 		size_t __result_len = __adj_endp1 - __start;
williamr@2: 
williamr@2: 		if (__result_len > __lazy_threshold) goto lazy;
williamr@2: 		_CharT* __section = __base->_M_size.allocate(_S_rounded_up_size(__result_len));
williamr@2: 		_STLP_TRY {
williamr@2: 		  (*(__f->_M_fn))(__start, __result_len, __section);
williamr@2:                 }
williamr@2: 		_STLP_UNWIND(_RopeRep::_S_free_string(
williamr@2: 	               __section, __result_len, __base->get_allocator()));
williamr@2: 		_S_cond_store_eos(__section[__result_len]);
williamr@2: 		return _S_new_RopeLeaf(__section, __result_len,
williamr@2: 				       __base->get_allocator());
williamr@2: 	    }
williamr@2:     }
williamr@2:     /*NOTREACHED*/
williamr@2:     _STLP_ASSERT(false)
williamr@2:   lazy:
williamr@2:     {
williamr@2: 	// Create substring node.
williamr@2: 	return _S_new_RopeSubstring(__base, __start, __adj_endp1 - __start,
williamr@2: 			       __base->get_allocator());
williamr@2:     }
williamr@2: }
williamr@2: 
williamr@2: template<class _CharT>
williamr@2: class _Rope_flatten_char_consumer : public _Rope_char_consumer<_CharT> {
williamr@2:     private:
williamr@2: 	_CharT* _M_buf_ptr;
williamr@2:     public:
williamr@2: 	//  _CharT* _M_buffer;  // XXX not used
williamr@2: 
williamr@2: 	_Rope_flatten_char_consumer(_CharT* __buffer) {
williamr@2: 	    _M_buf_ptr = __buffer;
williamr@2: 	};
williamr@2: 	~_Rope_flatten_char_consumer() {}
williamr@2: 	bool operator() (const _CharT* __leaf, size_t __n) {
williamr@2: 	    uninitialized_copy_n(__leaf, __n, _M_buf_ptr);
williamr@2: 	    _M_buf_ptr += __n;
williamr@2: 	    return true;
williamr@2: 	}
williamr@2: };
williamr@2: 	    
williamr@2: template<class _CharT>
williamr@2: class _Rope_find_char_char_consumer : public _Rope_char_consumer<_CharT> {
williamr@2:     private:
williamr@2: 	_CharT _M_pattern;
williamr@2:     public:
williamr@2: 	size_t _M_count;  // Number of nonmatching characters
williamr@2: 	_Rope_find_char_char_consumer(_CharT __p) 
williamr@2: 	  : _M_pattern(__p), _M_count(0) {}
williamr@2: 	~_Rope_find_char_char_consumer() {}
williamr@2: 	bool operator() (const _CharT* __leaf, size_t __n) {
williamr@2: 	    size_t __i;
williamr@2: 	    for (__i = 0; __i < __n; __i++) {
williamr@2: 		if (__leaf[__i] == _M_pattern) {
williamr@2: 		    _M_count += __i; return false;
williamr@2: 		}
williamr@2: 	    }
williamr@2: 	    _M_count += __n; return true;
williamr@2: 	}
williamr@2: };
williamr@2: 
williamr@2: #if !defined (_STLP_USE_NO_IOSTREAMS)	    
williamr@2: #if defined (_STLP_USE_NEW_IOSTREAMS)
williamr@2:   template<class _CharT, class _Traits>
williamr@2:   // Here _CharT is both the stream and rope character type.
williamr@2: #else
williamr@2:  template<class _CharT>
williamr@2:   // Here _CharT is the rope character type.  Unlike in the
williamr@2:   // above case, we somewhat handle the case in which it doesn't
williamr@2:   // match the stream character type, i.e. char.
williamr@2: #endif
williamr@2: class _Rope_insert_char_consumer : public _Rope_char_consumer<_CharT> {
williamr@2:     private:
williamr@2: #       if defined (_STLP_USE_NEW_IOSTREAMS)
williamr@2: 	  typedef basic_ostream<_CharT,_Traits> _Insert_ostream;
williamr@2: #	else
williamr@2:  	typedef ostream _Insert_ostream;
williamr@2: #	endif
williamr@2: 	_Insert_ostream& _M_o;
williamr@2:     public:
williamr@2: 	// _CharT* buffer;    // XXX not used
williamr@2: 	_Rope_insert_char_consumer(_Insert_ostream& __writer) 
williamr@2: 	  : _M_o(__writer) {};
williamr@2: #if defined(__MRC__)||(defined(__SC__) && !defined(__DMC__))		//*TY 05/23/2000 - added support for mpw compiler's trigger function approach to generate vtable
williamr@2:   ~_Rope_insert_char_consumer();		//*TY 05/23/2000 - 
williamr@2: #else		//*TY 05/23/2000 - 
williamr@2:   ~_Rope_insert_char_consumer() {}
williamr@2: #endif		//*TY 05/23/2000 - 
williamr@2: 		// Caller is presumed to own the ostream
williamr@2: 	bool operator() (const _CharT* __leaf, size_t __n);
williamr@2: 		// Returns true to continue traversal.
williamr@2: };
williamr@2: 	    
williamr@2: # if defined ( _STLP_USE_NEW_IOSTREAMS )
williamr@2: #  if defined(__MRC__)||(defined(__SC__) && !defined(__DMC__))		//*TY 05/23/2000 - added support for mpw compiler's trigger function approach to generate vtable
williamr@2:   template<class _CharT, class _Traits>
williamr@2:   _Rope_insert_char_consumer<_CharT, _Traits>::  ~_Rope_insert_char_consumer() {}
williamr@2: #  endif		//*TY 05/23/2000 - 
williamr@2: 
williamr@2:   template<class _CharT, class _Traits>
williamr@2:   bool _Rope_insert_char_consumer<_CharT, _Traits>::operator()
williamr@2: 					(const _CharT* __leaf, size_t __n)
williamr@2: {
williamr@2:     size_t __i;
williamr@2:     //  We assume that formatting is set up correctly for each element.
williamr@2:     for (__i = 0; __i < __n; __i++) _M_o.put(__leaf[__i]);
williamr@2:     return true;
williamr@2: }
williamr@2: # else
williamr@2: #  if defined(__MRC__)||(defined(__SC__) && !defined(__DMC__))		//*TY 05/23/2000 - added support for mpw compiler's trigger function approach to generate vtable
williamr@2:   template<class _CharT>
williamr@2:   _Rope_insert_char_consumer<_CharT>::  ~_Rope_insert_char_consumer() {}
williamr@2: #  endif		//*TY 05/23/2000 - 
williamr@2: 
williamr@2:   template<class _CharT>
williamr@2:   bool _Rope_insert_char_consumer<_CharT>::operator()
williamr@2: 					(const _CharT* __leaf, size_t __n)
williamr@2:   {
williamr@2:     size_t __i;
williamr@2:     //  We assume that formatting is set up correctly for each element.
williamr@2:     for (__i = 0; __i < __n; __i++) _M_o << __leaf[__i];
williamr@2:     return true;
williamr@2:   }
williamr@2: 
williamr@2: # if !defined (_STLP_NO_METHOD_SPECIALIZATION)
williamr@2: _STLP_TEMPLATE_NULL
williamr@2: inline bool 
williamr@2: _Rope_insert_char_consumer<char>::operator()
williamr@2: 					(const char* __leaf, size_t __n)
williamr@2: {
williamr@2:     size_t __i;
williamr@2:     for (__i = 0; __i < __n; __i++) _M_o.put(__leaf[__i]);
williamr@2:     return true;
williamr@2: }
williamr@2: 
williamr@2: #endif /* _STLP_METHOD_SPECIALIZATION */
williamr@2: #endif /* _STLP_USE_NEW_IOSTREAM */
williamr@2: #endif /* if !defined (_STLP_USE_NO_IOSTREAMS) */
williamr@2: 
williamr@2: template <class _CharT, class _Alloc>
williamr@2: bool rope<_CharT, _Alloc>::_S_apply_to_pieces(
williamr@2: 				_Rope_char_consumer<_CharT>& __c,
williamr@2: 				const _RopeRep* __r,
williamr@2: 				size_t __begin, size_t __end)
williamr@2: {
williamr@2:     if (0 == __r) return true;
williamr@2:     switch(__r->_M_tag) {
williamr@2: 	case _RopeRep::_S_concat:
williamr@2: 	    {
williamr@2: 		_RopeConcatenation* __conc = (_RopeConcatenation*)__r;
williamr@2: 		_RopeRep* __left =  __conc->_M_left;
williamr@2: 		size_t __left_len = __left->_M_size._M_data;
williamr@2: 		if (__begin < __left_len) {
williamr@2: 		    size_t __left_end = (min) (__left_len, __end);
williamr@2: 		    if (!_S_apply_to_pieces(__c, __left, __begin, __left_end))
williamr@2: 			return false;
williamr@2: 		}
williamr@2: 		if (__end > __left_len) {
williamr@2: 		    _RopeRep* __right =  __conc->_M_right;
williamr@2: 		    size_t __right_start = (max)(__left_len, __begin);
williamr@2: 		    if (!_S_apply_to_pieces(__c, __right,
williamr@2: 					 __right_start - __left_len,
williamr@2: 					 __end - __left_len)) {
williamr@2: 			return false;
williamr@2: 		    }
williamr@2: 		}
williamr@2: 	    }
williamr@2: 	    return true;
williamr@2: 	case _RopeRep::_S_leaf:
williamr@2: 	    {
williamr@2: 		_RopeLeaf* __l = (_RopeLeaf*)__r;
williamr@2: 		return __c.operator()(__l->_M_data + __begin, __end - __begin);
williamr@2: 	    }
williamr@2: 	case _RopeRep::_S_function:
williamr@2: 	case _RopeRep::_S_substringfn:
williamr@2: 	    {
williamr@2: 		_RopeFunction* __f = (_RopeFunction*)__r;
williamr@2: 		size_t __len = __end - __begin;
williamr@2: #ifdef __SYMBIAN32__
williamr@2: 		bool __result = false;
williamr@2: #else
williamr@2: 		bool __result;
williamr@2: #endif
williamr@2: 		_CharT* __buffer =
williamr@2: 		  (_CharT*)__sgi_alloc::allocate(__len * sizeof(_CharT));
williamr@2: 		_STLP_TRY {
williamr@2: 		  (*(__f->_M_fn))(__begin, __len, __buffer);
williamr@2: 		  __result = __c.operator()(__buffer, __len);
williamr@2:                   __sgi_alloc::deallocate(__buffer, __len * sizeof(_CharT));
williamr@2:                 }
williamr@2: 		_STLP_UNWIND((__sgi_alloc::deallocate(__buffer,
williamr@2: 						      __len * sizeof(_CharT))))
williamr@2: 		return __result;
williamr@2: 	    }
williamr@2: 	default:
williamr@2: 	    _STLP_ASSERT(false)
williamr@2: 	    /*NOTREACHED*/
williamr@2: 	    return false;
williamr@2:     }
williamr@2: }
williamr@2: 
williamr@2: template <class _CharT> inline bool _Rope_is_simple(_CharT*) { return false; }
williamr@2: inline bool _Rope_is_simple(char*) { return true; }
williamr@2: # ifdef _STLP_HAS_WCHAR_T
williamr@2: inline bool _Rope_is_simple(wchar_t*) { return true; }
williamr@2: # endif
williamr@2: 
williamr@2: #if !defined (_STLP_USE_NO_IOSTREAMS)
williamr@2: #if defined (_STLP_USE_NEW_IOSTREAMS)
williamr@2:   template<class _CharT, class _Traits>
williamr@2:   inline void _Rope_fill(basic_ostream<_CharT, _Traits>& __o, size_t __n)
williamr@2: #else
williamr@2: inline void _Rope_fill(ostream& __o, size_t __n)
williamr@2: #endif
williamr@2: {
williamr@2:     char __f = __o.fill();
williamr@2:     size_t __i;
williamr@2: 
williamr@2:     for (__i = 0; __i < __n; __i++) __o.put(__f);
williamr@2: }
williamr@2:     
williamr@2: #if defined (_STLP_USE_NEW_IOSTREAMS)
williamr@2:   template<class _CharT, class _Traits, class _Alloc>
williamr@2:   basic_ostream<_CharT, _Traits>& operator<<
williamr@2: 					(basic_ostream<_CharT, _Traits>& __o,
williamr@2: 					 const rope<_CharT, _Alloc>& __r)
williamr@2: # else
williamr@2: template<class _CharT, class _Alloc>
williamr@2: ostream& operator<< (ostream& __o, const rope<_CharT, _Alloc>& __r)
williamr@2: #endif
williamr@2: {
williamr@2:     size_t __w = __o.width();
williamr@2:     bool __left = bool(__o.flags() & ios::left);
williamr@2:     size_t __pad_len;
williamr@2:     size_t __rope_len = __r.size();
williamr@2: #   if defined (_STLP_USE_NEW_IOSTREAMS)
williamr@2:       _Rope_insert_char_consumer<_CharT, _Traits> __c(__o);
williamr@2: #   else
williamr@2:     _Rope_insert_char_consumer<_CharT> __c(__o);
williamr@2: #   endif
williamr@2:     bool __is_simple = _Rope_is_simple((_CharT*)0);
williamr@2:     
williamr@2:     if (__rope_len < __w) {
williamr@2: 	__pad_len = __w - __rope_len;
williamr@2:     } else {
williamr@2: 	__pad_len = 0;
williamr@2:     }
williamr@2:     if (!__is_simple) __o.width(__w/__rope_len);
williamr@2:     _STLP_TRY {
williamr@2:       if (__is_simple && !__left && __pad_len > 0) {
williamr@2: 	_Rope_fill(__o, __pad_len);
williamr@2:       }
williamr@2:       __r.apply_to_pieces(0, __r.size(), __c);
williamr@2:       if (__is_simple && __left && __pad_len > 0) {
williamr@2: 	_Rope_fill(__o, __pad_len);
williamr@2:       }
williamr@2:       if (!__is_simple)
williamr@2:         __o.width(__w);
williamr@2:     }
williamr@2:     _STLP_UNWIND(if (!__is_simple) __o.width(__w))
williamr@2:     return __o;
williamr@2: }
williamr@2: 
williamr@2: #endif /* NO_IOSTREAMS */
williamr@2: 
williamr@2: template <class _CharT, class _Alloc>
williamr@2: _CharT*
williamr@2: rope<_CharT,_Alloc>::_S_flatten(_RopeRep* __r,
williamr@2: 				 size_t __start, size_t __len,
williamr@2: 				 _CharT* __buffer)
williamr@2: {
williamr@2:     _Rope_flatten_char_consumer<_CharT> __c(__buffer);
williamr@2:     _S_apply_to_pieces(__c, __r, __start, __start + __len);
williamr@2:     return(__buffer + __len);
williamr@2: }
williamr@2: 
williamr@2: template <class _CharT, class _Alloc>
williamr@2: size_t
williamr@2: rope<_CharT,_Alloc>::find(_CharT __pattern, size_t __start) const
williamr@2: {
williamr@2:     _Rope_find_char_char_consumer<_CharT> __c(__pattern);
williamr@2:     _S_apply_to_pieces(__c, _M_tree_ptr._M_data, __start, size());
williamr@2:     size_type __result_pos = __start + __c._M_count;
williamr@2: #   ifndef _STLP_OLD_ROPE_SEMANTICS
williamr@2: 	if (__result_pos == size()) __result_pos = npos;
williamr@2: #   endif
williamr@2:     return __result_pos;
williamr@2: }
williamr@2: 
williamr@2: template <class _CharT, class _Alloc>
williamr@2: _CharT*
williamr@2: rope<_CharT,_Alloc>::_S_flatten(_Rope_RopeRep<_CharT, _Alloc>* __r, _CharT* __buffer)
williamr@2: {
williamr@2:     if (0 == __r) return __buffer;
williamr@2:     switch(__r->_M_tag) {
williamr@2: 	case _RopeRep::_S_concat:
williamr@2: 	    {
williamr@2: 		_RopeConcatenation* __c = (_RopeConcatenation*)__r;
williamr@2: 		_RopeRep* __left = __c->_M_left;
williamr@2: 		_RopeRep* __right = __c->_M_right;
williamr@2: 		_CharT* __rest = _S_flatten(__left, __buffer);
williamr@2: 		return _S_flatten(__right, __rest);
williamr@2: 	    }
williamr@2: 	case _RopeRep::_S_leaf:
williamr@2: 	    {
williamr@2: 		_RopeLeaf* __l = (_RopeLeaf*)__r;
williamr@2: 		return copy_n(__l->_M_data, __l->_M_size._M_data, __buffer).second;
williamr@2: 	    }
williamr@2: 	case _RopeRep::_S_function:
williamr@2: 	case _RopeRep::_S_substringfn:
williamr@2: 	    // We dont yet do anything with substring nodes.
williamr@2: 	    // This needs to be fixed before ropefiles will work well.
williamr@2: 	    {
williamr@2: 		_RopeFunction* __f = (_RopeFunction*)__r;
williamr@2: 		(*(__f->_M_fn))(0, __f->_M_size._M_data, __buffer);
williamr@2: 		return __buffer + __f->_M_size._M_data;
williamr@2: 	    }
williamr@2: 	default:
williamr@2: 	    _STLP_ASSERT(false)
williamr@2: 	    /*NOTREACHED*/
williamr@2: 	    return 0;
williamr@2:     }
williamr@2: }
williamr@2: 
williamr@2: 
williamr@2: // This needs work for _CharT != char
williamr@2: template <class _CharT, class _Alloc>
williamr@2: void
williamr@2: rope<_CharT,_Alloc>::_S_dump(_RopeRep* __r, int __indent)
williamr@2: {
williamr@2:     for (int __i = 0; __i < __indent; __i++) putchar(' ');
williamr@2:     if (0 == __r) {
williamr@2:       printf("NULL\n"); return;
williamr@2:     }
williamr@2:     if (_RopeRep::_S_concat == __r->_M_tag) {
williamr@2: 	_RopeConcatenation* __c = (_RopeConcatenation*)__r;
williamr@2: 	_RopeRep* __left = __c->_M_left;
williamr@2: 	_RopeRep* __right = __c->_M_right;
williamr@2: 
williamr@2: #       ifdef __GC
williamr@2: 	  printf("Concatenation %p (depth = %d, len = %ld, %s balanced)\n",
williamr@2: 	    __r, __r->_M_depth, __r->_M_size._M_data, __r->_M_is_balanced? "" : "not");
williamr@2: #       else
williamr@2: 	  printf("Concatenation %p (rc = %ld, depth = %d, "
williamr@2: 	           "len = %ld, %s balanced)\n",
williamr@2: 		 __r, __r->_M_ref_count, __r->_M_depth, __r->_M_size._M_data,
williamr@2: 		 __r->_M_is_balanced? "" : "not");
williamr@2: #       endif
williamr@2: 	_S_dump(__left, __indent + 2);
williamr@2: 	_S_dump(__right, __indent + 2);
williamr@2: 	return;
williamr@2:     } else {
williamr@2: 	const char* __kind;
williamr@2: 
williamr@2: 	switch (__r->_M_tag) {
williamr@2: 	    case _RopeRep::_S_leaf:
williamr@2: 		__kind = "Leaf";
williamr@2: 		break;
williamr@2: 	    case _RopeRep::_S_function:
williamr@2: 		__kind = "Function";
williamr@2: 		break;
williamr@2: 	    case _RopeRep::_S_substringfn:
williamr@2: 		__kind = "Function representing substring";
williamr@2: 		break;
williamr@2: 	    default:
williamr@2: 		__kind = "(corrupted kind field!)";
williamr@2: 	}
williamr@2: #       ifdef __GC
williamr@2: 	  printf("%s %p (depth = %d, len = %ld) ",
williamr@2: 		 __kind, __r, __r->_M_depth, __r->_M_size._M_data);
williamr@2: #       else
williamr@2: 	  printf("%s %p (rc = %ld, depth = %d, len = %ld) ",
williamr@2: 		 __kind, __r, __r->_M_ref_count, __r->_M_depth, __r->_M_size._M_data);
williamr@2: #       endif
williamr@2: 	if (_S_is_one_byte_char_type((_CharT*)0)) {
williamr@2: 	    const int __max_len = 40;
williamr@2: 	    _Self_destruct_ptr __prefix(_S_substring(__r, 0, __max_len));
williamr@2: 	    _CharT __buffer[__max_len + 1];
williamr@2: 	    bool __too_big = __r->_M_size._M_data > __prefix->_M_size._M_data;
williamr@2: 
williamr@2: 	    _S_flatten(__prefix, __buffer);
williamr@2: 	    __buffer[__prefix->_M_size._M_data] = _S_eos((_CharT*)0); 
williamr@2: 	    printf("%s%s\n", 
williamr@2: 	           (char*)__buffer, __too_big? "...\n" : "\n");
williamr@2: 	} else {
williamr@2: 	    printf("\n");
williamr@2: 	}
williamr@2:     }
williamr@2: }
williamr@2: 
williamr@2: # define __ROPE_TABLE_BODY  = { \
williamr@2: /* 0 */1, /* 1 */2, /* 2 */3, /* 3 */5, /* 4 */8, /* 5 */13, /* 6 */21,         \
williamr@2: /* 7 */34, /* 8 */55, /* 9 */89, /* 10 */144, /* 11 */233, /* 12 */377,         \
williamr@2: /* 13 */610, /* 14 */987, /* 15 */1597, /* 16 */2584, /* 17 */4181,             \
williamr@2: /* 18 */6765ul, /* 19 */10946ul, /* 20 */17711ul, /* 21 */28657ul, /* 22 */46368ul,   \
williamr@2: /* 23 */75025ul, /* 24 */121393ul, /* 25 */196418ul, /* 26 */317811ul,                \
williamr@2: /* 27 */514229ul, /* 28 */832040ul, /* 29 */1346269ul, /* 30 */2178309ul,             \
williamr@2: /* 31 */3524578ul, /* 32 */5702887ul, /* 33 */9227465ul, /* 34 */14930352ul,          \
williamr@2: /* 35 */24157817ul, /* 36 */39088169ul, /* 37 */63245986ul, /* 38 */102334155ul,      \
williamr@2: /* 39 */165580141ul, /* 40 */267914296ul, /* 41 */433494437ul,                        \
williamr@2: /* 42 */701408733ul, /* 43 */1134903170ul, /* 44 */1836311903ul,                      \
williamr@2: /* 45 */2971215073ul }
williamr@2: 
williamr@2: # if ( _STLP_STATIC_TEMPLATE_DATA > 0 )
williamr@2: template <class _CharT, class _Alloc>
williamr@2: const unsigned long
williamr@2: rope<_CharT,_Alloc>::_S_min_len[__ROPE_DEPTH_SIZE] __ROPE_TABLE_BODY ;
williamr@2: # else 
williamr@2: __DECLARE_INSTANCE(const unsigned long, 
williamr@2:                    crope::_S_min_len[__ROPE_DEPTH_SIZE],
williamr@2:                    __ROPE_TABLE_BODY);
williamr@2: #  ifndef _STLP_NO_WCHAR_T
williamr@2: __DECLARE_INSTANCE(const unsigned long, 
williamr@2:                    wrope::_S_min_len[__ROPE_DEPTH_SIZE],
williamr@2:                    __ROPE_TABLE_BODY);
williamr@2: #  endif
williamr@2: # endif
williamr@2: # undef __ROPE_DEPTH_SIZE
williamr@2: # undef __ROPE_MAX_DEPTH
williamr@2: # undef __ROPE_TABLE_BODY
williamr@2: 
williamr@2: // These are Fibonacci numbers < 2**32.
williamr@2: 
williamr@2: template <class _CharT, class _Alloc>
williamr@2: __RopeRep__*
williamr@2: rope<_CharT,_Alloc>::_S_balance(_RopeRep* __r)
williamr@2: {
williamr@2:     _RopeRep* __forest[_RopeRep::_S_max_rope_depth + 1];
williamr@2:     _RopeRep* __result = 0;
williamr@2:     int __i;
williamr@2:     // Invariant:
williamr@2:     // The concatenation of forest in descending order is equal to __r.
williamr@2:     // __forest[__i]._M_size._M_data >= _S_min_len[__i]
williamr@2:     // __forest[__i]._M_depth = __i
williamr@2:     // References from forest are included in refcount.
williamr@2: 
williamr@2:     for (__i = 0; __i <= _RopeRep::_S_max_rope_depth; ++__i) 
williamr@2:       __forest[__i] = 0;
williamr@2:     _STLP_TRY {
williamr@2:       _S_add_to_forest(__r, __forest);
williamr@2:       for (__i = 0; __i <= _RopeRep::_S_max_rope_depth; ++__i) 
williamr@2:         if (0 != __forest[__i]) {
williamr@2: #	ifndef __GC
williamr@2: 	  _Self_destruct_ptr __old(__result);
williamr@2: #	endif
williamr@2: 	  __result = _S_concat_rep(__forest[__i], __result);
williamr@2: 	__forest[__i]->_M_unref_nonnil();
williamr@2: #	if !defined(__GC) && defined(_STLP_USE_EXCEPTIONS)
williamr@2: 	  __forest[__i] = 0;
williamr@2: #	endif
williamr@2:       }
williamr@2:     }
williamr@2:     _STLP_UNWIND(for(__i = 0; __i <= _RopeRep::_S_max_rope_depth; __i++)
williamr@2: 		 _S_unref(__forest[__i]))
williamr@2:     if (__result->_M_depth > _RopeRep::_S_max_rope_depth) {
williamr@2: 	__stl_throw_range_error("rope too long");
williamr@2:     }
williamr@2:     return(__result);
williamr@2: }
williamr@2: 
williamr@2: 
williamr@2: template <class _CharT, class _Alloc>
williamr@2: void
williamr@2: rope<_CharT,_Alloc>::_S_add_to_forest(_RopeRep* __r, _RopeRep** __forest)
williamr@2: {
williamr@2:     if (__r -> _M_is_balanced) {
williamr@2: 	_S_add_leaf_to_forest(__r, __forest);
williamr@2: 	return;
williamr@2:     }
williamr@2:     _STLP_ASSERT(__r->_M_tag == _RopeRep::_S_concat)
williamr@2:     {
williamr@2: 	_RopeConcatenation* __c = (_RopeConcatenation*)__r;
williamr@2: 
williamr@2: 	_S_add_to_forest(__c->_M_left, __forest);
williamr@2: 	_S_add_to_forest(__c->_M_right, __forest);
williamr@2:     }
williamr@2: }
williamr@2: 
williamr@2: 
williamr@2: template <class _CharT, class _Alloc>
williamr@2: void
williamr@2: rope<_CharT,_Alloc>::_S_add_leaf_to_forest(_RopeRep* __r, _RopeRep** __forest)
williamr@2: {
williamr@2:     _RopeRep* __insertee;   		// included in refcount
williamr@2:     _RopeRep* __too_tiny = 0;    	// included in refcount
williamr@2:     int __i;  				// forest[0..__i-1] is empty
williamr@2:     size_t __s = __r->_M_size._M_data;
williamr@2: 
williamr@2:     for (__i = 0; __s >= _S_min_len[__i+1]/* not this bucket */; ++__i) {
williamr@2: 	if (0 != __forest[__i]) {
williamr@2: #	    ifndef __GC
williamr@2: 	      _Self_destruct_ptr __old(__too_tiny);
williamr@2: #	    endif
williamr@2: 	    __too_tiny = _S_concat_and_set_balanced(__forest[__i], __too_tiny);
williamr@2: 	    __forest[__i]->_M_unref_nonnil();
williamr@2: 	    __forest[__i] = 0;
williamr@2: 	}
williamr@2:     }
williamr@2:     {
williamr@2: #	ifndef __GC
williamr@2: 	  _Self_destruct_ptr __old(__too_tiny);
williamr@2: #	endif
williamr@2: 	__insertee = _S_concat_and_set_balanced(__too_tiny, __r);
williamr@2:     }
williamr@2:     // Too_tiny dead, and no longer included in refcount.
williamr@2:     // Insertee is live and included.
williamr@2:     _STLP_ASSERT(_S_is_almost_balanced(__insertee))
williamr@2:     _STLP_ASSERT(__insertee->_M_depth <= __r->_M_depth + 1)
williamr@2:     for (;; ++__i) {
williamr@2: 	if (0 != __forest[__i]) {
williamr@2: #	    ifndef __GC
williamr@2: 	      _Self_destruct_ptr __old(__insertee);
williamr@2: #	    endif
williamr@2: 	    __insertee = _S_concat_and_set_balanced(__forest[__i], __insertee);
williamr@2: 	    __forest[__i]->_M_unref_nonnil();
williamr@2: 	    __forest[__i] = 0;
williamr@2: 	    _STLP_ASSERT(_S_is_almost_balanced(__insertee))
williamr@2: 	}
williamr@2: 	_STLP_ASSERT(_S_min_len[__i] <= __insertee->_M_size._M_data)
williamr@2: 	_STLP_ASSERT(__forest[__i] == 0)
williamr@2: 	if (__i == _RopeRep::_S_max_rope_depth || 
williamr@2: 	      __insertee->_M_size._M_data < _S_min_len[__i+1]) {
williamr@2: 	    __forest[__i] = __insertee;
williamr@2: 	    // refcount is OK since __insertee is now dead.
williamr@2: 	    return;
williamr@2: 	}
williamr@2:     }
williamr@2: }
williamr@2: 
williamr@2: template <class _CharT, class _Alloc>
williamr@2: _CharT
williamr@2: rope<_CharT,_Alloc>::_S_fetch(_RopeRep* __r, size_type __i)
williamr@2: {
williamr@2:     __GC_CONST _CharT* __cstr = __r->_M_c_string;
williamr@2: 
williamr@2:     _STLP_ASSERT(__i < __r->_M_size._M_data)
williamr@2:     if (0 != __cstr) return __cstr[__i]; 
williamr@2:     for(;;) {
williamr@2:       switch(__r->_M_tag) {
williamr@2: 	case _RopeRep::_S_concat:
williamr@2: 	    {
williamr@2: 		_RopeConcatenation* __c = (_RopeConcatenation*)__r;
williamr@2: 		_RopeRep* __left = __c->_M_left;
williamr@2: 		size_t __left_len = __left->_M_size._M_data;
williamr@2: 
williamr@2: 		if (__i >= __left_len) {
williamr@2: 		    __i -= __left_len;
williamr@2: 		    __r = __c->_M_right;
williamr@2: 		} else {
williamr@2: 		    __r = __left;
williamr@2: 		}
williamr@2: 	    }
williamr@2: 	    break;
williamr@2: 	case _RopeRep::_S_leaf:
williamr@2: 	    {
williamr@2: 		_RopeLeaf* __l = (_RopeLeaf*)__r;
williamr@2: 		return __l->_M_data[__i];
williamr@2: 	    }
williamr@2: 	case _RopeRep::_S_function:
williamr@2: 	case _RopeRep::_S_substringfn:
williamr@2: 	    {
williamr@2: 		_RopeFunction* __f = (_RopeFunction*)__r;
williamr@2: 		_CharT __result;
williamr@2: 
williamr@2: 		(*(__f->_M_fn))(__i, 1, &__result);
williamr@2: 		return __result;
williamr@2: 	    }
williamr@2:       }
williamr@2:     }
williamr@2: #if defined(_STLP_NEED_UNREACHABLE_RETURN)
williamr@2:     return 0;
williamr@2: #endif
williamr@2: }
williamr@2: 
williamr@2: # ifndef __GC
williamr@2: // Return a uniquely referenced character slot for the given
williamr@2: // position, or 0 if that's not possible.
williamr@2: template <class _CharT, class _Alloc>
williamr@2: _CharT*
williamr@2: rope<_CharT,_Alloc>::_S_fetch_ptr(_RopeRep* __r, size_type __i)
williamr@2: {
williamr@2:     _RopeRep* __clrstack[_RopeRep::_S_max_rope_depth];
williamr@2:     size_t __csptr = 0;
williamr@2: 
williamr@2:     for(;;) {
williamr@2:       if (__r->_M_ref_count > 1) return 0;
williamr@2:       switch(__r->_M_tag) {
williamr@2: 	case _RopeRep::_S_concat:
williamr@2: 	    {
williamr@2: 		_RopeConcatenation* __c = (_RopeConcatenation*)__r;
williamr@2: 		_RopeRep* __left = __c->_M_left;
williamr@2: 		size_t __left_len = __left->_M_size._M_data;
williamr@2: 
williamr@2: 		if (__c->_M_c_string != 0) __clrstack[__csptr++] = __c;
williamr@2: 		if (__i >= __left_len) {
williamr@2: 		    __i -= __left_len;
williamr@2: 		    __r = __c->_M_right;
williamr@2: 		} else {
williamr@2: 		    __r = __left;
williamr@2: 		}
williamr@2: 	    }
williamr@2: 	    break;
williamr@2: 	case _RopeRep::_S_leaf:
williamr@2: 	    {
williamr@2: 		_RopeLeaf* __l = (_RopeLeaf*)__r;
williamr@2: 		if (__l->_M_c_string != __l->_M_data && __l->_M_c_string != 0)
williamr@2: 		    __clrstack[__csptr++] = __l;
williamr@2: 		while (__csptr > 0) {
williamr@2: 		    -- __csptr;
williamr@2: 		    _RopeRep* __d = __clrstack[__csptr];
williamr@2: 		    __d->_M_free_c_string();
williamr@2: 		    __d->_M_c_string = 0;
williamr@2: 		}
williamr@2: 		return __l->_M_data + __i;
williamr@2: 	    }
williamr@2: 	case _RopeRep::_S_function:
williamr@2: 	case _RopeRep::_S_substringfn:
williamr@2: 	    return 0;
williamr@2:       }
williamr@2:     }
williamr@2: #if defined(_STLP_NEED_UNREACHABLE_RETURN)
williamr@2:     return 0;
williamr@2: #endif
williamr@2: 
williamr@2: }
williamr@2: # endif /* __GC */
williamr@2: 
williamr@2: // The following could be implemented trivially using
williamr@2: // lexicographical_compare_3way.
williamr@2: // We do a little more work to avoid dealing with rope iterators for
williamr@2: // flat strings.
williamr@2: template <class _CharT, class _Alloc>
williamr@2: int
williamr@2: rope<_CharT,_Alloc>::_S_compare (const _RopeRep* __left, 
williamr@2:                                  const _RopeRep* __right)
williamr@2: {
williamr@2:     size_t __left_len;
williamr@2:     size_t __right_len;
williamr@2: 
williamr@2:     if (0 == __right) return 0 != __left;
williamr@2:     if (0 == __left) return -1;
williamr@2:     __left_len = __left->_M_size._M_data;
williamr@2:     __right_len = __right->_M_size._M_data;
williamr@2:     if (_RopeRep::_S_leaf == __left->_M_tag) {
williamr@2: 	_RopeLeaf* __l = (_RopeLeaf*) __left;
williamr@2: 	if (_RopeRep::_S_leaf == __right->_M_tag) {
williamr@2: 	    _RopeLeaf* __r = (_RopeLeaf*) __right;
williamr@2: 	    return lexicographical_compare_3way(
williamr@2: 			__l->_M_data, __l->_M_data + __left_len,
williamr@2: 			__r->_M_data, __r->_M_data + __right_len);
williamr@2: 	} else {
williamr@2: 	    const_iterator __rstart(__right, 0);
williamr@2: 	    const_iterator __rend(__right, __right_len);
williamr@2: 	    return lexicographical_compare_3way(
williamr@2: 			__l->_M_data, __l->_M_data + __left_len,
williamr@2: 			__rstart, __rend);
williamr@2: 	}
williamr@2:     } else {
williamr@2: 	const_iterator __lstart(__left, 0);
williamr@2: 	const_iterator __lend(__left, __left_len);
williamr@2: 	if (_RopeRep::_S_leaf == __right->_M_tag) {
williamr@2: 	    _RopeLeaf* __r = (_RopeLeaf*) __right;
williamr@2: 	    return lexicographical_compare_3way(
williamr@2: 				   __lstart, __lend,
williamr@2: 				   __r->_M_data, __r->_M_data + __right_len);
williamr@2: 	} else {
williamr@2: 	    const_iterator __rstart(__right, 0);
williamr@2: 	    const_iterator __rend(__right, __right_len);
williamr@2: 	    return lexicographical_compare_3way(
williamr@2: 				   __lstart, __lend,
williamr@2: 				   __rstart, __rend);
williamr@2: 	}
williamr@2:     }
williamr@2: }
williamr@2: 
williamr@2: // Assignment to reference proxies.
williamr@2: template <class _CharT, class _Alloc>
williamr@2: _Rope_char_ref_proxy<_CharT, _Alloc>&
williamr@2: _Rope_char_ref_proxy<_CharT, _Alloc>::operator= (_CharT __c) {
williamr@2:     _RopeRep* __old = _M_root->_M_tree_ptr._M_data;
williamr@2: #   ifndef __GC
williamr@2: 	// First check for the case in which everything is uniquely
williamr@2: 	// referenced.  In that case we can do this destructively.
williamr@2: 	_CharT* __ptr = _My_rope::_S_fetch_ptr(__old, _M_pos);
williamr@2: 	if (0 != __ptr) {
williamr@2: 	    *__ptr = __c;
williamr@2: 	    return *this;
williamr@2: 	}
williamr@2: #   endif
williamr@2:     _Self_destruct_ptr __left(
williamr@2:       _My_rope::_S_substring(__old, 0, _M_pos));
williamr@2:     _Self_destruct_ptr __right(
williamr@2:       _My_rope::_S_substring(__old, _M_pos+1, __old->_M_size._M_data));
williamr@2:     _Self_destruct_ptr __result_left(
williamr@2:       _My_rope::_S_destr_concat_char_iter(__left, &__c, 1));
williamr@2: 
williamr@2: #   ifndef __GC
williamr@2:       _STLP_ASSERT(__left == __result_left || 1 == __result_left->_M_ref_count)
williamr@2: #   endif
williamr@2:     _RopeRep* __result =
williamr@2:       _My_rope::_S_concat_rep(__result_left, __right);
williamr@2: #   ifndef __GC
williamr@2:       _STLP_ASSERT(1 <= __result->_M_ref_count)
williamr@2:       _RopeRep::_S_unref(__old);
williamr@2: #   endif
williamr@2:     _M_root->_M_tree_ptr._M_data = __result;
williamr@2:     return *this;
williamr@2: }
williamr@2: 
williamr@2: template <class _CharT, class _Alloc>
williamr@2: _Rope_char_ptr_proxy<_CharT, _Alloc>
williamr@2: _Rope_char_ref_proxy<_CharT, _Alloc>::operator& () const {
williamr@2:     return _Rope_char_ptr_proxy<_CharT, _Alloc>(*this);
williamr@2: }
williamr@2: 
williamr@2: # if ( _STLP_STATIC_TEMPLATE_DATA > 0 )
williamr@2: template<class _CharT, class _Alloc>
williamr@2: _CharT rope<_CharT,_Alloc>::_S_empty_c_str[1] = { _CharT() };
williamr@2: # else
williamr@2: __DECLARE_INSTANCE(char, crope::_S_empty_c_str[1], ={0});
williamr@2: # ifdef _STLP_HAS_WCHAR_T
williamr@2: __DECLARE_INSTANCE(wchar_t, wrope::_S_empty_c_str[1], ={0});
williamr@2: # endif /* _STLP_HAS_WCHAR_T */
williamr@2: # endif /* _STLP_STATIC_TEMPLATE_DATA */
williamr@2: // # endif
williamr@2: 
williamr@2: template<class _CharT, class _Alloc>
williamr@2: const _CharT* rope<_CharT,_Alloc>::c_str() const {
williamr@2:     if (0 == _M_tree_ptr._M_data) {
williamr@2:         _S_empty_c_str[0] = _S_eos((_CharT*)0);  // Possibly redundant,
williamr@2: 					     // but probably fast.
williamr@2:         return _S_empty_c_str;
williamr@2:     }
williamr@2:     __GC_CONST _CharT* __old_c_string = _M_tree_ptr._M_data->_M_c_string;
williamr@2:     if (0 != __old_c_string) return(__old_c_string);
williamr@2:     size_t __s = size();
williamr@2:    _CharT* __result = _STLP_CREATE_ALLOCATOR(allocator_type,(const allocator_type&)_M_tree_ptr, _CharT).allocate(__s + 1);
williamr@2:     _S_flatten(_M_tree_ptr._M_data, __result);
williamr@2:     __result[__s] = _S_eos((_CharT*)0);
williamr@2: #   ifdef __GC
williamr@2: 	_M_tree_ptr._M_data->_M_c_string = __result;
williamr@2: #   else
williamr@2:       if ((__old_c_string = (__GC_CONST _CharT*)
williamr@2: 	   _Atomic_swap((__stl_atomic_t *)(&(_M_tree_ptr._M_data->_M_c_string)),
williamr@2: 			(__stl_atomic_t)__result)) != 0) {
williamr@2: 	// It must have been added in the interim.  Hence it had to have been
williamr@2: 	// separately allocated.  Deallocate the old copy, since we just
williamr@2: 	// replaced it.
williamr@2: 	_STLP_STD::_Destroy(__old_c_string, __old_c_string + __s + 1);
williamr@2:       _STLP_CREATE_ALLOCATOR(allocator_type,(const allocator_type&)_M_tree_ptr, _CharT).deallocate(__old_c_string, __s + 1);
williamr@2:       }
williamr@2: #   endif
williamr@2:     return(__result);
williamr@2: }
williamr@2: 
williamr@2: template<class _CharT, class _Alloc>
williamr@2: const _CharT* rope<_CharT,_Alloc>::replace_with_c_str() {
williamr@2:     if (0 == _M_tree_ptr._M_data) {
williamr@2:         _S_empty_c_str[0] = _S_eos((_CharT*)0);
williamr@2:         return _S_empty_c_str;
williamr@2:     }
williamr@2:     __GC_CONST _CharT* __old_c_string = _M_tree_ptr._M_data->_M_c_string;
williamr@2:     if (_RopeRep::_S_leaf == _M_tree_ptr._M_data->_M_tag && 0 != __old_c_string) {
williamr@2: 	return(__old_c_string);
williamr@2:     }
williamr@2:     size_t __s = size();
williamr@2:     _CharT* __result = _M_tree_ptr.allocate(_S_rounded_up_size(__s));
williamr@2:     _S_flatten(_M_tree_ptr._M_data, __result);
williamr@2:     __result[__s] = _S_eos((_CharT*)0);
williamr@2:     _M_tree_ptr._M_data->_M_unref_nonnil();
williamr@2:     _M_tree_ptr._M_data = _S_new_RopeLeaf(__result, __s, get_allocator());
williamr@2:     return(__result);
williamr@2: }
williamr@2: 
williamr@2: // Algorithm specializations.  More should be added.
williamr@2: 
williamr@2: #ifndef _STLP_MSVC
williamr@2: // I couldn't get this to work with VC++
williamr@2: template<class _CharT,class _Alloc>
williamr@2: void
williamr@2: _Rope_rotate(_Rope_iterator<_CharT,_Alloc> __first,
williamr@2:               _Rope_iterator<_CharT,_Alloc> __middle,
williamr@2:               _Rope_iterator<_CharT,_Alloc> __last)
williamr@2: {
williamr@2:     _STLP_ASSERT(__first.container() == __middle.container()
williamr@2:                  && __middle.container() == __last.container())
williamr@2:     rope<_CharT,_Alloc>& __r(__first.container());
williamr@2:     rope<_CharT,_Alloc> __prefix = __r.substr(0, __first.index());
williamr@2:     rope<_CharT,_Alloc> __suffix = 
williamr@2:       __r.substr(__last.index(), __r.size() - __last.index());
williamr@2:     rope<_CharT,_Alloc> __part1 = 
williamr@2:       __r.substr(__middle.index(), __last.index() - __middle.index());
williamr@2:     rope<_CharT,_Alloc> __part2 = 
williamr@2:       __r.substr(__first.index(), __middle.index() - __first.index());
williamr@2:     __r = __prefix;
williamr@2:     __r += __part1;
williamr@2:     __r += __part2;
williamr@2:     __r += __suffix;
williamr@2: }
williamr@2: 
williamr@2: 
williamr@2: # if 0
williamr@2: // Probably not useful for several reasons:
williamr@2: // - for SGIs 7.1 compiler and probably some others,
williamr@2: //   this forces lots of rope<wchar_t, ...> instantiations, creating a
williamr@2: //   code bloat and compile time problem.  (Fixed in 7.2.)
williamr@2: // - wchar_t is 4 bytes wide on most UNIX platforms, making it unattractive
williamr@2: //   for unicode strings.  Unsigned short may be a better character
williamr@2: //   type.
williamr@2: inline void rotate(
williamr@2: 		_Rope_iterator<wchar_t,_STLP_DEFAULT_ALLOCATOR(char) > __first,
williamr@2:                 _Rope_iterator<wchar_t,_STLP_DEFAULT_ALLOCATOR(char) > __middle,
williamr@2:                 _Rope_iterator<wchar_t,_STLP_DEFAULT_ALLOCATOR(char) > __last) {
williamr@2:     _Rope_rotate(__first, __middle, __last);
williamr@2: }
williamr@2: # endif
williamr@2: #endif /* _STLP_MSVC */
williamr@2: 
williamr@2: #   undef __RopeLeaf__ 
williamr@2: #   undef __RopeRep__ 
williamr@2: #   undef __RopeLeaf 
williamr@2: #   undef __RopeRep 
williamr@2: #   undef size_type
williamr@2: 
williamr@2: _STLP_END_NAMESPACE
williamr@2: 
williamr@2: # endif /* ROPEIMPL_H */
williamr@2: 
williamr@2: // Local Variables:
williamr@2: // mode:C++
williamr@2: // End: