- Sort Score
- Result 10 results
- Languages All
Results 171 - 180 of 1,713 for Take (0.02 sec)
-
docs/en/docs/tutorial/bigger-applications.md
So, behind the scenes, it will actually work as if everything was the same single app. /// /// check You don't have to worry about performance when including routers. This will take microseconds and will only happen at startup. So it won't affect performance. ⚡ /// ### Include an `APIRouter` with a custom `prefix`, `tags`, `responses`, and `dependencies`
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 06 20:36:54 UTC 2024 - 18.4K bytes - Viewed (0) -
docs/en/docs/tutorial/first-steps.md
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sat Oct 26 11:48:16 UTC 2024 - 11.8K bytes - Viewed (0) -
cmd/batch-rotate.go
} obj, err := api.GetObjectInfo(ctx, r.Bucket, objInfo.Name, opts) if err != nil { return err } oi := obj.Clone() var ( newKeyID string newKeyContext kms.Context ) encMetadata := make(map[string]string) for k, v := range oi.UserDefined { if stringsHasPrefixFold(k, ReservedMetadataPrefixLower) { encMetadata[k] = v } } if (sseKMS || sseS3) && r.Encryption.Type == ssekms {
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Wed Sep 18 17:59:03 UTC 2024 - 14.7K bytes - Viewed (0) -
common-protos/k8s.io/api/admissionregistration/v1alpha1/generated.proto
// // Required. optional string expression = 2; } // MatchResources decides whether to run the admission control policy on an object based // on whether it meets the match criteria. // The exclude rules take precedence over include rules (if a resource matches both, it is excluded) // +structType=atomic message MatchResources { // NamespaceSelector decides whether to run the admission control policy on an object based
Registered: Wed Nov 06 22:53:10 UTC 2024 - Last Modified: Mon Mar 11 18:43:24 UTC 2024 - 25.7K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/HashCode.java
* probably not what you want to use. */ @Override public final int hashCode() { // If we have at least 4 bytes (32 bits), just take the first 4 bytes. Since this is // already a (presumably) high-quality hash code, any four bytes of it will do. if (bits() >= 32) { return asInt(); } // If we have less than 4 bytes, use them all.
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 30 19:54:59 UTC 2024 - 12.6K bytes - Viewed (0) -
common-protos/k8s.io/api/admissionregistration/v1beta1/generated.proto
// also be an IP address. // // Please note that using `localhost` or `127.0.0.1` as a `host` is // risky unless you take great care to run this webhook on all hosts // which run an apiserver which might need to make calls to this // webhook. Such installs are likely to be non-portable, i.e., not easy // to turn up in a new cluster. //
Registered: Wed Nov 06 22:53:10 UTC 2024 - Last Modified: Mon Mar 11 18:43:24 UTC 2024 - 22.6K bytes - Viewed (0) -
common/scripts/kind_provisioner.sh
# # The original version of this file is located in the https://github.com/istio/common-files repo. # If you're looking at this file in a different repo and want to make a change, please go to the # common-files repo, make the change there and check it in. Then come back to this repo and run # "make update-common". # Copyright Istio Authors # # Licensed under the Apache License, Version 2.0 (the "License");
Registered: Wed Nov 06 22:53:10 UTC 2024 - Last Modified: Wed Aug 21 04:47:23 UTC 2024 - 17.2K bytes - Viewed (0) -
guava/src/com/google/common/hash/HashCode.java
* probably not what you want to use. */ @Override public final int hashCode() { // If we have at least 4 bytes (32 bits), just take the first 4 bytes. Since this is // already a (presumably) high-quality hash code, any four bytes of it will do. if (bits() >= 32) { return asInt(); } // If we have less than 4 bytes, use them all.
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 30 19:54:59 UTC 2024 - 12.6K bytes - Viewed (0) -
common-protos/k8s.io/api/flowcontrol/v1beta3/generated.proto
// `matchingPrecedence` is used to choose among the FlowSchemas that match a given request. The chosen // FlowSchema is among those with the numerically lowest (which we take to be logically highest) // MatchingPrecedence. Each MatchingPrecedence value must be ranged in [1,10000]. // Note that if the precedence is not specified, it will be set to 1000 as default. // +optional
Registered: Wed Nov 06 22:53:10 UTC 2024 - Last Modified: Mon Mar 11 18:43:24 UTC 2024 - 19.5K bytes - Viewed (0) -
docs/en/docs/advanced/settings.md
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 06 20:36:54 UTC 2024 - 12.9K bytes - Viewed (0)