- Sort Score
- Result 10 results
- Languages All
Results 1 - 3 of 3 for Didier (0.57 sec)
-
cmd/erasure.go
// Otherwise same set of buckets get scanned across erasure sets always. // at any given point in time. This allows different buckets to be scanned // in different order per erasure set, this wider spread is needed when // there are lots of buckets with different order of objects in them. r := rand.New(rand.NewSource(time.Now().UnixNano())) permutes := r.Perm(len(buckets)) // Add new buckets first
Go - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Fri Apr 26 06:32:14 GMT 2024 - 16K bytes - Viewed (1) -
src/archive/zip/reader.go
if name == "." { return dotFile } dir, elem, _ := split(name) files := r.fileList i := sort.Search(len(files), func(i int) bool { idir, ielem, _ := split(files[i].name) return idir > dir || idir == dir && ielem >= elem }) if i < len(files) { fname := files[i].name if fname == name || len(fname) == len(name)+1 && fname[len(name)] == '/' && fname[:len(name)] == name {
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Fri Oct 13 18:36:46 GMT 2023 - 27.7K bytes - Viewed (0) -
src/bufio/scan.go
// deliver a final empty token (which is different from a nil token). // One could achieve the same behavior with a custom error value but // providing one here is tidier. // See the emptyFinalToken example for a use of this value. var ErrFinalToken = errors.New("final token") // Scan advances the [Scanner] to the next token, which will then be
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Mon Oct 23 09:06:30 GMT 2023 - 14.2K bytes - Viewed (0)