Home
last modified time | relevance | path

Searched refs:_M_depth (Results 1 – 2 of 2) sorted by relevance

/haiku/headers/cpp/
H A Dropeimpl.h448 size_t __depth = __result->_M_depth; in _S_tree_concat()
1012 __r, __r->_M_depth, __r->_M_size, __r->_M_is_balanced? "" : "not"); in _S_dump()
1016 __r, __r->_M_refcount, __r->_M_depth, __r->_M_size, in _S_dump()
1040 __kind, __r, __r->_M_depth, __r->_M_size); in _S_dump()
1043 __kind, __r, __r->_M_refcount, __r->_M_depth, __r->_M_size); in _S_dump()
1109 if (__result->_M_depth > _RopeRep::_S_max_rope_depth) abort(); in _S_balance()
1160 __stl_assert(__insertee->_M_depth <= __r->_M_depth + 1); in _S_add_leaf_to_forest()
H A Dstl_rope.h378 unsigned char _M_depth; member
390 _M_tag(__t), _M_depth(__d), _M_is_balanced(__b), _M_c_string(0) in _Rope_RopeRep()
597 _S_concat, max(__l->_M_depth, __r->_M_depth) + 1, false, in _Rope_RopeConcatenation()
1565 { return (__r->_M_size >= _S_min_len[__r->_M_depth]); }
1568 { return (__r->_M_depth == 0 ||
1569 __r->_M_size >= _S_min_len[__r->_M_depth - 1]); }
1572 { return (__r->_M_depth <= 1 ||
1573 __r->_M_size >= _S_min_len[__r->_M_depth - 2]); }