Home
last modified time | relevance | path

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

/freebsd-12.1/contrib/libstdc++/include/bits/
H A Ddeque.tcc231 std::__uninitialized_fill_a(*__cur, *__cur + _S_buffer_size(), in _M_fill_initialize()
283 std::advance(__mid, _S_buffer_size()); in _M_range_initialize()
643 std::_Destroy(*__node, *__node + _S_buffer_size(), in _M_destroy_data_aux()
666 const size_type __new_nodes = ((__new_elems + _S_buffer_size() - 1) in _M_new_elements_at_front()
667 / _S_buffer_size()); in _M_new_elements_at_front()
691 const size_type __new_nodes = ((__new_elems + _S_buffer_size() - 1) in _M_new_elements_at_back()
692 / _S_buffer_size()); in _M_new_elements_at_back()
765 std::fill(*__node, *__node + _Self::_S_buffer_size(), __value); in fill()
H A Dstl_deque.h107 static size_t _S_buffer_size() in _S_buffer_size() function
126 _M_last(*__y + _S_buffer_size()), _M_node(__y) {} in _Deque_iterator()
186 if (__offset >= 0 && __offset < difference_type(_S_buffer_size()))
191 __offset > 0 ? __offset / difference_type(_S_buffer_size())
193 / _S_buffer_size()) - 1;
196 * difference_type(_S_buffer_size()));
234 _M_last = _M_first + difference_type(_S_buffer_size()); in _M_set_node()
331 (_Deque_iterator<_Tp, _Ref, _Ptr>::_S_buffer_size())
343 (_Deque_iterator<_Tp, _RefL, _PtrL>::_S_buffer_size())
665 static size_t _S_buffer_size() in _S_buffer_size() function