Home
last modified time | relevance | path

Searched refs:newCount (Results 1 – 25 of 74) sorted by relevance

123

/external/guava/android/guava/src/com/google/common/collect/
DAbstractMapBasedMultiset.java84 long newCount = (long) oldCount + (long) occurrences; in add() local
85 checkArgument(newCount <= Integer.MAX_VALUE, "too many occurrences: %s", newCount); in add()
86 backingMap.setValue(entryIndex, (int) newCount); in add()
125 public final boolean setCount(@NullableDecl E element, int oldCount, int newCount) { in setCount() argument
127 checkNonnegative(newCount, "newCount"); in setCount()
133 if (newCount > 0) { in setCount()
134 backingMap.put(element, newCount); in setCount()
135 size += newCount; in setCount()
143 if (newCount == 0) { in setCount()
147 backingMap.setValue(entryIndex, newCount); in setCount()
[all …]
DTreeMultiset.java315 public boolean setCount(@NullableDecl E element, int oldCount, int newCount) { in setCount() argument
316 checkNonnegative(newCount, "newCount"); in setCount()
323 if (newCount > 0) { in setCount()
324 add(element, newCount); in setCount()
332 AvlNode<E> newRoot = root.setCount(comparator(), element, oldCount, newCount, result); in setCount()
761 int newCount,
768 if (expectedCount == 0 && newCount > 0) {
769 return addLeftChild(e, newCount);
774 left = initLeft.setCount(comparator, e, expectedCount, newCount, result);
777 if (newCount == 0 && result[0] != 0) {
[all …]
DForwardingMultiset.java104 public boolean setCount(E element, int oldCount, int newCount) { in setCount() argument
105 return delegate().setCount(element, oldCount, newCount); in setCount()
228 protected boolean standardSetCount(E element, int oldCount, int newCount) { in standardSetCount() argument
229 return Multisets.setCountImpl(this, element, oldCount, newCount); in standardSetCount()
DConcurrentHashMultiset.java403 public boolean setCount(E element, int expectedOldCount, int newCount) { in setCount() argument
406 checkNonnegative(newCount, "newCount"); in setCount()
412 } else if (newCount == 0) { in setCount()
416 return countMap.putIfAbsent(element, new AtomicInteger(newCount)) == null; in setCount()
422 if (newCount == 0) { in setCount()
427 AtomicInteger newCounter = new AtomicInteger(newCount); in setCount()
432 if (existingCounter.compareAndSet(oldValue, newCount)) { in setCount()
433 if (newCount == 0) { in setCount()
DMapMakerInternalMap.java1481 int newCount = this.count + 1; in put() local
1482 if (newCount > this.threshold) { // ensure capacity in put()
1484 newCount = this.count + 1; in put()
1504 newCount = this.count; // count remains unchanged in put()
1505 this.count = newCount; // write-volatile in put()
1526 this.count = newCount; // write-volatile in put()
1552 int newCount = count; in expand() local
1592 newCount--; in expand()
1599 this.count = newCount; in expand()
1621 int newCount = this.count - 1; in replace() local
[all …]
DEnumMultiset.java146 long newCount = (long) oldCount + occurrences; in add() local
147 checkArgument(newCount <= Integer.MAX_VALUE, "too many occurrences: %s", newCount); in add()
148 counts[index] = (int) newCount; in add()
/external/protobuf/objectivec/
DGPBArray.m227 //% NSUInteger newCount = initialCount + count;
228 //%MAYBE_GROW_TO_SET_COUNT(newCount)
238 //% NSUInteger newCount = initialCount + 1;
239 //%MAYBE_GROW_TO_SET_COUNT(newCount)
275 //% NSUInteger newCount = _count - 1;
276 //% if (index != newCount) {
277 //% memmove(&_values[index], &_values[index + 1], (newCount - index) * sizeof(TYPE));
279 //%SET_COUNT_AND_MAYBE_SHRINK(newCount)
457 NSUInteger newCount = initialCount + count;
458 if (newCount > _capacity) {
[all …]
/external/icu/icu4j/demos/src/com/ibm/icu/dev/demo/translit/
DIntDiffer.java128 int newCount = aCount-aTop; in flush() local
129 System.arraycopy(a, aTop, a, 0, newCount); in flush()
130 aCount = newCount; in flush()
135 int newCount = bCount-bTop; in flush() local
136 System.arraycopy(b, bTop, b, 0, newCount); in flush()
137 bCount = newCount; in flush()
/external/skqp/include/private/
DSkTArray.h156 int newCount = fCount - 1; in removeShuffle() local
157 fCount = newCount; in removeShuffle()
159 if (n != newCount) { in removeShuffle()
160 this->move(n, newCount); in removeShuffle()
289 void resize_back(int newCount) { in resize_back() argument
290 SkASSERT(newCount >= 0); in resize_back()
292 if (newCount > fCount) { in resize_back()
293 this->push_back_n(newCount - fCount); in resize_back()
294 } else if (newCount < fCount) { in resize_back()
295 this->pop_back_n(fCount - newCount); in resize_back()
[all …]
/external/cldr/tools/java/org/unicode/cldr/util/
DDiffer.java146 int newCount = aCount - aTop; in flush() local
147 System.arraycopy(a, aTop, a, 0, newCount); in flush()
148 aCount = newCount; in flush()
154 int newCount = bCount - bTop; in flush() local
155 System.arraycopy(b, bTop, b, 0, newCount); in flush()
156 bCount = newCount; in flush()
/external/skia/include/private/
DSkTArray.h188 int newCount = fCount - 1; in removeShuffle() local
189 fCount = newCount; in removeShuffle()
191 if (n != newCount) { in removeShuffle()
192 this->move(n, newCount); in removeShuffle()
321 void resize_back(int newCount) { in resize_back() argument
322 SkASSERT(newCount >= 0); in resize_back()
324 if (newCount > this->count()) { in resize_back()
325 this->push_back_n(newCount - fCount); in resize_back()
326 } else if (newCount < this->count()) { in resize_back()
327 this->pop_back_n(fCount - newCount); in resize_back()
[all …]
/external/deqp/framework/delibs/depool/
DdePoolMultiSet.h74 deBool TYPENAME##_setKeyCount (DE_PTR_TYPE(TYPENAME) set, KEYTYPE key, int newCount); \
147 deBool TYPENAME##_setKeyCount (DE_PTR_TYPE(TYPENAME) set, KEYTYPE key, int newCount) \
153 DE_ASSERT(newCount >= 0); \
154 set->numElements += (newCount - oldCount); \
156 if (newCount == 0 && countPtr) \
158 else if (newCount > 0 && countPtr) \
159 *countPtr = newCount; \
160 else if (newCount > 0) \
161 return TYPENAME##Hash_insert(set->hash, key, newCount); \
/external/guava/guava/src/com/google/common/collect/
DTreeMultiset.java317 public boolean setCount(@Nullable E element, int oldCount, int newCount) { in setCount() argument
318 checkNonnegative(newCount, "newCount"); in setCount()
325 if (newCount > 0) { in setCount()
326 add(element, newCount); in setCount()
334 AvlNode<E> newRoot = root.setCount(comparator(), element, oldCount, newCount, result); in setCount()
768 int newCount,
775 if (expectedCount == 0 && newCount > 0) {
776 return addLeftChild(e, newCount);
781 left = initLeft.setCount(comparator, e, expectedCount, newCount, result);
784 if (newCount == 0 && result[0] != 0) {
[all …]
DForwardingMultiset.java104 public boolean setCount(E element, int oldCount, int newCount) { in setCount() argument
105 return delegate().setCount(element, oldCount, newCount); in setCount()
228 protected boolean standardSetCount(E element, int oldCount, int newCount) { in standardSetCount() argument
229 return Multisets.setCountImpl(this, element, oldCount, newCount); in standardSetCount()
DConcurrentHashMultiset.java403 public boolean setCount(E element, int expectedOldCount, int newCount) { in setCount() argument
406 checkNonnegative(newCount, "newCount"); in setCount()
412 } else if (newCount == 0) { in setCount()
416 return countMap.putIfAbsent(element, new AtomicInteger(newCount)) == null; in setCount()
422 if (newCount == 0) { in setCount()
427 AtomicInteger newCounter = new AtomicInteger(newCount); in setCount()
432 if (existingCounter.compareAndSet(oldValue, newCount)) { in setCount()
433 if (newCount == 0) { in setCount()
DMapMakerInternalMap.java1476 int newCount = this.count + 1; in put() local
1477 if (newCount > this.threshold) { // ensure capacity in put()
1479 newCount = this.count + 1; in put()
1499 newCount = this.count; // count remains unchanged in put()
1500 this.count = newCount; // write-volatile in put()
1521 this.count = newCount; // write-volatile in put()
1547 int newCount = count; in expand() local
1587 newCount--; in expand()
1594 this.count = newCount; in expand()
1616 int newCount = this.count - 1; in replace() local
[all …]
DEnumMultiset.java147 long newCount = (long) oldCount + occurrences; in add() local
148 checkArgument(newCount <= Integer.MAX_VALUE, "too many occurrences: %s", newCount); in add()
149 counts[index] = (int) newCount; in add()
/external/cldr/tools/java/org/unicode/cldr/tool/
DCLDRCompare.java77 int newCount = 0; in main() local
90 ++newCount; in main()
108 … printLine(subDir, file, sameCount, newCount, deletedCount, diffValueCount, diffBothCount, in main()
114 …private static void printLine(String subDir, String file, Object sameCount, Object newCount, Objec… in printLine() argument
116 …System.out.println(subDir + "\t" + file + "\t" + sameCount + "\t" + newCount + "\t" + deletedCount… in printLine()
/external/javassist/src/main/javassist/bytecode/
DByteStream.java189 int newCount = count + delta; in enlarge() local
190 if (newCount > buf.length) { in enlarge()
192 byte[] newBuf = new byte[newLen > newCount ? newLen : newCount]; in enlarge()
/external/guice/core/src/com/google/inject/internal/
DInternalContext.java78 int newCount = --enterCount; in close() local
79 if (newCount < 0) { in close()
82 if (newCount == 0) { in close()
/external/skqp/src/ports/
DSkFontMgr_win_dw.cpp83 ULONG newCount = InterlockedDecrement(&fRefCount); in Release() local
84 if (0 == newCount) { in Release()
87 return newCount; in Release()
159 ULONG newCount = InterlockedDecrement(&fRefCount); in Release() local
160 if (0 == newCount) { in Release()
163 return newCount; in Release()
246 ULONG newCount = InterlockedDecrement(&fRefCount); in Release() local
247 if (0 == newCount) { in Release()
250 return newCount; in Release()
616 ULONG newCount = InterlockedDecrement(&fRefCount); in Release() local
[all …]
/external/cldr/tools/cldr-unittest/src/org/unicode/cldr/unittest/
DTestReferenceStringSearch.java106 int newCount = checkNew("lazy", bigText, newPos, newTimer, icuTimer); in checkAgainstStringSearch() local
110 int diff = findDifference(icuPos, newPos, oldCount, newCount); in checkAgainstStringSearch()
522 int newCount) { in findDifference() argument
523 int count = Math.min(oldCount, newCount); in findDifference()
529 if (oldCount != newCount) { in findDifference()
/external/skia/src/ports/
DSkFontMgr_win_dw.cpp84 ULONG newCount = InterlockedDecrement(&fRefCount); in SK_STDMETHODIMP_() local
85 if (0 == newCount) { in SK_STDMETHODIMP_()
88 return newCount; in SK_STDMETHODIMP_()
160 ULONG newCount = InterlockedDecrement(&fRefCount); in SK_STDMETHODIMP_() local
161 if (0 == newCount) { in SK_STDMETHODIMP_()
164 return newCount; in SK_STDMETHODIMP_()
247 ULONG newCount = InterlockedDecrement(&fRefCount); in SK_STDMETHODIMP_() local
248 if (0 == newCount) { in SK_STDMETHODIMP_()
251 return newCount; in SK_STDMETHODIMP_()
552 ULONG newCount = InterlockedDecrement(&fRefCount); in Release() local
[all …]
/external/skqp/src/gpu/gl/
DGrGLVertexArray.h30 void resize(int newCount) { in resize() argument
31 fAttribArrayStates.resize_back(newCount); in resize()
/external/skia/src/gpu/gl/
DGrGLVertexArray.h30 void resize(int newCount) { in resize() argument
31 fAttribArrayStates.resize_back(newCount); in resize()

123