headers/cpp/ropeimpl.h

1005

if (_RopeRep::_S_concat == __r->_M_tag) {

headers/cpp/ropeimpl.h

1007

_RopeRep* __left = __c->_M_left;

headers/cpp/ropeimpl.h

1008

_RopeRep* __right = __c->_M_right;

headers/cpp/ropeimpl.h

1026

case _RopeRep::_S_leaf:

headers/cpp/ropeimpl.h

1029

case _RopeRep::_S_function:

headers/cpp/ropeimpl.h

1032

case _RopeRep::_S_substringfn:

headers/cpp/ropeimpl.h

106

__stl_assert(__curr_depth <= _RopeRep::_S_max_rope_depth);

headers/cpp/ropeimpl.h

1079

rope<_CharT,_Alloc>::_RopeRep*

headers/cpp/ropeimpl.h

1080

rope<_CharT,_Alloc>::_S_balance(_RopeRep* __r)

headers/cpp/ropeimpl.h

1082

_RopeRep* __forest[_RopeRep::_S_max_rope_depth + 1];

headers/cpp/ropeimpl.h

1083

_RopeRep* __result = 0;

headers/cpp/ropeimpl.h

109

case _RopeRep::_S_leaf:

headers/cpp/ropeimpl.h

1091

for (__i = 0; __i <= _RopeRep::_S_max_rope_depth; ++__i)

headers/cpp/ropeimpl.h

1095

for (__i = 0; __i <= _RopeRep::_S_max_rope_depth; ++__i)

headers/cpp/ropeimpl.h

110

case _RopeRep::_S_function:

headers/cpp/ropeimpl.h

1107

__STL_UNWIND(for(__i = 0; __i <= _RopeRep::_S_max_rope_depth; __i++)

headers/cpp/ropeimpl.h

1109

if (__result->_M_depth > _RopeRep::_S_max_rope_depth) abort();

headers/cpp/ropeimpl.h

111

case _RopeRep::_S_substringfn:

headers/cpp/ropeimpl.h

1116

rope<_CharT,_Alloc>::_S_add_to_forest(_RopeRep* __r, _RopeRep** __forest)

headers/cpp/ropeimpl.h

1122

__stl_assert(__r->_M_tag == _RopeRep::_S_concat);

headers/cpp/ropeimpl.h

1134

rope<_CharT,_Alloc>::_S_add_leaf_to_forest(_RopeRep* __r, _RopeRep** __forest)

headers/cpp/ropeimpl.h

1136

_RopeRep* __insertee; // included in refcount

headers/cpp/ropeimpl.h

1137

_RopeRep* __too_tiny = 0; // included in refcount

headers/cpp/ropeimpl.h

114

case _RopeRep::_S_concat:

headers/cpp/ropeimpl.h

1173

if (__i == _RopeRep::_S_max_rope_depth ||

headers/cpp/ropeimpl.h

118

_RopeRep* __left = __c->_M_left;

headers/cpp/ropeimpl.h

1184

rope<_CharT,_Alloc>::_S_fetch(_RopeRep* __r, size_type __i)

headers/cpp/ropeimpl.h

1192

case _RopeRep::_S_concat:

headers/cpp/ropeimpl.h

1195

_RopeRep* __left = __c->_M_left;

headers/cpp/ropeimpl.h

1206

case _RopeRep::_S_leaf:

headers/cpp/ropeimpl.h

1211

case _RopeRep::_S_function:

headers/cpp/ropeimpl.h

1212

case _RopeRep::_S_substringfn:

headers/cpp/ropeimpl.h

1229

rope<_CharT,_Alloc>::_S_fetch_ptr(_RopeRep* __r, size_type __i)

headers/cpp/ropeimpl.h

1231

_RopeRep* __clrstack[_RopeRep::_S_max_rope_depth];

headers/cpp/ropeimpl.h

1237

case _RopeRep::_S_concat:

headers/cpp/ropeimpl.h

1240

_RopeRep* __left = __c->_M_left;

headers/cpp/ropeimpl.h

1252

case _RopeRep::_S_leaf:

headers/cpp/ropeimpl.h

1259

_RopeRep* __d = __clrstack[__csptr];

headers/cpp/ropeimpl.h

1265

case _RopeRep::_S_function:

headers/cpp/ropeimpl.h

1266

case _RopeRep::_S_substringfn:

headers/cpp/ropeimpl.h

1279

rope<_CharT,_Alloc>::_S_compare (const _RopeRep* __left,

headers/cpp/ropeimpl.h

1280

const _RopeRep* __right)

headers/cpp/ropeimpl.h

1289

if (_RopeRep::_S_leaf == __left->_M_tag) {

headers/cpp/ropeimpl.h

1291

if (_RopeRep::_S_leaf == __right->_M_tag) {

headers/cpp/ropeimpl.h

1306

if (_RopeRep::_S_leaf == __right->_M_tag) {

headers/cpp/ropeimpl.h

1325

_RopeRep* __old = _M_root->_M_tree_ptr;

headers/cpp/ropeimpl.h

1345

_RopeRep* __result =

headers/cpp/ropeimpl.h

1349

_RopeRep::_S_unref(__old);

headers/cpp/ropeimpl.h

1380

_RopeRep* __remainder;

headers/cpp/ropeimpl.h

1397

__STL_UNWIND(_RopeRep::__STL_FREE_STRING(__rest_buffer, __rest, __a))

headers/cpp/ropeimpl.h

1411

__STL_UNWIND(_RopeRep::__STL_FREE_STRING(__base_buffer,

headers/cpp/ropeimpl.h

1478

if (_RopeRep::_S_leaf == _M_tree_ptr->_M_tag && 0 != __old_c_string) {

headers/cpp/ropeimpl.h

156

const _RopeRep* __current_node = __x._M_path_end[__current_index];

headers/cpp/ropeimpl.h

194

while (_RopeRep::_S_concat == __current_node->_M_tag) {

headers/cpp/ropeimpl.h

248

_RopeRep::_S_unref(_M_root);

headers/cpp/ropeimpl.h

250

_RopeRep::_S_ref(_M_root);

headers/cpp/ropeimpl.h

268

_RopeRep::_S_ref(_M_root);

headers/cpp/ropeimpl.h

35

const _RopeRep* __leaf = __x._M_path_end[__x._M_leaf_index];

headers/cpp/ropeimpl.h

40

case _RopeRep::_S_leaf:

headers/cpp/ropeimpl.h

400

__STL_UNWIND(_RopeRep::__STL_FREE_STRING(__new_data, __old_len + __len,

headers/cpp/ropeimpl.h

443

rope<_CharT,_Alloc>::_RopeRep*

headers/cpp/ropeimpl.h

444

rope<_CharT,_Alloc>::_S_tree_concat (_RopeRep* __left, _RopeRep* __right)

headers/cpp/ropeimpl.h

454

__depth > _RopeRep::_S_max_rope_depth)) {

headers/cpp/ropeimpl.h

455

_RopeRep* __balanced;

headers/cpp/ropeimpl.h

46

case _RopeRep::_S_function:

headers/cpp/ropeimpl.h

47

case _RopeRep::_S_substringfn:

headers/cpp/ropeimpl.h

479

rope<_CharT,_Alloc>::_RopeRep* rope<_CharT,_Alloc>::_S_concat_char_iter

headers/cpp/ropeimpl.h

480

(_RopeRep* __r, const _CharT*__s, size_t __slen)

headers/cpp/ropeimpl.h

482

_RopeRep* __result;

headers/cpp/ropeimpl.h

490

if (_RopeRep::_S_leaf == __r->_M_tag &&

headers/cpp/ropeimpl.h

498

if (_RopeRep::_S_concat == __r->_M_tag

headers/cpp/ropeimpl.h

499

&& _RopeRep::_S_leaf == ((_RopeConcatenation*)__r)->_M_right->_M_tag) {

headers/cpp/ropeimpl.h

503

_RopeRep* __left = ((_RopeConcatenation*)__r)->_M_left;

headers/cpp/ropeimpl.h

504

_RopeRep* __nright =

headers/cpp/ropeimpl.h

517

_RopeRep* __nright =

headers/cpp/ropeimpl.h

532

rope<_CharT,_Alloc>::_RopeRep*

headers/cpp/ropeimpl.h

534

_RopeRep* __r, const _CharT* __s, size_t __slen)

headers/cpp/ropeimpl.h

536

_RopeRep* __result;

headers/cpp/ropeimpl.h

549

_RopeRep::_S_leaf == __r->_M_tag) {

headers/cpp/ropeimpl.h

553

if (_RopeRep::_S_concat == __r->_M_tag) {

headers/cpp/ropeimpl.h

555

if (_RopeRep::_S_leaf == __right->_M_tag

headers/cpp/ropeimpl.h

557

_RopeRep* __new_right =

headers/cpp/ropeimpl.h

577

_RopeRep* __right =

headers/cpp/ropeimpl.h

590

rope<_CharT,_Alloc>::_RopeRep*

headers/cpp/ropeimpl.h

591

rope<_CharT,_Alloc>::_S_concat(_RopeRep* __left, _RopeRep* __right)

headers/cpp/ropeimpl.h

601

if (_RopeRep::_S_leaf == __right->_M_tag) {

headers/cpp/ropeimpl.h

602

if (_RopeRep::_S_leaf == __left->_M_tag) {

headers/cpp/ropeimpl.h

608

} else if (_RopeRep::_S_concat == __left->_M_tag

headers/cpp/ropeimpl.h

609

&& _RopeRep::_S_leaf ==

headers/cpp/ropeimpl.h

614

_RopeRep* __leftleft = ((_RopeConcatenation*)__left)->_M_left;

headers/cpp/ropeimpl.h

615

_RopeRep* __rest = _S_leaf_concat_char_iter(__leftright,

headers/cpp/ropeimpl.h

635

rope<_CharT,_Alloc>::_RopeRep*

headers/cpp/ropeimpl.h

636

rope<_CharT,_Alloc>::_S_substring(_RopeRep* __base,

headers/cpp/ropeimpl.h

655

case _RopeRep::_S_concat:

headers/cpp/ropeimpl.h

658

_RopeRep* __left = __c->_M_left;

headers/cpp/ropeimpl.h

659

_RopeRep* __right = __c->_M_right;

headers/cpp/ropeimpl.h

661

_RopeRep* __result;

headers/cpp/ropeimpl.h

679

case _RopeRep::_S_leaf:

headers/cpp/ropeimpl.h

700

case _RopeRep::_S_substringfn:

headers/cpp/ropeimpl.h

717

case _RopeRep::_S_function:

headers/cpp/ropeimpl.h

731

__STL_UNWIND(_RopeRep::__STL_FREE_STRING(

headers/cpp/ropeimpl.h

81

const _RopeRep* __path[_RopeRep::_S_max_rope_depth+1];

headers/cpp/ropeimpl.h

82

const _RopeRep* __curr_rope;

headers/cpp/ropeimpl.h

836

const _RopeRep* __r,

headers/cpp/ropeimpl.h

841

case _RopeRep::_S_concat:

headers/cpp/ropeimpl.h

844

_RopeRep* __left = __conc->_M_left;

headers/cpp/ropeimpl.h

852

_RopeRep* __right = __conc->_M_right;

headers/cpp/ropeimpl.h

862

case _RopeRep::_S_leaf:

headers/cpp/ropeimpl.h

867

case _RopeRep::_S_function:

headers/cpp/ropeimpl.h

868

case _RopeRep::_S_substringfn:

headers/cpp/ropeimpl.h

938

rope<_CharT,_Alloc>::_S_flatten(_RopeRep* __r,

headers/cpp/ropeimpl.h

962

rope<_CharT,_Alloc>::_S_flatten(_RopeRep* __r, _CharT* __buffer)

headers/cpp/ropeimpl.h

966

case _RopeRep::_S_concat:

headers/cpp/ropeimpl.h

969

_RopeRep* __left = __c->_M_left;

headers/cpp/ropeimpl.h

970

_RopeRep* __right = __c->_M_right;

headers/cpp/ropeimpl.h

974

case _RopeRep::_S_leaf:

headers/cpp/ropeimpl.h

979

case _RopeRep::_S_function:

headers/cpp/ropeimpl.h

980

case _RopeRep::_S_substringfn:

headers/cpp/ropeimpl.h

999

rope<_CharT,_Alloc>::_S_dump(_RopeRep* __r, int __indent)

headers/cpp/stl_rope.h

1046

{ _RopeRep::_S_ref(_M_root); }

headers/cpp/stl_rope.h

1061

_RopeRep::_S_ref(_M_root);

headers/cpp/stl_rope.h

1065

_RopeRep::_S_unref(_M_root);

headers/cpp/stl_rope.h

1068

_RopeRep* __old = _M_root;

headers/cpp/stl_rope.h

1070

_RopeRep::_S_ref(__x._M_root);

headers/cpp/stl_rope.h

1080

_RopeRep::_S_unref(__old);

headers/cpp/stl_rope.h

1170

_Rope_alloc_base(_RopeRep *__t, const allocator_type& __a)

headers/cpp/stl_rope.h

1178

_RopeRep* _M_tree_ptr;

headers/cpp/stl_rope.h

1200

_Rope_alloc_base(_RopeRep *__t, const allocator_type&)

headers/cpp/stl_rope.h

1206

_RopeRep *_M_tree_ptr;

headers/cpp/stl_rope.h

1230

_Rope_base(_RopeRep* __t, const allocator_type& __a) : _Base(__t, __a) {}

headers/cpp/stl_rope.h

1242

_Rope_base(_RopeRep * __t, const allocator_type&) : _M_tree_ptr(__t) {}

headers/cpp/stl_rope.h

1247

_RopeRep* _M_tree_ptr;

headers/cpp/stl_rope.h

1339

static _CharT _S_fetch(_RopeRep* __r, size_type __pos);

headers/cpp/stl_rope.h

1348

static _CharT* _S_fetch_ptr(_RopeRep* __r, size_type __pos);

headers/cpp/stl_rope.h

1354

const _RopeRep* __r,

headers/cpp/stl_rope.h

1359

static void _S_unref(_RopeRep* __t)

headers/cpp/stl_rope.h

1361

_RopeRep::_S_unref(__t);

headers/cpp/stl_rope.h

1363

static void _S_ref(_RopeRep* __t)

headers/cpp/stl_rope.h

1365

_RopeRep::_S_ref(__t);

headers/cpp/stl_rope.h

1368

static void _S_unref(_RopeRep*) {}

headers/cpp/stl_rope.h

1369

static void _S_ref(_RopeRep*) {}

headers/cpp/stl_rope.h

1380

static _RopeRep* _S_substring(_RopeRep* __base,

headers/cpp/stl_rope.h

1383

static _RopeRep* _S_concat_char_iter(_RopeRep* __r,

headers/cpp/stl_rope.h

1388

static _RopeRep* _S_destr_concat_char_iter(_RopeRep* __r,

headers/cpp/stl_rope.h

1400

static _RopeRep* _S_concat(_RopeRep* __left, _RopeRep* __right);

headers/cpp/stl_rope.h

1439

_RopeRep* __left, _RopeRep* __right,

headers/cpp/stl_rope.h

1500

__STL_UNWIND(_RopeRep::__STL_FREE_STRING(__buf, __size, __a))

headers/cpp/stl_rope.h

1510

static _RopeRep*

headers/cpp/stl_rope.h

1511

_S_tree_concat(_RopeRep* __left, _RopeRep* __right);

headers/cpp/stl_rope.h

1546

rope(_RopeRep* __t, const allocator_type& __a = allocator_type())

headers/cpp/stl_rope.h

1553

static _CharT* _S_flatten(_RopeRep* __r, _CharT* __buffer);

headers/cpp/stl_rope.h

1557

static _CharT* _S_flatten(_RopeRep* __r,

headers/cpp/stl_rope.h

1562

_S_min_len[_RopeRep::_S_max_rope_depth + 1];

headers/cpp/stl_rope.h

1564

static bool _S_is_balanced(_RopeRep* __r)

headers/cpp/stl_rope.h

1567

static bool _S_is_almost_balanced(_RopeRep* __r)

headers/cpp/stl_rope.h

1571

static bool _S_is_roughly_balanced(_RopeRep* __r)

headers/cpp/stl_rope.h

1576

static _RopeRep* _S_concat_and_set_balanced(_RopeRep* __left,

headers/cpp/stl_rope.h

1577

_RopeRep* __right)

headers/cpp/stl_rope.h

1579

_RopeRep* __result = _S_concat(__left, __right);

headers/cpp/stl_rope.h

1589

static _RopeRep* _S_balance(_RopeRep* __r);

headers/cpp/stl_rope.h

1593

static void _S_add_to_forest(_RopeRep*__r, _RopeRep** __forest);

headers/cpp/stl_rope.h

1596

static void _S_add_leaf_to_forest(_RopeRep* __r, _RopeRep** __forest);

headers/cpp/stl_rope.h

1599

static void _S_dump(_RopeRep* __r, int __indent = 0);

headers/cpp/stl_rope.h

1602

static int _S_compare(const _RopeRep* __x, const _RopeRep* __y);

headers/cpp/stl_rope.h

1653

__STL_UNWIND(_RopeRep::__STL_FREE_STRING(__buf, 1, __a))

headers/cpp/stl_rope.h

1684

_RopeRep* __old = _M_tree_ptr;

headers/cpp/stl_rope.h

1696

_RopeRep* __old = _M_tree_ptr;

headers/cpp/stl_rope.h

1703

_RopeRep* __old = _M_tree_ptr;

headers/cpp/stl_rope.h

1716

_RopeRep* __old = _M_tree_ptr;

headers/cpp/stl_rope.h

1717

_RopeRep* __left =

headers/cpp/stl_rope.h

1729

_RopeRep* __old = _M_tree_ptr;

headers/cpp/stl_rope.h

1741

_RopeRep* __old = _M_tree_ptr;

headers/cpp/stl_rope.h

1785

if (_RopeRep::_S_leaf == _M_tree_ptr->_M_tag &&

headers/cpp/stl_rope.h

1832

return _S_min_len[_RopeRep::_S_max_rope_depth-1] - 1;

headers/cpp/stl_rope.h

1880

_RopeRep* __result =

headers/cpp/stl_rope.h

1894

_RopeRep* __result =

headers/cpp/stl_rope.h

1908

_RopeRep* __result =

headers/cpp/stl_rope.h

1909

_S_concat(_M_tree_ptr, (_RopeRep*)__appendee);

headers/cpp/stl_rope.h

1916

_RopeRep* __result =

headers/cpp/stl_rope.h

1929

_RopeRep* __result = _S_concat(_M_tree_ptr, __y._M_tree_ptr);

headers/cpp/stl_rope.h

1944

_RopeRep* __tmp = _M_tree_ptr;

headers/cpp/stl_rope.h

1952

static _RopeRep* replace(_RopeRep* __old, size_t __pos1,

headers/cpp/stl_rope.h

1953

size_t __pos2, _RopeRep* __r) {

headers/cpp/stl_rope.h

1959

_RopeRep* __result;

headers/cpp/stl_rope.h

1975

_RopeRep* __result =

headers/cpp/stl_rope.h

1994

_RopeRep* __result = _S_concat(__left_result, __right);

headers/cpp/stl_rope.h

2032

_RopeRep* __result =

headers/cpp/stl_rope.h

2106

_RopeRep* __result = replace(_M_tree_ptr, __p, __p + __n, 0);

headers/cpp/stl_rope.h

869

_RopeRep* _M_root; // The whole rope.

headers/cpp/stl_rope.h

883

const _RopeRep* _M_path_end[_S_path_cache_len];

headers/cpp/stl_rope.h

910

_Rope_iterator_base(_RopeRep* __root, size_t __pos)

headers/cpp/stl_rope.h

933

_Rope_const_iterator(const _RopeRep* __root, size_t __pos):

headers/cpp/stl_rope.h

935

const_cast<_RopeRep*>(__root), __pos)