Lines Matching defs:mTail
26 private int mTail;
41 mTail = n;
86 if (mHead == mTail) {
96 mElements[mTail] = e;
97 mTail = (mTail + 1) & mCapacityBitmask;
98 if (mTail == mHead) {
109 if (mHead == mTail) {
124 if (mHead == mTail) {
127 int t = (mTail - 1) & mCapacityBitmask;
130 mTail = t;
189 if (numOfElements < mTail) {
190 start = mTail - numOfElements;
192 for (int i = start; i < mTail; i++) {
195 int removed = (mTail - start);
197 mTail = mTail - removed;
199 // mTail wrapped to mElements.length
200 mTail = mElements.length;
201 int newTail = mTail - numOfElements;
202 for (int i = newTail; i < mTail; i++) {
205 mTail = newTail;
215 if (mHead == mTail) {
227 if (mHead == mTail) {
230 return mElements[(mTail - 1) & mCapacityBitmask];
251 return (mTail - mHead) & mCapacityBitmask;
259 return mHead == mTail;
