| /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/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);
|
| SkDisplayApply.cpp | 97 int oldCount = fActive->fAnimators.count();
100 fActive->appendSave(oldCount);
102 for (int index = oldCount; index < newCount; index++)
|
| /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...] |
| 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...] |
| 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);
|
| AbstractMultiset.java | 104 public boolean setCount(E element, int oldCount, int newCount) {
105 return 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);
|
| 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/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
| MultisetSetCountConditionallyTester.java | 55 fail("calling setCount() with a negative oldCount should throw "
61 // Negative oldCount.
80 assertFalse("setCount() with a too-large oldCount should return false",
88 assertFalse("setCount() with a too-small oldCount should return false",
97 assertFalse("setCount() with a too-small oldCount should return false",
|
| 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/skia/include/core/ |
| SkTDArray.h | 157 unsigned oldCount = fCount;
160 src + count <= fArray || fArray + oldCount <= src);
164 memcpy(fArray + oldCount, src, sizeof(T) * count);
167 return fArray + oldCount;
182 int oldCount = fCount;
185 memmove(dst + count, dst, sizeof(T) * (oldCount - index));
|
| /external/chromium/chrome/browser/ui/cocoa/ |
| objc_zombie.mm | 324 const size_t oldCount = g_zombieCount;
344 g_zombieCount = oldCount;
353 const size_t sharedCount = std::min(oldCount, zombieCount);
356 oldIndex = (oldIndex + oldCount - sharedCount) % oldCount;
360 DCHECK_LT(oldIndex, oldCount);
362 oldIndex = (oldIndex + 1) % oldCount;
370 for (size_t i = 0; i < oldCount; ++i) {
395 const size_t oldCount = g_zombieCount;
406 for (size_t i = 0; i < oldCount; ++i)
[all...] |
| /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/webkit/Source/WebCore/rendering/ |
| CounterNode.cpp | 183 int oldCount = node->m_countInParent;
185 if (oldCount == newCount)
|
| /ndk/sources/host-tools/make-3.81/glob/ |
| glob.c | 372 int oldcount;
609 oldcount = pglob->gl_pathc;
921 if (pglob->gl_pathc == oldcount)
1008 int ignore = oldcount;
1028 for (i = oldcount; i < pglob->gl_pathc; ++i)
1049 int non_sort = oldcount;
1051 if ((flags & GLOB_DOOFFS) && pglob->gl_offs > oldcount)
371 int oldcount; local
[all...] |
| /external/valgrind/main/drd/ |
| drd_vc.c | 91 typeof(vc->vc[i].count) const oldcount = vc->vc[i].count; local
94 tl_assert(oldcount < vc->vc[i].count);
|
| /external/webkit/Source/WebCore/platform/ |
| ScrollView.cpp | 782 int oldCount = m_scrollbarsAvoidingResizer;
790 if ((oldCount > 0 && m_scrollbarsAvoidingResizer == 0) ||
791 (oldCount == 0 && m_scrollbarsAvoidingResizer > 0))
[all...] |
