- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 75 for Younes (0.27 sec)
-
guava/src/com/google/common/collect/EnumMultiset.java
if (occurrences == 0) { return count(element); } int index = e.ordinal(); int oldCount = counts[index]; if (oldCount == 0) { return 0; } else if (oldCount <= occurrences) { counts[index] = 0; distinctElements--; size -= oldCount; } else { counts[index] = oldCount - occurrences; size -= occurrences; } return oldCount; }
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 9.3K bytes - Viewed (0) -
android/guava/src/com/google/common/reflect/TypeToken.java
} private static Bounds every(Type[] bounds) { // Every bound must match. On any false, result is false. return new Bounds(bounds, false); } private static Bounds any(Type[] bounds) { // Any bound matches. On any true, result is true. return new Bounds(bounds, true); } private static class Bounds { private final Type[] bounds;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jun 26 21:02:13 GMT 2023 - 53.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeRangeSet.java
* complementLowerBoundWindow. Complement range lower bounds are either positive range upper * bounds, or Cut.belowAll(). * * positiveItr starts at the first positive range with lower bound greater than * firstComplementRangeLowerBound. (Positive range lower bounds correspond to complement range * upper bounds.) */ Collection<Range<C>> positiveRanges;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jun 26 21:02:13 GMT 2023 - 32.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/cache/TestingRemovalListeners.java
implements RemovalListener<K, V> { @Override public void onRemoval(RemovalNotification<K, V> notification) { add(notification); } } /** * {@link RemovalListener} that counts each {@link RemovalNotification} it receives, and provides * access to the most-recently received one. */ static class CountingRemovalListener<K, V> implements RemovalListener<K, V> {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3K bytes - Viewed (0) -
android/guava/src/com/google/common/math/ToDoubleRounder.java
abstract X toX(double d, RoundingMode mode); /** Returns a - b, guaranteed that both arguments are nonnegative. */ abstract X minus(X a, X b); /** Rounds {@code x} to a {@code double}. */ final double roundToDouble(X x, RoundingMode mode) { checkNotNull(x, "x"); checkNotNull(mode, "mode"); double roundArbitrarily = roundToDoubleArbitrarily(x);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 5.8K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/testing/RelationshipTester.java
String reportItem(Item<?> item) { return item.toString(); } } /** * A word about using {@link Equivalence}, which automatically checks for {@code null} and * identical inputs: This sounds like it ought to be a problem here, since the goals of this class * include testing that {@code equals()} is reflexive and is tolerant of {@code null}. However,
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 25 11:57:12 GMT 2023 - 5.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/ConcurrentHashMultiset.java
* references to the map or modify it in any way. * * <p>The returned multiset is serializable if the input map is. * * @param countMap backing map for storing the elements in the multiset and their counts. It must * be empty. * @throws IllegalArgumentException if {@code countMap} is not empty * @since 20.0 */ public static <E> ConcurrentHashMultiset<E> create(ConcurrentMap<E, AtomicInteger> countMap) {
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 20.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeRangeMap.java
public void remove(Range<K> rangeToRemove) { if (rangeToRemove.isEmpty()) { return; } /* * The comments for this method will use [ ] to indicate the bounds of rangeToRemove and ( ) to * indicate the bounds of ranges in the range map. */ Entry<Cut<K>, RangeMapEntry<K, V>> mapEntryBelowToTruncate = entriesByLowerBound.lowerEntry(rangeToRemove.lowerBound);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 21.9K bytes - Viewed (0) -
guava/src/com/google/common/cache/AbstractCache.java
private final LongAddable totalLoadTime = LongAddables.create(); private final LongAddable evictionCount = LongAddables.create(); /** Constructs an instance with all counts initialized to zero. */ public SimpleStatsCounter() {} /** @since 11.0 */ @Override public void recordHits(int count) { hitCount.add(count); } /** @since 11.0 */
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Tue Jun 15 18:00:07 GMT 2021 - 9.1K bytes - Viewed (0) -
guava-testlib/src/com/google/common/testing/GcFinalization.java
} while (System.nanoTime() - deadline < 0); throw formatRuntimeException( "Latch failed to count down within %d second timeout", timeoutSeconds); } /** * Creates a garbage object that counts down the latch in its finalizer. Sequestered into a * separate method to make it somewhat more likely to be unreachable. */ private static void createUnreachableLatchFinalizer(CountDownLatch latch) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.6K bytes - Viewed (0)