- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 15 for small (0.14 sec)
-
guava-tests/test/com/google/common/cache/LocalCacheTest.java
createCacheBuilder().maximumSize(SMALL_MAX_SIZE), createCacheBuilder().expireAfterAccess(99999, SECONDS), createCacheBuilder().expireAfterWrite(99999, SECONDS), createCacheBuilder() .maximumSize(SMALL_MAX_SIZE) .expireAfterAccess(SMALL_MAX_SIZE, TimeUnit.SECONDS), createCacheBuilder() .maximumSize(SMALL_MAX_SIZE)
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 14 23:06:48 GMT 2024 - 112.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/cache/LocalCacheTest.java
createCacheBuilder().maximumSize(SMALL_MAX_SIZE), createCacheBuilder().expireAfterAccess(99999, SECONDS), createCacheBuilder().expireAfterWrite(99999, SECONDS), createCacheBuilder() .maximumSize(SMALL_MAX_SIZE) .expireAfterAccess(SMALL_MAX_SIZE, TimeUnit.SECONDS), createCacheBuilder() .maximumSize(SMALL_MAX_SIZE)
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Mar 14 23:06:48 GMT 2024 - 110.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableBiMap.java
* new ImmutableBiMap.Builder<String, Integer>() * .put("one", 1) * .put("two", 2) * .put("three", 3) * .buildOrThrow(); * }</pre> * * <p>For <i>small</i> immutable bimaps, the {@code ImmutableBiMap.of()} methods are even more * convenient. * * <p>By default, a {@code Builder} will generate bimaps that iterate over entries in the order
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 22.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Sets.java
* using a {@code LinkedHashSet} instead, at the cost of increased memory footprint, to get * deterministic iteration behavior. * * <p>This method is just a small convenience, either for {@code newHashSet(}{@link Arrays#asList * asList}{@code (...))}, or for creating an empty set then calling {@link Collections#addAll}.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 77.4K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/MoreExecutors.java
* been shutdown). * * <p>Although all tasks are immediately executed in the thread that submitted the task, this * {@code ExecutorService} imposes a small locking overhead on each task submission in order to * implement shutdown and termination behavior. * * <p>The implementation deviates from the {@code ExecutorService} specification with regards to
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Apr 17 16:33:44 GMT 2024 - 41.8K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AbstractFuture.java
// Timed Get // There are a few design constraints to consider // * We want to be responsive to small timeouts, unpark() has non trivial latency overheads (I // have observed 12 micros on 64-bit linux systems to wake up a parked thread). So if the // timeout is small we shouldn't park(). This needs to be traded off with the cpu overhead of
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:17:24 GMT 2024 - 63K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java
Random random = new Random(0); Multiset<Integer> elements = HashMultiset.create(); MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue.create(); int range = 10_000; // range should be small enough that equal elements occur semi-frequently for (int iter = 0; iter < reduceIterationsIfGwt(1000); iter++) { for (int i = 0; i < 100; i++) { Integer element = random.nextInt(range);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 36.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MapMakerInternalMap.java
int threshold; /** The per-segment table. */ @CheckForNull volatile AtomicReferenceArray<E> table; /** * A counter of the number of reads since the last write, used to drain queues on a small * fraction of read operations. */ final AtomicInteger readCount = new AtomicInteger(); Segment(MapMakerInternalMap<K, V, E, S> map, int initialCapacity) { this.map = map;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 91.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/ImmutableMapTest.java
.buildKeepingLast(); assertMapEquals(map, key1, 3, key2, 4); } // The java7 branch has different code depending on whether the entry indexes fit in a byte, // short, or int. The small table in testBuildKeepingLast_allowsOverwrite will test the byte // case. This method tests the short case. public void testBuildKeepingLast_shortTable() { Builder<Integer, String> builder = ImmutableMap.builder();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Apr 30 14:39:16 GMT 2024 - 37.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableMap.java
* new ImmutableMap.Builder<String, Integer>() * .put("one", 1) * .put("two", 2) * .put("three", 3) * .buildOrThrow(); * }</pre> * * <p>For <i>small</i> immutable maps, the {@code ImmutableMap.of()} methods are even more * convenient. * * <p>By default, a {@code Builder} will generate maps that iterate over entries in the order they
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)