- Sort Score
- Result 10 results
- Languages All
Results 81 - 90 of 182 for lookups (0.03 sec)
-
docs/changelogs/upgrading_to_okhttp_4.md
.build() ``` Kotlin calling OkHttp 4.x: ```kotlin val client = OkHttpClient.Builder() .dns(object : Dns { override fun lookup(hostname: String) = InetAddress.getAllByName(hostname).toList() }) .build() ``` SAM conversion impacts these APIs: * Authenticator * Dispatcher.setIdleCallback(Runnable)
Registered: Fri Dec 26 11:42:13 UTC 2025 - Last Modified: Sun Feb 06 16:58:16 UTC 2022 - 10.9K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/query/QueryCommand.java
} return SortBuilders.fieldSort(field).order(order); } /** * Checks if the specified field is a search field. * Uses O(1) Set lookup for improved performance. * @param field The field name to check. * @return True if the field is a search field, false otherwise. */ protected boolean isSearchField(final String field) {Registered: Sat Dec 20 09:19:18 UTC 2025 - Last Modified: Sun Nov 23 11:39:05 UTC 2025 - 11.6K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/AbstractCache.java
* found in the cache. This method should be called by the loading thread, as well as by threads * blocking on the load. Multiple concurrent calls to {@link Cache} lookup methods with the same * key on an absent value should result in a single call to either {@code recordLoadSuccess} or * {@code recordLoadException} and multiple calls to this method, despite all being served byRegistered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue May 13 17:27:14 UTC 2025 - 9.1K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/FuturesGetChecked.java
* than a handful of exceptions. But it seems prudent to set a cap on how many we'll cache. * This avoids out-of-control memory consumption, and it keeps the cache from growing so * large that doing the lookup is noticeably slower than redoing the work would be. * * Ideally we'd have a real eviction policy, but until we see a problem in practice, I hope
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Sat Aug 09 01:14:59 UTC 2025 - 11.8K bytes - Viewed (0) -
src/main/java/org/codelibs/core/io/LineIterator.java
protected final BufferedReader reader; /** The line that has been read */ protected String line = EMPTY; /** * Returns an {@link Iterable} that wraps a {@link LineIterator} for use in enhanced for-loops. * * @param reader * The {@link Reader} to read strings from. Must not be {@literal null}. * @return An {@link Iterable} that wraps a {@link LineIterator}. */Registered: Sat Dec 20 08:55:33 UTC 2025 - Last Modified: Thu Jun 19 09:12:22 UTC 2025 - 3.6K bytes - Viewed (0) -
guava-gwt/src/com/google/thirdparty/publicsuffix/PublicSuffixType.gwt.xml
for prod and one for tests. However, unlike our other packages, as of this writing it has test supersource but no prod supersource. GWT happens to use the prod .gwt.xml, so it looks for no supersource for tests, either. This causes it to fail to find AtomicLongMapTest. Our workaround is to tell GWT that util.concurrent and all other packagesRegistered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Fri Jul 19 16:02:36 UTC 2024 - 1.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graph.java
/** * Returns the count of {@code node}'s incident edges, counting self-loops twice (equivalently, * the number of times an edge touches {@code node}). * * <p>For directed graphs, this is equal to {@code inDegree(node) + outDegree(node)}. * * <p>For undirected graphs, this is equal to {@code incidentEdges(node).size()} + (number of * self-loops incident to {@code node}). *Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 13.6K bytes - Viewed (0) -
guava/src/com/google/common/graph/Graph.java
/** * Returns the count of {@code node}'s incident edges, counting self-loops twice (equivalently, * the number of times an edge touches {@code node}). * * <p>For directed graphs, this is equal to {@code inDegree(node) + outDegree(node)}. * * <p>For undirected graphs, this is equal to {@code incidentEdges(node).size()} + (number of * self-loops incident to {@code node}). *Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 13.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ValueGraphBuilder.java
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 7.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardNetwork.java
this.allowsSelfLoops = builder.allowsSelfLoops; this.nodeOrder = builder.nodeOrder.cast(); this.edgeOrder = builder.edgeOrder.cast(); // Prefer the heavier "MapRetrievalCache" for nodes if lookup is expensive. This optimizes // methods that access the same node(s) repeatedly, such as Graphs.removeEdgesConnecting(). this.nodeConnections = (nodeConnections instanceof TreeMap)Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Sat Dec 21 03:10:51 UTC 2024 - 6.9K bytes - Viewed (0)