- Sort Score
- Num 10 results
- Language All
Results 41 - 50 of 77 for Unreachable (0.09 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
lib/fips140/v1.26.0.zip
invalid private key") } p, err := c.newPoint().ScalarBaseMult(key) if err != nil { // This is unreachable because the only error condition of // ScalarBaseMult is if the input is not the right size. panic("crypto/ecdh: internal error: nistec ScalarBaseMult failed for a fixed-size input") } publicKey := p.Bytes() if len(publicKey) == 1 { // The encoding of the identity is a single 0x00 byte. This is // unreachable because the only scalar that generates the identity is // zero, which is rejected above....
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Jan 08 17:58:32 GMT 2026 - 660.3K bytes - Click Count (0) -
lib/fips140/v1.0.0-c2097c7c.zip
invalid private key") } p, err := c.newPoint().ScalarBaseMult(key) if err != nil { // This is unreachable because the only error condition of // ScalarBaseMult is if the input is not the right size. panic("crypto/ecdh: internal error: nistec ScalarBaseMult failed for a fixed-size input") } publicKey := p.Bytes() if len(publicKey) == 1 { // The encoding of the identity is a single 0x00 byte. This is // unreachable because the only scalar that generates the identity is // zero, which is rejected above....
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Sep 25 19:53:19 GMT 2025 - 642.7K bytes - Click Count (0) -
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. */
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Mar 11 01:10:31 GMT 2026 - 24.4K bytes - Click Count (0) -
cmd/erasure-common.go
defer wg.Done() if disks[i] == nil { return } di, err := disks[i].DiskInfo(context.Background(), DiskInfoOptions{}) if err != nil || di.Healing { // - Do not consume disks which are not reachable // unformatted or simply not accessible for some reason. // // - Do not consume disks which are being healed // // - Future: skip busy disks return } mu.Lock()
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Fri Aug 29 02:39:48 GMT 2025 - 2.3K bytes - Click Count (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 { @RegisterExtensionCreated: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Tue Nov 04 19:13:52 GMT 2025 - 10.6K bytes - Click Count (0) -
compat/maven-model-builder/src/main/java/org/apache/maven/model/building/ModelBuildingRequest.java
* project directory. * * @return The model resolver or {@code null} if not set. */ ModelResolver getModelResolver(); /** * Sets the model resolver to use for resolution of mixins or parents that are not locally reachable from the * project directory. *Created: Sun Apr 05 03:35:12 GMT 2026 - Last Modified: Sat Apr 05 11:52:05 GMT 2025 - 12.8K bytes - Click Count (0) -
src/test/java/org/codelibs/fess/exception/LdapConfigurationExceptionTest.java
assertNotSame(exception1, exception3); } @Test 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());
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Fri Mar 13 23:01:26 GMT 2026 - 7.8K bytes - Click Count (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 resultsCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Mar 11 01:10:31 GMT 2026 - 4.2K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/ArchetypeGraph.java
* * <p>In an undirected graph, 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 graph after this method is called, the {@code Set}Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Nov 11 17:11:16 GMT 2025 - 7.5K bytes - Click Count (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
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Wed Mar 19 19:25:20 GMT 2025 - 7.3K bytes - Click Count (0)