Searched refs:mPrev (Results 1 – 1 of 1) sorted by relevance
21 /* package */ LinkedNode mPrev; field in LinkedNode25 mPrev = mNext = this; in LinkedNode()30 mNext.mPrev = node; in insert()31 node.mPrev = this; in insert()37 mPrev.mNext = mNext; in remove()38 mNext.mPrev = mPrev; in remove()39 mPrev = mNext = null; in remove()47 mHead.mPrev.insert(node); in insertLast()55 return (T) (mHead.mPrev == mHead ? null : mHead.mPrev); in getLast()63 return (T) (node.mPrev == mHead ? null : node.mPrev); in previousOf()