Searched refs:newCount (Results 1 - 25 of 56) sorted by relevance

123

/external/icu/android_icu4j/src/main/java/android/icu/impl/
H A DDiffer.java145 int newCount = aCount-aTop;
146 System.arraycopy(a, aTop, a, 0, newCount);
147 aCount = newCount;
153 int newCount = bCount-bTop;
154 System.arraycopy(b, bTop, b, 0, newCount);
155 bCount = newCount;
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
H A DDiffer.java143 int newCount = aCount-aTop;
144 System.arraycopy(a, aTop, a, 0, newCount);
145 aCount = newCount;
151 int newCount = bCount-bTop;
152 System.arraycopy(b, bTop, b, 0, newCount);
153 bCount = newCount;
/external/skia/src/gpu/gl/
H A DGrGLVertexArray.h30 void resize(int newCount) { argument
31 fAttribArrayStates.resize_back(newCount);
32 for (int i = 0; i < newCount; ++i) {
/external/skia/include/private/
H A DSkTArray.h120 int newCount = fCount - 1;
121 fCount = newCount;
123 if (n != newCount) {
124 this->move(n, newCount);
234 void resize_back(int newCount) { argument
235 SkASSERT(newCount >= 0);
237 if (newCount > fCount) {
238 this->push_back_n(newCount - fCount);
239 } else if (newCount < fCount) {
240 this->pop_back_n(fCount - newCount);
436 int newCount = fCount + delta; local
[all...]
H A DSkTDArray.h208 int newCount = fCount - 1;
209 fCount = newCount;
210 if (index != newCount) {
211 memcpy(fArray + index, fArray + newCount, sizeof(T));
/external/deqp/framework/delibs/depool/
H A DdePoolMultiSet.h74 deBool TYPENAME##_setKeyCount (TYPENAME* set, KEYTYPE key, int newCount); \
147 deBool TYPENAME##_setKeyCount (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/guava/guava/src/com/google/common/collect/
H A DForwardingMultiset.java99 public boolean setCount(E element, int oldCount, int newCount) { argument
100 return delegate().setCount(element, oldCount, newCount);
225 protected boolean standardSetCount(E element, int oldCount, int newCount) { argument
226 return Multisets.setCountImpl(this, element, oldCount, newCount);
H A DTreeMultiset.java312 public boolean setCount(@Nullable E element, int oldCount, int newCount) { argument
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, resul
717 setCount( Comparator<? super E> comparator, @Nullable E e, int expectedCount, int newCount, int[] result) argument
[all...]
H A DConcurrentHashMultiset.java394 * 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) { argument
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...]
H A DMultiset.java170 * @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); argument
H A DAbstractMultiset.java104 public boolean setCount(@Nullable E element, int oldCount, int newCount) { argument
105 return setCountImpl(this, element, oldCount, newCount);
H A DAbstractMapBasedMultiset.java227 long newCount = (long) oldCount + (long) occurrences;
228 checkArgument(newCount <= Integer.MAX_VALUE,
229 "too many occurrences: %s", newCount);
H A DMapMakerInternalMap.java2502 int newCount = this.count + 1;
2503 if (newCount > this.threshold) { // ensure capacity
2505 newCount = this.count + 1;
2527 newCount = this.count; // count remains unchanged
2529 newCount = this.count + 1;
2531 this.count = newCount; // write-volatile
2555 newCount = this.count + 1;
2557 this.count = newCount; // write-volatile
2586 int newCount = count;
2627 newCount
[all...]
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
H A DTreeMultiset.java308 public boolean setCount(@Nullable E element, int oldCount, int newCount) { argument
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, resul
713 setCount( Comparator<? super E> comparator, @Nullable E e, int expectedCount, int newCount, int[] result) argument
[all...]
H A DAbstractMapBasedMultiset.java224 long newCount = (long) oldCount + (long) occurrences;
225 checkArgument(newCount <= Integer.MAX_VALUE,
226 "too many occurrences: %s", newCount);
/external/javassist/src/main/javassist/bytecode/
H A DByteStream.java185 int newCount = count + delta;
186 if (newCount > buf.length) {
188 byte[] newBuf = new byte[newLen > newCount ? newLen : newCount];
/external/skia/src/animator/
H A DSkAnimateActive.cpp60 int newCount = animates.count(); local
62 int total = oldCount + newCount;
66 memset(&fInterpolators.begin()[oldCount], 0, newCount * sizeof(SkOperandInterpolator*));
71 newCount);
75 for (index = 0; index < newCount; index++) {
110 // total = oldCount + newCount;
118 int newCount = fAnimators.count(); local
122 int newTotal = records * newCount;
126 newTotal -= newCount;
131 sizeof(fSaveRestore[0]) * (newCount
[all...]
/external/skia/src/ports/
H A DSkFontMgr_win_dw.cpp79 ULONG newCount = InterlockedDecrement(&fRefCount); local
80 if (0 == newCount) {
83 return newCount;
155 ULONG newCount = InterlockedDecrement(&fRefCount); local
156 if (0 == newCount) {
159 return newCount;
242 ULONG newCount = InterlockedDecrement(&fRefCount); local
243 if (0 == newCount) {
246 return newCount;
606 ULONG newCount variable
707 ULONG newCount = InterlockedDecrement(&fRefCount); variable
[all...]
/external/pdfium/core/src/fxge/win32/
H A Dfx_win32_dwrite.cpp276 ULONG newCount = InterlockedDecrement((long*)(&refCount_)); local
277 if (newCount == 0) {
280 return newCount;
325 ULONG newCount = InterlockedDecrement((long*)(&refCount_)); local
326 if (newCount == 0) {
330 return newCount;
/external/opencv3/modules/cudaimgproc/src/
H A Dhough_circles.cpp215 int newCount = 0;
288 newBuf[newCount++] = p;
292 cudaSafeCall( cudaMemcpy(centers, newBuf, newCount * sizeof(unsigned int), cudaMemcpyHostToDevice) );
293 centersCount = newCount;
/external/skia/src/utils/win/
H A DSkDWriteFontFileStream.cpp168 ULONG newCount = InterlockedDecrement(&fRefCount); local
169 if (0 == newCount) {
172 return newCount;
/external/guava/guava-tests/benchmark/com/google/common/collect/
H A DConcurrentHashMultisetBenchmark.java382 * Sets the number of occurrences of {@code element} to {@code newCount}, but
389 * {@code oldCount == newCount}, the method will return {@code true} if
391 * @throws IllegalArgumentException if {@code oldCount} or {@code newCount} is
394 @Override public boolean setCount(E element, int oldCount, int newCount) { argument
396 checkNonnegative(newCount, "newCount");
397 if (newCount == 0) {
406 return countMap.putIfAbsent(element, newCount) == null;
408 return countMap.replace(element, oldCount, newCount);
/external/guava/guava/src/com/google/common/cache/
H A DLocalCache.java2224 int newCount = this.count - 1;
2254 this.count = newCount; // write-volatile
2830 int newCount = this.count + 1;
2831 if (newCount > this.threshold) { // ensure capacity
2833 newCount = this.count + 1;
2855 newCount = this.count; // count remains unchanged
2858 newCount = this.count + 1;
2860 this.count = newCount; // write-volatile
2885 newCount = this.count + 1;
2886 this.count = newCount; // writ
[all...]
/external/deqp/framework/delibs/decpp/
H A DdeSharedPtr.hpp485 deInt32 oldCount, newCount; local
493 newCount = oldCount+1;
494 } while (deAtomicCompareExchange32((deUint32 volatile*)&state->strongRefCount, (deUint32)oldCount, (deUint32)newCount) != (deUint32)oldCount);
/external/guava/guava-tests/test/com/google/common/collect/
H A DForwardingMultisetTest.java111 @Override public boolean setCount(T element, int oldCount, int newCount) { argument
112 return standardSetCount(element, oldCount, newCount);
233 String element, int oldCount, int newCount) {

Completed in 627 milliseconds

123