Searched refs:mSize (Results 1 - 25 of 214) sorted by relevance

123456789

/frameworks/base/packages/WallpaperCropper/src/com/android/gallery3d/util/
H A DIntArray.java23 private int mSize = 0; field in class:IntArray
26 if (mData.length == mSize) {
27 int temp[] = new int[mSize + mSize];
28 System.arraycopy(mData, 0, temp, 0, mSize);
31 mData[mSize++] = value;
35 mSize--;
36 return mData[mSize];
40 return mSize;
45 if (result == null || result.length < mSize) {
[all...]
/frameworks/base/core/java/com/android/internal/util/
H A DRingBufferIndices.java28 private int mSize; field in class:RingBufferIndices
43 if (mSize < mCapacity) {
44 final int pos = mSize;
45 mSize++;
61 mSize = 0;
68 return mSize;
/frameworks/base/core/java/android/util/
H A DLongSparseLongArray.java50 private int mSize; field in class:LongSparseLongArray
74 mSize = 0;
103 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
116 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
127 System.arraycopy(mKeys, index + 1, mKeys, index, mSize - (index + 1));
128 System.arraycopy(mValues, index + 1, mValues, index, mSize - (index + 1));
129 mSize--;
138 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
145 mKeys = GrowingArrayUtils.insert(mKeys, mSize, i, key);
146 mValues = GrowingArrayUtils.insert(mValues, mSize,
[all...]
H A DSparseBooleanArray.java69 mSize = 0;
98 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
111 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
114 System.arraycopy(mKeys, i + 1, mKeys, i, mSize - (i + 1));
115 System.arraycopy(mValues, i + 1, mValues, i, mSize - (i + 1));
116 mSize--;
126 System.arraycopy(mKeys, index + 1, mKeys, index, mSize - (index + 1));
127 System.arraycopy(mValues, index + 1, mValues, index, mSize - (index + 1));
128 mSize--;
137 int i = ContainerHelpers.binarySearch(mKeys, mSize, ke
308 private int mSize; field in class:SparseBooleanArray
[all...]
H A DSparseLongArray.java48 private int mSize; field in class:SparseLongArray
72 mSize = 0;
101 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
114 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
132 size = Math.min(size, mSize - index);
133 System.arraycopy(mKeys, index + size, mKeys, index, mSize - (index + size));
134 System.arraycopy(mValues, index + size, mValues, index, mSize - (index + size));
135 mSize -= size;
142 System.arraycopy(mKeys, index + 1, mKeys, index, mSize - (index + 1));
143 System.arraycopy(mValues, index + 1, mValues, index, mSize
[all...]
H A DLongArray.java37 private int mSize; field in class:LongArray
41 mSize = Preconditions.checkArgumentInRange(size, 0, array.length, "size");
60 mSize = 0;
87 ensureCapacity(newSize - mSize);
89 mSize = newSize;
96 add(mSize, value);
107 int rightSegment = mSize - index;
108 mSize++;
123 final int count = values.mSize;
126 System.arraycopy(values.mValues, 0, mValues, mSize, coun
[all...]
H A DSparseIntArray.java50 private int mSize; field in class:SparseIntArray
74 mSize = 0;
103 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
116 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
127 System.arraycopy(mKeys, index + 1, mKeys, index, mSize - (index + 1));
128 System.arraycopy(mValues, index + 1, mValues, index, mSize - (index + 1));
129 mSize--;
138 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
145 mKeys = GrowingArrayUtils.insert(mKeys, mSize, i, key);
146 mValues = GrowingArrayUtils.insert(mValues, mSize,
[all...]
H A DIntArray.java33 private int mSize; field in class:IntArray
37 mSize = Preconditions.checkArgumentInRange(size, 0, array.length, "size");
56 mSize = 0;
83 ensureCapacity(newSize - mSize);
85 mSize = newSize;
92 add(mSize, value);
103 int rightSegment = mSize - index;
104 mSize++;
130 return ContainerHelpers.binarySearch(mValues, mSize, value);
137 final int count = values.mSize;
[all...]
H A DSparseArray.java58 private int mSize; field in class:SparseArray
82 mSize = 0;
113 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
126 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
141 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
184 final int end = Math.min(mSize, index + size);
191 // Log.e("SparseArray", "gc start with " + mSize);
193 int n = mSize;
213 mSize = o;
215 // Log.e("SparseArray", "gc end with " + mSize);
[all...]
H A DLongSparseArray.java58 private int mSize; field in class:LongSparseArray
82 mSize = 0;
113 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
126 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
154 // Log.e("SparseArray", "gc start with " + mSize);
156 int n = mSize;
176 mSize = o;
178 // Log.e("SparseArray", "gc end with " + mSize);
187 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
194 if (i < mSize
[all...]
H A DArraySet.java75 int mSize; field in class:ArraySet
79 final int N = mSize;
117 final int N = mSize;
271 mSize = 0;
297 if (mSize != 0) {
298 freeArrays(mHashes, mArray, mSize);
301 mSize = 0;
314 if (mSize > 0) {
315 System.arraycopy(ohashes, 0, mHashes, 0, mSize);
316 System.arraycopy(oarray, 0, mArray, 0, mSize);
[all...]
/frameworks/base/core/java/android/text/
H A DAutoGrowArray.java54 private @IntRange(from = 0) int mSize; field in class:AutoGrowArray.ByteArray
72 mSize = 0;
81 ensureCapacity(newSize - mSize);
83 mSize = newSize;
91 mValues[mSize++] = value;
98 final int requestedSize = mSize + count;
100 final int newCapacity = computeNewCapacity(mSize, requestedSize);
102 System.arraycopy(mValues, 0, newValues, 0, mSize);
111 mSize = 0;
143 return mSize;
163 private @IntRange(from = 0) int mSize; field in class:AutoGrowArray.IntArray
272 private @IntRange(from = 0) int mSize; field in class:AutoGrowArray.FloatArray
[all...]
/frameworks/opt/net/wifi/service/java/com/android/server/wifi/hotspot2/
H A DIconEvent.java6 private final int mSize; field in class:IconEvent
12 mSize = size;
25 return mSize;
37 ", size=" + mSize;
/frameworks/av/media/libaaudio/src/utility/
H A DFixedBlockReader.cpp27 mPosition = mSize;
32 mPosition = mSize; // Indicate no data in storage.
38 int32_t dataAvailable = mSize - mPosition;
51 if (mPosition < mSize) {
56 } else if (bytesLeft >= mSize) {
58 result = mFixedBlockProcessor.onProcessFixedBlock(buffer, mSize);
59 buffer += mSize;
60 bytesLeft -= mSize;
63 result = mFixedBlockProcessor.onProcessFixedBlock(mStorage, mSize);
H A DFixedBlockAdapter.cpp27 mSize = bytesPerFixedBlock;
37 mSize = 0;
H A DFixedBlockWriter.cpp29 int32_t roomAvailable = mSize - mPosition;
48 if (mPosition == mSize) {
49 result = mFixedBlockProcessor.onProcessFixedBlock(mStorage, mSize);
55 while(bytesLeft > mSize && result == 0) {
56 result = mFixedBlockProcessor.onProcessFixedBlock(buffer, mSize);
57 buffer += mSize;
58 bytesLeft -= mSize;
/frameworks/base/core/java/android/text/style/
H A DAbsoluteSizeSpan.java37 private final int mSize; field in class:AbsoluteSizeSpan
52 mSize = size;
60 mSize = src.readInt();
88 dest.writeInt(mSize);
100 return mSize;
119 ds.setTextSize(mSize * ds.density);
121 ds.setTextSize(mSize);
128 ds.setTextSize(mSize * ds.density);
130 ds.setTextSize(mSize);
/frameworks/base/core/tests/benchmarks/src/android/net/
H A DNetworkStatsBenchmark.java28 private int mSize; field in class:NetworkStatsBenchmark
33 mNetworkStats = new NetworkStats(0, mSize + 2);
36 for (int i = 0; i < mSize; i++) {
37 recycle.iface = (i < mSize / 2) ? TUN_IFACE : UNDERLYING_IFACE;
55 recycle.rxBytes = 90000 * mSize;
56 recycle.rxPackets = 40 * mSize;
57 recycle.txBytes = 180000 * mSize;
58 recycle.txPackets = 1200 * mSize;
/frameworks/base/core/java/android/app/backup/
H A DFullBackupDataOutput.java15 private long mSize; field in class:FullBackupDataOutput
41 mSize = 0;
49 mSize = 0;
78 mSize += size;
83 public long getSize() { return mSize; }
/frameworks/support/collection/src/main/java/androidx/collection/
H A DSparseArrayCompat.java53 private int mSize; field in class:SparseArrayCompat
78 mSize = 0;
109 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
122 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
156 final int end = Math.min(mSize, index + size);
163 // Log.e("SparseArray", "gc start with " + mSize);
165 int n = mSize;
185 mSize = o;
187 // Log.e("SparseArray", "gc end with " + mSize);
196 int i = ContainerHelpers.binarySearch(mKeys, mSize, ke
[all...]
H A DLongSparseArray.java49 private int mSize; field in class:LongSparseArray
74 mSize = 0;
105 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
118 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
146 // Log.e("SparseArray", "gc start with " + mSize);
148 int n = mSize;
168 mSize = o;
170 // Log.e("SparseArray", "gc end with " + mSize);
179 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
186 if (i < mSize
[all...]
H A DArraySet.java80 private int mSize; field in class:ArraySet
84 final int N = mSize;
122 final int N = mSize;
254 mSize = 0;
282 if (mSize != 0) {
283 freeArrays(mHashes, mArray, mSize);
286 mSize = 0;
299 if (mSize > 0) {
300 System.arraycopy(ohashes, 0, mHashes, 0, mSize);
301 System.arraycopy(oarray, 0, mArray, 0, mSize);
[all...]
/frameworks/base/tests/HwAccelerationTest/src/com/android/test/hwui/
H A DPathOpsActivity.java41 private float mSize; field in class:PathOpsActivity.PathsView
60 mSize = w / (ops.length * 2.0f);
63 p1.addRect(0.0f, 0.0f, mSize, mSize, Path.Direction.CW);
66 p2.addCircle(mSize, mSize, mSize / 2.0f, Path.Direction.CW);
80 canvas.translate(mSize * 0.2f, getHeight() / 2.0f);
83 canvas.translate(mSize * 1.8f, 0.0f);
/frameworks/base/packages/SettingsLib/src/com/android/settingslib/drawable/
H A DCircleFramedDrawable.java43 private final int mSize; field in class:CircleFramedDrawable
60 mSize = size;
62 mBitmap = Bitmap.createBitmap(mSize, mSize, Bitmap.Config.ARGB_8888);
70 final RectF circleRect = new RectF(0f, 0f, mSize, mSize);
93 mSrcRect = new Rect(0, 0, mSize, mSize);
94 mDstRect = new RectF(0, 0, mSize, mSize);
[all...]
/frameworks/layoutlib/bridge/src/com/android/layoutlib/bridge/util/
H A DSparseWeakArray.java65 mSize = 0;
81 int i = binarySearch(mKeys, 0, mSize, key);
94 int i = binarySearch(mKeys, 0, mSize, key);
122 int n = mSize;
143 mSize = o;
152 int i = binarySearch(mKeys, 0, mSize, key);
159 if (i < mSize && (mValues[i] == DELETED || mValues[i].get() == null)) {
165 if (mSize >= mKeys.length && (mGarbage || hasReclaimedRefs())) {
169 i = ~binarySearch(mKeys, 0, mSize, key);
172 mKeys = GrowingArrayUtils.insert(mKeys, mSize,
328 private int mSize; field in class:SparseWeakArray
[all...]

Completed in 2609 milliseconds

123456789