/external/guava/src/com/google/common/collect/ |
H A D | AbstractMapBasedMultiset.java | 247 int oldCount; 249 oldCount = 0; 252 oldCount = frequency.get(); 253 long newCount = (long) oldCount + (long) occurrences; 259 return oldCount; 273 int oldCount = frequency.get(); 276 if (oldCount > occurrences) { 279 numberRemoved = oldCount; 285 return oldCount; 293 int oldCount; [all...] |
H A D | ForwardingMultiset.java | 73 public boolean setCount(E element, int oldCount, int newCount) { argument 74 return delegate().setCount(element, oldCount, newCount);
|
H A D | Multisets.java | 140 @Override public boolean setCount(E element, int oldCount, int newCount) { argument 252 public boolean setCount(E element, int oldCount, int newCount) { argument 253 return setCountImpl(this, element, oldCount, newCount); 443 int oldCount = self.count(element); 445 int delta = count - oldCount; 452 return oldCount; 456 Multiset<E> self, E element, int oldCount, int newCount) { 457 checkNonnegative(oldCount, "oldCount"); 460 if (self.count(element) == oldCount) { 455 setCountImpl( Multiset<E> self, E element, int oldCount, int newCount) argument [all...] |
H A D | ConcurrentHashMultiset.java | 316 * only if the count is currently {@code oldCount}. If {@code element} does 317 * not appear in the multiset exactly {@code oldCount} times, no changes will 322 * {@code oldCount == newCount}, the method will return {@code true} if 324 * @throws IllegalArgumentException if {@code oldCount} or {@code newCount} is 327 @Override public boolean setCount(E element, int oldCount, int newCount) { argument 328 checkNonnegative(oldCount, "oldCount"); 331 if (oldCount == 0) { 335 return countMap.remove(element, oldCount); 338 if (oldCount [all...] |
H A D | Multiset.java | 152 * current count. If the current count is not {@code oldCount}, no change is 157 * @param oldCount the expected present count of the element in this multiset 161 * {@code oldCount == newCount}. 162 * @throws IllegalArgumentException if {@code oldCount} or {@code newCount} is 166 * oldCount} and {@code newCount} are both zero, the implementor may 169 boolean setCount(E element, int oldCount, int newCount); argument
|
H A D | AbstractMultiset.java | 152 public boolean setCount(E element, int oldCount, int newCount) { argument 153 return setCountImpl(this, element, oldCount, newCount);
|
H A D | LinkedListMultimap.java | 641 int oldCount = count(key); 647 return oldCount; 654 public boolean setCount(K element, int oldCount, int newCount) { argument 655 return setCountImpl(this, element, oldCount, newCount);
|
H A D | ImmutableMultiset.java | 236 public boolean setCount(E element, int oldCount, int newCount) { argument
|
H A D | Synchronized.java | 542 public boolean setCount(E element, int oldCount, int newCount) { argument 544 return delegate().setCount(element, oldCount, newCount);
|
/external/skia/src/animator/ |
H A D | SkAnimateActive.cpp | 66 int oldCount = fAnimators.count(); local 70 int total = oldCount + newCount; 74 memset(&fInterpolators.begin()[oldCount], 0, newCount * sizeof(SkOperandInterpolator*)); 75 for (index = oldCount; index < total; index++) 78 memcpy(&fAnimators[oldCount], animates.begin(), sizeof(fAnimators[0]) * 81 initState(apply, oldCount); 86 SkActive::SkState& testState = fState[oldCount + index]; 87 for (int inner = 0; inner < oldCount; inner++) { 106 saveIndex -= oldCount; 113 oldCount 124 appendSave(int oldCount) argument 259 int oldCount = fSaveRestore.count(); local [all...] |
H A D | SkTypedArray.cpp | 113 unsigned oldCount = fCount; local 121 memcpy(fArray + oldCount, src, sizeof(int32_t) * count); 123 return fArray + oldCount; 164 int oldCount = fCount; local 167 memmove(dst + count, dst, sizeof(int32_t) * (oldCount - index));
|
H A D | SkAnimateActive.h | 47 void appendSave(int oldCount);
|
H A D | SkDisplayApply.cpp | 105 int oldCount = fActive->fAnimators.count(); local 108 fActive->appendSave(oldCount); 110 for (int index = oldCount; index < newCount; index++)
|
/external/skia/include/core/ |
H A D | SkTDArray.h | 154 unsigned oldCount = fCount; local 157 src + count <= fArray || fArray + oldCount <= src); 161 memcpy(fArray + oldCount, src, sizeof(T) * count); 164 return fArray + oldCount; 179 int oldCount = fCount; local 182 memmove(dst + count, dst, sizeof(T) * (oldCount - index));
|
/external/webkit/WebCore/rendering/ |
H A D | CounterNode.cpp | 120 int oldCount = node->m_countInParent; local 122 if (oldCount == newCount)
|
/external/webkit/WebCore/platform/ |
H A D | ScrollView.cpp | 586 int oldCount = m_scrollbarsAvoidingResizer; local 594 if ((oldCount > 0 && m_scrollbarsAvoidingResizer == 0) || 595 (oldCount == 0 && m_scrollbarsAvoidingResizer > 0))
|