| /external/icu/icu4j/demos/src/com/ibm/icu/dev/demo/translit/ |
| IntDiffer.java | 128 int newCount = aCount-aTop;
129 System.arraycopy(a, aTop, a, 0, newCount);
130 aCount = newCount;
135 int newCount = bCount-bTop;
136 System.arraycopy(b, bTop, b, 0, newCount);
137 bCount = newCount;
|
| /external/cldr/tools/java/org/unicode/cldr/util/ |
| Differ.java | 146 int newCount = aCount - aTop;
147 System.arraycopy(a, aTop, a, 0, newCount);
148 aCount = newCount;
154 int newCount = bCount - bTop;
155 System.arraycopy(b, bTop, b, 0, newCount);
156 bCount = newCount;
|
| /external/skia/include/private/ |
| SkTArray.h | 156 int newCount = fCount - 1;
157 fCount = newCount;
159 if (n != newCount) {
160 this->move(n, newCount);
289 void resize_back(int newCount) {
290 SkASSERT(newCount >= 0);
292 if (newCount > fCount) {
293 this->push_back_n(newCount - fCount);
294 } else if (newCount < fCount) {
295 this->pop_back_n(fCount - newCount);
[all...] |
| SkTDArray.h | 208 int newCount = fCount - 1;
209 fCount = newCount;
210 if (index != newCount) {
211 memcpy(fArray + index, fArray + newCount, sizeof(T));
|
| /external/skqp/include/private/ |
| SkTArray.h | 156 int newCount = fCount - 1;
157 fCount = newCount;
159 if (n != newCount) {
160 this->move(n, newCount);
289 void resize_back(int newCount) {
290 SkASSERT(newCount >= 0);
292 if (newCount > fCount) {
293 this->push_back_n(newCount - fCount);
294 } else if (newCount < fCount) {
295 this->pop_back_n(fCount - newCount);
[all...] |
| SkTDArray.h | 208 int newCount = fCount - 1;
209 fCount = newCount;
210 if (index != newCount) {
211 memcpy(fArray + index, fArray + newCount, sizeof(T));
|
| /external/skia/src/gpu/gl/ |
| GrGLVertexArray.h | 30 void resize(int newCount) {
31 fAttribArrayStates.resize_back(newCount);
|
| /external/skqp/src/gpu/gl/ |
| GrGLVertexArray.h | 30 void resize(int newCount) {
31 fAttribArrayStates.resize_back(newCount);
|
| /external/cldr/tools/java/org/unicode/cldr/tool/ |
| CLDRCompare.java | 78 int newCount = 0;
91 ++newCount;
109 printLine(subDir, file, sameCount, newCount, deletedCount, diffValueCount, diffBothCount,
115 private static void printLine(String subDir, String file, Object sameCount, Object newCount, Object deletedCount,
117 System.out.println(subDir + "\t" + file + "\t" + sameCount + "\t" + newCount + "\t" + deletedCount + "\t"
|
| /external/deqp/framework/delibs/depool/ |
| dePoolMultiSet.h | 74 deBool TYPENAME##_setKeyCount (DE_PTR_TYPE(TYPENAME) set, KEYTYPE key, int newCount); \
147 deBool TYPENAME##_setKeyCount (DE_PTR_TYPE(TYPENAME) set, KEYTYPE key, int newCount) \
153 DE_ASSERT(newCount >= 0); \
154 set->numElements += (newCount - oldCount); \
156 if (newCount == 0 && countPtr) \
158 else if (newCount > 0 && countPtr) \
159 *countPtr = newCount; \
160 else if (newCount > 0) \
161 return TYPENAME##Hash_insert(set->hash, key, newCount); \
|
| /external/guice/core/src/com/google/inject/internal/ |
| InternalContext.java | 78 int newCount = --enterCount;
79 if (newCount < 0) {
82 if (newCount == 0) {
|
| /external/guava/guava/src/com/google/common/collect/ |
| ForwardingMultiset.java | 99 public boolean setCount(E element, int oldCount, int newCount) {
100 return delegate().setCount(element, oldCount, newCount);
225 protected boolean standardSetCount(E element, int oldCount, int newCount) {
226 return Multisets.setCountImpl(this, element, oldCount, newCount);
|
| TreeMultiset.java | 312 public boolean setCount(@Nullable E element, int oldCount, int newCount) {
313 checkNonnegative(newCount, "newCount");
320 if (newCount > 0) {
321 add(element, newCount);
329 AvlNode<E> newRoot = root.setCount(comparator(), element, oldCount, newCount, result);
721 int newCount,
728 if (expectedCount == 0 && newCount > 0) {
729 return addLeftChild(e, newCount);
734 left = initLeft.setCount(comparator, e, expectedCount, newCount, result)
[all...] |
| ConcurrentHashMultiset.java | 394 * Sets the number of occurrences of {@code element} to {@code newCount}, but only if
400 * {@code expectedOldCount == newCount}, the method will return {@code true} if
402 * @throws IllegalArgumentException if {@code expectedOldCount} or {@code newCount} is negative
404 @Override public boolean setCount(E element, int expectedOldCount, int newCount) {
407 checkNonnegative(newCount, "newCount");
413 } else if (newCount == 0) {
417 return countMap.putIfAbsent(element, new AtomicInteger(newCount)) == null;
423 if (newCount == 0) {
428 AtomicInteger newCounter = new AtomicInteger(newCount);
[all...] |
| Multiset.java | 170 * @param newCount the desired count of the element in this multiset
173 * {@code oldCount == newCount}.
174 * @throws IllegalArgumentException if {@code oldCount} or {@code newCount} is
178 * oldCount} and {@code newCount} are both zero, the implementor may
181 boolean setCount(E element, int oldCount, int newCount);
|
| AbstractMultiset.java | 104 public boolean setCount(@Nullable E element, int oldCount, int newCount) {
105 return setCountImpl(this, element, oldCount, newCount);
|
| AbstractMapBasedMultiset.java | 227 long newCount = (long) oldCount + (long) occurrences;
228 checkArgument(newCount <= Integer.MAX_VALUE,
229 "too many occurrences: %s", newCount);
|
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| TreeMultiset.java | 308 public boolean setCount(@Nullable E element, int oldCount, int newCount) {
309 checkNonnegative(newCount, "newCount");
316 if (newCount > 0) {
317 add(element, newCount);
325 AvlNode<E> newRoot = root.setCount(comparator(), element, oldCount, newCount, result);
717 int newCount,
724 if (expectedCount == 0 && newCount > 0) {
725 return addLeftChild(e, newCount);
730 left = initLeft.setCount(comparator, e, expectedCount, newCount, result)
[all...] |
| AbstractMapBasedMultiset.java | 224 long newCount = (long) oldCount + (long) occurrences;
225 checkArgument(newCount <= Integer.MAX_VALUE,
226 "too many occurrences: %s", newCount);
|
| /art/runtime/jdwp/ |
| jdwp_expand_buf.cc | 87 static void ensureSpace(ExpandBuf* pBuf, int newCount) {
88 if (pBuf->curLen + newCount <= pBuf->maxLen) {
92 while (pBuf->curLen + newCount > pBuf->maxLen) {
|
| /external/cldr/tools/cldr-unittest/src/org/unicode/cldr/unittest/ |
| TestReferenceStringSearch.java | 106 int newCount = checkNew("lazy", bigText, newPos, newTimer, icuTimer);
110 int diff = findDifference(icuPos, newPos, oldCount, newCount);
522 int newCount) {
523 int count = Math.min(oldCount, newCount);
529 if (oldCount != newCount) {
|
| /external/pdfium/core/fxge/win32/ |
| fx_win32_dwrite.cpp | 301 ULONG newCount = InterlockedDecrement((long*)(&refCount_));
302 if (newCount == 0) {
305 return newCount;
356 ULONG newCount = InterlockedDecrement((long*)(&refCount_));
357 if (newCount == 0) {
361 return newCount;
|
| /external/skia/src/utils/win/ |
| SkDWriteFontFileStream.cpp | 168 ULONG newCount = InterlockedDecrement(&fRefCount);
169 if (0 == newCount) {
172 return newCount;
|
| /external/skqp/src/utils/win/ |
| SkDWriteFontFileStream.cpp | 168 ULONG newCount = InterlockedDecrement(&fRefCount);
169 if (0 == newCount) {
172 return newCount;
|
| /external/skia/src/ports/ |
| SkFontMgr_win_dw.cpp | 83 ULONG newCount = InterlockedDecrement(&fRefCount);
84 if (0 == newCount) {
87 return newCount;
159 ULONG newCount = InterlockedDecrement(&fRefCount);
160 if (0 == newCount) {
163 return newCount;
246 ULONG newCount = InterlockedDecrement(&fRefCount);
247 if (0 == newCount) {
250 return newCount;
616 ULONG newCount = InterlockedDecrement(&fRefCount)
[all...] |
