Home | History | Annotate | Download | only in stl

Lines Matching defs:_Alloc

65 template <class _Tp, class _Alloc>
66 void _List_base<_Tp,_Alloc>::clear() {
94 template <class _Tp, class _Alloc>
95 void list<_Tp, _Alloc>::resize(size_type __new_size, const _Tp& __x) {
106 template <class _Tp, class _Alloc>
107 list<_Tp, _Alloc>& list<_Tp, _Alloc>::operator=(const list<_Tp, _Alloc>& __x) {
123 template <class _Tp, class _Alloc>
124 void list<_Tp, _Alloc>::_M_fill_assign(size_type __n, const _Tp& __val) {
138 template <class _Tp, class _Alloc, class _Predicate>
139 void _S_remove_if(list<_Tp, _Alloc>& __that, _Predicate __pred) {
140 typedef typename list<_Tp, _Alloc>::iterator _Literator;
151 template <class _Tp, class _Alloc, class _BinaryPredicate>
152 void _S_unique(list<_Tp, _Alloc>& __that, _BinaryPredicate __binary_pred) {
153 typedef typename list<_Tp, _Alloc>::iterator _Literator;
167 template <class _Tp, class _Alloc, class _StrictWeakOrdering>
168 void _S_merge(list<_Tp, _Alloc>& __that, list<_Tp, _Alloc>& __x,
170 typedef typename list<_Tp, _Alloc>::iterator _Literator;
205 template <class _Tp, class _Alloc, class _StrictWeakOrdering>
206 void _S_sort(list<_Tp, _Alloc>& __that, _StrictWeakOrdering __comp) {
212 list<_Tp, _Alloc> __carry(__that.get_allocator());
214 _STLP_PRIV _CArray<list<_Tp, _Alloc>, NB> __counter(__carry);