- Sort Score
- Result 10 results
- Languages All
Results 341 - 350 of 393 for hasTest (0.03 sec)
-
android/guava-testlib/src/com/google/common/collect/testing/google/MultisetNavigationTester.java
assertEquals(0, multiset.toArray().length); assertTrue(multiset.entrySet().isEmpty()); assertFalse(multiset.iterator().hasNext()); assertEquals(0, multiset.entrySet().size()); assertEquals(0, multiset.entrySet().toArray().length); assertFalse(multiset.entrySet().iterator().hasNext()); } public void testEmptyRangeSubMultisetSupportingAdd(SortedMultiset<E> multiset) {
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 20:14:36 UTC 2024 - 26K bytes - Viewed (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/ResponseBody.kt
* * `Response.body().bytes()` * * `Response.body().string()` * * There is no benefit to invoking multiple `close()` methods for the same response body. * * For synchronous calls, the easiest way to make sure a response body is closed is with a `try` * block. With this structure the compiler inserts an implicit `finally` clause that calls * [close()][Response.close] for you. * * ```java
Registered: Fri Dec 26 11:42:13 UTC 2025 - Last Modified: Tue May 27 14:51:25 UTC 2025 - 11.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashSet.java
* 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. *Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Wed Aug 06 14:59:07 UTC 2025 - 9.4K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashSet.java
* 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. *Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Wed Aug 06 14:59:07 UTC 2025 - 9.6K bytes - Viewed (0) -
fess-crawler/src/main/java/org/codelibs/fess/crawler/extractor/impl/JsonExtractor.java
final Map<String, List<String>> metadataMap, final int depth) { final Iterator<Map.Entry<String, JsonNode>> fields = node.fields(); while (fields.hasNext()) { final Map.Entry<String, JsonNode> field = fields.next(); final String fieldName = field.getKey(); final JsonNode fieldValue = field.getValue();
Registered: Sat Dec 20 11:21:39 UTC 2025 - Last Modified: Sun Nov 23 03:46:53 UTC 2025 - 9.7K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/ds/callback/FileListIndexUpdateCallbackImpl.java
*/ package org.codelibs.fess.ds.callback; import static org.codelibs.core.stream.StreamUtil.stream; import java.util.ArrayList; import java.util.Deque; import java.util.HashSet; import java.util.LinkedList; import java.util.List; import java.util.Map; import java.util.Objects; import java.util.Set; import java.util.concurrent.ExecutorService; import java.util.concurrent.LinkedBlockingQueue;
Registered: Sat Dec 20 09:19:18 UTC 2025 - Last Modified: Fri Nov 28 16:29:12 UTC 2025 - 29.7K bytes - Viewed (3) -
src/main/java/org/codelibs/fess/rank/fusion/RankFusionProcessor.java
* governing permissions and limitations under the License. */ package org.codelibs.fess.rank.fusion; import java.util.ArrayList; import java.util.Collections; import java.util.HashMap; import java.util.HashSet; import java.util.List; import java.util.Locale; import java.util.Map; import java.util.Set; import java.util.concurrent.CopyOnWriteArrayList; import java.util.concurrent.ExecutionException;
Registered: Sat Dec 20 09:19:18 UTC 2025 - Last Modified: Fri Nov 28 16:29:12 UTC 2025 - 27.5K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/ldap/LdapManager.java
if (logger.isDebugEnabled()) { logger.debug("Account filter: {}", filter); } final Set<String> subRoleSet = new HashSet<>(); final Set<String> sAMAccountGroupNameSet = new HashSet<>(); search(bindDn, filter, new String[] { fessConfig.getLdapMemberofAttribute() }, () -> ldapUser.getEnvironment(), result -> { processSearchRoles(result, entryDn -> {
Registered: Sat Dec 20 09:19:18 UTC 2025 - Last Modified: Fri Nov 28 16:29:12 UTC 2025 - 86.3K bytes - Viewed (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/connection/RealConnectionPool.kt
if (connections.isEmpty()) cleanupQueue.cancelAll() true } else { scheduleCloser() false } } fun evictAll() { val i = connections.iterator() while (i.hasNext()) { val connection = i.next() val socketToClose = connection.withLock { if (connection.calls.isEmpty()) { i.remove() connection.noNewExchanges = true
Registered: Fri Dec 26 11:42:13 UTC 2025 - Last Modified: Wed Oct 08 03:50:05 UTC 2025 - 11.1K bytes - Viewed (0) -
guava-testlib/src/com/google/common/testing/FreshValueGenerator.java
import java.nio.charset.Charset; import java.util.ArrayList; import java.util.Arrays; import java.util.Collection; import java.util.Comparator; import java.util.Currency; import java.util.HashMap; import java.util.HashSet; import java.util.LinkedHashMap; import java.util.LinkedHashSet; import java.util.LinkedList; import java.util.List; import java.util.Locale; import java.util.Map; import java.util.NavigableMap;
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue May 13 17:27:14 UTC 2025 - 28.7K bytes - Viewed (0)