Lines Matching refs:_M_size
84 __x._M_buf_end = __x._M_buf_start + __leaf->_M_size;
91 size_t __leaf_end = __leaf_pos + __leaf->_M_size;
127 if (__pos >= __x._M_root->_M_size)
137 __x._M_buf_end = __curr_rope->_M_c_string + __curr_rope->_M_size;
160 size_t __left_len = __left->_M_size;
199 size_t __len = __current_node->_M_size;
219 __node_start_pos -= __c->_M_left->_M_size;
233 __node_start_pos += __c->_M_left->_M_size;
349 size_t __size = this->_M_size + 1;
434 size_t __old_len = __r->_M_size;
466 size_t __old_len = __r->_M_size;
479 __r->_M_size = __old_len + __len;
505 && (__result->_M_size < 1000
545 && __r->_M_size + __slen <= size_t(_S_copy_max))
555 if (__right->_M_size + __slen <= size_t(_S_copy_max))
599 size_t __orig_size = __r->_M_size;
619 && __right->_M_size + __slen <= size_t(_S_copy_max))
629 __r->_M_size = __orig_size + __slen;
672 if (__right->_M_size + __left->_M_size <= size_t(_S_copy_max))
675 __right->_M_size);
683 if (__leftright->_M_size
684 + __right->_M_size <= size_t(_S_copy_max))
691 __right->_M_size);
723 size_t __len = __base->_M_size;
748 size_t __left_len = __left->_M_size;
937 size_t __left_len = __left->_M_size;
1095 return copy_n(__l->_M_data, __l->_M_size, __buffer).second;
1103 (*(__f->_M_fn))(0, __f->_M_size, __buffer);
1104 return __buffer + __f->_M_size;
1132 __r, __r->_M_depth, __r->_M_size,
1137 __r, __r->_M_ref_count, __r->_M_depth, __r->_M_size,
1164 __kind, __r, __r->_M_depth, __r->_M_size);
1167 __kind, __r, __r->_M_ref_count, __r->_M_depth, __r->_M_size);
1174 bool __too_big = __r->_M_size > __prefix->_M_size;
1177 __buffer[__prefix->_M_size] = _S_eos((_CharT*)0);
1213 // __forest[__i]._M_size >= _S_min_len[__i]
1275 size_t __s = __r->_M_size;
1311 || __insertee->_M_size < _S_min_len[__i+1])
1337 size_t __left_len = __left->_M_size;
1387 size_t __left_len = __left->_M_size;
1438 __left_len = __left->_M_size;
1439 __right_len = __right->_M_size;
1500 __old->_M_size));