- Sort Score
- Num 10 results
- Language All
Results 61 - 70 of 89 for factories (0.05 seconds)
-
android/guava/src/com/google/common/collect/Platform.java
import com.google.common.annotations.J2ktIncompatible; import java.util.Arrays; import java.util.Map; import java.util.Set; import org.jspecify.annotations.Nullable; /** * Methods factored out so that they can be emulated differently in GWT. * * @author Hayward Chan */ @GwtCompatible final class Platform { /** Returns the platform preferred implementation of a map based on a hash table. */Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Fri Jan 23 17:16:53 GMT 2026 - 4.5K bytes - Click Count (0) -
guava/src/com/google/common/collect/Platform.java
import java.util.Arrays; import java.util.LinkedHashMap; import java.util.Map; import java.util.Set; import java.util.concurrent.ConcurrentHashMap; import org.jspecify.annotations.Nullable; /** * Methods factored out so that they can be emulated differently in GWT. * * @author Hayward Chan */ @GwtCompatible final class Platform { /** Returns the platform preferred implementation of a map based on a hash table. */Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Fri Jan 23 17:16:53 GMT 2026 - 4.7K bytes - Click Count (0) -
guava/src/com/google/common/collect/RegularImmutableMultiset.java
if (bucketLength > MAX_HASH_BUCKET_LENGTH) { return true; } } } return false; } /** * Closed addressing tends to perform well even with high load factors. Being conservative here * ensures that the table is still likely to be relatively sparse (hence it misses fast) while * saving space. */ @VisibleForTesting static final double MAX_LOAD_FACTOR = 1.0;
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Fri Dec 26 20:08:09 GMT 2025 - 6.8K bytes - Click Count (0) -
src/main/java/org/codelibs/fess/helper/QueryHelper.java
boolQuery.filter(roleQuery); } /** * Builds boost query functions to modify document scoring based on various factors. * This method adds field value factors, key matching boosts, and custom boost functions. * * @param queryContext the query context to add boost functions to */
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Thu Jul 17 08:28:31 GMT 2025 - 19.9K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
* <p>This class should not be assumed to be universally superior to {@code * java.util.LinkedHashMap}. Generally speaking, this class reduces object allocation and memory * consumption at the price of moderately increased constant factors of CPU. Only use this class * when there is a specific reason to prioritize memory over CPU. * * @author Louis Wasserman */ @J2ktIncompatible // no support for access-order mode in LinkedHashMap delegateCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Aug 06 14:59:07 GMT 2025 - 8.4K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/util/concurrent/JSR166TestCase.java
* anything about how the property is tested. To find out, read the code. * <li>These tests are "conformance tests", and do not attempt to test throughput, latency, * scalability or other performance factors (see the separate "jtreg" tests for a set intended * to check these for the most central aspects of functionality.) So, most tests use the * smallest sensible numbers of threads, collection sizes, etc needed to check basic
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sat Mar 07 02:20:33 GMT 2026 - 8.8K bytes - Click Count (0) -
src/main/java/jcifs/SmbResourceLocator.java
* * @return The uncanonicalized full URL of this SMB resource. */ String getPath(); /** * Returns the full URL of this SMB resource with '.' and '..' components * factored out. An <code>SmbFile</code> constructed with the result of * this method will result in an <code>SmbFile</code> that is equal to * the original. * * @return The canonicalized URL of this SMB resource.Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sat Aug 16 01:32:48 GMT 2025 - 6.4K bytes - Click Count (0) -
docs/distributed/DESIGN.md
- *If total drives has many common divisors the algorithm chooses the minimum amounts of erasure sets possible for a erasure set size of any N*. In the example with 1024 drives - 4, 8, 16 are GCD factors. With 16 drives we get a total of 64 possible sets, with 8 drives we get a total of 128 possible sets, with 4 drives we get a total of 256 possible sets. So algorithm automatically chooses 64 sets, which is *16* 64 = 1024* drives in total.
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Wed Feb 26 09:25:50 GMT 2025 - 8K bytes - Click Count (2) -
android/guava/src/com/google/common/collect/CompactLinkedHashSet.java
* <p>This class should not be assumed to be universally superior to {@code * java.util.LinkedHashSet}. Generally speaking, this class reduces object allocation and memory * consumption at the price of moderately increased constant factors of CPU. Only use this class * when there is a specific reason to prioritize memory over CPU. * * @author Louis Wasserman */ @GwtIncompatible // not worth using in GWT for nowCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Aug 06 14:59:07 GMT 2025 - 9.4K bytes - Click Count (0) -
guava/src/com/google/common/collect/CompactLinkedHashSet.java
* <p>This class should not be assumed to be universally superior to {@code * java.util.LinkedHashSet}. Generally speaking, this class reduces object allocation and memory * consumption at the price of moderately increased constant factors of CPU. Only use this class * when there is a specific reason to prioritize memory over CPU. * * @author Louis Wasserman */ @GwtIncompatible // not worth using in GWT for nowCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Aug 06 14:59:07 GMT 2025 - 9.6K bytes - Click Count (0)