- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 238 for Chan (0.13 sec)
-
android/guava-tests/test/com/google/common/collect/AbstractImmutableSetTest.java
assertEquals( "Modifying the builder should not have changed any already built sets", 216, webSafeColors.size()); assertEquals("the new array should be one bigger than webSafeColors", 217, addedColor.size()); Integer[] appendColorArray = addedColor.toArray(new Integer[addedColor.size()]); assertEquals(getComplexBuilderSetLastElement(), (int) appendColorArray[216]); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 18.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/RateLimiterTest.java
stopwatch.sleepMillis(rate * 1000); limiter.setRate(rate); long burst = measureTotalTimeMillis(limiter, oneSecWorthOfWork, new Random()); // we allow one second worth of work to go in a burst (i.e. take less than a second) assertTrue(burst <= 1000); long afterBurst = measureTotalTimeMillis(limiter, oneSecWorthOfWork, new Random()); // but work beyond that must take at least one second
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 21.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSetMultimap.java
/** * {@inheritDoc} * * <p>Because an inverse of a set multimap cannot contain multiple pairs with the same key and * value, this method returns an {@code ImmutableSetMultimap} rather than the {@code * ImmutableMultimap} specified in the {@code ImmutableMultimap} class. */ @Override public ImmutableSetMultimap<V, K> inverse() { ImmutableSetMultimap<V, K> result = inverse;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 23.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeMultiset.java
return result[0] == oldCount; } @Override public void clear() { if (!range.hasLowerBound() && !range.hasUpperBound()) { // We can do this in O(n) rather than removing one by one, which could force rebalancing. for (AvlNode<E> current = header.succ(); current != header; ) { AvlNode<E> next = current.succ(); current.elemCount = 0;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 34.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/HashBiMap.java
* equivalently, if this inverse view contains a key that is equal to {@code value}). * * <p>Due to the property that values in a BiMap are unique, this will tend to execute in * faster-than-linear time. * * @param value the object to search for in the values of this BiMap * @return true if a mapping exists from a key to the specified value */ @Override
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Mar 06 16:06:58 GMT 2023 - 36.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/ForwardingMultisetTest.java
import junit.framework.TestCase; import junit.framework.TestSuite; import org.checkerframework.checker.nullness.qual.Nullable; /** * Tests for {@link ForwardingMultiset}. * * @author Hayward Chan * @author Louis Wasserman */ public class ForwardingMultisetTest extends TestCase { static final class StandardImplForwardingMultiset<T> extends ForwardingMultiset<T> { private final Multiset<T> backingCollection;
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Apr 17 15:49:06 GMT 2023 - 11.8K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/SmoothRateLimiter.java
* with underutilization, then we want stored permits to be given out /faster/ than fresh ones, * because underutilization = free resources for the taking. If we are primarily interested to * deal with overflow, then stored permits could be given out /slower/ than fresh ones. Thus, we * require a (different in each case) function that translates storedPermits to throttling time. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 04 09:45:04 GMT 2023 - 19.3K bytes - Viewed (0) -
guava/src/com/google/common/cache/Striped64.java
* retries, there is increased contention and reduced locality, * which is still better than alternatives. * * Per-thread hash codes are initialized to random values. * Contention and/or table collisions are indicated by failed * CASes when performing an update operation (see method * retryUpdate). Upon a collision, if the table size is less than * the capacity, it is doubled in size unless some other thread
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TopKSelector.java
private int bufferSize; /** * The largest of the lowest k elements we've seen so far relative to this comparator. If * bufferSize ≥ k, then we can ignore any elements greater than this value. */ @CheckForNull private T threshold; @SuppressWarnings("unchecked") // TODO(cpovirk): Consider storing Object[] instead of T[]. private TopKSelector(Comparator<? super T> comparator, int k) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 11.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableMap.java
* Returns a newly-created immutable map, using the last value for any key that was added more * than once. The iteration order of the returned map is the order in which entries were * inserted into the builder, unless {@link #orderEntriesByValue} was called, in which case * entries are sorted by value. If a key was added more than once, it appears in iteration order
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 41.7K bytes - Viewed (0)