- Sort Score
- Result 10 results
- Languages All
Results 81 - 90 of 167 for sela (0.03 sec)
-
okhttp/src/jvmTest/kotlin/okhttp3/SocketChannelTest.kt
// recordSslDebug = true } // https://tools.ietf.org/html/rfc6066#page-6 specifies a FQDN is required. val hostname = "local.host" private val handshakeCertificates = run { // Generate a self-signed cert for the server to serve and the client to trust. val heldCertificate = HeldCertificate .Builder() .commonName(hostname) .addSubjectAlternativeName(hostname)
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Wed Jun 18 12:28:21 UTC 2025 - 8K bytes - Viewed (0) -
LICENSES/third_party/forked/libcontainer/LICENSE
worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Tue Oct 22 13:56:22 UTC 2024 - 10.5K bytes - Viewed (0) -
okhttp-tls/src/main/kotlin/okhttp3/tls/internal/TlsUtil.kt
import org.codehaus.mojo.animal_sniffer.IgnoreJRERequirement object TlsUtil { val password = "password".toCharArray() private val localhost: HandshakeCertificates by lazy { // Generate a self-signed cert for the server to serve and the client to trust. val heldCertificate = HeldCertificate .Builder() .commonName("localhost") .addSubjectAlternativeName("localhost")
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Wed Mar 19 19:25:20 UTC 2025 - 4.3K bytes - Viewed (1) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/CertificatePinner.kt
* migrate between certificate authorities. Do not use certificate pinning without the blessing of * your server's TLS administrator! * * ### Note about self-signed certificates * * [CertificatePinner] can not be used to pin self-signed certificate if such certificate is not * accepted by [javax.net.ssl.TrustManager]. * * See also [OWASP: Certificate and Public Key Pinning][owasp]. *
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Wed Mar 19 19:25:20 UTC 2025 - 14.1K bytes - Viewed (0) -
LICENSES/vendor/github.com/containerd/containerd/api/LICENSE
worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Sun Sep 22 18:50:45 UTC 2024 - 10.7K bytes - Viewed (0) -
LICENSES/vendor/github.com/google/cadvisor/LICENSE
worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Fri May 08 04:49:00 UTC 2020 - 10.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
* of edges in a graph arranged to form a path (a sequence of adjacent outgoing edges) starting * and ending with the same node. * * <p>This method will detect any non-empty cycle, including self-loops (a cycle of length 1). */ public static <N> boolean hasCycle(Graph<N> graph) { int numEdges = graph.edges().size(); if (numEdges == 0) { return false; // An edge-free graph is acyclic by definition.
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
* of edges in a graph arranged to form a path (a sequence of adjacent outgoing edges) starting * and ending with the same node. * * <p>This method will detect any non-empty cycle, including self-loops (a cycle of length 1). */ public static <N> boolean hasCycle(Graph<N> graph) { int numEdges = graph.edges().size(); if (numEdges == 0) { return false; // An edge-free graph is acyclic by definition.
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Aug 01 00:26:14 UTC 2025 - 23.3K bytes - Viewed (0) -
LICENSES/vendor/github.com/containerd/errdefs/LICENSE
worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Sun Sep 22 18:50:45 UTC 2024 - 10.6K bytes - Viewed (0) -
LICENSES/vendor/github.com/containerd/log/LICENSE
worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Sun Sep 22 18:50:45 UTC 2024 - 10.6K bytes - Viewed (0)