Searched defs:occurrences (Results 1 - 25 of 30) sorted by relevance

12

/external/chromium_org/components/crash/app/
H A Dcrash_keys_win_unittest.cc70 size_t occurrences = 0; local
74 ++occurrences;
78 return occurrences;
/external/guava/guava-tests/test/com/google/common/collect/
H A DSimpleAbstractMultisetTest.java45 public int add(String element, int occurrences) {
47 return super.add(element, occurrences);
70 @Override public int add(E element, int occurrences) { argument
71 checkArgument(occurrences >= 0);
76 if (occurrences == 0) {
79 checkArgument(occurrences <= Integer.MAX_VALUE - frequency);
80 backingMap.put(element, frequency + occurrences);
125 @Override public int remove(Object element, int occurrences) { argument
126 checkArgument(occurrences >= 0);
130 } else if (count > occurrences) {
[all...]
/external/guava/guava/src/com/google/common/collect/
H A DAbstractMapBasedMultiset.java224 * {@link Integer#MAX_VALUE} occurrences of {@code element} in this
227 @Override public int add(@Nullable E element, int occurrences) { argument
228 if (occurrences == 0) {
232 occurrences > 0, "occurrences cannot be negative: %s", occurrences);
237 backingMap.put(element, new Count(occurrences));
240 long newCount = (long) oldCount + (long) occurrences;
242 "too many occurrences: %s", newCount);
243 frequency.getAndAdd(occurrences);
249 remove(@ullable Object element, int occurrences) argument
[all...]
H A DAbstractMultiset.java85 public int add(E element, int occurrences) { argument
94 public int remove(Object element, int occurrences) { argument
H A DConcurrentHashMultiset.java63 /** The number of occurrences of each element. */
103 * applies to all occurrences of a given element as a single unit. However, most updates to the
142 * Returns the number of occurrences of {@code element} in this multiset.
145 * @return the nonnegative number of occurrences of the element
212 * Adds a number of occurrences of the specified element to this multiset.
215 * @param occurrences the number of occurrences to add
217 * @throws IllegalArgumentException if {@code occurrences} is negative, or if
220 @Override public int add(E element, int occurrences) { argument
221 if (occurrences
275 remove(@ullable Object element, int occurrences) argument
314 removeExactly(@ullable Object element, int occurrences) argument
[all...]
H A DForwardingMultiset.java66 public int add(E element, int occurrences) { argument
67 return delegate().add(element, occurrences);
71 public int remove(Object element, int occurrences) { argument
72 return delegate().remove(element, occurrences);
H A DMultiset.java35 * element equivalence", below) are referred to as <i>occurrences</i> of the
36 * same single element. The total number of occurrences of an element in a
40 * more than {@link Integer#MAX_VALUE} occurrences of any one element.
46 * or remove multiple occurrences of an element at once, or to set the count of
89 * Returns the number of occurrences of an element in this multiset (the
98 * @param element the element to count occurrences of
99 * @return the number of occurrences of the element in this multiset; possibly
107 * Adds a number of occurrences of an element to this multiset. Note that if
108 * {@code occurrences == 1}, this method has the identical effect to {@link
111 * occurrences))}, whic
125 add(@ullable E element, int occurrences) argument
140 remove(@ullable Object element, int occurrences) argument
[all...]
H A DConstraints.java355 @Override public int add(E element, int occurrences) { argument
357 return delegate.add(element, occurrences);
H A DImmutableMultiset.java287 public final int add(E element, int occurrences) { argument
297 public final int remove(Object element, int occurrences) { argument
545 * Adds a number of occurrences of an element to this {@code
549 * @param occurrences the number of occurrences of the element to add. May
553 * @throws IllegalArgumentException if {@code occurrences} is negative, or
555 * occurrences of the element
557 public Builder<E> addCopies(E element, int occurrences) { argument
558 contents.add(checkNotNull(element), occurrences);
563 * Adds or removes the necessary occurrences o
[all...]
H A DImmutableSortedMultiset.java492 * Adds a number of occurrences of an element to this {@code ImmutableSortedMultiset}.
495 * @param occurrences the number of occurrences of the element to add. May be zero, in which
499 * @throws IllegalArgumentException if {@code occurrences} is negative, or if this operation
500 * would result in more than {@link Integer#MAX_VALUE} occurrences of the element
503 public Builder<E> addCopies(E element, int occurrences) { argument
504 super.addCopies(element, occurrences);
509 * Adds or removes the necessary occurrences of an element such that the element attains the
512 * @param element the element to add or remove occurrences of
H A DLinkedListMultimap.java741 public int add(@Nullable K key, int occurrences) { argument
746 public int remove(@Nullable Object key, int occurrences) { argument
747 checkArgument(occurrences >= 0);
750 while ((occurrences-- > 0) && values.hasNext()) {
H A DTreeMultiset.java210 public int add(E element, int occurrences) { argument
212 if (occurrences == 0) {
216 return mutate(element, new AddModifier(occurrences));
220 public int remove(@Nullable Object element, int occurrences) { argument
223 } else if (occurrences == 0) {
228 return range.contains(e) ? mutate(e, new RemoveModifier(occurrences)) : 0;
H A DMultisets.java152 @Override public int remove(Object element, int occurrences) { argument
358 public int add(E element, int occurrences) { argument
363 public int remove(Object element, int occurrences) { argument
364 if (occurrences == 0) {
367 checkArgument(occurrences > 0);
484 * element set of {@code multiset1}, with repeated occurrences of the same
569 * all occurrences of elements that appear at all in {@code
570 * multisetToRetain}, and deletes all occurrences of all other elements.
616 * removes all occurrences of elements that appear in
H A DMultimaps.java1966 @Override public int remove(@Nullable Object element, int occurrences) { argument
1967 checkArgument(occurrences >= 0);
1968 if (occurrences == 0) {
1986 if (occurrences >= oldCount) {
1990 for (int i = 0; i < occurrences; i++) {
2709 @Override public int remove(Object o, int occurrences) { argument
2710 checkArgument(occurrences >= 0);
2721 if (removed < occurrences) {
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
H A DAbstractMapBasedMultiset.java221 * {@link Integer#MAX_VALUE} occurrences of {@code element} in this
224 @Override public int add(@Nullable E element, int occurrences) { argument
225 if (occurrences == 0) {
229 occurrences > 0, "occurrences cannot be negative: %s", occurrences);
234 backingMap.put(element, new Count(occurrences));
237 long newCount = (long) oldCount + (long) occurrences;
239 "too many occurrences: %s", newCount);
240 frequency.getAndAdd(occurrences);
246 remove(@ullable Object element, int occurrences) argument
[all...]
H A DLinkedListMultimap.java737 public int add(@Nullable K key, int occurrences) { argument
742 public int remove(@Nullable Object key, int occurrences) { argument
743 checkArgument(occurrences >= 0);
746 while ((occurrences-- > 0) && values.hasNext()) {
H A DTreeMultiset.java206 public int add(E element, int occurrences) { argument
208 if (occurrences == 0) {
212 return mutate(element, new AddModifier(occurrences));
216 public int remove(@Nullable Object element, int occurrences) { argument
219 } else if (occurrences == 0) {
224 return range.contains(e) ? mutate(e, new RemoveModifier(occurrences)) : 0;
H A DMultimaps.java1877 @Override public int remove(@Nullable Object element, int occurrences) { argument
1878 checkArgument(occurrences >= 0);
1879 if (occurrences == 0) {
1897 if (occurrences >= oldCount) {
1901 for (int i = 0; i < occurrences; i++) {
2492 @Override public int remove(Object o, int occurrences) { argument
2493 checkArgument(occurrences >= 0);
2504 if (removed < occurrences) {
/external/chromium_org/extensions/browser/
H A Dextension_error.h49 size_t occurrences() const { return occurrences_; } function in class:extensions::ExtensionError
50 void set_occurrences(size_t occurrences) { occurrences_ = occurrences; } argument
/external/chromium_org/third_party/icu/source/test/intltest/
H A Dustrtest.cpp717 uint16_t occurrences = 0; local
721 (startPos = test1.indexOf(test2, startPos)) != -1 ? (++occurrences, startPos += 4) : 0)
723 if (occurrences != 6)
724 errln(UnicodeString("indexOf failed: expected to find 6 occurrences, found ") + occurrences);
726 for ( occurrences = 0, startPos = 10;
728 (startPos = test1.indexOf(test2, startPos)) != -1 ? (++occurrences, startPos += 4) : 0)
730 if (occurrences != 4)
732 "expected to find 4 occurrences, found ") + occurrences);
[all...]
/external/icu/icu4c/source/test/intltest/
H A Dustrtest.cpp717 uint16_t occurrences = 0; local
721 (startPos = test1.indexOf(test2, startPos)) != -1 ? (++occurrences, startPos += 4) : 0)
723 if (occurrences != 6)
724 errln(UnicodeString("indexOf failed: expected to find 6 occurrences, found ") + occurrences);
726 for ( occurrences = 0, startPos = 10;
728 (startPos = test1.indexOf(test2, startPos)) != -1 ? (++occurrences, startPos += 4) : 0)
730 if (occurrences != 4)
732 "expected to find 4 occurrences, found ") + occurrences);
[all...]
/external/owasp/sanitizer/distrib/lib/
H A Dguava.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/common/ com/google/common/collect/ ...
/external/owasp/sanitizer/lib/guava-libraries/
H A Dguava.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/common/ com/google/common/collect/ ...
/external/chromium_org/third_party/checkstyle/
H A Dcheckstyle-5.7-all.jarMETA-INF/MANIFEST.MF META-INF/ checkstyle_packages.xml checkstylecompilation.properties checkstyletask.properties com/ ...
/external/chromium_org/third_party/WebKit/Source/devtools/scripts/closure/
H A Dcompiler.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/javascript/ com/google/javascript/jscomp/ ...

Completed in 4638 milliseconds

12