Lines Matching defs:mData
52 T[] mData;
103 mData = (T[]) Array.newInstance(klass, initialCapacity);
259 mData = newItems;
275 mOldData = mData;
279 mData = (T[]) Array.newInstance(mTClass, newSize);
285 System.arraycopy(newData, insertIndex, mData, insertIndex, itemCount);
313 mData[mNewDataStart] = newItem;
334 mData[mNewDataStart] = newItem;
413 mOldData = mData;
418 mData = (T[]) Array.newInstance(mTClass, mergedCapacity);
426 System.arraycopy(newData, newDataStart, mData, mNewDataStart, itemCount);
436 System.arraycopy(mOldData, mOldDataStart, mData, mNewDataStart, itemCount);
446 mData[mNewDataStart++] = newItem;
452 mData[mNewDataStart++] = newItem;
462 mData[mNewDataStart++] = oldItem;
542 int index = findIndexOf(item, mData, 0, mSize, INSERTION);
546 T existing = mData[index];
550 mData[index] = item;
553 mData[index] = item;
593 int index = findIndexOf(item, mData, 0, mSize, DELETION);
602 System.arraycopy(mData, index + 1, mData, index, mSize - index - 1);
604 mData[mSize] = null;
639 mData[index] = item;
711 // between mData and mOldData.
716 return mData[index];
729 int index = findIndexOf(item, mData, 0, mNewDataStart, LOOKUP);
739 return findIndexOf(item, mData, 0, mSize, LOOKUP);
742 private int findIndexOf(T item, T[] mData, int left, int right, int reason) {
745 T myItem = mData[middle];
770 T nextItem = mData[next];
780 T nextItem = mData[next];
797 if (mSize == mData.length) {
799 T[] newData = (T[]) Array.newInstance(mTClass, mData.length + CAPACITY_GROWTH);
800 System.arraycopy(mData, 0, newData, 0, index);
802 System.arraycopy(mData, index, newData, index + 1, mSize - index);
803 mData = newData;
806 System.arraycopy(mData, index, mData, index + 1, mSize - index);
807 mData[index] = item;
827 Arrays.fill(mData, 0, prevSize, null);