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

1234567

/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/android/app/backup/
H A DFullBackupDataOutput.java13 private long mSize; field in class:FullBackupDataOutput
18 mSize = 0;
32 mSize += size;
37 public long getSize() { return mSize; }
/frameworks/base/core/java/android/util/
H A DLongArray.java31 private int mSize; field in class:LongArray
49 mSize = 0;
56 add(mSize, value);
65 if (index < 0 || index > mSize) {
71 if (mSize - index != 0) {
72 System.arraycopy(mValues, index, mValues, index + 1, mSize - index);
76 mSize++;
83 final int count = values.mSize;
86 System.arraycopy(values.mValues, 0, mValues, mSize, count);
87 mSize
[all...]
H A DIntArray.java33 private int mSize; field in class:IntArray
51 mSize = 0;
58 add(mSize, value);
67 if (index < 0 || index > mSize) {
73 if (mSize - index != 0) {
74 System.arraycopy(mValues, index, mValues, index + 1, mSize - index);
78 mSize++;
96 return ContainerHelpers.binarySearch(mValues, mSize, value);
103 final int count = values.mSize;
106 System.arraycopy(values.mValues, 0, mValues, mSize, coun
[all...]
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 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);
125 System.arraycopy(mKeys, index + 1, mKeys, index, mSize - (index + 1));
126 System.arraycopy(mValues, index + 1, mValues, index, mSize - (index + 1));
127 mSize--;
136 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
143 mKeys = GrowingArrayUtils.insert(mKeys, mSize, i, key);
144 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--;
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
264 private int mSize; field in class:SparseBooleanArray
[all...]
H A DArraySet.java74 int mSize; field in class:ArraySet
78 final int N = mSize;
116 final int N = mSize;
227 mSize = 0;
240 mSize = 0;
266 if (mSize != 0) {
267 freeArrays(mHashes, mArray, mSize);
270 mSize = 0;
283 if (mSize > 0) {
284 System.arraycopy(ohashes, 0, mHashes, 0, mSize);
[all...]
H A DSparseIntArray.java48 private int mSize; field in class:SparseIntArray
72 mSize = 0;
101 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
114 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
125 System.arraycopy(mKeys, index + 1, mKeys, index, mSize - (index + 1));
126 System.arraycopy(mValues, index + 1, mValues, index, mSize - (index + 1));
127 mSize--;
136 int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
143 mKeys = GrowingArrayUtils.insert(mKeys, mSize, i, key);
144 mValues = GrowingArrayUtils.insert(mValues, 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);
178 final int end = Math.min(mSize, index + size);
185 // Log.e("SparseArray", "gc start with " + mSize);
187 int n = mSize;
207 mSize = o;
209 // 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 DArrayMap.java85 int mSize; field in class:ArrayMap
89 final int N = mSize;
127 final int N = mSize;
241 mSize = 0;
254 mSize = 0;
263 mSize = 0;
281 if (mSize > 0) {
282 freeArrays(mHashes, mArray, mSize);
285 mSize = 0;
294 if (mSize >
[all...]
/frameworks/base/core/java/android/text/style/
H A DAbsoluteSizeSpan.java26 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/av/include/private/media/
H A DVideoFrame.h33 VideoFrame(): mWidth(0), mHeight(0), mDisplayWidth(0), mDisplayHeight(0), mSize(0), mData(0),
41 mSize = copy.mSize;
43 if (mSize > 0 && copy.mData != NULL) {
44 mData = new uint8_t[mSize];
46 memcpy(mData, copy.mData, mSize);
48 mSize = 0;
65 uint32_t mSize; // Number of bytes in mData member in class:android::VideoFrame
/frameworks/base/core/tests/benchmarks/src/android/net/
H A DNetworkStatsBenchmark.java28 private int mSize; field in class:NetworkStatsBenchmark
35 mNetworkStats = new NetworkStats(0, mSize + 2);
38 for (int i = 0; i < mSize; i++) {
39 recycle.iface = (i < mSize / 2) ? TUN_IFACE : UNDERLYING_IFACE;
57 recycle.rxBytes = 90000 * mSize;
58 recycle.rxPackets = 40 * mSize;
59 recycle.txBytes = 180000 * mSize;
60 recycle.txPackets = 1200 * mSize;
/frameworks/support/v4/java/android/support/v4/util/
H A DSimpleArrayMap.java59 int mSize; field in class:SimpleArrayMap
62 final int N = mSize;
100 final int N = mSize;
211 mSize = 0;
224 mSize = 0;
241 if (mSize != 0) {
242 freeArrays(mHashes, mArray, mSize);
245 mSize = 0;
258 if (mSize > 0) {
259 System.arraycopy(ohashes, 0, mHashes, 0, mSize);
[all...]
H A DSparseArrayCompat.java29 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 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...]
/frameworks/av/media/libstagefright/foundation/
H A DAString.cpp35 mSize(0),
41 mSize(0),
48 mSize(0),
55 mSize(0),
62 mSize(0),
69 mSize(0),
87 return mSize;
95 return mSize == 0;
121 mSize = 0;
127 for (size_t i = 0; i < mSize;
[all...]
/frameworks/support/v7/recyclerview/src/android/support/v7/widget/
H A DPositionMap.java31 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 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/tools/aapt2/
H A DBigBuffer.h110 size_t mSize; member in class:aapt::BigBuffer
114 inline BigBuffer::BigBuffer(size_t blockSize) : mBlockSize(blockSize), mSize(0) {
118 mBlockSize(rhs.mBlockSize), mSize(rhs.mSize), mBlocks(std::move(rhs.mBlocks)) {
122 return mSize;
133 mSize += buffer.mSize;
135 buffer.mSize = 0;
143 const size_t unaligned = mSize % 4;
/frameworks/base/tools/layoutlib/bridge/src/com/android/layoutlib/bridge/libcore/io/
H A DBridgeBufferIterator.java28 private final long mSize; field in class:BridgeBufferIterator
32 mSize = size;
38 assert offset <= mSize;
45 assert newPosition <= mSize;
/frameworks/base/tools/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...]
/frameworks/native/libs/binder/
H A DMemoryBase.cpp30 : mSize(size), mOffset(offset), mHeap(heap)
37 if (size) *size = mSize;

Completed in 1569 milliseconds

1234567