Searched refs:getNodePtr (Results 1 – 5 of 5) sorted by relevance
161 list_base_type::insertBefore(*I.getNodePtr(), *this->getNodePtr(&Node)); in insert()184 void remove(reference N) { list_base_type::remove(*this->getNodePtr(&N)); } in remove()207 list_base_type::removeRange(*First.getNodePtr(), *Last.getNodePtr()); in erase()250 list_base_type::transferBefore(*I.getNodePtr(), *First.getNodePtr(), in splice()251 *Last.getNodePtr()); in splice()
167 static ilist_node_impl<OptionsT> *getNodePtr(typename OptionsT::pointer N) { in getNodePtr() function173 getNodePtr(typename OptionsT::const_pointer N) { in getNodePtr() function217 static node_type *getNodePtr(pointer N) { in getNodePtr() function218 return NodeAccess::getNodePtr<OptionsT>(N); in getNodePtr()221 static const node_type *getNodePtr(const_pointer N) { in getNodePtr() function222 return NodeAccess::getNodePtr<OptionsT>(N); in getNodePtr()
85 explicit ilist_iterator(pointer NP) : NodePtr(Access::getNodePtr(NP)) {}86 explicit ilist_iterator(reference NR) : NodePtr(Access::getNodePtr(&NR)) {}174 node_pointer getNodePtr() const { return static_cast<node_pointer>(NodePtr); }
180 reinterpret_cast<const void *>(_references.begin().getNodePtr()); in begin()186 reinterpret_cast<const void *>(_references.end().getNodePtr()); in end()198 it = reinterpret_cast<const void *>(std::next(ref).getNodePtr()); in incrementIterator()
134 assert((!MI.getNodePtr() || MI.isEnd() || !MI->isBundledWithPred()) &&183 bool isValid() const { return MII.getNodePtr(); }