- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 57 for Low (0.01 sec)
-
android/guava/src/com/google/common/primitives/ImmutableLongArray.java
* of values that will be added, if that knowledge is readily available. It is better to guess a * value slightly too high than slightly too low. If the value is not exact, the {@link * ImmutableLongArray} that is built will very likely occupy more memory than strictly necessary; * to trim memory usage, build using {@code builder.build().trimmed()}. */
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Aug 09 01:14:59 UTC 2025 - 22K bytes - Viewed (0) -
guava/src/com/google/common/primitives/ImmutableIntArray.java
* of values that will be added, if that knowledge is readily available. It is better to guess a * value slightly too high than slightly too low. If the value is not exact, the {@link * ImmutableIntArray} that is built will very likely occupy more memory than strictly necessary; * to trim memory usage, build using {@code builder.build().trimmed()}. */
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Aug 09 01:14:59 UTC 2025 - 21.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/cache/CacheBuilderTest.java
LoadingCache<?, ?> cache = CacheBuilder.newBuilder().initialCapacity(0).build(identityLoader()); LocalCache<?, ?> map = CacheTesting.toLocalCache(cache); assertThat(map.segments).hasLength(4); // 1 is as low as it goes, not 0. it feels dirty to know this/test this. assertEquals(1, map.segments[0].table.length()); assertEquals(1, map.segments[1].table.length()); assertEquals(1, map.segments[2].table.length());
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 25.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/cache/CacheBuilderTest.java
LoadingCache<?, ?> cache = CacheBuilder.newBuilder().initialCapacity(0).build(identityLoader()); LocalCache<?, ?> map = CacheTesting.toLocalCache(cache); assertThat(map.segments).hasLength(4); // 1 is as low as it goes, not 0. it feels dirty to know this/test this. assertEquals(1, map.segments[0].table.length()); assertEquals(1, map.segments[1].table.length()); assertEquals(1, map.segments[2].table.length());
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 25K bytes - Viewed (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/Cache.kt
// Don't cache non-GET and non-QUERY responses. We're technically allowed to cache HEAD // requests and some POST requests, but the complexity of doing so is high and the benefit // is low. return null } if (response.hasVaryAll()) { return null } val entry = Entry(response) var editor: DiskLruCache.Editor? = null try {
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Sat Aug 16 09:39:51 UTC 2025 - 26.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashMap.java
/** * Contains the logical entries, in the range of [0, size()). The high bits of each int are the * part of the smeared hash of the key not covered by the hashtable mask, whereas the low bits are * the "next" pointer (pointing to the next entry in the bucket chain), which will always be less * than or equal to the hashtable mask. * * <pre> * hash = aaaaaaaa * mask = 00000fff
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue Jul 08 18:32:10 UTC 2025 - 39.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSet.java
* element. (https://en.wikipedia.org/wiki/Linear_probing#Analysis) * * <p>This method may return {@code true} even on truly random input, but {@code * ImmutableSetTest} tests that the probability of that is low. */ static boolean hashFloodingDetected(@Nullable Object[] hashTable) { int maxRunBeforeFallback = maxRunBeforeFallback(hashTable.length); int mask = hashTable.length - 1;
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 35.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashMap.java
/** * Contains the logical entries, in the range of [0, size()). The high bits of each int are the * part of the smeared hash of the key not covered by the hashtable mask, whereas the low bits are * the "next" pointer (pointing to the next entry in the bucket chain), which will always be less * than or equal to the hashtable mask. * * <pre> * hash = aaaaaaaa * mask = 00000fff
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Aug 09 01:14:59 UTC 2025 - 35.7K bytes - Viewed (0) -
src/main/webapp/css/font-awesome.min.css
ore{content:"\f023"}.fa-lock-open:before{content:"\f3c1"}.fa-long-arrow-alt-down:before{content:"\f309"}.fa-long-arrow-alt-left:before{content:"\f30a"}.fa-long-arrow-alt-right:before{content:"\f30b"}.fa-long-arrow-alt-up:before{content:"\f30c"}.fa-low-vision:before{content:"\f2a8"}.fa-luggage-cart:before{content:"\f59d"}.fa-lyft:before{content:"\f3c3"}.fa-magento:before{content:"\f3c4"}.fa-magic:before{content:"\f0d0"}.fa-magnet:before{content:"\f076"}.fa-mail-bulk:before{content:"\f674"}.fa-mai...
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Sat Dec 14 21:22:25 UTC 2019 - 55.8K bytes - Viewed (2) -
src/main/webapp/css/admin/font-awesome.min.css
ore{content:"\f023"}.fa-lock-open:before{content:"\f3c1"}.fa-long-arrow-alt-down:before{content:"\f309"}.fa-long-arrow-alt-left:before{content:"\f30a"}.fa-long-arrow-alt-right:before{content:"\f30b"}.fa-long-arrow-alt-up:before{content:"\f30c"}.fa-low-vision:before{content:"\f2a8"}.fa-luggage-cart:before{content:"\f59d"}.fa-lyft:before{content:"\f3c3"}.fa-magento:before{content:"\f3c4"}.fa-magic:before{content:"\f0d0"}.fa-magnet:before{content:"\f076"}.fa-mail-bulk:before{content:"\f674"}.fa-mai...
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Sat Dec 14 21:22:25 UTC 2019 - 55.8K bytes - Viewed (0)