HomeSort by relevance Sort by last modified time
    Searched refs:mSize (Results 26 - 50 of 772) sorted by null

12 3 4 5 6 7 8 91011>>

  /packages/apps/UnifiedEmail/src/com/android/mail/utils/
SparseLongArray.java 31 private int mSize;
48 mSize = 0;
77 int i = binarySearch(mKeys, 0, mSize, key);
90 int i = binarySearch(mKeys, 0, mSize, key);
101 System.arraycopy(mKeys, index + 1, mKeys, index, mSize - (index + 1));
102 System.arraycopy(mValues, index + 1, mValues, index, mSize - (index + 1));
103 mSize--;
112 int i = binarySearch(mKeys, 0, mSize, key);
119 if (mSize >= mKeys.length) {
120 growKeyAndValueArrays(mSize + 1)
    [all...]
  /frameworks/base/core/tests/benchmarks/src/android/net/
NetworkStatsBenchmark.java 28 private int mSize;
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;
  /packages/inputmethods/LatinIME/native/jni/src/dictionary/structure/backward/v402/content/
terminal_position_lookup_table.cpp 34 if (terminalId < 0 || terminalId >= mSize) {
48 while (terminalId >= mSize) {
51 Ver4DictConstants::TERMINAL_ADDRESS_TABLE_ADDRESS_SIZE, getEntryPos(mSize))) {
54 mSize++;
65 if (getEntryPos(mSize) < getBuffer()->getTailPosition()) {
67 for (int i = 0; i < mSize; ++i) {
87 for (int i = 0; i < mSize; ++i) {
105 mSize = nextNewTerminalId;
probability_dict_content.h 45 mSize(getBuffer()->getTailPosition() / getEntrySize()) {}
48 : mHasHistoricalInfo(hasHistoricalInfo), mSize(0) {}
69 int mSize;
  /packages/inputmethods/LatinIME/native/jni/src/dictionary/structure/v4/content/
terminal_position_lookup_table.cpp 24 if (terminalId < 0 || terminalId >= mSize) {
38 while (terminalId >= mSize) {
41 Ver4DictConstants::TERMINAL_ADDRESS_TABLE_ADDRESS_SIZE, getEntryPos(mSize))) {
44 mSize++;
55 if (getEntryPos(mSize) < getBuffer()->getTailPosition()) {
57 for (int i = 0; i < mSize; ++i) {
76 for (int i = 0; i < mSize; ++i) {
94 mSize = nextNewTerminalId;
  /cts/tests/tests/media/libaudiojni/
Blob.h 33 mSize(size) {
47 const size_t mSize;
57 mSize(size),
64 mSize(size),
73 const size_t mSize;
  /frameworks/support/compat/java/android/support/v4/util/
SimpleArrayMap.java 59 int mSize;
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...]
SparseArrayCompat.java 29 private int mSize;
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, key)
    [all...]
LongSparseArray.java 49 private int mSize;
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 && mValues[i] == DELETED)
    [all...]
  /frameworks/support/v7/recyclerview/src/android/support/v7/widget/
PositionMap.java 31 private int mSize;
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, key)
    [all...]
  /external/protobuf/java/src/main/java/com/google/protobuf/nano/
FieldArray.java 49 private int mSize;
67 mSize = 0;
97 int n = mSize;
117 mSize = o;
132 if (i < mSize && mData[i] == DELETED) {
138 if (mGarbage && mSize >= mFieldNumbers.length) {
145 if (mSize >= mFieldNumbers.length) {
146 int n = idealIntArraySize(mSize + 1);
158 if (mSize - i != 0) {
159 System.arraycopy(mFieldNumbers, i, mFieldNumbers, i + 1, mSize - i)
    [all...]
  /cts/suite/audio_quality/lib/include/audio/
Buffer.h 44 return mSize;
52 mSize = size;
56 mSize += size;
65 mSize = len;
73 return mSize <= mHandled;
93 return mSize - mHandled;
125 size_t mSize;
  /external/robolectric/v1/src/main/java/com/xtremelabs/robolectric/shadows/
ShadowSparseArray.java 62 mSize = 0;
82 int i = binarySearch(mKeys, 0, mSize, key);
97 int i = binarySearch(mKeys, 0, mSize, key);
116 // Log.e("SparseArray", "gc start with " + mSize);
118 int n = mSize;
137 mSize = o;
139 // Log.e("SparseArray", "gc end with " + mSize);
149 int i = binarySearch(mKeys, 0, mSize, key);
156 if (i < mSize && mValues[i] == DELETED) {
162 if (mGarbage && mSize >= mKeys.length)
    [all...]
  /frameworks/base/core/java/android/util/
SparseArray.java 58 private int mSize;
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...]
LongSparseArray.java 58 private int mSize;
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 && mValues[i] == DELETED)
    [all...]
ArraySet.java 75 int mSize;
79 final int N = mSize;
117 final int N = mSize;
263 mSize = 0;
289 if (mSize != 0) {
290 freeArrays(mHashes, mArray, mSize);
293 mSize = 0;
306 if (mSize > 0) {
307 System.arraycopy(ohashes, 0, mHashes, 0, mSize);
308 System.arraycopy(oarray, 0, mArray, 0, mSize);
    [all...]
ArrayMap.java 86 int mSize;
90 final int N = mSize;
128 final int N = mSize;
266 mSize = 0;
284 if (mSize > 0) {
285 freeArrays(mHashes, mArray, mSize);
288 mSize = 0;
297 if (mSize > 0) {
298 final int N = mSize<<1;
303 mSize = 0
    [all...]
  /frameworks/base/tests/HwAccelerationTest/src/com/android/test/hwui/
PathOpsActivity.java 41 private float mSize;
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/util/
BigBuffer.h 111 size_t mSize;
115 inline BigBuffer::BigBuffer(size_t blockSize) : mBlockSize(blockSize), mSize(0) {
119 mBlockSize(rhs.mBlockSize), mSize(rhs.mSize), mBlocks(std::move(rhs.mBlocks)) {
123 return mSize;
135 mSize += buffer.mSize;
137 buffer.mSize = 0;
145 const size_t unaligned = mSize % 4;
  /external/smali/util/src/main/java/org/jf/util/
SparseArray.java 62 mSize = 0;
78 int i = binarySearch(mKeys, 0, mSize, key);
91 int i = binarySearch(mKeys, 0, mSize, key);
109 // Log.e("SparseArray", "gc start with " + mSize);
111 int n = mSize;
130 mSize = o;
132 // Log.e("SparseArray", "gc end with " + mSize);
141 int i = binarySearch(mKeys, 0, mSize, key);
148 if (i < mSize && mValues[i] == DELETED) {
154 if (mGarbage && mSize >= mKeys.length)
    [all...]
  /external/replicaisland/src/com/replica/replicaisland/
ObjectPool.java 27 private int mSize;
64 mSize = size;
65 mAvailable = new FixedSizeArray<Object>(mSize);
77 return mSize;
  /frameworks/base/packages/SettingsLib/src/com/android/settingslib/drawable/
CircleFramedDrawable.java 43 private final int mSize;
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/base/tools/layoutlib/bridge/src/com/android/layoutlib/bridge/libcore/io/
BridgeBufferIterator.java 28 private final long mSize;
32 mSize = size;
38 assert offset <= mSize;
45 assert newPosition <= mSize;
  /frameworks/base/tools/layoutlib/bridge/src/com/android/layoutlib/bridge/util/
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, i, key)
    [all...]
  /frameworks/native/libs/binder/
MemoryBase.cpp 30 : mSize(size), mOffset(offset), mHeap(heap)
37 if (size) *size = mSize;

Completed in 1458 milliseconds

12 3 4 5 6 7 8 91011>>