- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 110 for Capacity (1.92 sec)
-
src/main/java/org/codelibs/core/collection/LruHashSet.java
import java.util.Iterator; import java.util.Set; /** * A {@link Set} implementation that stores its elements in a {@link LruHashMap}. * <p> * This set has a fixed maximum capacity. When the capacity is reached and a new element is added, * the least recently used element is removed. * </p> * @author shinsuke * @param <E> the type of elements maintained by this set */
Registered: Fri Sep 05 20:58:11 UTC 2025 - Last Modified: Sat Jul 05 00:11:05 UTC 2025 - 3.7K bytes - Viewed (0) -
android/guava-testlib/test/com/google/common/testing/ArbitraryInstancesTest.java
assertEquals(0, ArbitraryInstances.get(Buffer.class).capacity()); assertEquals(0, ArbitraryInstances.get(CharBuffer.class).capacity()); assertEquals(0, ArbitraryInstances.get(ByteBuffer.class).capacity()); assertEquals(0, ArbitraryInstances.get(ShortBuffer.class).capacity()); assertEquals(0, ArbitraryInstances.get(IntBuffer.class).capacity()); assertEquals(0, ArbitraryInstances.get(LongBuffer.class).capacity());
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Wed Jul 16 17:42:14 UTC 2025 - 21.8K bytes - Viewed (0) -
src/main/java/org/codelibs/core/collection/LruHashMap.java
* @param <K> the key type * @param <V> the value type */ public class LruHashMap<K, V> extends LinkedHashMap<K, V> { private static final long serialVersionUID = 1L; /** * Default initial capacity. */ protected static final int DEFAULT_INITIAL_CAPACITY = 16; /** * Default load factor. */ protected static final float DEFAULT_LOAD_FACTOR = 0.75f; /**
Registered: Fri Sep 05 20:58:11 UTC 2025 - Last Modified: Thu Jun 19 09:12:22 UTC 2025 - 2.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java
MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue.create(); assertEquals(11, queue.capacity()); checkUnbounded(queue); checkNatural(queue); } public void testCreation_comparator() { MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue.orderedBy(SOME_COMPARATOR).create(); assertEquals(11, queue.capacity()); checkUnbounded(queue); assertSame(SOME_COMPARATOR, queue.comparator()); }
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 36K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedPriorityBlockingQueue.java
* Creates a {@code MonitorBasedPriorityBlockingQueue} with the default initial capacity (11) that * orders its elements according to their {@linkplain Comparable natural ordering}. */ public MonitorBasedPriorityBlockingQueue() { q = new PriorityQueue<E>(); } /** * Creates a {@code MonitorBasedPriorityBlockingQueue} with the specified initial capacity that
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue May 13 18:46:00 UTC 2025 - 18.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashSet.java
} /** * Creates a {@code CompactHashSet} instance, with a high enough "initial capacity" that it * <i>should</i> hold {@code expectedSize} elements without growth. * * @param expectedSize the number of elements you expect to add to the returned set * @return a new, empty {@code CompactHashSet} with enough capacity to hold {@code expectedSize} * elements without resizing
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue Jul 08 18:32:10 UTC 2025 - 23.9K bytes - Viewed (0) -
guava-testlib/test/com/google/common/testing/ArbitraryInstancesTest.java
assertEquals(0, ArbitraryInstances.get(Buffer.class).capacity()); assertEquals(0, ArbitraryInstances.get(CharBuffer.class).capacity()); assertEquals(0, ArbitraryInstances.get(ByteBuffer.class).capacity()); assertEquals(0, ArbitraryInstances.get(ShortBuffer.class).capacity()); assertEquals(0, ArbitraryInstances.get(IntBuffer.class).capacity()); assertEquals(0, ArbitraryInstances.get(LongBuffer.class).capacity());
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Wed Jul 16 17:42:14 UTC 2025 - 22.3K bytes - Viewed (0) -
src/test/java/jcifs/internal/fscc/SmbInfoAllocationTest.java
// Verify - actual implementation reads 20 bytes (4 + 4 + 4 + 4 + 4) // bytesPerSect is read as Int2 but advances by 4 bytes (padding) assertEquals(20, bytesDecoded); // Verify capacity calculation: alloc * sectPerAlloc * bytesPerSect long expectedCapacity = alloc * sectPerAlloc * bytesPerSect; assertEquals(expectedCapacity, smbInfoAllocation.getCapacity());
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 14.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashMap.java
} /** * Creates a {@code CompactHashMap} instance, with a high enough "initial capacity" that it * <i>should</i> hold {@code expectedSize} elements without growth. * * @param expectedSize the number of elements you expect to add to the returned set * @return a new, empty {@code CompactHashMap} with enough capacity to hold {@code expectedSize} * elements without resizing
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue Jul 08 18:32:10 UTC 2025 - 39.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/RateLimiterTest.java
stopwatch.sleepMillis(1000); // max capacity reached stopwatch.sleepMillis(1000); // this makes no difference limiter.acquire(1); // R0.00, since it's the first request limiter.acquire(1); // R0.00, from capacity limiter.acquire(3); // R0.00, from capacity limiter.acquire(1); // R0.00, concluding a burst of 5 permits limiter.acquire(); // R0.20, capacity exhausted assertEvents(
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 21.9K bytes - Viewed (0)