Lines Matching refs:__bufsiz
98 template <class _Tp, class _Ref, class _Ptr, size_t __bufsiz>
100 typedef _Deque_iterator<_Tp,_Tp&,_Tp*,__bufsiz> iterator;
101 typedef _Deque_iterator<_Tp,const _Tp&,const _Tp*,__bufsiz> const_iterator;
103 _S_buffer_size() { return __deque_buf_size(__bufsiz, sizeof(_Tp)); } in _S_buffer_size()
223 template <class _Tp, class _Ref, class _Ptr, size_t __bufsiz>
225 iterator_category(const _Deque_iterator<_Tp,_Ref,_Ptr,__bufsiz>&) { in iterator_category() argument
229 template <class _Tp, class _Ref, class _Ptr, size_t __bufsiz>
231 value_type(const _Deque_iterator<_Tp,_Ref,_Ptr,__bufsiz>&) { in value_type() argument
235 template <class _Tp, class _Ref, class _Ptr, size_t __bufsiz>
237 distance_type(const _Deque_iterator<_Tp,_Ref,_Ptr,__bufsiz>&) { in distance_type() argument
273 template <class _Tp, class _Alloc, size_t __bufsiz, bool __is_static>
291 return node_allocator.allocate(__deque_buf_size(__bufsiz,sizeof(_Tp))); in _M_allocate_node()
294 node_allocator.deallocate(__p, __deque_buf_size(__bufsiz,sizeof(_Tp))); in _M_deallocate_node()
306 template <class _Tp, class _Alloc, size_t __bufsiz>
307 class _Deque_alloc_base<_Tp, _Alloc, __bufsiz, true>
320 { return _Node_alloc_type::allocate(__deque_buf_size(__bufsiz, in _M_allocate_node()
323 { _Node_alloc_type::deallocate(__p, __deque_buf_size(__bufsiz, in _M_deallocate_node()
334 template <class _Tp, class _Alloc, size_t __bufsiz>
336 : public _Deque_alloc_base<_Tp,_Alloc,__bufsiz,
340 typedef _Deque_alloc_base<_Tp,_Alloc,__bufsiz,
344 typedef _Deque_iterator<_Tp,_Tp&,_Tp*,__bufsiz> iterator;
345 typedef _Deque_iterator<_Tp,const _Tp&,const _Tp*, __bufsiz> const_iterator;
367 template <class _Tp, class _Alloc, size_t __bufsiz>
371 typedef _Deque_iterator<_Tp,_Tp&,_Tp*,__bufsiz> iterator;
372 typedef _Deque_iterator<_Tp,const _Tp&,const _Tp*, __bufsiz> const_iterator;
405 { return _Node_alloc_type::allocate(__deque_buf_size(__bufsiz, in _M_allocate_node()
408 { _Node_alloc_type::deallocate(__p, __deque_buf_size(__bufsiz, in _M_deallocate_node()
420 template <class _Tp, class _Alloc, size_t __bufsiz>
421 _Deque_base<_Tp,_Alloc,__bufsiz>::~_Deque_base() { in ~_Deque_base()
428 template <class _Tp, class _Alloc, size_t __bufsiz>
430 _Deque_base<_Tp,_Alloc,__bufsiz>::_M_initialize_map(size_t __num_elements) in _M_initialize_map()
433 __num_elements / __deque_buf_size(__bufsiz, sizeof(_Tp)) + 1; in _M_initialize_map()
450 __num_elements % __deque_buf_size(__bufsiz, sizeof(_Tp)); in _M_initialize_map()
453 template <class _Tp, class _Alloc, size_t __bufsiz>
455 _Deque_base<_Tp,_Alloc,__bufsiz>::_M_create_nodes(_Tp** __nstart, in _M_create_nodes()
466 template <class _Tp, class _Alloc, size_t __bufsiz>
468 _Deque_base<_Tp,_Alloc,__bufsiz>::_M_destroy_nodes(_Tp** __nstart, in _M_destroy_nodes()
479 size_t __bufsiz = 0>
480 class deque : protected _Deque_base<_Tp, _Alloc, __bufsiz> {
481 typedef _Deque_base<_Tp, _Alloc, __bufsiz> _Base;
512 { return __deque_buf_size(__bufsiz, sizeof(_Tp)); } in _S_buffer_size()
1657 template <class _Tp, class _Alloc, size_t __bufsiz>
1658 bool operator==(const deque<_Tp, _Alloc, __bufsiz>& __x,
1659 const deque<_Tp, _Alloc, __bufsiz>& __y)
1665 template <class _Tp, class _Alloc, size_t __bufsiz>
1666 bool operator<(const deque<_Tp, _Alloc, __bufsiz>& __x,
1667 const deque<_Tp, _Alloc, __bufsiz>& __y)
1678 template <class _Tp, class _Alloc, size_t __bufsiz>
1680 swap(deque<_Tp,_Alloc,__bufsiz>& __x, deque<_Tp,_Alloc,__bufsiz>& __y) in swap()