Home
last modified time | relevance | path

Searched refs:_M_size (Results 1 – 6 of 6) sorted by relevance

/haiku/headers/cpp/std/
H A Dstd_valarray.h227 size_t _M_size;
285 inline valarray<_Tp>::valarray () : _M_size (0), _M_data (0) {} in valarray()
289 : _M_size (__n), _M_data (new _Tp[__n]) {} in valarray()
293 : _M_size (__n), _M_data (new _Tp[__n]) in valarray()
294 { __valarray_fill (_M_data, _M_size, __t); } in valarray()
298 : _M_size (__n), _M_data (new _Tp[__n]) in valarray()
303 : _M_size (__v._M_size), _M_data (new _Tp[__v._M_size]) in valarray()
304 { __valarray_copy (__v._M_data, _M_size, _M_data); } in valarray()
308 : _M_size (__sa._M_sz), _M_data (new _Tp[__sa._M_sz]) in valarray()
314 : _M_size (__ga._M_index.size()), _M_data (new _Tp[_M_size]) in valarray()
[all …]
H A Dgslice.h40 valarray<size_t> _M_size; member
74 { return _M_index ? _M_index->_M_size : valarray<size_t>(); } in size()
H A Dvalarray_meta.h520 : _M_array (__a._M_data+__s.start()), _M_size (__s.size()),
524 size_t size() const { return _M_size; }
528 const size_t _M_size;
/haiku/headers/cpp/
H A Dropeimpl.h44 __x._M_buf_end = __x._M_buf_start + __leaf->_M_size; in _S_setbuf()
51 size_t __leaf_end = __leaf_pos + __leaf->_M_size; in _S_setbuf()
88 __stl_assert(__pos <= __x._M_root->_M_size); in _S_setcache()
89 if (__pos >= __x._M_root->_M_size) { in _S_setcache()
97 __x._M_buf_end = __curr_rope->_M_c_string + __curr_rope->_M_size; in _S_setcache()
119 size_t __left_len = __left->_M_size; in _S_setcache()
157 size_t __len = __current_node->_M_size; in _S_setcache_for_incr()
162 __stl_assert(__x._M_current_pos <= __x._M_root->_M_size); in _S_setcache_for_incr()
177 __node_start_pos -= __c->_M_left->_M_size; in _S_setcache_for_incr()
190 __node_start_pos += __c->_M_left->_M_size; in _S_setcache_for_incr()
[all …]
H A Dstl_rope.h285 : _M_size(__size), _M_data_allocator(__a) {} in _Rope_rep_alloc_base()
286 size_t _M_size; // This is here only to avoid wasting space variable
313 : _M_size(__size) {} in _Rope_rep_alloc_base()
314 size_t _M_size; variable
353 _Rope_rep_base(size_t __size, const allocator_type&) : _M_size(__size) {} in _Rope_rep_base()
354 size_t _M_size; variable
582 __STL_FREE_STRING(_M_data, _M_size, get_allocator()); in ~_Rope_RopeLeaf()
598 __l->_M_size + __r->_M_size, __a), in _Rope_RopeConcatenation()
677 __stl_assert(__start_pos + __req_len <= _M_size); in operator()
678 __stl_assert(_M_start + _M_size <= _M_base->_M_size); in operator()
[all …]
/haiku/src/libs/stdc++/legacy/
H A Dvalarray.cc45 : _M_count(1), _M_start(__o), _M_size(__l), _M_stride(__s), in _Indexer()