HomeSort by: relevance | last modified time | path
    Searched refs:_M_size (Results 1 - 18 of 18) sorted by relevancy

  /src/external/gpl3/gcc/dist/libstdc++-v3/include/bits/
gslice.h 110 valarray<size_t> _M_size;
115 : _M_count(1), _M_start(0), _M_size(), _M_stride(), _M_index() {}
140 { return _M_index ? _M_index->_M_size : valarray<size_t>(); }
ranges_util.h 287 constexpr _Size(_Tp __s = {}) : _M_size(__s) { }
289 _Tp _M_size;
292 [[no_unique_address]] _Size<__size_type> _M_size = {};
311 : _M_begin(std::move(__i)), _M_end(__s), _M_size(__n)
369 return _M_size._M_size;
409 _M_size._M_size += __detail::__to_unsigned_like(-__n);
416 _M_size._M_size -= __detail::__to_unsigned_like(__d)
    [all...]
stl_list.h 108 std::size_t _M_size;
118 , _M_size(__x._M_size)
143 _M_size = __x._M_size;
155 this->_M_size = 0;
481 size_t _M_get_size() const { return _M_impl._M_node._M_size; }
483 void _M_set_size(size_t __n) { _M_impl._M_node._M_size = __n; }
485 void _M_inc_size(size_t __n) { _M_impl._M_node._M_size += __n; }
487 void _M_dec_size(size_t __n) { _M_impl._M_node._M_size -= __n;
    [all...]
valarray_before.h 717 : _M_array (__a._M_data+__s.start()), _M_size (__s.size()),
726 { return _M_size; }
730 const size_t _M_size;
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/
gslice.h 110 valarray<size_t> _M_size;
115 : _M_count(1), _M_start(0), _M_size(), _M_stride(), _M_index() {}
140 { return _M_index ? _M_index->_M_size : valarray<size_t>(); }
ranges_util.h 248 { _Tp _M_size; };
250 [[no_unique_address]] _Size<__size_type> _M_size = {};
272 _M_size._M_size = __n;
330 return _M_size._M_size;
370 _M_size._M_size += __detail::__to_unsigned_like(-__n);
377 _M_size._M_size -= __detail::__to_unsigned_like(__d)
    [all...]
stl_list.h 107 std::size_t _M_size;
117 , _M_size(__x._M_size)
142 _M_size = __x._M_size;
154 this->_M_size = 0;
480 size_t _M_get_size() const { return _M_impl._M_node._M_size; }
482 void _M_set_size(size_t __n) { _M_impl._M_node._M_size = __n; }
484 void _M_inc_size(size_t __n) { _M_impl._M_node._M_size += __n; }
486 void _M_dec_size(size_t __n) { _M_impl._M_node._M_size -= __n;
    [all...]
valarray_before.h 717 : _M_array (__a._M_data+__s.start()), _M_size (__s.size()),
726 { return _M_size; }
730 const size_t _M_size;
  /src/external/gpl3/gcc/dist/libstdc++-v3/include/debug/
safe_unordered_container.h 113 : _M_source(__src), _M_size(__src.size()), _M_pred { __src }
121 if (__size == _M_size)
141 const std::size_t _M_size;
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/debug/
safe_unordered_container.h 113 : _M_source(__src), _M_size(__src.size()), _M_pred { __src }
121 if (__size == _M_size)
141 const std::size_t _M_size;
  /src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/
ropeimpl.h 74 __x._M_buf_end = __x._M_buf_start + __leaf->_M_size;
81 size_t __leaf_end = __leaf_pos + __leaf->_M_size;
118 if (__pos >= __x._M_root->_M_size)
128 __x._M_buf_end = __curr_rope->_M_c_string + __curr_rope->_M_size;
151 size_t __left_len = __left->_M_size;
191 size_t __len = __current_node->_M_size;
211 __node_start_pos -= __c->_M_left->_M_size;
225 __node_start_pos += __c->_M_left->_M_size;
341 std::size_t __size = this->_M_size + 1;
427 std::size_t __old_len = __r->_M_size;
    [all...]
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/
ropeimpl.h 74 __x._M_buf_end = __x._M_buf_start + __leaf->_M_size;
81 size_t __leaf_end = __leaf_pos + __leaf->_M_size;
118 if (__pos >= __x._M_root->_M_size)
128 __x._M_buf_end = __curr_rope->_M_c_string + __curr_rope->_M_size;
151 size_t __left_len = __left->_M_size;
191 size_t __len = __current_node->_M_size;
211 __node_start_pos -= __c->_M_left->_M_size;
225 __node_start_pos += __c->_M_left->_M_size;
341 std::size_t __size = this->_M_size + 1;
427 std::size_t __old_len = __r->_M_size;
    [all...]
  /src/external/gpl3/gcc/dist/libstdc++-v3/src/c++17/
fs_path.cc 208 _Impl(int cap) : _M_size(0), _M_capacity(cap) { }
210 alignas(value_type) int _M_size;
226 int size() const { return _M_size; }
228 bool empty() const { return _M_size == 0; }
230 void clear() { std::destroy_n(begin(), _M_size); _M_size = 0; }
235 --_M_size;
243 _M_size -= last - first;
252 newptr->_M_size = n;
269 __glibcxx_assert(p->_M_size <= p->_M_capacity)
    [all...]
memory_resource.cc 272 size_t __size = __ch->_M_size.size();
273 size_t __align = __ch->_M_size.alignment();
281 : _M_size(__size, __align), _M_next(__next)
284 aligned_size<64> _M_size;
321 : _M_words(static_cast<word*>(p)), _M_size(num_blocks),
326 // Set bits beyond _M_size, so they are not treated as free blocks:
337 size_type size() const noexcept { return _M_size; }
381 _M_size = _M_next_word = 0;
386 __glibcxx_assert( n < _M_size );
411 __glibcxx_assert( n < _M_size );
    [all...]
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/src/c++17/
fs_path.cc 207 _Impl(int cap) : _M_size(0), _M_capacity(cap) { }
209 alignas(value_type) int _M_size;
225 int size() const { return _M_size; }
227 bool empty() const { return _M_size == 0; }
229 void clear() { std::destroy_n(begin(), _M_size); _M_size = 0; }
234 --_M_size;
242 _M_size -= last - first;
251 newptr->_M_size = n;
268 __glibcxx_assert(p->_M_size <= p->_M_capacity)
    [all...]
memory_resource.cc 272 size_t __size = __ch->_M_size.size();
273 size_t __align = __ch->_M_size.alignment();
281 : _M_size(__size, __align), _M_next(__next)
284 aligned_size<64> _M_size;
321 : _M_words(static_cast<word*>(p)), _M_size(num_blocks),
326 // Set bits beyond _M_size, so they are not treated as free blocks:
337 size_type size() const noexcept { return _M_size; }
381 _M_size = _M_next_word = 0;
386 __glibcxx_assert( n < _M_size );
411 __glibcxx_assert( n < _M_size );
    [all...]
  /src/external/gpl3/gcc/dist/libstdc++-v3/src/c++98/
valarray.cc 108 : _M_count(1), _M_start(__o), _M_size(__l), _M_stride(__s),
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/src/c++98/
valarray.cc 108 : _M_count(1), _M_start(__o), _M_size(__l), _M_stride(__s),

Completed in 39 milliseconds