- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 15 for complexity (0.07 sec)
-
okhttp/src/main/kotlin/okhttp3/CertificatePinner.kt
* * ## Warning: Certificate Pinning is Dangerous! * * Pinning certificates limits your server team's abilities to update their TLS certificates. By * pinning certificates, you take on additional operational complexity and limit your ability to * migrate between certificate authorities. Do not use certificate pinning without the blessing of * your server's TLS administrator! * * ### Note about self-signed certificates *
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Mon Jan 08 01:13:22 UTC 2024 - 14.2K bytes - Viewed (0) -
istioctl/pkg/tag/generate.go
return "", fmt.Errorf("failed deactivating existing default revision: %w", err) } } // TODO(Monkeyanator) should extract the validationURL from revision's validating webhook here. However, // to ease complexity when pointing default to revision without per-revision validating webhook, // instead grab the endpoint information from the mutating webhook. This is not strictly correct.
Registered: Wed Nov 06 22:53:10 UTC 2024 - Last Modified: Wed Oct 09 16:05:45 UTC 2024 - 13.3K bytes - Viewed (0) -
src/main/webapp/js/admin/plugins/form-validator/security.js
rmUtils.LANG.andSpaces),this.errorMessage=e.badAlphaNumeric+e.badAlphaNumericExtra+j}else i=f+g,this.errorMessage=e.badAlphaNumeric;return new RegExp(i).test(b)},errorMessage:"",errorMessageKey:"requiredFields"}),a.formUtils.addValidator({name:"complexity",validatorFunction:function(b,c,d,e){var f=c.valAttr("require-uc-letter")||"0",g=c.valAttr("require-lc-letter")||"0",h=c.valAttr("require-special-char")||"0",i=c.valAttr("require-numeral")||"0",j=c.valAttr("require-length")||"0",k={"uc-letter":...
Registered: Thu Oct 31 13:40:30 UTC 2024 - Last Modified: Mon Jan 01 05:12:47 UTC 2018 - 10.5K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/Cache.kt
} return null } if (requestMethod != "GET") { // Don't cache non-GET responses. We're technically allowed to cache HEAD requests and some // POST requests, but the complexity of doing so is high and the benefit is low. return null } if (response.hasVaryAll()) { return null } val entry = Entry(response)
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Wed Apr 10 19:46:48 UTC 2024 - 26.8K bytes - Viewed (0) -
architecture/networking/pilot.md
* The Kubernetes Service Discovery controller is a bit of a monolith, and spins off a bunch of other sub-controllers in addition to the core service discovery controller. Because of the monolithic complexity it helps to see this magnified a bit: ```mermaid graph BT mcsc("Multicluster Secret") scr("Credentials Controller") ksd("Kubernetes Service Controller") nsc("Namespace Controller")
Registered: Wed Nov 06 22:53:10 UTC 2024 - Last Modified: Wed Feb 07 17:53:24 UTC 2024 - 19.1K bytes - Viewed (0) -
docs/en/docs/deployment/docker.md
Having another process manager inside the container (as would be with multiple workers) would only add **unnecessary complexity** that you are most probably already taking care of with your cluster system. ### Containers with Multiple Processes and Special Cases
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Wed Sep 18 16:09:57 UTC 2024 - 28.5K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Quantiles.java
* dataset contains no finite values). * * <h3>Performance</h3> * * <p>The average time complexity of the computation is O(N) in the size of the dataset. There is a * worst case time complexity of O(N^2). You are extremely unlikely to hit this quadratic case on * randomly ordered data (the probability decreases faster than exponentially in N), but if you are
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri May 12 17:02:53 UTC 2023 - 29.9K bytes - Viewed (0) -
guava/src/com/google/common/graph/Network.java
* * <p>A graph is composed of a set of nodes and a set of edges connecting pairs of nodes. * * <p>There are three primary interfaces provided to represent graphs. In order of increasing * complexity they are: {@link Graph}, {@link ValueGraph}, and {@link Network}. You should generally * prefer the simplest interface that satisfies your use case. See the <a
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 10 15:41:27 UTC 2024 - 22.4K bytes - Viewed (0) -
guava/src/com/google/common/graph/ValueGraph.java
* * <p>A graph is composed of a set of nodes and a set of edges connecting pairs of nodes. * * <p>There are three primary interfaces provided to represent graphs. In order of increasing * complexity they are: {@link Graph}, {@link ValueGraph}, and {@link Network}. You should generally * prefer the simplest interface that satisfies your use case. See the <a
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 10 15:41:27 UTC 2024 - 16K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RegularImmutableMap.java
@CheckForNull private final transient Object hashTable; @VisibleForTesting final transient @Nullable Object[] alternatingKeysAndValues; private final transient int size; /* * We have some considerable complexity in these create methods because of * Builder.buildKeepingLast(). The same Builder might be called with buildKeepingLast() and then * buildOrThrow(), or vice versa. So in particular, if we modify alternatingKeysAndValues to
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Apr 15 22:32:14 UTC 2024 - 22.7K bytes - Viewed (0)