ReactOS  0.4.15-dev-3294-ge98684e
_slist.h
Go to the documentation of this file.
1 /*
2  * Copyright (c) 2003
3  * Francois Dumont
4  *
5  * This material is provided "as is", with absolutely no warranty expressed
6  * or implied. Any use is at your own risk.
7  *
8  * Permission to use or copy this software for any purpose is hereby granted
9  * without fee, provided the above notices are retained on all copies.
10  * Permission to modify the code and to distribute modified code is granted,
11  * provided the above notices are retained, and a notice that the code was
12  * modified is included with the above copyright notice.
13  *
14  */
15 
16 /* NOTE: This is an internal header file, included by other STL headers.
17  * You should not attempt to use it directly.
18  */
19 
20 #ifndef _STLP_SPECIALIZED_SLIST_H
21 #define _STLP_SPECIALIZED_SLIST_H
22 
23 #ifndef _STLP_POINTERS_SPEC_TOOLS_H
24 # include <stl/pointers/_tools.h>
25 #endif
26 
28 
29 #define SLIST_IMPL _STLP_PTR_IMPL_NAME(slist)
30 
31 #if defined (__BORLANDC__) || defined (__DMC__)
32 # define typename
33 #endif
34 
35 #if defined (_STLP_USE_TEMPLATE_EXPORT) && !defined (_STLP_USE_MSVC6_MEM_T_BUG_WORKAROUND)
37 
39 typedef _Slist_node<void*> _VoidPtrSNode;
42 _STLP_EXPORT_TEMPLATE_CLASS SLIST_IMPL<void*, allocator<void*> >;
43 
45 #endif
46 
47 #if defined (_STLP_DEBUG)
48 # define slist _STLP_NON_DBG_NAME(slist)
50 #endif
51 
52 template <class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator<_Tp>) >
53 class slist
54 #if defined (_STLP_USE_PARTIAL_SPEC_WORKAROUND) && !defined (slist)
55  : public __stlport_class<slist<_Tp, _Alloc> >
56 #endif
57 {
60  typedef _STLP_PRIV SLIST_IMPL<_StorageType, _StorageTypeAlloc> _Base;
61  typedef typename _Base::iterator _BaseIte;
62  typedef typename _Base::const_iterator _BaseConstIte;
66 
67 public:
68  typedef _Tp value_type;
69  typedef value_type* pointer;
70  typedef const value_type* const_pointer;
72  typedef const value_type& const_reference;
73  typedef size_t size_type;
76 
79 
82 
83 public:
85  { return _STLP_CONVERT_ALLOCATOR(_M_impl.get_allocator(), value_type); }
86 
87  explicit slist(const allocator_type& __a = allocator_type())
89 
90 #if !defined(_STLP_DONT_SUP_DFLT_PARAM)
92 #else
93  slist(size_type __n, const value_type& __x,
94 #endif /*_STLP_DONT_SUP_DFLT_PARAM*/
95  const allocator_type& __a = allocator_type())
96  : _M_impl(__n, cast_traits::to_storage_type_cref(__x), _STLP_CONVERT_ALLOCATOR(__a, _StorageType)) {}
97 
98 #if defined(_STLP_DONT_SUP_DFLT_PARAM)
99  explicit slist(size_type __n) : _M_impl(__n) {}
100 #endif /*_STLP_DONT_SUP_DFLT_PARAM*/
101 
102 #if defined (_STLP_MEMBER_TEMPLATES)
103  // We don't need any dispatching tricks here, because _M_insert_after_range
104  // already does them.
105  template <class _InputIterator>
106  slist(_InputIterator __first, _InputIterator __last,
108 # if !defined (_STLP_USE_ITERATOR_WRAPPER)
109  : _M_impl(__first, __last, _STLP_CONVERT_ALLOCATOR(__a, _StorageType)) {}
110 # else
112  insert_after(before_begin(), __first, __last);
113  }
114 # endif
115 # if defined (_STLP_NEEDS_EXTRA_TEMPLATE_CONSTRUCTORS)
116  // VC++ needs this crazyness
117  template <class _InputIterator>
118  slist(_InputIterator __first, _InputIterator __last)
119 # if !defined (_STLP_USE_WRAPPER_ITERATOR)
120  : _M_impl(__first, __last) {}
121 # else
122  { insert_after(before_begin(), __first, __last); }
123 # endif
124 # endif
125 #else /* _STLP_MEMBER_TEMPLATES */
127  const allocator_type& __a = allocator_type() )
128  : _M_impl(_BaseConstIte(__first._M_node), _BaseConstIte(__last._M_node),
130  slist(const value_type* __first, const value_type* __last,
131  const allocator_type& __a = allocator_type())
132  : _M_impl(cast_traits::to_storage_type_cptr(__first), cast_traits::to_storage_type_cptr(__last),
134 #endif /* _STLP_MEMBER_TEMPLATES */
135 
136  slist(const _Self& __x) : _M_impl(__x._M_impl) {}
137 
138 #if !defined (_STLP_NO_MOVE_SEMANTIC)
141 #endif
142 
143  _Self& operator= (const _Self& __x) { _M_impl = __x._M_impl; return *this; }
144 
146  { _M_impl.assign(__n, cast_traits::to_storage_type_cref(__val)); }
147 
148 #if defined (_STLP_MEMBER_TEMPLATES)
149 # if defined (_STLP_USE_ITERATOR_WRAPPER)
150 private:
151  template <class _Integer>
152  void _M_assign_dispatch(_Integer __n, _Integer __val,
153  const __true_type&)
154  { _M_impl.assign(__n, __val); }
155 
156  template <class _InputIterator>
157  void _M_assign_dispatch(_InputIterator __first, _InputIterator __last,
158  const __false_type&) {
159  _M_impl.assign(_STLP_TYPENAME _STLP_PRIV _IteWrapper<_StorageType, _Tp, _InputIterator>::_Ite(__first),
160  _STLP_TYPENAME _STLP_PRIV _IteWrapper<_StorageType, _Tp, _InputIterator>::_Ite(__last));
161  }
162 
163 public:
164 # endif
165 
166  template <class _InputIterator>
167  void assign(_InputIterator __first, _InputIterator __last) {
168 # if defined (_STLP_USE_ITERATOR_WRAPPER)
169  typedef typename _IsIntegral<_InputIterator>::_Ret _Integral;
170  _M_assign_dispatch(__first, __last, _Integral());
171 # else
172  _M_impl.assign(__first, __last);
173 # endif
174  }
175 #else
176  void assign(const value_type *__first, const value_type *__last) {
177  _M_impl.assign(cast_traits::to_storage_type_cptr(__first),
178  cast_traits::to_storage_type_cptr(__last));
179  }
181  _M_impl.assign(_BaseConstIte(__first._M_node),
182  _BaseConstIte(__last._M_node));
183  }
184 #endif /* _STLP_MEMBER_TEMPLATES */
185 
186  iterator before_begin() { return iterator(_M_impl.before_begin()._M_node); }
187  const_iterator before_begin() const { return const_iterator(const_cast<_Node_base*>(_M_impl.before_begin()._M_node)); }
188 
189  iterator begin() { return iterator(_M_impl.begin()._M_node); }
190  const_iterator begin() const { return const_iterator(const_cast<_Node_base*>(_M_impl.begin()._M_node));}
191 
192  iterator end() { return iterator(_M_impl.end()._M_node); }
193  const_iterator end() const { return iterator(_M_impl.end()._M_node); }
194 
195  size_type size() const { return _M_impl.size(); }
196  size_type max_size() const { return _M_impl.max_size(); }
197  bool empty() const { return _M_impl.empty(); }
198 
199  void swap(_Self& __x) { _M_impl.swap(__x._M_impl); }
200 #if defined (_STLP_USE_PARTIAL_SPEC_WORKAROUND) && !defined (_STLP_FUNCTION_TMPL_PARTIAL_ORDER)
201  void _M_swap_workaround(_Self& __x) { swap(__x); }
202 #endif
203 
204 public:
205  reference front() { return *begin(); }
206  const_reference front() const { return *begin(); }
207 #if !defined(_STLP_DONT_SUP_DFLT_PARAM) && !defined(_STLP_NO_ANACHRONISMS)
209 #else
210  void push_front(const value_type& __x)
211 #endif
212  { _M_impl.push_front(cast_traits::to_storage_type_cref(__x)); }
213 
214 # if defined(_STLP_DONT_SUP_DFLT_PARAM) && !defined(_STLP_NO_ANACHRONISMS)
215  void push_front() { _M_impl.push_front();}
216 # endif /*_STLP_DONT_SUP_DFLT_PARAM && !_STLP_NO_ANACHRONISMS*/
217 
218  void pop_front() { _M_impl.pop_front(); }
219 
221  { return iterator(_M_impl.previous(_BaseConstIte(__pos._M_node))._M_node); }
223  { return const_iterator(const_cast<_Node_base*>(_M_impl.previous(_BaseConstIte(__pos._M_node))._M_node)); }
224 
225 #if !defined(_STLP_DONT_SUP_DFLT_PARAM)
227 #else
228  iterator insert_after(iterator __pos, const value_type& __x)
229 #endif /*_STLP_DONT_SUP_DFLT_PARAM*/
230  { return iterator(_M_impl.insert_after(_BaseIte(__pos._M_node),
231  cast_traits::to_storage_type_cref(__x))._M_node); }
232 
233 #if defined(_STLP_DONT_SUP_DFLT_PARAM)
235  { return iterator(_M_impl.insert_after(_BaseIte(__pos._M_node))._M_node);}
236 #endif /*_STLP_DONT_SUP_DFLT_PARAM*/
237 
238  void insert_after(iterator __pos, size_type __n, const value_type& __x)
239  { _M_impl.insert_after(_BaseIte(__pos._M_node), __n, cast_traits::to_storage_type_cref(__x)); }
240 
241 #if defined (_STLP_MEMBER_TEMPLATES)
242 # if defined (_STLP_USE_ITERATOR_WRAPPER)
243 private:
244  template <class _Integer>
245  void _M_insert_after_dispatch(iterator __pos, _Integer __n, _Integer __val,
246  const __true_type&) {
247  _M_impl.insert_after(_BaseIte(__pos._M_node), __n, __val);
248  }
249 
250  template <class _InputIterator>
251  void _M_insert_after_dispatch(iterator __pos,
252  _InputIterator __first, _InputIterator __last,
253  const __false_type&) {
254  _M_impl.insert_after(_BaseIte(__pos._M_node),
255  _STLP_TYPENAME _STLP_PRIV _IteWrapper<_StorageType, _Tp, _InputIterator>::_Ite(__first),
256  _STLP_TYPENAME _STLP_PRIV _IteWrapper<_StorageType, _Tp, _InputIterator>::_Ite(__last));
257  }
258 
259 public:
260 # endif
261 
262  template <class _InputIterator>
263  void insert_after(iterator __pos, _InputIterator __first, _InputIterator __last) {
264 # if defined (_STLP_USE_ITERATOR_WRAPPER)
265  // Check whether it's an integral type. If so, it's not an iterator.
266  typedef typename _IsIntegral<_InputIterator>::_Ret _Integral;
267  _M_insert_after_dispatch(__pos, __first, __last, _Integral());
268 # else
269  _M_impl.insert_after(_BaseIte(__pos._M_node), __first, __last);
270 # endif
271  }
272 
273 #else /* _STLP_MEMBER_TEMPLATES */
274  void insert_after(iterator __pos,
276  { _M_impl.insert_after(_BaseIte(__pos._M_node),
277  _BaseConstIte(__first._M_node), _BaseConstIte(__last._M_node)); }
278  void insert_after(iterator __pos,
279  const value_type* __first, const value_type* __last) {
280  _M_impl.insert_after(_BaseIte(__pos._M_node),
281  cast_traits::to_storage_type_cptr(__first),
282  cast_traits::to_storage_type_cptr(__last));
283  }
284 #endif /* _STLP_MEMBER_TEMPLATES */
285 
286 #if !defined(_STLP_DONT_SUP_DFLT_PARAM)
288 #else
289  iterator insert(iterator __pos, const value_type& __x)
290 #endif /*_STLP_DONT_SUP_DFLT_PARAM*/
291  { return iterator(_M_impl.insert(_BaseIte(__pos._M_node),
292  cast_traits::to_storage_type_cref(__x))._M_node); }
293 
294 #if defined(_STLP_DONT_SUP_DFLT_PARAM)
295  iterator insert(iterator __pos)
296  { return iterator(_M_impl.insert(_BaseIte(__pos._M_node))._M_node); }
297 #endif /*_STLP_DONT_SUP_DFLT_PARAM*/
298 
299  void insert(iterator __pos, size_type __n, const value_type& __x)
300  { _M_impl.insert(_BaseIte(__pos._M_node), __n, cast_traits::to_storage_type_cref(__x)); }
301 
302 #if defined (_STLP_MEMBER_TEMPLATES)
303 # if defined (_STLP_USE_ITERATOR_WRAPPER)
304 private:
305  template <class _Integer>
306  void _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val,
307  const __true_type&) {
308  _M_impl.insert(_BaseIte(__pos._M_node), __n, __val);
309  }
310 
311  template <class _InputIterator>
312  void _M_insert_dispatch(iterator __pos,
313  _InputIterator __first, _InputIterator __last,
314  const __false_type&) {
315  _M_impl.insert(_BaseIte(__pos._M_node), _STLP_TYPENAME _STLP_PRIV _IteWrapper<_StorageType, _Tp, _InputIterator>::_Ite(__first),
316  _STLP_TYPENAME _STLP_PRIV _IteWrapper<_StorageType, _Tp, _InputIterator>::_Ite(__last));
317  }
318 
319 public:
320 # endif
321 
322  template <class _InputIterator>
323  void insert(iterator __pos, _InputIterator __first, _InputIterator __last) {
324 # if defined (_STLP_USE_ITERATOR_WRAPPER)
325  // Check whether it's an integral type. If so, it's not an iterator.
326  typedef typename _IsIntegral<_InputIterator>::_Ret _Integral;
327  _M_insert_dispatch(__pos, __first, __last, _Integral());
328 # else
329  _M_impl.insert(_BaseIte(__pos._M_node), __first, __last);
330 # endif
331  }
332 
333 #else /* _STLP_MEMBER_TEMPLATES */
335  { _M_impl.insert(_BaseIte(__pos._M_node), _BaseConstIte(__first._M_node), _BaseConstIte(__last._M_node)); }
336  void insert(iterator __pos, const value_type* __first, const value_type* __last)
337  { _M_impl.insert(_BaseIte(__pos._M_node), cast_traits::to_storage_type_cptr(__first),
338  cast_traits::to_storage_type_cptr(__last)); }
339 #endif /* _STLP_MEMBER_TEMPLATES */
340 
342  { return iterator(_M_impl.erase_after(_BaseIte(__pos._M_node))._M_node); }
344  { return iterator(_M_impl.erase_after(_BaseIte(__before_first._M_node),
345  _BaseIte(__last._M_node))._M_node); }
346 
348  { return iterator(_M_impl.erase(_BaseIte(__pos._M_node))._M_node); }
350  { return iterator(_M_impl.erase(_BaseIte(__first._M_node), _BaseIte(__last._M_node))._M_node); }
351 
352 #if !defined(_STLP_DONT_SUP_DFLT_PARAM)
354 #else
355  void resize(size_type __new_size, const value_type& __x)
356 #endif /*_STLP_DONT_SUP_DFLT_PARAM*/
357  { _M_impl.resize(__new_size, cast_traits::to_storage_type_cref(__x));}
358 
359 #if defined(_STLP_DONT_SUP_DFLT_PARAM)
360  void resize(size_type __new_size) { _M_impl.resize(__new_size); }
361 #endif /*_STLP_DONT_SUP_DFLT_PARAM*/
362 
363  void clear() { _M_impl.clear(); }
364 
365  void splice_after(iterator __pos, _Self& __x,
366  iterator __before_first, iterator __before_last)
367  { _M_impl.splice_after(_BaseIte(__pos._M_node), __x._M_impl,
368  _BaseIte(__before_first._M_node), _BaseIte(__before_last._M_node)); }
369  void splice_after(iterator __pos, _Self& __x, iterator __prev)
370  { _M_impl.splice_after(_BaseIte(__pos._M_node), __x._M_impl, _BaseIte(__prev._M_node)); }
371  void splice_after(iterator __pos, _Self& __x)
372  { _M_impl.splice_after(_BaseIte(__pos._M_node), __x._M_impl); }
373  void splice(iterator __pos, _Self& __x)
374  { _M_impl.splice(_BaseIte(__pos._M_node), __x._M_impl); }
375  void splice(iterator __pos, _Self& __x, iterator __i)
376  { _M_impl.splice(_BaseIte(__pos._M_node), __x._M_impl, _BaseIte(__i._M_node)); }
377  void splice(iterator __pos, _Self& __x, iterator __first, iterator __last)
378  { _M_impl.splice(_BaseIte(__pos._M_node), __x._M_impl,
379  _BaseIte(__first._M_node), _BaseIte(__last._M_node)); }
380 
381  void reverse() { _M_impl.reverse(); }
382 
383  void remove(const value_type& __val) { _M_impl.remove(cast_traits::to_storage_type_cref(__val)); }
384  void unique() { _M_impl.unique(); }
385  void merge(_Self& __x) { _M_impl.merge(__x._M_impl); }
386  void sort() {_M_impl.sort(); }
387 
388 #ifdef _STLP_MEMBER_TEMPLATES
389  template <class _Predicate>
390  void remove_if(_Predicate __pred)
392 
393  template <class _BinaryPredicate>
394  void unique(_BinaryPredicate __pred)
396 
397  template <class _StrictWeakOrdering>
398  void merge(_Self& __x, _StrictWeakOrdering __comp)
400 
401  template <class _StrictWeakOrdering>
402  void sort(_StrictWeakOrdering __comp)
404 #endif /* _STLP_MEMBER_TEMPLATES */
405 
406 private:
408 };
409 
410 #if defined (slist)
411 # undef slist
413 #endif
414 
415 #undef SLIST_IMPL
416 
417 #if defined (__BORLANDC__) || defined (__DMC__)
418 # undef typename
419 #endif
420 
422 
423 #endif /* _STLP_SPECIALIZED_SLIST_H */
424 
425 // Local Variables:
426 // mode:C++
427 // End:
#define _STLP_CONVERT_ALLOCATOR(__a, _Tp)
Definition: _alloc.h:183
void insert(iterator __pos, size_type __n, const value_type &__x)
Definition: _slist.h:299
_Alloc_traits< _StorageType, _Alloc >::allocator_type _StorageTypeAlloc
Definition: _slist.h:59
forward_iterator_tag _Iterator_category
Definition: _slist.h:75
iterator insert_after(iterator __pos, const value_type &__x=_Tp())
Definition: _slist.h:601
iterator erase(iterator __pos)
Definition: _slist.h:347
void insert_after(iterator __pos, const value_type *__first, const value_type *__last)
Definition: _slist.h:278
#define swap(a, b)
Definition: qsort.c:63
_Base::const_iterator _BaseConstIte
Definition: _slist.h:62
return __n
Definition: _algo.h:75
bool empty() const
Definition: _slist.h:197
_QualifiedType _Type
Definition: _tools.h:171
slist(size_type __n, const value_type &__x=_STLP_DEFAULT_CONSTRUCTED(value_type), const allocator_type &__a=allocator_type())
Definition: _slist.h:91
char typename[32]
Definition: main.c:84
size_t size_type
Definition: _slist.h:73
const value_type * const_pointer
Definition: _slist.h:70
#define _Alloc
Definition: _bvector.h:330
#define _STLP_TYPENAME
Definition: features.h:612
value_type & reference
Definition: _slist.h:71
_STLP_MOVE_TO_STD_NAMESPACE void sort(_RandomAccessIter __first, _RandomAccessIter __last)
Definition: _algo.c:993
_STLP_PRIV SLIST_IMPL< _StorageType, _StorageTypeAlloc > _Base
Definition: _slist.h:60
Definition: _slist.h:198
_STLP_INLINE_LOOP _InputIter _Predicate __pred
Definition: _algo.h:68
slist(const allocator_type &__a=allocator_type())
Definition: _slist.h:87
iterator before_begin()
Definition: _slist.h:412
static int insert
Definition: xmllint.c:144
if(dx==0 &&dy==0)
Definition: linetemp.h:174
void assign(size_type __n, const _Tp &__val)
Definition: _slist.h:348
void splice_after(iterator __pos, _Self &__x, iterator __prev)
Definition: _slist.h:369
_STLP_PRIV _Slist_base< value_type, _Alloc > _Base
Definition: _slist.h:226
_STLP_PRIV _Slist_iterator< value_type, _Const_traits< value_type > > const_iterator
Definition: _slist.h:240
iterator begin()
Definition: _slist.h:189
_Base _M_impl
Definition: _slist.h:407
slist(__move_source< _Self > src)
Definition: _slist.h:139
const_reference front() const
Definition: _slist.h:206
#define _STLP_MOVE_TO_PRIV_NAMESPACE
Definition: features.h:524
void assign(const value_type *__first, const value_type *__last)
Definition: _slist.h:176
reference front()
Definition: _slist.h:205
_STLP_MOVE_TO_STD_NAMESPACE _OutputIter merge(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result)
Definition: _algo.c:1419
void resize(size_type new_size, const value_type &__x=_Tp())
Definition: _slist.c:106
#define _STLP_DEFAULT_CONSTRUCTED(_TTp)
Definition: _construct.h:265
slist(const_iterator __first, const_iterator __last, const allocator_type &__a=allocator_type())
Definition: _slist.h:126
iterator previous(const_iterator __pos)
Definition: _slist.h:220
_Base::allocator_type allocator_type
Definition: _slist.h:243
_STLP_INLINE_LOOP _InputIter __last
Definition: _algo.h:68
const_iterator previous(const_iterator __pos) const
Definition: _slist.h:222
static clock_t begin
Definition: xmllint.c:467
_Self & operator=(const _Self &__x)
Definition: _slist.c:70
const_iterator begin() const
Definition: _slist.h:190
_Base::iterator _BaseIte
Definition: _slist.h:61
const value_type & const_reference
Definition: _slist.h:72
_STLP_PRIV _Slist_iterator< value_type, _Nonconst_traits< value_type > > iterator
Definition: _slist.h:77
_STLP_PRIV _Slist_node_base _Node_base
Definition: _slist.h:65
void insert_after(iterator __pos, const_iterator __first, const_iterator __last)
Definition: _slist.h:274
ptrdiff_t difference_type
Definition: _slist.h:74
#define _STLP_MOVE_TO_STD_NAMESPACE
Definition: features.h:525
_STLP_PRIV _Slist_iterator< value_type, _Const_traits< value_type > > const_iterator
Definition: _slist.h:78
void get(int argc, const char *argv[])
Definition: cmds.c:480
iterator erase(iterator __first, iterator __last)
Definition: _slist.h:349
_STLP_PRIV _CastTraits< _StorageType, _Tp > cast_traits
Definition: _slist.h:64
void remove(const value_type &__val)
Definition: _slist.h:383
#define _STLP_ALLOCATOR_TYPE_DFL
Definition: features.h:691
_STLP_INLINE_LOOP _InputIter const _Tp & __val
Definition: _algobase.h:656
slist< _Tp, _Alloc > _Self
Definition: _slist.h:227
iterator erase_after(iterator __pos)
Definition: _slist.h:341
#define _STLP_EXPORT_TEMPLATE_CLASS
Definition: features.h:987
void sort()
Definition: _slist.h:386
void insert_after(iterator __pos, size_type __n, const value_type &__x)
Definition: _slist.h:238
size_type size() const
Definition: _slist.h:195
void splice_after(iterator __pos, _Self &__x)
Definition: _slist.h:371
void pop_front()
Definition: _slist.h:218
value_type * pointer
Definition: _slist.h:69
_STLP_INLINE_LOOP _ForwardIter remove_if(_ForwardIter __first, _ForwardIter __last, _Predicate __pred)
Definition: _algo.h:278
const_iterator before_begin() const
Definition: _slist.h:187
slist< _Tp, _Alloc > _Self
Definition: _slist.h:63
#define _STLP_PRIV
Definition: _dm.h:70
_Rebind_type::other allocator_type
Definition: _alloc.h:201
void reverse()
Definition: _slist.h:381
slist(const value_type *__first, const value_type *__last, const allocator_type &__a=allocator_type())
Definition: _slist.h:130
void clear()
Definition: _slist.h:363
GLenum src
Definition: glext.h:6340
WDF_CHILD_LIST_ITERATOR iterator
void assign(const_iterator __first, const_iterator __last)
Definition: _slist.h:180
void assign(size_type __n, const value_type &__val)
Definition: _slist.h:145
allocator_type get_allocator() const
Definition: _slist.h:277
void swap(_Self &__x)
Definition: _slist.h:199
void insert(iterator __pos, const value_type *__first, const value_type *__last)
Definition: _slist.h:336
iterator end()
Definition: _slist.h:192
void splice(iterator __pos, _Self &__x, iterator __first, iterator __last)
Definition: _slist.h:377
void splice(iterator __pos, _Self &__x)
Definition: _slist.h:373
_STLP_TYPENAME _STLP_PRIV _StorageType< _Tp >::_Type _StorageType
Definition: _slist.h:58
void push_front(const value_type &__x=_STLP_DEFAULT_CONSTRUCTED(value_type))
Definition: _slist.h:208
iterator insert_after(iterator __pos, const value_type &__x=_STLP_DEFAULT_CONSTRUCTED(value_type))
Definition: _slist.h:226
#define _STLP_END_NAMESPACE
Definition: features.h:503
iterator insert(iterator __pos, const value_type &__x=_STLP_DEFAULT_CONSTRUCTED(value_type))
Definition: _slist.h:287
void insert(iterator __pos, const_iterator __first, const_iterator __last)
Definition: _slist.h:334
__kernel_ptrdiff_t ptrdiff_t
Definition: linux.h:247
void merge(_Self &__x)
Definition: _slist.h:385
_Tp value_type
Definition: _slist.h:68
void splice_after(iterator __pos, _Self &__x, iterator __before_first, iterator __before_last)
Definition: _slist.h:365
size_type max_size() const
Definition: _slist.h:196
_ForwardIter unique(_ForwardIter __first, _ForwardIter __last)
Definition: _algo.h:298
void push_front(const value_type &__x=_Tp())
Definition: _slist.h:440
slist(const _Self &__x)
Definition: _slist.h:136
#define _STLP_BEGIN_NAMESPACE
Definition: features.h:501
void splice(iterator __pos, _Self &__x, iterator __i)
Definition: _slist.h:375
void unique()
Definition: _slist.h:384
iterator erase_after(iterator __before_first, iterator __last)
Definition: _slist.h:343
const_iterator end() const
Definition: _slist.h:193
void resize(size_type __new_size, const value_type &__x=_STLP_DEFAULT_CONSTRUCTED(value_type))
Definition: _slist.h:353
#define _STLP_FORCE_ALLOCATORS(a, y)
Definition: _alloc.h:436