Searched refs:_M_data (Results 1 - 7 of 7) sorted by relevance

/haiku/headers/cpp/std/
H A Dvalarray_array.h116 _Tp* const __restrict__ _M_data; member in struct:_Array
122 { __valarray_fill (__a._M_data, __n, __t); }
127 { __valarray_fill (__a._M_data, __n, __s, __t); }
133 { __valarray_fill (__a._M_data, __i._M_data, __n, __t); }
138 { __valarray_copy (__a._M_data, __n, __b._M_data); }
143 { __valarray_copy(__a._M_data, __n, __s, __b._M_data); }
148 { __valarray_copy (__a._M_data, __
[all...]
H A Dstd_valarray.h228 _Tp* __restrict__ _M_data; member in class:valarray
266 { return _M_data[__i]; }
271 { return _M_data[__i]; }
285 inline valarray<_Tp>::valarray () : _M_size (0), _M_data (0) {}
289 : _M_size (__n), _M_data (new _Tp[__n]) {}
293 : _M_size (__n), _M_data (new _Tp[__n])
294 { __valarray_fill (_M_data, _M_size, __t); }
298 : _M_size (__n), _M_data (new _Tp[__n])
299 { __valarray_copy (__pT, __n, _M_data); }
303 : _M_size (__v._M_size), _M_data (ne
[all...]
H A Dvalarray_meta.h520 : _M_array (__a._M_data+__s.start()), _M_size (__s.size()),
523 { return _M_array._M_data[__i * _M_stride]; }
572 { return _M_array._M_data[_M_index[__i]]; }
/haiku/headers/cpp/
H A Dstl_slist.h100 _Tp _M_data; member in struct:_Slist_node
138 reference operator*() const { return ((_Node*) _M_node)->_M_data; }
245 destroy(&__next->_M_data);
272 destroy(&__next->_M_data);
292 destroy(&__tmp->_M_data);
327 construct(&__node->_M_data, __x);
337 construct(&__node->_M_data);
435 reference front() { return ((_Node*) _M_head._M_next)->_M_data; }
437 { return ((_Node*) _M_head._M_next)->_M_data; }
445 destroy(&__node->_M_data);
[all...]
H A Dropeimpl.h42 ((_Rope_RopeLeaf<_CharT,_Alloc>*)__leaf)->_M_data;
393 uninitialized_copy_n(__r->_M_data, __old_len, __new_data);
419 uninitialized_copy_n(__iter, __len, __r->_M_data + __old_len);
421 _S_cond_store_eos(__r->_M_data[__old_len + __len]);
422 __stl_assert(__r->_M_c_string == __r->_M_data);
423 } else if (__r->_M_c_string != __r->_M_data && 0 != __r->_M_c_string) {
605 ((_RopeLeaf*)__right)->_M_data,
616 ((_RopeLeaf*)__right)->_M_data,
688 const _CharT* __section = __l->_M_data + __start;
695 __l->_M_data
[all...]
H A Dstl_list.h46 _Tp _M_data; member in struct:_List_node
71 reference operator*() const { return (*_M_node)._M_data; }
239 destroy(&__tmp->_M_data);
293 construct(&__p->_M_data, __x);
303 construct(&__p->_M_data);
389 destroy(&__position._M_node->_M_data);
526 if (__n1->_M_data != __n2->_M_data)
H A Dstl_rope.h558 __GC_CONST _CharT* _M_data; /* Not necessarily 0 terminated. */ member in struct:_Rope_RopeLeaf
566 _M_data(__d)
579 if (_M_data != _M_c_string) {
582 __STL_FREE_STRING(_M_data, _M_size, get_allocator());
685 ((_Rope_RopeLeaf<_CharT,_Alloc>*)_M_base)->_M_data;
1786 ((_RopeLeaf*)_M_tree_ptr)->_M_data ==

Completed in 90 milliseconds