Lines Matching refs:list
87 # define list _STLP_PTR_IMPL_NAME(list)
89 # define list _STLP_NON_DBG_NAME(list)
95 void list<_Tp, _Alloc>::resize(size_type __new_size, const _Tp& __x) {
107 list<_Tp, _Alloc>& list<_Tp, _Alloc>::operator=(const list<_Tp, _Alloc>& __x) {
124 void list<_Tp, _Alloc>::_M_fill_assign(size_type __n, const _Tp& __val) {
134 #if !defined (list)
139 void _S_remove_if(list<_Tp, _Alloc>& __that, _Predicate __pred) {
140 typedef typename list<_Tp, _Alloc>::iterator _Literator;
152 void _S_unique(list<_Tp, _Alloc>& __that, _BinaryPredicate __binary_pred) {
153 typedef typename list<_Tp, _Alloc>::iterator _Literator;
168 void _S_merge(list<_Tp, _Alloc>& __that, list<_Tp, _Alloc>& __x,
170 typedef typename list<_Tp, _Alloc>::iterator _Literator;
206 void _S_sort(list<_Tp, _Alloc>& __that, _StrictWeakOrdering __comp) {
207 // Do nothing if the list has length 0 or 1.
212 list<_Tp, _Alloc> __carry(__that.get_allocator());
214 _STLP_PRIV _CArray<list<_Tp, _Alloc>, NB> __counter(__carry);
227 //Looks like the list has too many elements to be sorted with this algorithm:
228 __stl_throw_overflow_error("list::sort");
238 #if defined (list)
239 # undef list