HomeSort by relevance Sort by last modified time
    Searched full:occurrences (Results 1 - 25 of 685) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/guava/guava-tests/benchmark/com/google/common/collect/
ConcurrentHashMultisetBenchmark.java 159 /** The number of occurrences of each element. */
178 * Returns the number of occurrences of {@code element} in this multiset.
181 * @return the nonnegative number of occurrences of the element
239 * Adds a number of occurrences of the specified element to this multiset.
242 * @param occurrences the number of occurrences to add
245 * @throws IllegalArgumentException if {@code occurrences} is negative, or if
248 @Override public int add(E element, int occurrences) {
249 if (occurrences == 0) {
252 checkArgument(occurrences > 0, "Invalid occurrences: %s", occurrences)
    [all...]
  /external/bison/po/
insert-header.sin 5 # occurrences, do nothing. The distinction between the first and the following
6 # occurrences is achieved by looking at the hold space.
20 # The hold space was nonempty. Following occurrences. Do nothing.
remove-potcdate.sin 4 # The distinction between the first and the following occurrences of the
16 # The hold space was nonempty. Following occurrences. Do nothing.
  /external/bison/runtime-po/
insert-header.sin 5 # occurrences, do nothing. The distinction between the first and the following
6 # occurrences is achieved by looking at the hold space.
20 # The hold space was nonempty. Following occurrences. Do nothing.
remove-potcdate.sin 4 # The distinction between the first and the following occurrences of the
16 # The hold space was nonempty. Following occurrences. Do nothing.
  /external/e2fsprogs/po/
insert-header.sin 5 # occurrences, do nothing. The distinction between the first and the following
6 # occurrences is achieved by looking at the hold space.
20 # The hold space was nonempty. Following occurrences. Do nothing.
remove-potcdate.sin 4 # The distinction between the first and the following occurrences of the
16 # The hold space was nonempty. Following occurrences. Do nothing.
  /external/elfutils/po/
insert-header.sin 5 # occurrences, do nothing. The distinction between the first and the following
6 # occurrences is achieved by looking at the hold space.
20 # The hold space was nonempty. Following occurrences. Do nothing.
remove-potcdate.sin 4 # The distinction between the first and the following occurrences of the
16 # The hold space was nonempty. Following occurrences. Do nothing.
  /external/libexif/po/
insert-header.sin 5 # occurrences, do nothing. The distinction between the first and the following
6 # occurrences is achieved by looking at the hold space.
20 # The hold space was nonempty. Following occurrences. Do nothing.
remove-potcdate.sin 4 # The distinction between the first and the following occurrences of the
16 # The hold space was nonempty. Following occurrences. Do nothing.
  /ndk/sources/host-tools/make-3.81/po/
insert-header.sin 5 # occurrences, do nothing. The distinction between the first and the following
6 # occurrences is achieved by looking at the hold space.
20 # The hold space was nonempty. Following occurrences. Do nothing.
remove-potcdate.sin 4 # The distinction between the first and the following occurrences of the
16 # The hold space was nonempty. Following occurrences. Do nothing.
  /sdk/eclipse/plugins/com.android.ide.eclipse.monitor/
plugin.properties 2 #TODO: update with new year date (search this to find other occurrences to update)
  /external/guava/guava/src/com/google/common/collect/
AbstractMapBasedMultiset.java 211 * {@link Integer#MAX_VALUE} occurrences of {@code element} in this
214 @Override public int add(@Nullable E element, int occurrences) {
215 if (occurrences == 0) {
219 occurrences > 0, "occurrences cannot be negative: %s", occurrences);
224 backingMap.put(element, new Count(occurrences));
227 long newCount = (long) oldCount + (long) occurrences;
229 "too many occurrences: %s", newCount);
230 frequency.getAndAdd(occurrences);
    [all...]
ConcurrentHashMultiset.java 69 /** The number of occurrences of each element. */
109 * applies to all occurrences of a given element as a single unit. However, most updates to the
148 * Returns the number of occurrences of {@code element} in this multiset.
151 * @return the nonnegative number of occurrences of the element
203 * Adds a number of occurrences of the specified element to this multiset.
206 * @param occurrences the number of occurrences to add
208 * @throws IllegalArgumentException if {@code occurrences} is negative, or if
211 @Override public int add(E element, int occurrences) {
213 if (occurrences == 0)
    [all...]
Multiset.java 35 * <i>occurrences</i> of the same single element. The total number of
36 * occurrences of an element in a multiset is called the <i>count</i> of that
40 * occurrences of any one element.
46 * or remove multiple occurrences of an element at once, or to set the count of
93 * Returns the number of occurrences of an element in this multiset (the
102 * @param element the element to count occurrences of
103 * @return the number of occurrences of the element in this multiset; possibly
111 * Adds a number of occurrences of an element to this multiset. Note that if
112 * {@code occurrences == 1}, this method has the identical effect to {@link
115 * occurrences))}, which would presumably perform much more poorly
    [all...]
ImmutableMultiset.java 280 public final int add(E element, int occurrences) {
292 public final int remove(Object element, int occurrences) {
515 * Adds a number of occurrences of an element to this {@code
519 * @param occurrences the number of occurrences of the element to add. May
523 * @throws IllegalArgumentException if {@code occurrences} is negative, or
525 * occurrences of the element
527 public Builder<E> addCopies(E element, int occurrences) {
528 contents.add(checkNotNull(element), occurrences);
533 * Adds or removes the necessary occurrences of an element such that th
    [all...]
  /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
AbstractMapBasedMultiset.java 208 * {@link Integer#MAX_VALUE} occurrences of {@code element} in this
211 @Override public int add(@Nullable E element, int occurrences) {
212 if (occurrences == 0) {
216 occurrences > 0, "occurrences cannot be negative: %s", occurrences);
221 backingMap.put(element, new Count(occurrences));
224 long newCount = (long) oldCount + (long) occurrences;
226 "too many occurrences: %s", newCount);
227 frequency.getAndAdd(occurrences);
    [all...]
  /external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/
SimpleAbstractMultisetTest.java 44 public int add(String element, int occurrences) {
46 return super.add(element, occurrences);
69 @Override public int add(@Nullable E element, int occurrences) {
70 checkArgument(occurrences >= 0);
75 if (occurrences == 0) {
78 checkArgument(occurrences <= Integer.MAX_VALUE - frequency);
79 backingMap.put(element, frequency + occurrences);
  /external/guava/guava-tests/test/com/google/common/collect/
SimpleAbstractMultisetTest.java 70 public int add(String element, int occurrences) {
72 return super.add(element, occurrences);
95 @Override public int add(@Nullable E element, int occurrences) {
96 checkArgument(occurrences >= 0);
101 if (occurrences == 0) {
104 checkArgument(occurrences <= Integer.MAX_VALUE - frequency);
105 backingMap.put(element, frequency + occurrences);
  /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/lang/
UTF16Test.java 1021 int occurrences = 0; local
    [all...]
  /external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/lang/
UTF16Test.java 1017 int occurrences = 0; local
    [all...]
  /external/icu/icu4c/source/test/intltest/
ustrtest.cpp 707 uint16_t occurrences = 0; local
711 (startPos = test1.indexOf(test2, startPos)) != -1 ? (++occurrences, startPos += 4) : 0)
713 if (occurrences != 6)
714 errln(UnicodeString("indexOf failed: expected to find 6 occurrences, found ") + occurrences);
716 for ( occurrences = 0, startPos = 10;
718 (startPos = test1.indexOf(test2, startPos)) != -1 ? (++occurrences, startPos += 4) : 0)
720 if (occurrences != 4)
722 "expected to find 4 occurrences, found ") + occurrences);
    [all...]
  /external/icu/icu4c/source/samples/strsrch/
readme.txt 2 strsrch: a sample program which finds the occurrences of a pattern string in a source string, using user-defined collation rules.
6 Finding all occurrences of a pattern string in a given source string.

Completed in 539 milliseconds

1 2 3 4 5 6 7 8 91011>>