reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
52 using size_type = typename vector_type::size_type;
usr/include/c++/7.4.0/bits/deque.tcc114 const size_type __len = size(); 305 _M_fill_insert(iterator __pos, size_type __n, const value_type& __x) 348 _M_default_append(size_type __n) 444 const size_type __n = std::distance(__first, __last); 589 const size_type __n = std::distance(__first, __last); 672 _M_insert_aux(iterator __pos, size_type __n, const value_type& __x) 675 const size_type __length = this->size(); 760 size_type __n) 763 const size_type __length = size(); 868 _M_new_elements_at_front(size_type __new_elems) 873 const size_type __new_nodes = ((__new_elems + _S_buffer_size() - 1) 876 size_type __i; 884 for (size_type __j = 1; __j < __i; ++__j) 893 _M_new_elements_at_back(size_type __new_elems) 898 const size_type __new_nodes = ((__new_elems + _S_buffer_size() - 1) 901 size_type __i; 909 for (size_type __j = 1; __j < __i; ++__j) 918 _M_reallocate_map(size_type __nodes_to_add, bool __add_at_front) 920 const size_type __old_num_nodes 922 const size_type __new_num_nodes = __old_num_nodes + __nodes_to_add; 941 size_type __new_map_size = this->_M_impl._M_map_sizeusr/include/c++/7.4.0/bits/stl_deque.h
908 deque(size_type __n, const allocator_type& __a = allocator_type()) 920 deque(size_type __n, const value_type& __value, 1107 assign(size_type __n, const value_type& __val) 1270 size_type 1275 size_type 1290 resize(size_type __new_size) 1292 const size_type __len = size(); 1312 resize(size_type __new_size, const value_type& __x) 1314 const size_type __len = size(); 1373 operator[](size_type __n) _GLIBCXX_NOEXCEPT 1391 operator[](size_type __n) const _GLIBCXX_NOEXCEPT 1400 _M_range_check(size_type __n) const 1422 at(size_type __n) 1440 at(size_type __n) const 1699 insert(const_iterator __position, size_type __n, const value_type& __x) 1942 const size_type __len = std::distance(__first, __last); 1958 _M_fill_assign(size_type __n, const value_type& __val) 2031 _M_fill_insert(iterator __pos, size_type __n, const value_type& __x); 2045 _M_insert_aux(iterator __pos, size_type __n, const value_type& __x); 2052 size_type __n); 2104 _M_default_append(size_type __n); 2113 _M_reserve_elements_at_front(size_type __n) 2115 const size_type __vacancies = this->_M_impl._M_start._M_cur 2123 _M_reserve_elements_at_back(size_type __n) 2125 const size_type __vacancies = (this->_M_impl._M_finish._M_last 2133 _M_new_elements_at_front(size_type __new_elements); 2136 _M_new_elements_at_back(size_type __new_elements); 2149 _M_reserve_map_at_back(size_type __nodes_to_add = 1) 2157 _M_reserve_map_at_front(size_type __nodes_to_add = 1) 2159 if (__nodes_to_add > size_type(this->_M_impl._M_start._M_node 2165 _M_reallocate_map(size_type __nodes_to_add, bool __add_at_front);usr/include/c++/7.4.0/bits/stl_queue.h
127 typedef typename _Sequence::size_type size_type;
usr/include/c++/7.4.0/bits/stl_stack.h 129 typedef typename _Sequence::size_type size_type;
utils/TableGen/GlobalISelEmitter.cpp 1009 typename PredicatesTy::size_type predicates_size() const {