Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 5 of 5 for searchpart (0.1 sec)

  1. 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)
  2. 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)
  3. 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)
  4. 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)
  5. cmd/data-scanner.go

    				for parent != hashPath(f.updateCache.Info.Name) {
    					e := f.updateCache.find(parent.Key())
    					if e == nil || e.Compacted {
    						foundAny = true
    						break
    					}
    					next := f.updateCache.searchParent(parent)
    					if next == nil {
    						foundAny = true
    						break
    					}
    					parent = *next
    				}
    				if !foundAny {
    					// Add non-compacted empty entry.
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Oct 22 21:10:34 UTC 2024
    - 48.4K bytes
    - Viewed (0)
Back to top