- Sort Score
- Num 10 results
- Language All
Results 601 - 610 of 2,967 for than (0.03 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
docs/changelogs/changelog_3x.md
connections alive so applications that have many pools also risk exhausting memory! The best practice in OkHttp 3 is to create a single OkHttpClient instance and share it throughout the application. Requests that needs a customized client should call `OkHttpClient.newBuilder()` on that shared instance. This allows customization without the drawbacks of separate connectionCreated: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Sun Feb 06 14:55:54 GMT 2022 - 50.8K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/AbstractNetwork.java
import java.util.Map; import java.util.Set; import org.jspecify.annotations.Nullable; /** * This class provides a skeletal implementation of {@link Network}. It is recommended to extend * this class rather than implement {@link Network} directly. * * <p>The methods implemented in this class should not be overridden unless the subclass admits a * more efficient implementation. * * @author James SextonCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Mar 11 01:10:31 GMT 2026 - 10K bytes - Click Count (0) -
.teamcity/src/main/kotlin/model/PerformanceTestBucketProvider.kt
durationsPerTestProject.forEach { (key, value) -> if (value.size != 1 ) { throw IllegalArgumentException("More than one scenario split for test project $key: $projectDurations") } } return durationsPerTestProject .mapValues { (_, durations) -> durations.flatten().map { it.scenario } } }Created: Wed Apr 01 11:36:16 GMT 2026 - Last Modified: Thu Jan 29 01:37:22 GMT 2026 - 17.2K bytes - Click Count (0) -
android/guava/src/com/google/common/hash/BloomFilterStrategies.java
} /** * Number of set bits (1s). * * <p>Note that because of concurrent set calls and uses of atomics, this bitCount is a (very) * close *estimate* of the actual number of bits set. It's not possible to do better than an * estimate without locking. Note that the number, if not exactly accurate, is *always* * underestimating, never overestimating. */Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Mar 19 18:53:45 GMT 2026 - 10.7K bytes - Click Count (0) -
guava/src/com/google/common/collect/FilteredEntryMultimap.java
} @SuppressWarnings("EmptyList") // ImmutableList doesn't support nullable element types Collection<V> unmodifiableEmptyCollection() { // These return false, rather than throwing a UOE, on remove calls. return (unfiltered instanceof SetMultimap) ? emptySet() : emptyList(); } @Override public void clear() { entries().clear(); } @OverrideCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Sep 22 18:35:44 GMT 2025 - 12.3K bytes - Click Count (0) -
src/test/java/org/codelibs/fess/suggest/converter/ReadingConverterTest.java
// Test that readings respect max reading limit TestReadingConverterWithLimit limitConverter = new TestReadingConverterWithLimit(); limitConverter.init(); assertEquals(5, limitConverter.getMaxReadingNum()); String text = "test"; String field = "content"; // Request more languages than max reading numCreated: Fri Apr 17 09:08:13 GMT 2026 - Last Modified: Mon Sep 01 13:33:03 GMT 2025 - 13.5K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashSet.java
* good job of distributing the elements to the buckets to a distribution not far from uniform), and * amortized since some operations can trigger a hash table resize. * * <p>This implementation consumes significantly less memory than {@code java.util.LinkedHashSet} or * even {@code java.util.HashSet}, and places considerably less load on the garbage collector. Like * {@code java.util.LinkedHashSet}, it offers insertion-order iteration, with identical behavior.Created: 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
* good job of distributing the elements to the buckets to a distribution not far from uniform), and * amortized since some operations can trigger a hash table resize. * * <p>This implementation consumes significantly less memory than {@code java.util.LinkedHashSet} or * even {@code java.util.HashSet}, and places considerably less load on the garbage collector. Like * {@code java.util.LinkedHashSet}, it offers insertion-order iteration, with identical behavior.Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Aug 06 14:59:07 GMT 2025 - 9.6K bytes - Click Count (0) -
guava-tests/test/com/google/common/hash/HashTestUtils.java
return actions[random.nextInt(actions.length)]; } } /** * Test that the hash function contains no funnels. A funnel is a situation where a set of input * (key) bits 'affects' a strictly smaller set of output bits. Funneling is bad because it can * result in more-than-ideal collisions for a non-uniformly distributed key space. In practice,
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Oct 28 18:19:59 GMT 2025 - 25.6K bytes - Click Count (0) -
android/guava/src/com/google/common/util/concurrent/ExecutionSequencer.java
* Tasks execute with the same happens-before order that the function calls to {@link #submit} and * {@link #submitAsync} that submitted those tasks had. * * <p>This class has limited support for cancellation and other "early completions": * * <ul> * <li>While calls to {@code submit} and {@code submitAsync} return a {@code Future} that can be * cancelled, cancellation never propagates to a task that has started to run -- neither toCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Sep 23 01:35:55 GMT 2025 - 22.1K bytes - Click Count (0)