headers/cpp/ropeimpl.h

391     _RopeLeaf* __result;
397 	__result = _S_new_RopeLeaf(__new_data, __old_len + __len,
402     return __result;
432 	_RopeLeaf* __result = _S_leaf_concat_char_iter(__r, __iter, __len);
433 	__stl_assert(__result->_M_refcount == 1);
434 	return __result;
446     _RopeConcatenation* __result =
448     size_t __depth = __result->_M_depth;
453     if (__depth > 20 && (__result->_M_size < 1000 ||
458 	   __balanced = _S_balance(__result);
460 	     if (__result != __balanced) {
461 		__stl_assert(1 == __result->_M_refcount
465 	   __result->_M_unref_nonnil();
467 	__STL_UNWIND((_C_deallocate(__result,1)));
474 	return __result;
482     _RopeRep* __result;
492 	__result = _S_leaf_concat_char_iter((_RopeLeaf*)__r, __s, __slen);
494 	  __stl_assert(1 == __result->_M_refcount);
496 	return __result;
508 	    __result = _S_tree_concat(__left, __nright);
512 	    __stl_assert(1 == __result->_M_refcount);
514 	  return __result;
521       __result = _S_tree_concat(__r, __nright);
525       __stl_assert(1 == __result->_M_refcount);
527     return __result;
536     _RopeRep* __result;
550 	__result = _S_destr_leaf_concat_char_iter((_RopeLeaf*)__r, __s, __slen);
551 	return __result;
581       __result = _S_tree_concat(__r, __right);
584     __stl_assert(1 == __result->_M_refcount);
585     return __result;
661 		_RopeRep* __result;
673 		__result = _S_concat(__left_result, __right_result);
675 		  __stl_assert(1 == __result->_M_refcount);
677 		return __result;
682 		_RopeLeaf* __result;
689 		    __result = _S_new_RopeLeaf(__section, __result_len,
691 		    __result->_M_c_string = 0;  // Not eos terminated.
694 		    __result = __STL_ROPE_FROM_UNOWNED_CHAR_PTR(
698 		return __result;
708 		    _RopeSubstring* __result =
713 		    return __result;
872 		bool __result;
877 		  __result = __c(__buffer, __len);
882 		return __result;
1083     _RopeRep* __result = 0;
1098 	  _Self_destruct_ptr __old(__result);
1100 	  __result = _S_concat(__forest[__i], __result);
1109     if (__result->_M_depth > _RopeRep::_S_max_rope_depth) abort();
1110     return(__result);
1215 		_CharT __result;
1217 		(*(__f->_M_fn))(__i, 1, &__result);
1218 		return __result;
1345     _RopeRep* __result =
1348       __stl_assert(1 <= __result->_M_refcount);
1351     _M_root->_M_tree_ptr = __result;
1375     rope<_CharT,_Alloc> __result;
1415 	  __result = __base_rope;
1417 	    __stl_assert(2 == __result._M_tree_ptr->_M_refcount);
1418 		// One each for base_rope and __result
1422 	  __result = power(__base_rope, __exponent, _Concat_fn());
1425 	  __result += __remainder_rope;
1428 	__result = __remainder_rope;
1430     _M_tree_ptr = __result._M_tree_ptr;
1453     _CharT* __result = _Data_allocate(__s + 1);
1454     _S_flatten(_M_tree_ptr, __result);
1455     __result[__s] = _S_eos((_CharT*)0);
1457 	_M_tree_ptr->_M_c_string = __result;
1460              _S_atomic_swap(&(_M_tree_ptr->_M_c_string), __result)) != 0) {
1468     return(__result);
1482     _CharT* __result = _Data_allocate(_S_rounded_up_size(__s));
1483     _S_flatten(_M_tree_ptr, __result);
1484     __result[__s] = _S_eos((_CharT*)0);
1486     _M_tree_ptr = _S_new_RopeLeaf(__result, __s, get_allocator());
1487     return(__result);