Searched refs:mCurrent (Results 1 – 5 of 5) sorted by relevance
108 iterator() : mCurrent(nullptr, size_t(0)) { in iterator()111 iterator(const Buffer<T>& buf) : mCurrent(buf) {} in iterator()115 mCurrent.mData = reinterpret_cast<const T*>( //116 uintptr_t(mCurrent.mData) + impl::align(mCurrent.declaredLength()));125 return uintptr_t(other.mCurrent.mData) == uintptr_t(mCurrent.mData);128 const Buffer<T>& operator*() const { return mCurrent; }130 bool isEnd() const { return !mCurrent.ok(); } in isEnd()133 Buffer<T> mCurrent;141 this->mCurrent.mData++; // ignore alignment144 const T& operator*() const { return *this->mCurrent.mData; }
214 Buffer<nlmsghdr>::iterator mCurrent; variable
167 ++mCurrent; in operator ++()168 if (mCurrent.isEnd()) receive(); in operator ++()175 return mCurrent == other.mCurrent; in operator ==()180 return *mCurrent; in operator *()185 CHECK(mCurrent.isEnd()) << "Trying to receive without draining previous read"; in receive()189 mCurrent = buf->begin(); in receive()
28 mCurrent = mTree; in reset()77 mCurrent = mCurrent->addChild( in processMainTag()78 std::make_shared<HidTreeNode>(mCurrent, collectionType, fullUsage)); in processMainTag()82 mCurrent = mCurrent->getParent(); in processMainTag()83 if (!mCurrent) { in processMainTag()119 std::shared_ptr<HidTreeNode> node(new HidReportNode(mCurrent, report)); in processMainTag()120 mCurrent->addChild(node); in processMainTag()
84 std::shared_ptr<HidTreeNode> mCurrent; variable