- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 68 for occurrences (0.06 sec)
-
android/guava/src/com/google/common/collect/ImmutableSortedMultiset.java
* @throws IllegalArgumentException if {@code occurrences} is negative, or if this operation * would result in more than {@link Integer#MAX_VALUE} occurrences of the element */ @CanIgnoreReturnValue @Override public Builder<E> addCopies(E element, int occurrences) { checkNotNull(element); CollectPreconditions.checkNonnegative(occurrences, "occurrences"); if (occurrences == 0) {Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue May 13 17:27:14 UTC 2025 - 35.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/ForwardingMultiset.java
} @CanIgnoreReturnValue @Override public int add(@ParametricNullness E element, int occurrences) { return delegate().add(element, occurrences); } @CanIgnoreReturnValue @Override public int remove(@Nullable Object element, int occurrences) { return delegate().remove(element, occurrences); } @Override public Set<E> elementSet() { return delegate().elementSet(); }
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue Jul 08 18:32:10 UTC 2025 - 10.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/TreeMultiset.java
return 0; } } @CanIgnoreReturnValue @Override public int add(@ParametricNullness E element, int occurrences) { checkNonnegative(occurrences, "occurrences"); if (occurrences == 0) { return count(element); } checkArgument(range.contains(element)); AvlNode<E> root = rootReference.get(); if (root == null) {Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue Dec 09 15:58:48 UTC 2025 - 34.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ForwardingMultiset.java
} @CanIgnoreReturnValue @Override public int add(@ParametricNullness E element, int occurrences) { return delegate().add(element, occurrences); } @CanIgnoreReturnValue @Override public int remove(@Nullable Object element, int occurrences) { return delegate().remove(element, occurrences); } @Override public Set<E> elementSet() { return delegate().elementSet(); }
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue Jul 08 18:32:10 UTC 2025 - 10.3K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/AbstractContainerTester.java
* words, for the default {@code expectContents()} implementation, the number of occurrences of * each given element has increased by one since the test collection was created, and the number * of occurrences of all other elements has not changed. * * <p>Note: This means that a test like the following will fail if {@code collection} is a {@code * Set}:Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Sep 22 20:54:16 UTC 2025 - 8.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSortedMultiset.java
* @throws IllegalArgumentException if {@code occurrences} is negative, or if this operation * would result in more than {@link Integer#MAX_VALUE} occurrences of the element */ @CanIgnoreReturnValue @Override public Builder<E> addCopies(E element, int occurrences) { super.addCopies(element, occurrences); return this; } /**Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Sep 22 21:07:18 UTC 2025 - 29.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeMultiset.java
return 0; } } @CanIgnoreReturnValue @Override public int add(@ParametricNullness E element, int occurrences) { checkNonnegative(occurrences, "occurrences"); if (occurrences == 0) { return count(element); } checkArgument(range.contains(element)); AvlNode<E> root = rootReference.get(); if (root == null) {Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue Dec 09 15:58:48 UTC 2025 - 33.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/LinkedHashMultiset.java
/** * A {@code Multiset} implementation with predictable iteration order. Its iterator orders elements * according to when the first occurrence of the element was added. When the multiset contains * multiple instances of an element, those instances are consecutive in the iteration order. If all * occurrences of an element are removed, after which that element is added to the multiset, the * element will appear at the end of the iteration. *Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 2.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/AbstractMultiset.java
@Override public int add(@ParametricNullness E element, int occurrences) { throw new UnsupportedOperationException(); } @CanIgnoreReturnValue @Override public final boolean remove(@Nullable Object element) { return remove(element, 1) > 0; } @CanIgnoreReturnValue @Override public int remove(@Nullable Object element, int occurrences) { throw new UnsupportedOperationException(); }
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Sat Aug 09 01:14:59 UTC 2025 - 5.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/LinkedHashMultiset.java
/** * A {@code Multiset} implementation with predictable iteration order. Its iterator orders elements * according to when the first occurrence of the element was added. When the multiset contains * multiple instances of an element, those instances are consecutive in the iteration order. If all * occurrences of an element are removed, after which that element is added to the multiset, the * element will appear at the end of the iteration. *Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Fri Dec 05 23:15:58 UTC 2025 - 3.8K bytes - Viewed (0)