24 #ifndef PPL_Pending_List_inlines_hh
25 #define PPL_Pending_List_inlines_hh 1
31 namespace Implementation {
35 template <
typename Traits>
43 template <
typename Traits>
48 template <
typename Traits>
51 return active_list.begin();
54 template <
typename Traits>
57 return active_list.end();
60 template <
typename Traits>
63 return active_list.empty();
66 template <
typename Traits>
70 iterator next = active_list.erase(position);
71 free_list.push_back(*position);
82 #endif // !defined(PPL_Pending_List_inlines_hh)
bool empty() const
Returns true if and only if the list is empty.
A class providing iterators for embedded lists.
iterator erase(iterator position)
Removes the element pointed to by position, returning an iterator pointing to the next element...
bool OK() const
Checks if all the invariants are satisfied.
The entire library is confined to this namespace.
iterator end()
Returns an iterator pointing one past the last element in the list.
iterator begin()
Returns an iterator pointing to the beginning of the list.
~Pending_List()
Destructor.
Pending_List()
Constructs an empty list.