- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 185 for leash (0.14 sec)
-
istioctl/pkg/describe/describe_test.go
}, }, TrafficPolicy: &v1alpha32.TrafficPolicy{ LoadBalancer: &v1alpha32.LoadBalancerSettings{ LbPolicy: &v1alpha32.LoadBalancerSettings_Simple{Simple: v1alpha32.LoadBalancerSettings_LEAST_REQUEST}, }, ConnectionPool: &v1alpha32.ConnectionPoolSettings{Tcp: &v1alpha32.ConnectionPoolSettings_TCPSettings{MaxConnections: 10}}, OutlierDetection: &v1alpha32.OutlierDetection{MinHealthPercent: 10},
Go - Registered: Wed May 08 22:53:08 GMT 2024 - Last Modified: Thu Mar 28 09:54:01 GMT 2024 - 30.4K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/connection/RealConnectionPool.kt
addressState.concurrentCallCapacity += connection.allocationLimit } } // Find the longest-idle connections in 2 categories: // // 1. OLD: Connections that have been idle for at least keepAliveDurationNs. We close these if // we find them, regardless of what the address policies need. // // 2. EVICTABLE: Connections not required by any address policy. This matches connections that
Plain Text - Registered: Fri May 03 11:42:14 GMT 2024 - Last Modified: Sat Apr 20 17:03:43 GMT 2024 - 16.2K bytes - Viewed (0) -
cmd/server-rlimit.go
return err } if maxLimit < 4096 && runtime.GOOS != globalWindowsOSName { logger.Info("WARNING: maximum file descriptor limit %d is too low for production servers. At least 4096 is recommended. Fix with \"ulimit -n 4096\"", maxLimit) } if err = sys.SetMaxOpenFileLimit(maxLimit, maxLimit); err != nil { return err } // Set max memory limit as current memory limit.
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Apr 04 12:06:57 GMT 2024 - 2.8K bytes - Viewed (0) -
docs/en/docs/benchmarks.md
* Will have the best performance, as it doesn't have much extra code apart from the server itself. * You wouldn't write an application in Uvicorn directly. That would mean that your code would have to include more or less, at least, all the code provided by Starlette (or **FastAPI**). And if you did that, your final application would have the same overhead as having used a framework and minimizing your app code and bugs.
Plain Text - Registered: Sun May 05 07:19:11 GMT 2024 - Last Modified: Thu Apr 18 19:53:19 GMT 2024 - 3.4K bytes - Viewed (0) -
istioctl/pkg/analyze/analyze.go
} var ( listAnalyzers bool useKube bool failureThreshold = formatting.MessageThreshold{Level: diag.Error} // messages at least this level will generate an error exit code outputThreshold = formatting.MessageThreshold{Level: diag.Info} // messages at least this level will be included in the output colorize bool msgOutputFormat string meshCfgFile string selectedNamespace string
Go - Registered: Wed May 08 22:53:08 GMT 2024 - Last Modified: Tue Apr 02 08:32:06 GMT 2024 - 17K bytes - Viewed (0) -
internal/arn/arn.go
Partition string Service string Region string ResourceType string ResourceID string } // Allows english letters, numbers, '.', '-', '_' and '/'. Starts with a // letter or digit. At least 1 character long. var validResourceIDRegex = regexp.MustCompile(`[A-Za-z0-9_/\.-]+$`) // NewIAMRoleARN - returns an ARN for a role in MinIO. func NewIAMRoleARN(resourceID, serverRegion string) (ARN, error) {
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Apr 04 08:31:34 GMT 2024 - 3.5K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/internal/impl/DefaultDependencyResolverResult.java
} } addPathElement(cache.selectPathType(pathTypes, filter, path).orElse(PathType.UNRESOLVED), path); } /** * Returns whether the given set of path types contains at least one patch for a module. */ private boolean containsPatches(Set<PathType> types) { for (PathType type : types) { if (type instanceof JavaPathType.Modular) {
Java - Registered: Sun Mar 24 03:35:10 GMT 2024 - Last Modified: Fri Mar 01 17:18:13 GMT 2024 - 14.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
*/ @Beta @ElementTypesAreNonnullByDefault public final class Graphs extends GraphsBridgeMethods { private Graphs() {} // Graph query methods /** * Returns true if {@code graph} has at least one cycle. A cycle is defined as a non-empty subset * of edges in a graph arranged to form a path (a sequence of adjacent outgoing edges) starting * and ending with the same node. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 21.2K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Function.java
* * <p>This interface is now a legacy type. Use {@code java.util.function.Function} (or the * appropriate primitive specialization such as {@code ToIntFunction}) instead whenever possible. * Otherwise, at least reduce <i>explicit</i> dependencies on this type by using lambda expressions * or method references instead of classes, leaving your code easier to migrate in the future. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 24 01:41:50 GMT 2024 - 3.4K bytes - Viewed (0) -
docs/debugging/pprofgoparser/main.go
t = time.Duration(a) * time.Minute save(line) record = true } else { skip = true } } } } return ret, nil } const helpUsage = ` At least one argument is required to run this tool. EXAMPLE: ./pprofgoparser --time 50m --margin 1m /path/to/*-goroutines-before,debug=2.txt ` func main() { flag.Parse() if len(flag.Args()) == 0 {
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Wed Mar 06 11:43:16 GMT 2024 - 3.4K bytes - Viewed (0)