Home
last modified time | relevance | path

Searched refs:oldCount (Results 1 – 25 of 40) sorted by relevance

12

/external/javassist/src/main/javassist/bytecode/
DByteStream.java52 int oldCount = count; in write() local
53 buf[oldCount] = (byte)b; in write()
54 count = oldCount + 1; in write()
59 int oldCount = count; in writeShort() local
60 buf[oldCount] = (byte)(s >>> 8); in writeShort()
61 buf[oldCount + 1] = (byte)s; in writeShort()
62 count = oldCount + 2; in writeShort()
67 int oldCount = count; in writeInt() local
68 buf[oldCount] = (byte)(i >>> 24); in writeInt()
69 buf[oldCount + 1] = (byte)(i >>> 16); in writeInt()
[all …]
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
DAbstractMapBasedMultiset.java231 int oldCount;
233 oldCount = 0;
236 oldCount = frequency.get();
237 long newCount = (long) oldCount + (long) occurrences;
243 return oldCount;
257 int oldCount = frequency.get();
260 if (oldCount > occurrences) {
263 numberRemoved = oldCount;
269 return oldCount;
277 int oldCount;
[all …]
DTreeMultiset.java231 public boolean setCount(E element, int oldCount, int newCount) { in setCount() argument
234 return mutate(element, new ConditionalSetCountModifier(oldCount, newCount)) in setCount()
235 == oldCount; in setCount()
454 abstract int newCount(int oldCount); in newCount() argument
459 int oldCount = countOrZero(originalEntry); in modify() local
460 int newCount = newCount(oldCount); in modify()
461 if (oldCount == newCount) { in modify()
465 } else if (oldCount == 0) { in modify()
483 int newCount(int oldCount) { in newCount() argument
484 checkArgument(countToAdd <= Integer.MAX_VALUE - oldCount, "Cannot add this many elements"); in newCount()
[all …]
/external/guava/guava/src/com/google/common/collect/
DAbstractMapBasedMultiset.java234 int oldCount;
236 oldCount = 0;
239 oldCount = frequency.get();
240 long newCount = (long) oldCount + (long) occurrences;
246 return oldCount;
260 int oldCount = frequency.get();
263 if (oldCount > occurrences) {
266 numberRemoved = oldCount;
272 return oldCount;
280 int oldCount;
[all …]
DTreeMultiset.java235 public boolean setCount(E element, int oldCount, int newCount) { in setCount() argument
238 return mutate(element, new ConditionalSetCountModifier(oldCount, newCount)) in setCount()
239 == oldCount; in setCount()
458 abstract int newCount(int oldCount); in newCount() argument
463 int oldCount = countOrZero(originalEntry); in modify() local
464 int newCount = newCount(oldCount); in modify()
465 if (oldCount == newCount) { in modify()
469 } else if (oldCount == 0) { in modify()
487 int newCount(int oldCount) { in newCount() argument
488 checkArgument(countToAdd <= Integer.MAX_VALUE - oldCount, "Cannot add this many elements"); in newCount()
[all …]
DForwardingMultiset.java99 public boolean setCount(E element, int oldCount, int newCount) { in setCount() argument
100 return delegate().setCount(element, oldCount, newCount); in setCount()
230 E element, int oldCount, int newCount) { in standardSetCount() argument
231 return Multisets.setCountImpl(this, element, oldCount, newCount); in standardSetCount()
DMultisets.java172 @Override public boolean setCount(E element, int oldCount, int newCount) { in setCount() argument
429 public boolean setCount(E element, int oldCount, int newCount) { in setCount() argument
430 return setCountImpl(this, element, oldCount, newCount); in setCount()
775 int oldCount = self.count(element);
777 int delta = count - oldCount;
784 return oldCount;
791 Multiset<E> self, E element, int oldCount, int newCount) {
792 checkNonnegative(oldCount, "oldCount");
795 if (self.count(element) == oldCount) {
DAbstractMultiset.java104 public boolean setCount(E element, int oldCount, int newCount) { in setCount() argument
105 return setCountImpl(this, element, oldCount, newCount); in setCount()
DMultiset.java177 boolean setCount(E element, int oldCount, int newCount); in setCount() argument
/external/chromium_org/third_party/skia/src/animator/
DSkAnimateActive.cpp58 int oldCount = fAnimators.count(); in append() local
62 int total = oldCount + newCount; in append()
66 memset(&fInterpolators.begin()[oldCount], 0, newCount * sizeof(SkOperandInterpolator*)); in append()
67 for (index = oldCount; index < total; index++) in append()
70 memcpy(&fAnimators[oldCount], animates.begin(), sizeof(fAnimators[0]) * in append()
73 initState(apply, oldCount); in append()
78 SkActive::SkState& testState = fState[oldCount + index]; in append()
79 for (int inner = 0; inner < oldCount; inner++) { in append()
98 saveIndex -= oldCount; in append()
105 oldCount--; in append()
[all …]
DSkTypedArray.cpp105 unsigned oldCount = fCount; in append() local
113 memcpy(fArray + oldCount, src, sizeof(int32_t) * count); in append()
115 return fArray + oldCount; in append()
156 int oldCount = fCount; in insert() local
159 memmove(dst + count, dst, sizeof(int32_t) * (oldCount - index)); in insert()
DSkAnimateActive.h39 void appendSave(int oldCount);
/external/skia/src/animator/
DSkAnimateActive.cpp58 int oldCount = fAnimators.count(); in append() local
62 int total = oldCount + newCount; in append()
66 memset(&fInterpolators.begin()[oldCount], 0, newCount * sizeof(SkOperandInterpolator*)); in append()
67 for (index = oldCount; index < total; index++) in append()
70 memcpy(&fAnimators[oldCount], animates.begin(), sizeof(fAnimators[0]) * in append()
73 initState(apply, oldCount); in append()
78 SkActive::SkState& testState = fState[oldCount + index]; in append()
79 for (int inner = 0; inner < oldCount; inner++) { in append()
98 saveIndex -= oldCount; in append()
105 oldCount--; in append()
[all …]
DSkTypedArray.cpp105 unsigned oldCount = fCount; in append() local
113 memcpy(fArray + oldCount, src, sizeof(int32_t) * count); in append()
115 return fArray + oldCount; in append()
156 int oldCount = fCount; in insert() local
159 memmove(dst + count, dst, sizeof(int32_t) * (oldCount - index)); in insert()
DSkAnimateActive.h39 void appendSave(int oldCount);
/external/deqp/framework/delibs/depool/
DdePoolMultiSet.h96 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/guava/guava-testlib/src/com/google/common/collect/testing/google/
DMultisetWritesTester.java58 int oldCount = getMultiset().count(samples.e0); in testAddOccurrences() local
60 oldCount, getMultiset().add(samples.e0, 2)); in testAddOccurrences()
62 oldCount + 2, getMultiset().count(samples.e0)); in testAddOccurrences()
100 int oldCount = getMultiset().count(samples.e0); in testRemove_occurrences_0() local
102 oldCount, getMultiset().remove(samples.e0, 0)); in testRemove_occurrences_0()
/external/skia/include/core/
DSkTDArray.h184 int oldCount = fCount; variable
187 src + count <= fArray || fArray + oldCount <= src);
191 memcpy(fArray + oldCount, src, sizeof(T) * count);
194 return fArray + oldCount;
209 size_t oldCount = fCount; variable
212 memmove(dst + count, dst, sizeof(T) * (oldCount - index));
/external/chromium_org/third_party/skia/include/core/
DSkTDArray.h184 int oldCount = fCount; variable
187 src + count <= fArray || fArray + oldCount <= src);
191 memcpy(fArray + oldCount, src, sizeof(T) * count);
194 return fArray + oldCount;
209 size_t oldCount = fCount; variable
212 memmove(dst + count, dst, sizeof(T) * (oldCount - index));
/external/deqp/framework/delibs/decpp/
DdeSharedPtr.hpp438 int oldCount, newCount; in acquireFromWeak() local
443 oldCount = state->strongRefCount; in acquireFromWeak()
444 if (oldCount == 0) in acquireFromWeak()
446 newCount = oldCount+1; in acquireFromWeak()
447 …Uint32 volatile*)&state->strongRefCount, (deUint32)oldCount, (deUint32)newCount) != (deUint32)oldC… in acquireFromWeak()
/external/chromium_org/chrome/common/mac/
Dobjc_zombie.mm343 const size_t oldCount = g_zombieCount;
363 g_zombieCount = oldCount;
372 const size_t sharedCount = std::min(oldCount, zombieCount);
375 oldIndex = (oldIndex + oldCount - sharedCount) % oldCount;
379 DCHECK_LT(oldIndex, oldCount);
381 oldIndex = (oldIndex + 1) % oldCount;
389 for (size_t i = 0; i < oldCount; ++i) {
414 const size_t oldCount = g_zombieCount;
425 for (size_t i = 0; i < oldCount; ++i) {
/external/guava/guava-tests/test/com/google/common/collect/
DForwardingMultisetTest.java111 @Override public boolean setCount(T element, int oldCount, int newCount) { in setCount() argument
112 return standardSetCount(element, oldCount, newCount); in setCount()
233 String element, int oldCount, int newCount) { in suite()
/external/skia/src/core/
DSkTDynamicHash.h203 SkDEBUGCODE(int oldCount = fCount;) in resize()
217 SkASSERT(oldCount == fCount); in resize()
DSkPictureFlat.h415 const int oldCount = this->count(); in findAndReplace() local
417 *added = this->count() > oldCount; in findAndReplace()
442 SkASSERT(this->count() == oldCount); in findAndReplace()
/external/chromium_org/third_party/skia/src/core/
DSkPictureFlat.h418 const int oldCount = this->count(); in findAndReplace() local
420 *added = this->count() > oldCount; in findAndReplace()
445 SkASSERT(this->count() == oldCount); in findAndReplace()

12