1 // SGI's rope class implementation -*- C++ -*-
3 // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
4 // Free Software Foundation, Inc.
6 // This file is part of the GNU ISO C++ Library. This library is free
7 // software; you can redistribute it and/or modify it under the
8 // terms of the GNU General Public License as published by the
9 // Free Software Foundation; either version 3, or (at your option)
12 // This library is distributed in the hope that it will be useful,
13 // but WITHOUT ANY WARRANTY; without even the implied warranty of
14 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 // GNU General Public License for more details.
17 // Under Section 7 of GPL version 3, you are granted additional
18 // permissions described in the GCC Runtime Library Exception, version
19 // 3.1, as published by the Free Software Foundation.
21 // You should have received a copy of the GNU General Public License and
22 // a copy of the GCC Runtime Library Exception along with this program;
23 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
24 // <http://www.gnu.org/licenses/>.
28 * Silicon Graphics Computer Systems, Inc.
30 * Permission to use, copy, modify, distribute and sell this software
31 * and its documentation for any purpose is hereby granted without fee,
32 * provided that the above copyright notice appear in all copies and
33 * that both that copyright notice and this permission notice appear
34 * in supporting documentation. Silicon Graphics makes no
35 * representations about the suitability of this software for any
36 * purpose. It is provided "as is" without express or implied warranty.
40 * This is an internal header file, included by other library headers.
41 * Do not attempt to use it directly. @headername{ext/rope}
46 #include <bits/functexcept.h>
48 #include <ext/algorithm> // For copy_n and lexicographical_compare_3way
49 #include <ext/memory> // For uninitialized_copy_n
50 #include <ext/numeric> // For power
52 namespace __gnu_cxx _GLIBCXX_VISIBILITY(default)
54 _GLIBCXX_BEGIN_NAMESPACE_VERSION
58 using std::basic_ostream;
59 using std::__throw_length_error;
61 using std::uninitialized_fill_n;
63 // Set buf_start, buf_end, and buf_ptr appropriately, filling tmp_buf
64 // if necessary. Assumes _M_path_end[leaf_index] and leaf_pos are correct.
65 // Results in a valid buf_ptr if the iterator can be legitimately
67 template <class _CharT, class _Alloc>
69 _Rope_iterator_base<_CharT, _Alloc>::
70 _S_setbuf(_Rope_iterator_base<_CharT, _Alloc>& __x)
72 const _RopeRep* __leaf = __x._M_path_end[__x._M_leaf_index];
73 size_t __leaf_pos = __x._M_leaf_pos;
74 size_t __pos = __x._M_current_pos;
76 switch(__leaf->_M_tag)
78 case __detail::_S_leaf:
79 __x._M_buf_start = ((_Rope_RopeLeaf<_CharT, _Alloc>*)__leaf)->_M_data;
80 __x._M_buf_ptr = __x._M_buf_start + (__pos - __leaf_pos);
81 __x._M_buf_end = __x._M_buf_start + __leaf->_M_size;
83 case __detail::_S_function:
84 case __detail::_S_substringfn:
86 size_t __len = _S_iterator_buf_len;
87 size_t __buf_start_pos = __leaf_pos;
88 size_t __leaf_end = __leaf_pos + __leaf->_M_size;
89 char_producer<_CharT>* __fn = ((_Rope_RopeFunction<_CharT,
90 _Alloc>*)__leaf)->_M_fn;
91 if (__buf_start_pos + __len <= __pos)
93 __buf_start_pos = __pos - __len / 4;
94 if (__buf_start_pos + __len > __leaf_end)
95 __buf_start_pos = __leaf_end - __len;
97 if (__buf_start_pos + __len > __leaf_end)
98 __len = __leaf_end - __buf_start_pos;
99 (*__fn)(__buf_start_pos - __leaf_pos, __len, __x._M_tmp_buf);
100 __x._M_buf_ptr = __x._M_tmp_buf + (__pos - __buf_start_pos);
101 __x._M_buf_start = __x._M_tmp_buf;
102 __x._M_buf_end = __x._M_tmp_buf + __len;
110 // Set path and buffer inside a rope iterator. We assume that
111 // pos and root are already set.
112 template <class _CharT, class _Alloc>
114 _Rope_iterator_base<_CharT, _Alloc>::
115 _S_setcache(_Rope_iterator_base<_CharT, _Alloc>& __x)
117 const _RopeRep* __path[int(__detail::_S_max_rope_depth) + 1];
118 const _RopeRep* __curr_rope;
119 int __curr_depth = -1; /* index into path */
120 size_t __curr_start_pos = 0;
121 size_t __pos = __x._M_current_pos;
122 unsigned char __dirns = 0; // Bit vector marking right turns in the path
124 if (__pos >= __x._M_root->_M_size)
129 __curr_rope = __x._M_root;
130 if (0 != __curr_rope->_M_c_string)
132 /* Treat the root as a leaf. */
133 __x._M_buf_start = __curr_rope->_M_c_string;
134 __x._M_buf_end = __curr_rope->_M_c_string + __curr_rope->_M_size;
135 __x._M_buf_ptr = __curr_rope->_M_c_string + __pos;
136 __x._M_path_end[0] = __curr_rope;
137 __x._M_leaf_index = 0;
144 __path[__curr_depth] = __curr_rope;
145 switch(__curr_rope->_M_tag)
147 case __detail::_S_leaf:
148 case __detail::_S_function:
149 case __detail::_S_substringfn:
150 __x._M_leaf_pos = __curr_start_pos;
152 case __detail::_S_concat:
154 _Rope_RopeConcatenation<_CharT, _Alloc>* __c =
155 (_Rope_RopeConcatenation<_CharT, _Alloc>*)__curr_rope;
156 _RopeRep* __left = __c->_M_left;
157 size_t __left_len = __left->_M_size;
160 if (__pos >= __curr_start_pos + __left_len)
163 __curr_rope = __c->_M_right;
164 __curr_start_pos += __left_len;
167 __curr_rope = __left;
173 // Copy last section of path into _M_path_end.
176 int __j = __curr_depth + 1 - int(_S_path_cache_len);
178 if (__j < 0) __j = 0;
179 while (__j <= __curr_depth)
180 __x._M_path_end[++__i] = __path[__j++];
181 __x._M_leaf_index = __i;
183 __x._M_path_directions = __dirns;
187 // Specialized version of the above. Assumes that
188 // the path cache is valid for the previous position.
189 template <class _CharT, class _Alloc>
191 _Rope_iterator_base<_CharT, _Alloc>::
192 _S_setcache_for_incr(_Rope_iterator_base<_CharT, _Alloc>& __x)
194 int __current_index = __x._M_leaf_index;
195 const _RopeRep* __current_node = __x._M_path_end[__current_index];
196 size_t __len = __current_node->_M_size;
197 size_t __node_start_pos = __x._M_leaf_pos;
198 unsigned char __dirns = __x._M_path_directions;
199 _Rope_RopeConcatenation<_CharT, _Alloc>* __c;
201 if (__x._M_current_pos - __node_start_pos < __len)
203 /* More stuff in this leaf, we just didn't cache it. */
207 // node_start_pos is starting position of last_node.
208 while (--__current_index >= 0)
210 if (!(__dirns & 1) /* Path turned left */)
212 __current_node = __x._M_path_end[__current_index];
213 __c = (_Rope_RopeConcatenation<_CharT, _Alloc>*)__current_node;
214 // Otherwise we were in the right child. Thus we should pop
215 // the concatenation node.
216 __node_start_pos -= __c->_M_left->_M_size;
219 if (__current_index < 0)
221 // We underflowed the cache. Punt.
225 __current_node = __x._M_path_end[__current_index];
226 __c = (_Rope_RopeConcatenation<_CharT, _Alloc>*)__current_node;
227 // current_node is a concatenation node. We are positioned on the first
228 // character in its right child.
229 // node_start_pos is starting position of current_node.
230 __node_start_pos += __c->_M_left->_M_size;
231 __current_node = __c->_M_right;
232 __x._M_path_end[++__current_index] = __current_node;
234 while (__detail::_S_concat == __current_node->_M_tag)
237 if (int(_S_path_cache_len) == __current_index)
240 for (__i = 0; __i < int(_S_path_cache_len) - 1; __i++)
241 __x._M_path_end[__i] = __x._M_path_end[__i+1];
245 ((_Rope_RopeConcatenation<_CharT, _Alloc>*)__current_node)->_M_left;
246 __x._M_path_end[__current_index] = __current_node;
248 // node_start_pos is unchanged.
250 __x._M_leaf_index = __current_index;
251 __x._M_leaf_pos = __node_start_pos;
252 __x._M_path_directions = __dirns;
256 template <class _CharT, class _Alloc>
258 _Rope_iterator_base<_CharT, _Alloc>::
261 _M_current_pos += __n;
264 size_t __chars_left = _M_buf_end - _M_buf_ptr;
265 if (__chars_left > __n)
267 else if (__chars_left == __n)
270 _S_setcache_for_incr(*this);
277 template <class _CharT, class _Alloc>
279 _Rope_iterator_base<_CharT, _Alloc>::
284 size_t __chars_left = _M_buf_ptr - _M_buf_start;
285 if (__chars_left >= __n)
290 _M_current_pos -= __n;
293 template <class _CharT, class _Alloc>
295 _Rope_iterator<_CharT, _Alloc>::
298 if (_M_root_rope->_M_tree_ptr != this->_M_root)
300 // _Rope was modified. Get things fixed up.
301 _RopeRep::_S_unref(this->_M_root);
302 this->_M_root = _M_root_rope->_M_tree_ptr;
303 _RopeRep::_S_ref(this->_M_root);
304 this->_M_buf_ptr = 0;
308 template <class _CharT, class _Alloc>
310 _Rope_const_iterator<_CharT, _Alloc>::
311 _Rope_const_iterator(const _Rope_iterator<_CharT, _Alloc>& __x)
312 : _Rope_iterator_base<_CharT, _Alloc>(__x)
315 template <class _CharT, class _Alloc>
317 _Rope_iterator<_CharT, _Alloc>::
318 _Rope_iterator(rope<_CharT, _Alloc>& __r, size_t __pos)
319 : _Rope_iterator_base<_CharT,_Alloc>(__r._M_tree_ptr, __pos),
321 { _RopeRep::_S_ref(this->_M_root); }
323 template <class _CharT, class _Alloc>
325 rope<_CharT, _Alloc>::
326 _S_char_ptr_len(const _CharT* __s)
328 const _CharT* __p = __s;
330 while (!_S_is0(*__p))
338 template <class _CharT, class _Alloc>
340 _Rope_RopeRep<_CharT, _Alloc>::
343 _CharT* __cstr = _M_c_string;
346 size_t __size = this->_M_size + 1;
347 _Destroy(__cstr, __cstr + __size, _M_get_allocator());
348 this->_Data_deallocate(__cstr, __size);
352 template <class _CharT, class _Alloc>
354 _Rope_RopeRep<_CharT, _Alloc>::
355 _S_free_string(_CharT* __s, size_t __n, allocator_type& __a)
357 if (!_S_is_basic_char_type((_CharT*)0))
358 _Destroy(__s, __s + __n, __a);
360 // This has to be a static member, so this gets a bit messy
362 _Rope_RopeLeaf<_CharT, _Alloc>::_S_rounded_up_size(__n));
365 // There are several reasons for not doing this with virtual destructors
366 // and a class specific delete operator:
367 // - A class specific delete operator can't easily get access to
368 // allocator instances if we need them.
369 // - Any virtual function would need a 4 or byte vtable pointer;
370 // this only requires a one byte tag per object.
371 template <class _CharT, class _Alloc>
373 _Rope_RopeRep<_CharT, _Alloc>::
378 case __detail::_S_leaf:
380 _Rope_RopeLeaf<_CharT, _Alloc>* __l
381 = (_Rope_RopeLeaf<_CharT, _Alloc>*)this;
382 __l->_Rope_RopeLeaf<_CharT, _Alloc>::~_Rope_RopeLeaf();
383 _L_deallocate(__l, 1);
386 case __detail::_S_concat:
388 _Rope_RopeConcatenation<_CharT,_Alloc>* __c
389 = (_Rope_RopeConcatenation<_CharT, _Alloc>*)this;
390 __c->_Rope_RopeConcatenation<_CharT, _Alloc>::
391 ~_Rope_RopeConcatenation();
392 _C_deallocate(__c, 1);
395 case __detail::_S_function:
397 _Rope_RopeFunction<_CharT, _Alloc>* __f
398 = (_Rope_RopeFunction<_CharT, _Alloc>*)this;
399 __f->_Rope_RopeFunction<_CharT, _Alloc>::~_Rope_RopeFunction();
400 _F_deallocate(__f, 1);
403 case __detail::_S_substringfn:
405 _Rope_RopeSubstring<_CharT, _Alloc>* __ss =
406 (_Rope_RopeSubstring<_CharT, _Alloc>*)this;
407 __ss->_Rope_RopeSubstring<_CharT, _Alloc>::
408 ~_Rope_RopeSubstring();
409 _S_deallocate(__ss, 1);
416 template <class _CharT, class _Alloc>
418 _Rope_RopeRep<_CharT, _Alloc>::
419 _S_free_string(const _CharT*, size_t, allocator_type)
424 // Concatenate a C string onto a leaf rope by copying the rope data.
425 // Used for short ropes.
426 template <class _CharT, class _Alloc>
427 typename rope<_CharT, _Alloc>::_RopeLeaf*
428 rope<_CharT, _Alloc>::
429 _S_leaf_concat_char_iter(_RopeLeaf* __r, const _CharT* __iter, size_t __len)
431 size_t __old_len = __r->_M_size;
432 _CharT* __new_data = (_CharT*)
433 _Data_allocate(_S_rounded_up_size(__old_len + __len));
436 uninitialized_copy_n(__r->_M_data, __old_len, __new_data);
437 uninitialized_copy_n(__iter, __len, __new_data + __old_len);
438 _S_cond_store_eos(__new_data[__old_len + __len]);
441 __result = _S_new_RopeLeaf(__new_data, __old_len + __len,
442 __r->_M_get_allocator());
446 _RopeRep::__STL_FREE_STRING(__new_data, __old_len + __len,
447 __r->_M_get_allocator());
448 __throw_exception_again;
454 // As above, but it's OK to clobber original if refcount is 1
455 template <class _CharT, class _Alloc>
456 typename rope<_CharT,_Alloc>::_RopeLeaf*
457 rope<_CharT, _Alloc>::
458 _S_destr_leaf_concat_char_iter(_RopeLeaf* __r, const _CharT* __iter,
461 if (__r->_M_ref_count > 1)
462 return _S_leaf_concat_char_iter(__r, __iter, __len);
463 size_t __old_len = __r->_M_size;
464 if (_S_allocated_capacity(__old_len) >= __old_len + __len)
466 // The space has been partially initialized for the standard
467 // character types. But that doesn't matter for those types.
468 uninitialized_copy_n(__iter, __len, __r->_M_data + __old_len);
469 if (_S_is_basic_char_type((_CharT*)0))
470 _S_cond_store_eos(__r->_M_data[__old_len + __len]);
471 else if (__r->_M_c_string != __r->_M_data && 0 != __r->_M_c_string)
473 __r->_M_free_c_string();
474 __r->_M_c_string = 0;
476 __r->_M_size = __old_len + __len;
477 __r->_M_ref_count = 2;
482 _RopeLeaf* __result = _S_leaf_concat_char_iter(__r, __iter, __len);
488 // Assumes left and right are not 0.
489 // Does not increment (nor decrement on exception) child reference counts.
490 // Result has ref count 1.
491 template <class _CharT, class _Alloc>
492 typename rope<_CharT, _Alloc>::_RopeRep*
493 rope<_CharT, _Alloc>::
494 _S_tree_concat(_RopeRep* __left, _RopeRep* __right)
496 _RopeConcatenation* __result = _S_new_RopeConcatenation(__left, __right,
499 size_t __depth = __result->_M_depth;
502 && (__result->_M_size < 1000
503 || __depth > size_t(__detail::_S_max_rope_depth)))
505 _RopeRep* __balanced;
509 __balanced = _S_balance(__result);
510 __result->_M_unref_nonnil();
514 _C_deallocate(__result,1);
515 __throw_exception_again;
517 // In case of exception, we need to deallocate
518 // otherwise dangling result node. But caller
519 // still owns its children. Thus unref is
527 template <class _CharT, class _Alloc>
528 typename rope<_CharT, _Alloc>::_RopeRep*
529 rope<_CharT, _Alloc>::
530 _S_concat_char_iter(_RopeRep* __r, const _CharT*__s, size_t __slen)
539 return __STL_ROPE_FROM_UNOWNED_CHAR_PTR(__s, __slen,
540 __r->_M_get_allocator());
541 if (__r->_M_tag == __detail::_S_leaf
542 && __r->_M_size + __slen <= size_t(_S_copy_max))
544 __result = _S_leaf_concat_char_iter((_RopeLeaf*)__r, __s, __slen);
547 if (__detail::_S_concat == __r->_M_tag
548 && __detail::_S_leaf == ((_RopeConcatenation*) __r)->_M_right->_M_tag)
551 (_RopeLeaf* )(((_RopeConcatenation* )__r)->_M_right);
552 if (__right->_M_size + __slen <= size_t(_S_copy_max))
554 _RopeRep* __left = ((_RopeConcatenation*)__r)->_M_left;
556 _S_leaf_concat_char_iter((_RopeLeaf*)__right, __s, __slen);
557 __left->_M_ref_nonnil();
559 { __result = _S_tree_concat(__left, __nright); }
564 __throw_exception_again;
570 __STL_ROPE_FROM_UNOWNED_CHAR_PTR(__s, __slen, __r->_M_get_allocator());
573 __r->_M_ref_nonnil();
574 __result = _S_tree_concat(__r, __nright);
580 __throw_exception_again;
586 template <class _CharT, class _Alloc>
587 typename rope<_CharT,_Alloc>::_RopeRep*
588 rope<_CharT,_Alloc>::
589 _S_destr_concat_char_iter(_RopeRep* __r, const _CharT* __s, size_t __slen)
593 return __STL_ROPE_FROM_UNOWNED_CHAR_PTR(__s, __slen,
594 __r->_M_get_allocator());
595 size_t __count = __r->_M_ref_count;
596 size_t __orig_size = __r->_M_size;
598 return _S_concat_char_iter(__r, __s, __slen);
601 __r->_M_ref_count = 2; // One more than before
604 if (__orig_size + __slen <= size_t(_S_copy_max)
605 && __detail::_S_leaf == __r->_M_tag)
607 __result = _S_destr_leaf_concat_char_iter((_RopeLeaf*)__r, __s,
611 if (__detail::_S_concat == __r->_M_tag)
613 _RopeLeaf* __right = (_RopeLeaf*)(((_RopeConcatenation*)
615 if (__detail::_S_leaf == __right->_M_tag
616 && __right->_M_size + __slen <= size_t(_S_copy_max))
618 _RopeRep* __new_right =
619 _S_destr_leaf_concat_char_iter(__right, __s, __slen);
620 if (__right == __new_right)
621 __new_right->_M_ref_count = 1;
623 __right->_M_unref_nonnil();
624 __r->_M_ref_count = 2; // One more than before.
625 ((_RopeConcatenation*)__r)->_M_right = __new_right;
626 __r->_M_size = __orig_size + __slen;
627 if (0 != __r->_M_c_string)
629 __r->_M_free_c_string();
630 __r->_M_c_string = 0;
636 __STL_ROPE_FROM_UNOWNED_CHAR_PTR(__s, __slen, __r->_M_get_allocator());
637 __r->_M_ref_nonnil();
639 { __result = _S_tree_concat(__r, __right); }
644 __throw_exception_again;
650 template <class _CharT, class _Alloc>
651 typename rope<_CharT, _Alloc>::_RopeRep*
652 rope<_CharT, _Alloc>::
653 _S_concat(_RopeRep* __left, _RopeRep* __right)
662 __left->_M_ref_nonnil();
665 if (__detail::_S_leaf == __right->_M_tag)
667 if (__detail::_S_leaf == __left->_M_tag)
669 if (__right->_M_size + __left->_M_size <= size_t(_S_copy_max))
670 return _S_leaf_concat_char_iter((_RopeLeaf*)__left,
671 ((_RopeLeaf*)__right)->_M_data,
674 else if (__detail::_S_concat == __left->_M_tag
675 && __detail::_S_leaf == ((_RopeConcatenation*)
676 __left)->_M_right->_M_tag)
678 _RopeLeaf* __leftright =
679 (_RopeLeaf*)(((_RopeConcatenation*)__left)->_M_right);
680 if (__leftright->_M_size
681 + __right->_M_size <= size_t(_S_copy_max))
683 _RopeRep* __leftleft = ((_RopeConcatenation*)__left)->_M_left;
684 _RopeRep* __rest = _S_leaf_concat_char_iter(__leftright,
689 __leftleft->_M_ref_nonnil();
691 { return(_S_tree_concat(__leftleft, __rest)); }
694 _S_unref(__leftleft);
696 __throw_exception_again;
701 __left->_M_ref_nonnil();
702 __right->_M_ref_nonnil();
704 { return(_S_tree_concat(__left, __right)); }
709 __throw_exception_again;
713 template <class _CharT, class _Alloc>
714 typename rope<_CharT, _Alloc>::_RopeRep*
715 rope<_CharT, _Alloc>::
716 _S_substring(_RopeRep* __base, size_t __start, size_t __endp1)
720 size_t __len = __base->_M_size;
722 const size_t __lazy_threshold = 128;
724 if (__endp1 >= __len)
728 __base->_M_ref_nonnil();
736 __adj_endp1 = __endp1;
738 switch(__base->_M_tag)
740 case __detail::_S_concat:
742 _RopeConcatenation* __c = (_RopeConcatenation*)__base;
743 _RopeRep* __left = __c->_M_left;
744 _RopeRep* __right = __c->_M_right;
745 size_t __left_len = __left->_M_size;
748 if (__adj_endp1 <= __left_len)
749 return _S_substring(__left, __start, __endp1);
750 else if (__start >= __left_len)
751 return _S_substring(__right, __start - __left_len,
752 __adj_endp1 - __left_len);
753 _Self_destruct_ptr __left_result(_S_substring(__left,
756 _Self_destruct_ptr __right_result(_S_substring(__right, 0,
759 __result = _S_concat(__left_result, __right_result);
762 case __detail::_S_leaf:
764 _RopeLeaf* __l = (_RopeLeaf*)__base;
767 if (__start >= __adj_endp1)
769 __result_len = __adj_endp1 - __start;
770 if (__result_len > __lazy_threshold)
773 const _CharT* __section = __l->_M_data + __start;
774 __result = _S_new_RopeLeaf(__section, __result_len,
775 __base->_M_get_allocator());
776 __result->_M_c_string = 0; // Not eos terminated.
778 // We should sometimes create substring node instead.
779 __result = __STL_ROPE_FROM_UNOWNED_CHAR_PTR(__l->_M_data + __start,
786 case __detail::_S_substringfn:
787 // Avoid introducing multiple layers of substring nodes.
789 _RopeSubstring* __old = (_RopeSubstring*)__base;
791 if (__start >= __adj_endp1)
793 __result_len = __adj_endp1 - __start;
794 if (__result_len > __lazy_threshold)
796 _RopeSubstring* __result =
797 _S_new_RopeSubstring(__old->_M_base,
798 __start + __old->_M_start,
799 __adj_endp1 - __start,
800 __base->_M_get_allocator());
803 } // *** else fall through: ***
805 case __detail::_S_function:
807 _RopeFunction* __f = (_RopeFunction*)__base;
810 if (__start >= __adj_endp1)
812 __result_len = __adj_endp1 - __start;
814 if (__result_len > __lazy_threshold)
816 __section = (_CharT*)
817 _Data_allocate(_S_rounded_up_size(__result_len));
819 { (*(__f->_M_fn))(__start, __result_len, __section); }
822 _RopeRep::__STL_FREE_STRING(__section, __result_len,
823 __base->_M_get_allocator());
824 __throw_exception_again;
826 _S_cond_store_eos(__section[__result_len]);
827 return _S_new_RopeLeaf(__section, __result_len,
828 __base->_M_get_allocator());
833 // Create substring node.
834 return _S_new_RopeSubstring(__base, __start, __adj_endp1 - __start,
835 __base->_M_get_allocator());
839 template<class _CharT>
840 class _Rope_flatten_char_consumer
841 : public _Rope_char_consumer<_CharT>
847 _Rope_flatten_char_consumer(_CharT* __buffer)
848 { _M_buf_ptr = __buffer; };
850 ~_Rope_flatten_char_consumer() {}
853 operator()(const _CharT* __leaf, size_t __n)
855 uninitialized_copy_n(__leaf, __n, _M_buf_ptr);
861 template<class _CharT>
862 class _Rope_find_char_char_consumer
863 : public _Rope_char_consumer<_CharT>
868 size_t _M_count; // Number of nonmatching characters
870 _Rope_find_char_char_consumer(_CharT __p)
871 : _M_pattern(__p), _M_count(0) {}
873 ~_Rope_find_char_char_consumer() {}
876 operator()(const _CharT* __leaf, size_t __n)
879 for (__i = 0; __i < __n; __i++)
881 if (__leaf[__i] == _M_pattern)
887 _M_count += __n; return true;
891 template<class _CharT, class _Traits>
892 // Here _CharT is both the stream and rope character type.
893 class _Rope_insert_char_consumer
894 : public _Rope_char_consumer<_CharT>
897 typedef basic_ostream<_CharT,_Traits> _Insert_ostream;
898 _Insert_ostream& _M_o;
900 _Rope_insert_char_consumer(_Insert_ostream& __writer)
902 ~_Rope_insert_char_consumer() { };
903 // Caller is presumed to own the ostream
904 bool operator() (const _CharT* __leaf, size_t __n);
905 // Returns true to continue traversal.
908 template<class _CharT, class _Traits>
910 _Rope_insert_char_consumer<_CharT, _Traits>::
911 operator()(const _CharT* __leaf, size_t __n)
914 // We assume that formatting is set up correctly for each element.
915 for (__i = 0; __i < __n; __i++)
916 _M_o.put(__leaf[__i]);
920 template <class _CharT, class _Alloc>
922 rope<_CharT, _Alloc>::
923 _S_apply_to_pieces(_Rope_char_consumer<_CharT>& __c,
924 const _RopeRep* __r, size_t __begin, size_t __end)
930 case __detail::_S_concat:
932 _RopeConcatenation* __conc = (_RopeConcatenation*)__r;
933 _RopeRep* __left = __conc->_M_left;
934 size_t __left_len = __left->_M_size;
935 if (__begin < __left_len)
937 size_t __left_end = std::min(__left_len, __end);
938 if (!_S_apply_to_pieces(__c, __left, __begin, __left_end))
941 if (__end > __left_len)
943 _RopeRep* __right = __conc->_M_right;
944 size_t __right_start = std::max(__left_len, __begin);
945 if (!_S_apply_to_pieces(__c, __right,
946 __right_start - __left_len,
952 case __detail::_S_leaf:
954 _RopeLeaf* __l = (_RopeLeaf*)__r;
955 return __c(__l->_M_data + __begin, __end - __begin);
957 case __detail::_S_function:
958 case __detail::_S_substringfn:
960 _RopeFunction* __f = (_RopeFunction*)__r;
961 size_t __len = __end - __begin;
964 (_CharT*)_Alloc().allocate(__len * sizeof(_CharT));
967 (*(__f->_M_fn))(__begin, __len, __buffer);
968 __result = __c(__buffer, __len);
969 _Alloc().deallocate(__buffer, __len * sizeof(_CharT));
973 _Alloc().deallocate(__buffer, __len * sizeof(_CharT));
974 __throw_exception_again;
983 template<class _CharT, class _Traits>
985 _Rope_fill(basic_ostream<_CharT, _Traits>& __o, size_t __n)
987 char __f = __o.fill();
990 for (__i = 0; __i < __n; __i++)
995 template <class _CharT>
997 _Rope_is_simple(_CharT*)
1001 _Rope_is_simple(char*)
1005 _Rope_is_simple(wchar_t*)
1008 template<class _CharT, class _Traits, class _Alloc>
1009 basic_ostream<_CharT, _Traits>&
1010 operator<<(basic_ostream<_CharT, _Traits>& __o,
1011 const rope<_CharT, _Alloc>& __r)
1013 size_t __w = __o.width();
1014 bool __left = bool(__o.flags() & std::ios::left);
1016 size_t __rope_len = __r.size();
1017 _Rope_insert_char_consumer<_CharT, _Traits> __c(__o);
1018 bool __is_simple = _Rope_is_simple((_CharT*)0);
1020 if (__rope_len < __w)
1021 __pad_len = __w - __rope_len;
1026 __o.width(__w / __rope_len);
1029 if (__is_simple && !__left && __pad_len > 0)
1030 _Rope_fill(__o, __pad_len);
1031 __r.apply_to_pieces(0, __r.size(), __c);
1032 if (__is_simple && __left && __pad_len > 0)
1033 _Rope_fill(__o, __pad_len);
1041 __throw_exception_again;
1046 template <class _CharT, class _Alloc>
1048 rope<_CharT, _Alloc>::
1049 _S_flatten(_RopeRep* __r, size_t __start, size_t __len,
1052 _Rope_flatten_char_consumer<_CharT> __c(__buffer);
1053 _S_apply_to_pieces(__c, __r, __start, __start + __len);
1054 return(__buffer + __len);
1057 template <class _CharT, class _Alloc>
1059 rope<_CharT, _Alloc>::
1060 find(_CharT __pattern, size_t __start) const
1062 _Rope_find_char_char_consumer<_CharT> __c(__pattern);
1063 _S_apply_to_pieces(__c, this->_M_tree_ptr, __start, size());
1064 size_type __result_pos = __start + __c._M_count;
1065 #ifndef __STL_OLD_ROPE_SEMANTICS
1066 if (__result_pos == size())
1067 __result_pos = npos;
1069 return __result_pos;
1072 template <class _CharT, class _Alloc>
1074 rope<_CharT, _Alloc>::
1075 _S_flatten(_RopeRep* __r, _CharT* __buffer)
1081 case __detail::_S_concat:
1083 _RopeConcatenation* __c = (_RopeConcatenation*)__r;
1084 _RopeRep* __left = __c->_M_left;
1085 _RopeRep* __right = __c->_M_right;
1086 _CharT* __rest = _S_flatten(__left, __buffer);
1087 return _S_flatten(__right, __rest);
1089 case __detail::_S_leaf:
1091 _RopeLeaf* __l = (_RopeLeaf*)__r;
1092 return copy_n(__l->_M_data, __l->_M_size, __buffer).second;
1094 case __detail::_S_function:
1095 case __detail::_S_substringfn:
1096 // We don't yet do anything with substring nodes.
1097 // This needs to be fixed before ropefiles will work well.
1099 _RopeFunction* __f = (_RopeFunction*)__r;
1100 (*(__f->_M_fn))(0, __f->_M_size, __buffer);
1101 return __buffer + __f->_M_size;
1108 // This needs work for _CharT != char
1109 template <class _CharT, class _Alloc>
1111 rope<_CharT, _Alloc>::
1112 _S_dump(_RopeRep* __r, int __indent)
1114 for (int __i = 0; __i < __indent; __i++)
1121 if (_S_concat == __r->_M_tag)
1123 _RopeConcatenation* __c = (_RopeConcatenation*)__r;
1124 _RopeRep* __left = __c->_M_left;
1125 _RopeRep* __right = __c->_M_right;
1128 printf("Concatenation %p (depth = %d, len = %ld, %s balanced)\n",
1129 __r, __r->_M_depth, __r->_M_size,
1130 __r->_M_is_balanced? "" : "not");
1132 printf("Concatenation %p (rc = %ld, depth = %d, "
1133 "len = %ld, %s balanced)\n",
1134 __r, __r->_M_ref_count, __r->_M_depth, __r->_M_size,
1135 __r->_M_is_balanced? "" : "not");
1137 _S_dump(__left, __indent + 2);
1138 _S_dump(__right, __indent + 2);
1145 switch (__r->_M_tag)
1147 case __detail::_S_leaf:
1150 case __detail::_S_function:
1151 __kind = "Function";
1153 case __detail::_S_substringfn:
1154 __kind = "Function representing substring";
1157 __kind = "(corrupted kind field!)";
1160 printf("%s %p (depth = %d, len = %ld) ",
1161 __kind, __r, __r->_M_depth, __r->_M_size);
1163 printf("%s %p (rc = %ld, depth = %d, len = %ld) ",
1164 __kind, __r, __r->_M_ref_count, __r->_M_depth, __r->_M_size);
1166 if (_S_is_one_byte_char_type((_CharT*)0))
1168 const int __max_len = 40;
1169 _Self_destruct_ptr __prefix(_S_substring(__r, 0, __max_len));
1170 _CharT __buffer[__max_len + 1];
1171 bool __too_big = __r->_M_size > __prefix->_M_size;
1173 _S_flatten(__prefix, __buffer);
1174 __buffer[__prefix->_M_size] = _S_eos((_CharT*)0);
1175 printf("%s%s\n", (char*)__buffer,
1176 __too_big? "...\n" : "\n");
1183 template <class _CharT, class _Alloc>
1185 rope<_CharT, _Alloc>::
1186 _S_min_len[int(__detail::_S_max_rope_depth) + 1] = {
1187 /* 0 */1, /* 1 */2, /* 2 */3, /* 3 */5, /* 4 */8, /* 5 */13, /* 6 */21,
1188 /* 7 */34, /* 8 */55, /* 9 */89, /* 10 */144, /* 11 */233, /* 12 */377,
1189 /* 13 */610, /* 14 */987, /* 15 */1597, /* 16 */2584, /* 17 */4181,
1190 /* 18 */6765, /* 19 */10946, /* 20 */17711, /* 21 */28657, /* 22 */46368,
1191 /* 23 */75025, /* 24 */121393, /* 25 */196418, /* 26 */317811,
1192 /* 27 */514229, /* 28 */832040, /* 29 */1346269, /* 30 */2178309,
1193 /* 31 */3524578, /* 32 */5702887, /* 33 */9227465, /* 34 */14930352,
1194 /* 35 */24157817, /* 36 */39088169, /* 37 */63245986, /* 38 */102334155,
1195 /* 39 */165580141, /* 40 */267914296, /* 41 */433494437,
1196 /* 42 */701408733, /* 43 */1134903170, /* 44 */1836311903,
1197 /* 45 */2971215073u };
1198 // These are Fibonacci numbers < 2**32.
1200 template <class _CharT, class _Alloc>
1201 typename rope<_CharT, _Alloc>::_RopeRep*
1202 rope<_CharT, _Alloc>::
1203 _S_balance(_RopeRep* __r)
1205 _RopeRep* __forest[int(__detail::_S_max_rope_depth) + 1];
1206 _RopeRep* __result = 0;
1209 // The concatenation of forest in descending order is equal to __r.
1210 // __forest[__i]._M_size >= _S_min_len[__i]
1211 // __forest[__i]._M_depth = __i
1212 // References from forest are included in refcount.
1214 for (__i = 0; __i <= int(__detail::_S_max_rope_depth); ++__i)
1218 _S_add_to_forest(__r, __forest);
1219 for (__i = 0; __i <= int(__detail::_S_max_rope_depth); ++__i)
1220 if (0 != __forest[__i])
1223 _Self_destruct_ptr __old(__result);
1225 __result = _S_concat(__forest[__i], __result);
1226 __forest[__i]->_M_unref_nonnil();
1227 #if !defined(__GC) && defined(__EXCEPTIONS)
1234 for(__i = 0; __i <= int(__detail::_S_max_rope_depth); __i++)
1235 _S_unref(__forest[__i]);
1236 __throw_exception_again;
1239 if (__result->_M_depth > int(__detail::_S_max_rope_depth))
1240 __throw_length_error(__N("rope::_S_balance"));
1244 template <class _CharT, class _Alloc>
1246 rope<_CharT, _Alloc>::
1247 _S_add_to_forest(_RopeRep* __r, _RopeRep** __forest)
1249 if (__r->_M_is_balanced)
1251 _S_add_leaf_to_forest(__r, __forest);
1256 _RopeConcatenation* __c = (_RopeConcatenation*)__r;
1258 _S_add_to_forest(__c->_M_left, __forest);
1259 _S_add_to_forest(__c->_M_right, __forest);
1264 template <class _CharT, class _Alloc>
1266 rope<_CharT, _Alloc>::
1267 _S_add_leaf_to_forest(_RopeRep* __r, _RopeRep** __forest)
1269 _RopeRep* __insertee; // included in refcount
1270 _RopeRep* __too_tiny = 0; // included in refcount
1271 int __i; // forest[0..__i-1] is empty
1272 size_t __s = __r->_M_size;
1274 for (__i = 0; __s >= _S_min_len[__i+1]/* not this bucket */; ++__i)
1276 if (0 != __forest[__i])
1279 _Self_destruct_ptr __old(__too_tiny);
1281 __too_tiny = _S_concat_and_set_balanced(__forest[__i],
1283 __forest[__i]->_M_unref_nonnil();
1289 _Self_destruct_ptr __old(__too_tiny);
1291 __insertee = _S_concat_and_set_balanced(__too_tiny, __r);
1293 // Too_tiny dead, and no longer included in refcount.
1294 // Insertee is live and included.
1297 if (0 != __forest[__i])
1300 _Self_destruct_ptr __old(__insertee);
1302 __insertee = _S_concat_and_set_balanced(__forest[__i],
1304 __forest[__i]->_M_unref_nonnil();
1307 if (__i == int(__detail::_S_max_rope_depth)
1308 || __insertee->_M_size < _S_min_len[__i+1])
1310 __forest[__i] = __insertee;
1311 // refcount is OK since __insertee is now dead.
1317 template <class _CharT, class _Alloc>
1319 rope<_CharT, _Alloc>::
1320 _S_fetch(_RopeRep* __r, size_type __i)
1322 __GC_CONST _CharT* __cstr = __r->_M_c_string;
1330 case __detail::_S_concat:
1332 _RopeConcatenation* __c = (_RopeConcatenation*)__r;
1333 _RopeRep* __left = __c->_M_left;
1334 size_t __left_len = __left->_M_size;
1336 if (__i >= __left_len)
1339 __r = __c->_M_right;
1345 case __detail::_S_leaf:
1347 _RopeLeaf* __l = (_RopeLeaf*)__r;
1348 return __l->_M_data[__i];
1350 case __detail::_S_function:
1351 case __detail::_S_substringfn:
1353 _RopeFunction* __f = (_RopeFunction*)__r;
1356 (*(__f->_M_fn))(__i, 1, &__result);
1364 // Return a uniquely referenced character slot for the given
1365 // position, or 0 if that's not possible.
1366 template <class _CharT, class _Alloc>
1368 rope<_CharT, _Alloc>::
1369 _S_fetch_ptr(_RopeRep* __r, size_type __i)
1371 _RopeRep* __clrstack[__detail::_S_max_rope_depth];
1376 if (__r->_M_ref_count > 1)
1380 case __detail::_S_concat:
1382 _RopeConcatenation* __c = (_RopeConcatenation*)__r;
1383 _RopeRep* __left = __c->_M_left;
1384 size_t __left_len = __left->_M_size;
1386 if (__c->_M_c_string != 0)
1387 __clrstack[__csptr++] = __c;
1388 if (__i >= __left_len)
1391 __r = __c->_M_right;
1397 case __detail::_S_leaf:
1399 _RopeLeaf* __l = (_RopeLeaf*)__r;
1400 if (__l->_M_c_string != __l->_M_data && __l->_M_c_string != 0)
1401 __clrstack[__csptr++] = __l;
1405 _RopeRep* __d = __clrstack[__csptr];
1406 __d->_M_free_c_string();
1407 __d->_M_c_string = 0;
1409 return __l->_M_data + __i;
1411 case __detail::_S_function:
1412 case __detail::_S_substringfn:
1419 // The following could be implemented trivially using
1420 // lexicographical_compare_3way.
1421 // We do a little more work to avoid dealing with rope iterators for
1423 template <class _CharT, class _Alloc>
1425 rope<_CharT, _Alloc>::
1426 _S_compare (const _RopeRep* __left, const _RopeRep* __right)
1435 __left_len = __left->_M_size;
1436 __right_len = __right->_M_size;
1437 if (__detail::_S_leaf == __left->_M_tag)
1439 _RopeLeaf* __l = (_RopeLeaf*) __left;
1440 if (__detail::_S_leaf == __right->_M_tag)
1442 _RopeLeaf* __r = (_RopeLeaf*) __right;
1443 return lexicographical_compare_3way(__l->_M_data,
1444 __l->_M_data + __left_len,
1445 __r->_M_data, __r->_M_data
1450 const_iterator __rstart(__right, 0);
1451 const_iterator __rend(__right, __right_len);
1452 return lexicographical_compare_3way(__l->_M_data, __l->_M_data
1459 const_iterator __lstart(__left, 0);
1460 const_iterator __lend(__left, __left_len);
1461 if (__detail::_S_leaf == __right->_M_tag)
1463 _RopeLeaf* __r = (_RopeLeaf*) __right;
1464 return lexicographical_compare_3way(__lstart, __lend,
1465 __r->_M_data, __r->_M_data
1470 const_iterator __rstart(__right, 0);
1471 const_iterator __rend(__right, __right_len);
1472 return lexicographical_compare_3way(__lstart, __lend,
1478 // Assignment to reference proxies.
1479 template <class _CharT, class _Alloc>
1480 _Rope_char_ref_proxy<_CharT, _Alloc>&
1481 _Rope_char_ref_proxy<_CharT, _Alloc>::
1482 operator=(_CharT __c)
1484 _RopeRep* __old = _M_root->_M_tree_ptr;
1486 // First check for the case in which everything is uniquely
1487 // referenced. In that case we can do this destructively.
1488 _CharT* __ptr = _My_rope::_S_fetch_ptr(__old, _M_pos);
1495 _Self_destruct_ptr __left(_My_rope::_S_substring(__old, 0, _M_pos));
1496 _Self_destruct_ptr __right(_My_rope::_S_substring(__old, _M_pos + 1,
1498 _Self_destruct_ptr __result_left(_My_rope::
1499 _S_destr_concat_char_iter(__left,
1502 _RopeRep* __result = _My_rope::_S_concat(__result_left, __right);
1504 _RopeRep::_S_unref(__old);
1506 _M_root->_M_tree_ptr = __result;
1510 template <class _CharT, class _Alloc>
1511 inline _Rope_char_ref_proxy<_CharT, _Alloc>::
1512 operator _CharT() const
1514 if (_M_current_valid)
1517 return _My_rope::_S_fetch(_M_root->_M_tree_ptr, _M_pos);
1520 template <class _CharT, class _Alloc>
1521 _Rope_char_ptr_proxy<_CharT, _Alloc>
1522 _Rope_char_ref_proxy<_CharT, _Alloc>::
1524 { return _Rope_char_ptr_proxy<_CharT, _Alloc>(*this); }
1526 template <class _CharT, class _Alloc>
1527 rope<_CharT, _Alloc>::
1528 rope(size_t __n, _CharT __c, const allocator_type& __a)
1531 rope<_CharT,_Alloc> __result;
1532 const size_t __exponentiate_threshold = 32;
1535 _CharT* __rest_buffer;
1536 _RopeRep* __remainder;
1537 rope<_CharT, _Alloc> __remainder_rope;
1542 __exponent = __n / __exponentiate_threshold;
1543 __rest = __n % __exponentiate_threshold;
1548 __rest_buffer = this->_Data_allocate(_S_rounded_up_size(__rest));
1549 __uninitialized_fill_n_a(__rest_buffer, __rest, __c,
1550 _M_get_allocator());
1551 _S_cond_store_eos(__rest_buffer[__rest]);
1553 { __remainder = _S_new_RopeLeaf(__rest_buffer, __rest,
1554 _M_get_allocator()); }
1557 _RopeRep::__STL_FREE_STRING(__rest_buffer, __rest,
1558 _M_get_allocator());
1559 __throw_exception_again;
1562 __remainder_rope._M_tree_ptr = __remainder;
1563 if (__exponent != 0)
1565 _CharT* __base_buffer =
1566 this->_Data_allocate(_S_rounded_up_size(__exponentiate_threshold));
1567 _RopeLeaf* __base_leaf;
1569 __uninitialized_fill_n_a(__base_buffer, __exponentiate_threshold, __c,
1570 _M_get_allocator());
1571 _S_cond_store_eos(__base_buffer[__exponentiate_threshold]);
1574 __base_leaf = _S_new_RopeLeaf(__base_buffer,
1575 __exponentiate_threshold,
1576 _M_get_allocator());
1580 _RopeRep::__STL_FREE_STRING(__base_buffer,
1581 __exponentiate_threshold,
1582 _M_get_allocator());
1583 __throw_exception_again;
1585 __base_rope._M_tree_ptr = __base_leaf;
1586 if (1 == __exponent)
1587 __result = __base_rope;
1589 __result = power(__base_rope, __exponent,
1590 _Rope_Concat_fn<_CharT, _Alloc>());
1592 if (0 != __remainder)
1593 __result += __remainder_rope;
1596 __result = __remainder_rope;
1598 this->_M_tree_ptr = __result._M_tree_ptr;
1599 this->_M_tree_ptr->_M_ref_nonnil();
1602 template<class _CharT, class _Alloc>
1604 rope<_CharT, _Alloc>::_S_empty_c_str[1];
1606 template<class _CharT, class _Alloc>
1608 rope<_CharT, _Alloc>::
1611 if (0 == this->_M_tree_ptr)
1613 _S_empty_c_str[0] = _S_eos((_CharT*)0); // Possibly redundant,
1614 // but probably fast.
1615 return _S_empty_c_str;
1617 __gthread_mutex_lock (&this->_M_tree_ptr->_M_c_string_lock);
1618 __GC_CONST _CharT* __result = this->_M_tree_ptr->_M_c_string;
1621 size_t __s = size();
1622 __result = this->_Data_allocate(__s + 1);
1623 _S_flatten(this->_M_tree_ptr, __result);
1624 __result[__s] = _S_eos((_CharT*)0);
1625 this->_M_tree_ptr->_M_c_string = __result;
1627 __gthread_mutex_unlock (&this->_M_tree_ptr->_M_c_string_lock);
1631 template<class _CharT, class _Alloc>
1632 const _CharT* rope<_CharT, _Alloc>::
1633 replace_with_c_str()
1635 if (0 == this->_M_tree_ptr)
1637 _S_empty_c_str[0] = _S_eos((_CharT*)0);
1638 return _S_empty_c_str;
1640 __GC_CONST _CharT* __old_c_string = this->_M_tree_ptr->_M_c_string;
1641 if (__detail::_S_leaf == this->_M_tree_ptr->_M_tag
1642 && 0 != __old_c_string)
1643 return(__old_c_string);
1644 size_t __s = size();
1645 _CharT* __result = this->_Data_allocate(_S_rounded_up_size(__s));
1646 _S_flatten(this->_M_tree_ptr, __result);
1647 __result[__s] = _S_eos((_CharT*)0);
1648 this->_M_tree_ptr->_M_unref_nonnil();
1649 this->_M_tree_ptr = _S_new_RopeLeaf(__result, __s,
1650 this->_M_get_allocator());
1654 // Algorithm specializations. More should be added.
1656 template<class _Rope_iterator> // was templated on CharT and Alloc
1657 void // VC++ workaround
1658 _Rope_rotate(_Rope_iterator __first,
1659 _Rope_iterator __middle,
1660 _Rope_iterator __last)
1662 typedef typename _Rope_iterator::value_type _CharT;
1663 typedef typename _Rope_iterator::_allocator_type _Alloc;
1665 rope<_CharT, _Alloc>& __r(__first.container());
1666 rope<_CharT, _Alloc> __prefix = __r.substr(0, __first.index());
1667 rope<_CharT, _Alloc> __suffix =
1668 __r.substr(__last.index(), __r.size() - __last.index());
1669 rope<_CharT, _Alloc> __part1 =
1670 __r.substr(__middle.index(), __last.index() - __middle.index());
1671 rope<_CharT, _Alloc> __part2 =
1672 __r.substr(__first.index(), __middle.index() - __first.index());
1679 #if !defined(__GNUC__)
1680 // Appears to confuse g++
1682 rotate(_Rope_iterator<char, __STL_DEFAULT_ALLOCATOR(char)> __first,
1683 _Rope_iterator<char, __STL_DEFAULT_ALLOCATOR(char)> __middle,
1684 _Rope_iterator<char, __STL_DEFAULT_ALLOCATOR(char)> __last)
1685 { _Rope_rotate(__first, __middle, __last); }
1689 // Probably not useful for several reasons:
1690 // - for SGIs 7.1 compiler and probably some others,
1691 // this forces lots of rope<wchar_t, ...> instantiations, creating a
1692 // code bloat and compile time problem. (Fixed in 7.2.)
1693 // - wchar_t is 4 bytes wide on most UNIX platforms, making it
1694 // unattractive for unicode strings. Unsigned short may be a better
1697 rotate(_Rope_iterator<wchar_t, __STL_DEFAULT_ALLOCATOR(char)> __first,
1698 _Rope_iterator<wchar_t, __STL_DEFAULT_ALLOCATOR(char)> __middle,
1699 _Rope_iterator<wchar_t, __STL_DEFAULT_ALLOCATOR(char)> __last)
1700 { _Rope_rotate(__first, __middle, __last); }
1703 _GLIBCXX_END_NAMESPACE_VERSION