- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 204 for reachable (0.12 sec)
-
android/guava/src/com/google/common/graph/Graphs.java
&& network.edges().size() > network.asGraph().edges().size()) { return true; } return hasCycle(network.asGraph()); } /** * Performs a traversal of the nodes reachable from {@code startNode}. If we ever reach a node * we've already visited (following only outgoing edges and without reusing edges), we know * there's a cycle in the graph. */
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Aug 01 00:26:14 UTC 2025 - 22.7K bytes - Viewed (0) -
guava/src/com/google/common/graph/Graphs.java
&& network.edges().size() > network.asGraph().edges().size()) { return true; } return hasCycle(network.asGraph()); } /** * Performs a traversal of the nodes reachable from {@code startNode}. If we ever reach a node * we've already visited (following only outgoing edges and without reusing edges), we know * there's a cycle in the graph. */
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Aug 01 00:26:14 UTC 2025 - 23.3K bytes - Viewed (0) -
guava/src/com/google/common/graph/SuccessorsFunction.java
* Returns all nodes in this graph adjacent to {@code node} which can be reached by traversing * {@code node}'s outgoing edges in the direction (if any) of the edge. * * <p>This is <i>not</i> the same as "all nodes reachable from {@code node} by following outgoing * edges". For that functionality, see {@link Graphs#reachableNodes(Graph, Object)}. * * <p>Some algorithms that operate on a {@code SuccessorsFunction} may produce undesired results
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 4.2K bytes - Viewed (0) -
src/test/java/org/codelibs/fess/exception/LdapConfigurationExceptionTest.java
assertNotSame(exception1, exception3); } public void test_throwAndCatch() { // Test throwing and catching the exception String errorMessage = "LDAP server not reachable"; try { throw new LdapConfigurationException(errorMessage); } catch (LdapConfigurationException e) { assertEquals(errorMessage, e.getMessage());
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Tue Aug 19 14:09:36 UTC 2025 - 7.5K bytes - Viewed (0) -
okhttp/src/jvmTest/kotlin/okhttp3/FastFallbackTest.kt
* `::1` will reach the IPv6 server. * * By orchestrating two different servers with the same port but different IP addresses, we can * test what OkHttp does when both are reachable, or if only one is reachable. * * This test only runs on host machines that have both IPv4 and IPv6 addresses for localhost. */ @Timeout(30) class FastFallbackTest { @RegisterExtension
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Fri Jun 20 11:46:46 UTC 2025 - 10.4K bytes - Viewed (0) -
docs/works_with_okhttp.md
* [okhttp-staleiferror-interceptor](https://github.com/PeelTechnologies/okhttp-staleiferror-interceptor/): serve stale responses when the server isn’t reachable. * [okhttp-stats](https://github.com/flipkart-incubator/okhttp-stats): Get stats like average network speed.
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Sat Feb 15 16:18:51 UTC 2025 - 3.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/SuccessorsFunction.java
* Returns all nodes in this graph adjacent to {@code node} which can be reached by traversing * {@code node}'s outgoing edges in the direction (if any) of the edge. * * <p>This is <i>not</i> the same as "all nodes reachable from {@code node} by following outgoing * edges". For that functionality, see {@link Graphs#reachableNodes(Graph, Object)}. * * <p>Some algorithms that operate on a {@code SuccessorsFunction} may produce undesired results
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 4.2K bytes - Viewed (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/Address.kt
protocols: List<Protocol>, connectionSpecs: List<ConnectionSpec>, /** * Returns this address's proxy selector. Only used if the proxy is null. If none of this * selector's proxies are reachable, a direct connection will be attempted. */ @get:JvmName("proxySelector") val proxySelector: ProxySelector, ) { /** * Returns a URL with the hostname and port of the origin server. The path, query, and fragment of
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Wed Mar 19 19:25:20 UTC 2025 - 7.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MapMaker.java
* Specifies that each value (not key) stored in the map should be wrapped in a {@link * WeakReference} (by default, strong references are used). * * <p>Weak values will be garbage collected once they are weakly reachable. This makes them a poor * candidate for caching. * * <p><b>Warning:</b> when this method is used, the resulting map will use identity ({@code ==})
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 12.8K bytes - Viewed (0) -
guava/src/com/google/common/graph/Network.java
* * <p>In an undirected network, this is equivalent to {@link #adjacentNodes(Object)}. * * <p>This is <i>not</i> the same as "all nodes reachable from {@code node} by following outgoing * edges". For that functionality, see {@link Graphs#reachableNodes(Graph, Object)}. * * <p>If {@code node} is removed from the network after this method is called, the {@code Set}
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 22:03:02 UTC 2025 - 22.5K bytes - Viewed (0)