_S_concat
if (_RopeRep::_S_concat == __r->_M_tag) {
__result = _S_concat(__forest[__i], __result);
__stl_assert(__r->_M_tag == _RopeRep::_S_concat);
case _RopeRep::_S_concat:
case _RopeRep::_S_concat:
case _RopeRep::_S_concat:
_My_rope::_S_concat(__result_left, __right);
while (_RopeRep::_S_concat == __current_node->_M_tag) {
case _S_concat:
if (_RopeRep::_S_concat == __r->_M_tag
if (_RopeRep::_S_concat == __r->_M_tag) {
} else if (_RopeRep::_S_concat == __left->_M_tag
case _RopeRep::_S_concat:
__result = _S_concat(__left_result, __right_result);
case _RopeRep::_S_concat:
case _RopeRep::_S_concat:
static _RopeRep* _S_concat(_RopeRep* __left, _RopeRep* __right);
_RopeRep* __result = _S_concat(__left, __right);
_M_tree_ptr = _S_concat(__left, _M_tree_ptr);
_S_concat(_M_tree_ptr, (_RopeRep*)__appendee);
_RopeRep* __result = _S_concat(_M_tree_ptr, __y._M_tree_ptr);
__result = _S_concat(__left, __right);
_Self_destruct_ptr __left_result(_S_concat(__left, __r));
__result = _S_concat(__left_result, __right);
_RopeRep* __result = _S_concat(__left_result, __right);
rope<_CharT,_Alloc>::_S_concat(__left._M_tree_ptr, __right._M_tree_ptr));
_S_concat, max(__l->_M_depth, __r->_M_depth) + 1, false,