Searched defs:IntrusiveList (Results 1 – 2 of 2) sorted by relevance
28 struct IntrusiveList { struct29 friend class Iterator;31 void clear() { in clear()36 bool empty() const { return size_ == 0; } in empty()37 uptr size() const { return size_; } in size()39 void push_back(Item *x) { in push_back()52 void push_front(Item *x) { in push_front()64 void pop_front() { in pop_front()88 void append_front(IntrusiveList<Item> *l) { in append_front() argument102 void append_back(IntrusiveList<Item> *l) { in append_back() argument[all …]
128 template <class T> struct IntrusiveList : public LinkOp<T> { struct130 void init(T *Base, uptr BaseSize) { LinkOp<T>::init(Base, BaseSize); } in init()132 bool empty() const { return Size == 0; } in empty()133 uptr size() const { return Size; } in size()135 T *front() { return First; } in front()136 const T *front() const { return First; } in front()137 T *back() { return Last; } in back()138 const T *back() const { return Last; } in back()140 void clear() { in clear()145 typedef IteratorBase<T> Iterator;[all …]