Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 4 of 4 for candidates (0.17 sec)

  1. cmd/metacache-entries.go

    	if len(m) == 0 {
    		return nil, false
    	}
    
    	dirExists := 0
    	if cap(r.candidates) < len(m) {
    		r.candidates = make([][]xlMetaV2ShallowVersion, 0, len(m))
    	}
    	r.candidates = r.candidates[:0]
    	objsAgree := 0
    	objsValid := 0
    	for i := range m {
    		entry := &m[i]
    		// Empty entry
    		if entry.name == "" {
    			continue
    		}
    
    		if entry.isDir() {
    Go
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Fri Apr 19 16:43:43 GMT 2024
    - 23.2K bytes
    - Viewed (0)
  2. internal/config/config.go

    	// Set of env vars for the sub-system to validate.
    	candidates := set.CreateStringSet(subSysEnvVars...)
    
    	// Remove all default target env vars from the candidates set (as they
    	// are valid).
    	for _, param := range validKeys {
    		paramEnvName := getEnvVarName(subSys, Default, param)
    		candidates.Remove(paramEnvName)
    	}
    
    	isSingleTarget := SubSystemsSingleTargets.Contains(subSys)
    Go
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Sat Mar 02 05:11:03 GMT 2024
    - 37.3K bytes
    - Viewed (0)
  3. cmd/erasure-metadata.go

    	}
    
    	// Find the successor mod time in quorum, otherwise leave the
    	// candidate's successor modTime as found
    	succModTimeMap := make(map[time.Time]int)
    	var candidate FileInfo
    	var found bool
    	for i, hash := range metaHashes {
    		if hash == maxHash {
    			if metaArr[i].IsValid() {
    				if !found {
    					candidate = metaArr[i]
    					found = true
    				}
    				succModTimeMap[metaArr[i].SuccessorModTime]++
    Go
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Sun Apr 28 17:53:50 GMT 2024
    - 19.2K bytes
    - Viewed (1)
  4. cmd/data-usage-cache.go

    	})
    	for remove > 0 && len(leaves) > 0 {
    		// Remove top entry.
    		e := leaves[0]
    		candidate := e.path
    		if candidate == path && !compactSelf {
    			// We should be the biggest,
    			// if we cannot compact ourself, we are done.
    			break
    		}
    		removing := d.totalChildrenRec(candidate.Key())
    		flat := d.sizeRecursive(candidate.Key())
    		if flat == nil {
    			leaves = leaves[1:]
    			continue
    		}
    Go
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Mon Apr 22 17:49:30 GMT 2024
    - 41.4K bytes
    - Viewed (1)
Back to top