Lines Matching defs:slist
58 # define slist _STLP_PTR_IMPL_NAME(slist)
60 # define slist _STLP_NON_DBG_NAME(slist)
70 slist<_Tp,_Alloc>& slist<_Tp,_Alloc>::operator=(const slist<_Tp,_Alloc>& __x) {
91 void slist<_Tp, _Alloc>::_M_fill_assign(size_type __n, const _Tp& __val) {
106 void slist<_Tp,_Alloc>::resize(size_type __len, const _Tp& __x) {
119 void slist<_Tp,_Alloc>::remove(const _Tp& __val) {
129 #if !defined (slist)
134 void _Slist_unique(slist<_Tp, _Alloc>& __that, _BinaryPredicate __pred) {
136 typename slist<_Tp, _Alloc>::iterator __ite(__that.begin());
148 void _Slist_merge(slist<_Tp, _Alloc>& __that, slist<_Tp, _Alloc>& __x,
153 typename slist<_Tp, _Alloc>::iterator __ite(__that.before_begin());
167 typename slist<_Tp, _Alloc>::iterator __i1(__that.before_begin()), __i2(__x.begin());
184 void _Slist_sort(slist<_Tp, _Alloc>& __that, _StrictWeakOrdering __comp) {
188 slist<_Tp, _Alloc> __carry(__that.get_allocator());
190 _STLP_PRIV _CArray<slist<_Tp, _Alloc>, NB> __counter(__carry);
204 //Looks like the slist has too many elements to be sorted with this algorithm:
205 __stl_throw_overflow_error("slist::sort");
215 #if defined (slist)
216 # undef slist
