| /external/javassist/src/main/javassist/bytecode/ |
| 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 + 1] = (byte)(i >>> 16)
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| AbstractMapBasedMultiset.java | 234 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...] |
| TreeMultiset.java | 235 public boolean setCount(E element, int oldCount, int newCount) {
238 return mutate(element, new ConditionalSetCountModifier(oldCount, newCount))
239 == oldCount;
458 abstract int newCount(int oldCount);
463 int oldCount = countOrZero(originalEntry);
464 int newCount = newCount(oldCount);
465 if (oldCount == newCount) {
469 } else if (oldCount == 0) {
487 int newCount(int oldCount) {
488 checkArgument(countToAdd <= Integer.MAX_VALUE - oldCount, "Cannot add this many elements")
[all...] |
| ForwardingMultiset.java | 99 public boolean setCount(E element, int oldCount, int newCount) {
100 return delegate().setCount(element, oldCount, newCount);
230 E element, int oldCount, int newCount) {
231 return Multisets.setCountImpl(this, element, oldCount, newCount);
|
| Multiset.java | 160 * current count. If the current count is not {@code oldCount}, no change is
165 * @param oldCount the expected present count of the element in this multiset
169 * {@code oldCount == newCount}.
170 * @throws IllegalArgumentException if {@code oldCount} or {@code newCount} is
174 * oldCount} and {@code newCount} are both zero, the implementor may
177 boolean setCount(E element, int oldCount, int newCount);
|
| AbstractMultiset.java | 104 public boolean setCount(E element, int oldCount, int newCount) {
105 return setCountImpl(this, element, oldCount, newCount);
|
| Multisets.java | 172 @Override public boolean setCount(E element, int oldCount, int newCount) {
429 public boolean setCount(E element, int oldCount, int newCount) {
430 return setCountImpl(this, element, oldCount, newCount);
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) {
[all...] |
| Constraints.java | 363 @Override public boolean setCount(E element, int oldCount, int newCount) {
365 return delegate.setCount(element, oldCount, newCount);
|
| LinkedListMultimap.java | 748 int oldCount = count(key);
754 return oldCount;
763 public boolean setCount(K element, int oldCount, int newCount) {
764 return setCountImpl(this, element, oldCount, newCount);
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| AbstractMapBasedMultiset.java | 231 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...] |
| TreeMultiset.java | 231 public boolean setCount(E element, int oldCount, int newCount) {
234 return mutate(element, new ConditionalSetCountModifier(oldCount, newCount))
235 == oldCount;
454 abstract int newCount(int oldCount);
459 int oldCount = countOrZero(originalEntry);
460 int newCount = newCount(oldCount);
461 if (oldCount == newCount) {
465 } else if (oldCount == 0) {
483 int newCount(int oldCount) {
484 checkArgument(countToAdd <= Integer.MAX_VALUE - oldCount, "Cannot add this many elements")
[all...] |
| LinkedListMultimap.java | 744 int oldCount = count(key);
750 return oldCount;
759 public boolean setCount(K element, int oldCount, int newCount) {
760 return setCountImpl(this, element, oldCount, newCount);
|
| /external/chromium_org/third_party/skia/src/animator/ |
| SkAnimateActive.cpp | 58 int oldCount = fAnimators.count();
62 int total = oldCount + newCount;
66 memset(&fInterpolators.begin()[oldCount], 0, newCount * sizeof(SkOperandInterpolator*));
67 for (index = oldCount; index < total; index++)
70 memcpy(&fAnimators[oldCount], animates.begin(), sizeof(fAnimators[0]) *
73 initState(apply, oldCount);
78 SkActive::SkState& testState = fState[oldCount + index];
79 for (int inner = 0; inner < oldCount; inner++) {
98 saveIndex -= oldCount;
105 oldCount--
[all...] |
| SkTypedArray.cpp | 105 unsigned oldCount = fCount;
113 memcpy(fArray + oldCount, src, sizeof(int32_t) * count);
115 return fArray + oldCount;
156 int oldCount = fCount;
159 memmove(dst + count, dst, sizeof(int32_t) * (oldCount - index));
|
| SkAnimateActive.h | 39 void appendSave(int oldCount);
|
| /external/deqp/framework/delibs/depool/ |
| 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/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
| MultisetWritesTester.java | 58 int oldCount = getMultiset().count(samples.e0);
60 oldCount, getMultiset().add(samples.e0, 2));
62 oldCount + 2, getMultiset().count(samples.e0));
100 int oldCount = getMultiset().count(samples.e0);
102 oldCount, getMultiset().remove(samples.e0, 0));
|
| /external/chromium_org/third_party/skia/include/core/ |
| SkTDArray.h | 184 int oldCount = fCount;
187 src + count <= fArray || fArray + oldCount <= src);
191 memcpy(fArray + oldCount, src, sizeof(T) * count);
194 return fArray + oldCount;
209 size_t oldCount = fCount;
212 memmove(dst + count, dst, sizeof(T) * (oldCount - index));
|
| /external/deqp/framework/delibs/decpp/ |
| deSharedPtr.hpp | 438 int oldCount, newCount;
443 oldCount = state->strongRefCount;
444 if (oldCount == 0)
446 newCount = oldCount+1;
447 } while (deAtomicCompareExchange32((deUint32 volatile*)&state->strongRefCount, (deUint32)oldCount, (deUint32)newCount) != (deUint32)oldCount);
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| ForwardingMultisetTest.java | 111 @Override public boolean setCount(T element, int oldCount, int newCount) {
112 return standardSetCount(element, oldCount, newCount);
233 String element, int oldCount, int newCount) {
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkTDynamicHash.h | 250 SkDEBUGCODE(int oldCount = fCount;)
264 SkASSERT(oldCount == fCount);
|
| SkPictureFlat.h | 418 const int oldCount = this->count();
420 *added = this->count() > oldCount;
445 SkASSERT(this->count() == oldCount);
|
| /development/samples/Support7Demos/src/com/example/android/supportv7/widget/ |
| RecyclerViewActivity.java | 201 final int oldCount = getChildCount();
203 if (oldCount == 0) {
|
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| CounterNode.cpp | 228 int oldCount = node->m_countInParent;
230 if (oldCount == newCount)
|
| /external/chromium_org/third_party/codesighs/ |
| msdump2symdb.c | 505 unsigned oldCount = inContainer->mReadState.mCurrentObject->mSectionCount;
509 memset(&inContainer->mReadState.mCurrentObject->mSections[oldCount], 0, sizeof(MSDump_Section) * (sectionIndex1 - oldCount));
[all...] |
