/external/javassist/src/main/javassist/bytecode/ |
H A D | ByteStream.java | 52 int oldCount = count; 53 buf[oldCount] = (byte)b; 54 count = oldCount + 1; 59 int oldCount = count; 60 buf[oldCount] = (byte)(s >>> 8); 61 buf[oldCount + 1] = (byte)s; 62 count = oldCount + 2; 67 int oldCount = count; 68 buf[oldCount] = (byte)(i >>> 24); 69 buf[oldCount [all...] |
/external/guava/guava/src/com/google/common/collect/ |
H A D | AbstractMapBasedMultiset.java | 221 int oldCount; 223 oldCount = 0; 226 oldCount = frequency.get(); 227 long newCount = (long) oldCount + (long) occurrences; 233 return oldCount; 247 int oldCount = frequency.get(); 250 if (oldCount > occurrences) { 253 numberRemoved = oldCount; 259 return oldCount; 267 int oldCount; [all...] |
H A D | ForwardingMultiset.java | 99 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 D | Multiset.java | 164 * current count. If the current count is not {@code oldCount}, no change is 169 * @param oldCount the expected present 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 D | AbstractMultiset.java | 104 public boolean setCount(@Nullable E element, int oldCount, int newCount) { argument 105 return setCountImpl(this, element, oldCount, newCount);
|
H A D | FilteredEntryMultimap.java | 346 int oldCount = 0; 351 oldCount++; 352 if (oldCount <= occurrences) { 357 return oldCount;
|
H A D | Multisets.java | 175 @Override public boolean setCount(E element, int oldCount, int newCount) { argument 893 int oldCount = self.count(element); 895 int delta = count - oldCount; 902 return oldCount; 909 Multiset<E> self, E element, int oldCount, int newCount) { 910 checkNonnegative(oldCount, "oldCount"); 913 if (self.count(element) == oldCount) { 908 setCountImpl( Multiset<E> self, E element, int oldCount, int newCount) argument
|
H A D | TreeMultiset.java | 312 public boolean setCount(@Nullable E element, int oldCount, int newCount) { argument 314 checkNonnegative(oldCount, "oldCount"); 319 if (oldCount == 0) { 329 AvlNode<E> newRoot = root.setCount(comparator(), element, oldCount, newCount, result); 331 return result[0] == oldCount;
|
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | AbstractMapBasedMultiset.java | 218 int oldCount; 220 oldCount = 0; 223 oldCount = frequency.get(); 224 long newCount = (long) oldCount + (long) occurrences; 230 return oldCount; 244 int oldCount = frequency.get(); 247 if (oldCount > occurrences) { 250 numberRemoved = oldCount; 256 return oldCount; 264 int oldCount; [all...] |
H A D | TreeMultiset.java | 308 public boolean setCount(@Nullable E element, int oldCount, int newCount) { argument 310 checkNonnegative(oldCount, "oldCount"); 315 if (oldCount == 0) { 325 AvlNode<E> newRoot = root.setCount(comparator(), element, oldCount, newCount, result); 327 return result[0] == oldCount;
|
/external/skia/src/core/ |
H A D | SkCachedData.cpp | 18 int32_t oldCount = sk_atomic_inc(&gCachedDataCounter); local 19 SkDebugf("SkCachedData inc %d\n", oldCount + 1); 23 int32_t oldCount = sk_atomic_dec(&gCachedDataCounter); local 24 SkDebugf("SkCachedData dec %d\n", oldCount - 1);
|
H A D | SkPixelRef.cpp | 144 SkDEBUGCODE(int oldCount = fLockCount;) 147 SkASSERT(oldCount + (int)success == fLockCount);
|
H A D | SkTDynamicHash.h | 250 SkDEBUGCODE(int oldCount = fCount;) 264 SkASSERT(oldCount == fCount);
|
/external/deqp/framework/delibs/depool/ |
H A D | dePoolMultiSet.h | 96 int oldCount = TYPENAME##_getKeyCount(set, key); \ 97 return TYPENAME##_setKeyCount(set, key, oldCount + 1); \ 102 int oldCount = TYPENAME##_getKeyCount(set, key); \ 103 DE_ASSERT(oldCount > 0); \ 104 TYPENAME##_setKeyCount(set, key, oldCount - 1); \ 150 int oldCount = countPtr ? *countPtr : 0; \ 152 DE_ASSERT(oldCount > 0 || !countPtr); \ 154 set->numElements += (newCount - oldCount); \
|
/external/deqp/framework/delibs/decpp/ |
H A D | deSharedPtr.hpp | 485 deInt32 oldCount, newCount; local 490 oldCount = state->strongRefCount; 491 if (oldCount == 0) 493 newCount = oldCount+1; 494 } while (deAtomicCompareExchange32((deUint32 volatile*)&state->strongRefCount, (deUint32)oldCount, (deUint32)newCount) != (deUint32)oldCount);
|
/external/skia/include/private/ |
H A D | SkTDArray.h | 177 int oldCount = fCount; local 180 src + count <= fArray || fArray + oldCount <= src); 184 memcpy(fArray + oldCount, src, sizeof(T) * count); 187 return fArray + oldCount; 202 size_t oldCount = fCount; local 205 memmove(dst + count, dst, sizeof(T) * (oldCount - index));
|
H A D | SkTHash.h | 172 SkDEBUGCODE(int oldCount = fCount); 185 SkASSERT(fCount == oldCount);
|
/external/guava/guava-tests/benchmark/com/google/common/collect/ |
H A D | ConcurrentHashMultisetBenchmark.java | 383 * only if the count is currently {@code oldCount}. If {@code element} does 384 * not appear in the multiset exactly {@code oldCount} times, no changes will 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 395 checkNonnegative(oldCount, "oldCount"); 398 if (oldCount == 0) { 402 return countMap.remove(element, oldCount); 405 if (oldCount [all...] |
/external/guava/guava-gwt/test-super/com/google/common/collect/testing/google/super/com/google/common/collect/testing/google/ |
H A D | MultisetRemoveTester.java | 106 int oldCount = getMultiset().count(samples.e0); 108 oldCount, getMultiset().remove(samples.e0, 0));
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | ForwardingMultisetTest.java | 111 @Override public boolean setCount(T element, int oldCount, int newCount) { argument 112 return standardSetCount(element, oldCount, newCount); 233 String element, int oldCount, int newCount) {
|
/external/icu/android_icu4j/src/main/java/android/icu/text/ |
H A D | CollationElementIterator.java | 600 Integer oldCount = maxExpansions.get(lastHalf); 601 if (oldCount == null || count > oldCount) {
|
/external/icu/icu4j/main/classes/collate/src/com/ibm/icu/text/ |
H A D | CollationElementIterator.java | 617 Integer oldCount = maxExpansions.get(lastHalf); 618 if (oldCount == null || count > oldCount) {
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
H A D | MultisetRemoveTester.java | 109 int oldCount = getMultiset().count(samples.e0); 111 oldCount, getMultiset().remove(samples.e0, 0));
|
/external/icu/android_icu4j/src/main/java/android/icu/impl/ |
H A D | UnicodeSetStringSpan.java | 1130 int oldCount = list[i]; 1131 return oldCount != 0 && oldCount <= count;
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
H A D | UnicodeSetStringSpan.java | 1126 int oldCount = list[i]; 1127 return oldCount != 0 && oldCount <= count;
|