headers/cpp/stl_deque.h

117   typedef size_t size_type;
488   typedef size_t size_type;
543   reference operator[](size_type __n)
545   const_reference operator[](size_type __n) const
561   size_type size() const { return _M_finish - _M_start;; }
562   size_type max_size() const { return size_type(-1); }
570   deque(size_type __n, const value_type& __value,
573   explicit deque(size_type __n) : _Base(allocator_type(), __n)
614     const size_type __len = size();
640   void assign(size_type __n, const _Tp& __val) {
663     { assign((size_type) __n, (_Tp) __val); }
678     size_type __len = 0;
770   void insert(iterator __pos, size_type __n, const value_type& __x);
784     insert(__pos, (size_type) __n, (value_type) __x);
803   void resize(size_type __new_size, const value_type& __x) {
804     const size_type __len = size();
811   void resize(size_type new_size) { resize(new_size, value_type()); }
818     if (static_cast<size_type>(__index) < (size() >> 1)) {
874   void _M_insert_aux(iterator __pos, size_type __n, const value_type& __x);
881                      size_type __n);
887                      size_type __n);
891                      size_type __n);
895   iterator _M_reserve_elements_at_front(size_type __n) {
896     size_type __vacancies = _M_start._M_cur - _M_start._M_first;
902   iterator _M_reserve_elements_at_back(size_type __n) {
903     size_type __vacancies = (_M_finish._M_last - _M_finish._M_cur) - 1;
909   void _M_new_elements_at_front(size_type __new_elements);
910   void _M_new_elements_at_back(size_type __new_elements);
918   void _M_reserve_map_at_back (size_type __nodes_to_add = 1) {
923   void _M_reserve_map_at_front (size_type __nodes_to_add = 1) {
924     if (__nodes_to_add > size_type(_M_start._M_node - _M_map))
928   void _M_reallocate_map(size_type __nodes_to_add, bool __add_at_front);
967                                       size_type __n, const value_type& __x)
989   size_type __n = __last - __first;
1016   size_type __n = __last - __first;
1051     if (static_cast<size_type>(__elems_before) < (size() - __n) / 2) {
1125   size_type __n = 0;
1253   size_type __n = 0;
1285   if (static_cast<size_type>(__index) < size() / 2) {
1314   if (static_cast<size_type>(__index) < size() / 2) {
1341                                            size_type __n,
1345   size_type __length = size();
1347   if (static_cast<size_type>(__elems_before) < __length / 2) {
1402                                            size_type __n)
1405   size_type __length = size();
1406   if (static_cast<size_type>(__elemsbefore) < __length / 2) {
1463                                            size_type __n)
1466   size_type __length = size();
1521                                            size_type __n)
1524   size_type __length = size();
1576 deque<_Tp,_Alloc,__bufsize>::_M_new_elements_at_front(size_type __new_elems)
1578   size_type __new_nodes
1581   size_type __i;
1588     for (size_type __j = 1; __j < __i; ++__j)
1597 deque<_Tp,_Alloc,__bufsize>::_M_new_elements_at_back(size_type __new_elems)
1599   size_type __new_nodes
1602   size_type __i;
1609     for (size_type __j = 1; __j < __i; ++__j)
1618 deque<_Tp,_Alloc,__bufsize>::_M_reallocate_map(size_type __nodes_to_add,
1621   size_type __old_num_nodes = _M_finish._M_node - _M_start._M_node + 1;
1622   size_type __new_num_nodes = __old_num_nodes + __nodes_to_add;
1635     size_type __new_map_size =