- Sort Score
- Result 10 results
- Languages All
Results 1 - 5 of 5 for searchpart (0.06 sec)
-
common-protos/k8s.io/api/networking/v1beta1/generated.proto
// will be forwarded to. optional IngressBackend backend = 2; } // HTTPIngressRuleValue is a list of http selectors pointing to backends. // In the example: http://<host>/<path>?<searchpart> -> backend where // where parts of the url correspond to RFC 3986, this resource will be used // to match against everything after the last '/' and before the first '?' // or '#'. message HTTPIngressRuleValue {
Registered: Wed Nov 06 22:53:10 UTC 2024 - Last Modified: Mon Mar 11 18:43:24 UTC 2024 - 14.9K bytes - Viewed (0) -
common-protos/k8s.io/api/networking/v1/generated.proto
// will be forwarded to. optional IngressBackend backend = 2; } // HTTPIngressRuleValue is a list of http selectors pointing to backends. // In the example: http://<host>/<path>?<searchpart> -> backend where // where parts of the url correspond to RFC 3986, this resource will be used // to match against everything after the last '/' and before the first '?' // or '#'. message HTTPIngressRuleValue {
Registered: Wed Nov 06 22:53:10 UTC 2024 - Last Modified: Mon Mar 11 18:43:24 UTC 2024 - 25.2K bytes - Viewed (0) -
common-protos/k8s.io/api/extensions/v1beta1/generated.proto
// will be forwarded to. optional IngressBackend backend = 2; } // HTTPIngressRuleValue is a list of http selectors pointing to backends. // In the example: http://<host>/<path>?<searchpart> -> backend where // where parts of the url correspond to RFC 3986, this resource will be used // to match against everything after the last '/' and before the first '?' // or '#'. message HTTPIngressRuleValue {
Registered: Wed Nov 06 22:53:10 UTC 2024 - Last Modified: Mon Mar 11 18:43:24 UTC 2024 - 45.6K bytes - Viewed (0) -
cmd/data-usage-cache.go
res := make(dataUsageHashMap, len(ch)) for k := range ch { res[k] = struct{}{} } return res } // searchParent will search for the parent of h. // This is an O(N*N) operation if there is no parent or it cannot be guessed. func (d *dataUsageCache) searchParent(h dataUsageHash) *dataUsageHash { want := h.Key() if idx := strings.LastIndexByte(want, '/'); idx >= 0 { if v := d.find(want[:idx]); v != nil {
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Tue Oct 22 15:30:50 UTC 2024 - 34.7K bytes - Viewed (0) -
cmd/data-scanner.go
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Tue Oct 22 21:10:34 UTC 2024 - 48.4K bytes - Viewed (0)