/frameworks/base/packages/WallpaperCropper/src/com/android/gallery3d/util/ |
H A D | IntArray.java | 23 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 D | RingBufferIndices.java | 28 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 D | LongSparseLongArray.java | 50 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 D | SparseBooleanArray.java | 69 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--; 122 System.arraycopy(mKeys, index + 1, mKeys, index, mSize - (index + 1)); 123 System.arraycopy(mValues, index + 1, mValues, index, mSize - (index + 1)); 124 mSize--; 133 int i = ContainerHelpers.binarySearch(mKeys, mSize, ke 304 private int mSize; field in class:SparseBooleanArray [all...] |
H A D | SparseLongArray.java | 48 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 D | SparseIntArray.java | 50 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 D | IntArray.java | 33 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 D | LongArray.java | 33 private int mSize; field in class:LongArray 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++; 119 final int count = values.mSize; 122 System.arraycopy(values.mValues, 0, mValues, mSize, coun [all...] |
H A D | SparseArray.java | 58 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 D | LongSparseArray.java | 58 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 D | ArraySet.java | 75 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/style/ |
H A D | AbsoluteSizeSpan.java | 26 private final int mSize; field in class:AbsoluteSizeSpan 33 mSize = size; 42 mSize = size; 47 mSize = src.readInt(); 70 dest.writeInt(mSize); 75 return mSize; 85 ds.setTextSize(mSize * ds.density); 87 ds.setTextSize(mSize); 94 ds.setTextSize(mSize * ds.density); 96 ds.setTextSize(mSize); [all...] |
/frameworks/opt/net/wifi/service/java/com/android/server/wifi/hotspot2/ |
H A D | IconEvent.java | 6 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 D | FixedBlockReader.cpp | 27 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 D | FixedBlockAdapter.cpp | 27 mSize = bytesPerFixedBlock; 37 mSize = 0;
|
H A D | FixedBlockWriter.cpp | 29 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/app/backup/ |
H A D | FullBackupDataOutput.java | 14 private long mSize; field in class:FullBackupDataOutput 30 mSize = 0; 50 mSize += size; 55 public long getSize() { return mSize; }
|
/frameworks/base/core/tests/benchmarks/src/android/net/ |
H A D | NetworkStatsBenchmark.java | 28 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/support/compat/java/android/support/v4/util/ |
H A D | SparseArrayCompat.java | 29 private int mSize; field in class:SparseArrayCompat 54 mSize = 0; 85 int i = ContainerHelpers.binarySearch(mKeys, mSize, key); 98 int i = ContainerHelpers.binarySearch(mKeys, mSize, key); 132 final int end = Math.min(mSize, index + size); 139 // Log.e("SparseArray", "gc start with " + mSize); 141 int n = mSize; 161 mSize = o; 163 // Log.e("SparseArray", "gc end with " + mSize); 172 int i = ContainerHelpers.binarySearch(mKeys, mSize, ke [all...] |
H A D | LongSparseArray.java | 49 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 D | ArraySet.java | 80 int mSize; field in class:ArraySet 84 final int N = mSize; 122 final int N = mSize; 260 mSize = 0; 286 if (mSize != 0) { 287 freeArrays(mHashes, mArray, mSize); 290 mSize = 0; 303 if (mSize > 0) { 304 System.arraycopy(ohashes, 0, mHashes, 0, mSize); 305 System.arraycopy(oarray, 0, mArray, 0, mSize); [all...] |
/frameworks/support/v7/recyclerview/src/android/support/v7/widget/ |
H A D | PositionMap.java | 31 private int mSize; field in class:PositionMap 56 mSize = 0; 87 int i = ContainerHelpers.binarySearch(mKeys, mSize, key); 100 int i = ContainerHelpers.binarySearch(mKeys, mSize, key); 134 final int end = Math.min(mSize, index + size); 149 // Log.e("SparseArray", "gc start with " + mSize); 151 int n = mSize; 171 mSize = o; 173 // Log.e("SparseArray", "gc end with " + mSize); 182 int i = ContainerHelpers.binarySearch(mKeys, mSize, ke [all...] |
/frameworks/base/tests/HwAccelerationTest/src/com/android/test/hwui/ |
H A D | PathOpsActivity.java | 41 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/av/include/private/media/ |
H A D | VideoFrame.h | 44 mSize(0), mIccSize(0), mReserved(0), mData(0), mIccData(0) { 46 mSize = mRowBytes * mHeight; 47 mData = new uint8_t[mSize]; 49 mSize = 0; 68 mSize = copy.mSize; 70 if (mSize > 0 && copy.mData != NULL) { 71 mData = new uint8_t[mSize]; 73 memcpy(mData, copy.mData, mSize); 75 mSize 142 uint32_t mSize; // Number of bytes in mData member in class:android::VideoFrame [all...] |
/frameworks/layoutlib/bridge/src/com/android/layoutlib/bridge/util/ |
H A D | SparseWeakArray.java | 65 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...] |