Searched refs:getPrev (Results 1 – 4 of 4) sorted by relevance
23 node_base_type &Prev = *Next.getPrev(); in insertBeforeImpl()31 node_base_type *Prev = N.getPrev(); in removeImpl()42 node_base_type *Prev = First.getPrev(); in removeRangeImpl()43 node_base_type *Final = Last.getPrev(); in removeRangeImpl()62 node_base_type &Final = *Last.getPrev(); in transferBeforeImpl()65 First.getPrev()->setNext(&Last); in transferBeforeImpl()66 Last.setPrev(First.getPrev()); in transferBeforeImpl()69 node_base_type &Prev = *Next.getPrev(); in transferBeforeImpl()
89 ilist_node_impl *getPrev() { in getPrev() function90 return static_cast<ilist_node_impl *>(node_base_type::getPrev()); in getPrev()97 const ilist_node_impl *getPrev() const { in getPrev() function98 return static_cast<ilist_node_impl *>(node_base_type::getPrev()); in getPrev()216 static ilist_node_impl<OptionsT> *getPrev(ilist_node_impl<OptionsT> &N) { in getPrev() function217 return N.getPrev(); in getPrev()227 getPrev(const ilist_node_impl<OptionsT> &N) { in getPrev() function228 return N.getPrev(); in getPrev()276 bool empty() const { return this == this->getPrev(); } in empty()
28 ilist_node_base *getPrev() const { return Prev; } in getPrev() function42 ilist_node_base *getPrev() const { return PrevAndSentinel.getPointer(); } in getPrev() function
44 template <class T> static void decrement(T *&I) { I = Access::getPrev(*I); }49 template <class T> static void increment(T *&I) { I = Access::getPrev(*I); }153 NodePtr = IsReverse ? NodePtr->getNext() : NodePtr->getPrev();157 NodePtr = IsReverse ? NodePtr->getPrev() : NodePtr->getNext();311 NodePtr = IsReverse ? NodePtr->getNext() : NodePtr->getPrev();319 NodePtr = IsReverse ? NodePtr->getPrev() : NodePtr->getNext();