Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 91 - 100 of 1,451 for orange (0.04 seconds)

  1. internal/grid/manager.go

    func (m *Manager) Targets() []string {
    	var res []string
    	for k := range m.targets {
    		res = append(res, k)
    	}
    	return res
    }
    
    // debugMsg should *only* be used by tests.
    //
    //lint:ignore U1000 This is used by tests.
    func (m *Manager) debugMsg(d debugMsg, args ...any) {
    	for _, c := range m.targets {
    		c.debugMsg(d, args...)
    	}
    }
    
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Tue Nov 12 20:41:41 GMT 2024
    - 10.8K bytes
    - Click Count (0)
  2. guava/src/com/google/common/collect/TreeMultiset.java

      TreeMultiset(Reference<AvlNode<E>> rootReference, GeneralRange<E> range, AvlNode<E> endLink) {
        super(range.comparator());
        this.rootReference = rootReference;
        this.range = range;
        this.header = endLink;
      }
    
      TreeMultiset(Comparator<? super E> comparator) {
        super(comparator);
        this.range = GeneralRange.all(comparator);
        this.header = new AvlNode<>();
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Tue Dec 09 15:58:48 GMT 2025
    - 34.3K bytes
    - Click Count (0)
  3. android/guava/src/com/google/common/hash/Hashing.java

       *
       * <p><b>Warning:</b> a new random seed for these functions is chosen each time the {@code
       * Hashing} class is loaded. <b>Do not use this method</b> if hash codes may escape the current
       * process in any way, for example being sent over RPC, or saved to disk. For a general-purpose,
       * non-cryptographic hash function that will never change behavior, we suggest {@link
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Jul 17 15:26:41 GMT 2025
    - 29.8K bytes
    - Click Count (0)
  4. cmd/data-usage-cache.go

    		Tiers: make(map[string]tierStats),
    	}
    }
    
    func (ats *allTierStats) addSizes(tiers map[string]tierStats) {
    	for tier, st := range tiers {
    		ats.Tiers[tier] = ats.Tiers[tier].add(st)
    	}
    }
    
    func (ats *allTierStats) merge(other *allTierStats) {
    	for tier, st := range other.Tiers {
    		ats.Tiers[tier] = ats.Tiers[tier].add(st)
    	}
    }
    
    func (ats *allTierStats) clone() *allTierStats {
    	if ats == nil {
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 34.7K bytes
    - Click Count (0)
  5. helm-releases/minio-3.6.4.tgz

    {{- if .Values.consoleIngress.ingressClassName }} ingressClassName: {{ .Values.consoleIngress.ingressClassName }} {{- end }} {{- if .Values.consoleIngress.tls }} tls: {{- range .Values.consoleIngress.tls }} - hosts: {{- range .hosts }} - {{ . | quote }} {{- end }} secretName: {{ .secretName }} {{- end }} {{- end }} rules: {{- range .Values.consoleIngress.hosts }} - http: paths: - path: {{ $ingressPath }} {{- if semverCompare ">=1.19-0" $.Capabilities.KubeVersion.GitVersion }} pathType: Prefix backend:...
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Tue Apr 12 01:30:28 GMT 2022
    - 17.9K bytes
    - Click Count (0)
  6. android/guava/src/com/google/common/collect/Maps.java

        }
        if (range.hasLowerBound() && range.hasUpperBound()) {
          return map.subMap(
              range.lowerEndpoint(),
              range.lowerBoundType() == BoundType.CLOSED,
              range.upperEndpoint(),
              range.upperBoundType() == BoundType.CLOSED);
        } else if (range.hasLowerBound()) {
          return map.tailMap(range.lowerEndpoint(), range.lowerBoundType() == BoundType.CLOSED);
        } else if (range.hasUpperBound()) {
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Tue Sep 23 17:50:58 GMT 2025
    - 157.6K bytes
    - Click Count (0)
  7. guava/src/com/google/common/collect/Maps.java

        }
        if (range.hasLowerBound() && range.hasUpperBound()) {
          return map.subMap(
              range.lowerEndpoint(),
              range.lowerBoundType() == BoundType.CLOSED,
              range.upperEndpoint(),
              range.upperBoundType() == BoundType.CLOSED);
        } else if (range.hasLowerBound()) {
          return map.tailMap(range.lowerEndpoint(), range.lowerBoundType() == BoundType.CLOSED);
        } else if (range.hasUpperBound()) {
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Nov 17 22:50:48 GMT 2025
    - 163.5K bytes
    - Click Count (0)
  8. cmd/erasure-server-pool.go

    func (z *erasureServerPools) GetDisksID(ids ...string) []StorageAPI {
    	idMap := make(map[string]struct{}, len(ids))
    	for _, id := range ids {
    		idMap[id] = struct{}{}
    	}
    	res := make([]StorageAPI, 0, len(idMap))
    	for _, s := range z.serverPools {
    		for _, set := range s.sets {
    			for _, disk := range set.getDisks() {
    				if disk == OfflineDisk {
    					continue
    				}
    				if id, _ := disk.GetDiskID(); id != "" {
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 89.2K bytes
    - Click Count (0)
  9. cmd/storage-rest-client.go

    	for _, version := range versions {
    		version.EncodeMsg(encoder)
    	}
    	storageLogIf(ctx, encoder.Flush())
    
    	errs = make([]error, len(versions))
    
    	respBody, err := client.call(ctx, storageRESTMethodDeleteVersions, values, &buffer, -1)
    	defer xhttp.DrainBody(respBody)
    	if err != nil {
    		if contextCanceled(ctx) {
    			err = ctx.Err()
    		}
    		for i := range errs {
    			errs[i] = err
    		}
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 08 02:38:41 GMT 2025
    - 30.4K bytes
    - Click Count (0)
  10. docs/debugging/xl-meta/main.go

    						}
    
    						splitDataShards := make([]byte, len(splitFilled[0]))
    						for _, sh := range splitFilled {
    							for i, v := range sh {
    								splitDataShards[i] += v
    							}
    						}
    						var hist [256]int
    						for _, v := range splitDataShards {
    							hist[v]++
    						}
    
    						for _, v := range hist[m.data-hasParity : m.shards] {
    							if attempt > 0 {
    								break
    							}
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 40.4K bytes
    - Click Count (0)
Back to Top