- Sort Score
- Result 10 results
- Languages All
Results 1 - 6 of 6 for asYears (0.11 sec)
-
cmd/admin-handlers-users_test.go
accessKey, secretKey := mustGenerateCredentials(c) err := s.adm.SetUser(ctx, accessKey, secretKey, madmin.AccountEnabled) if err != nil { c.Fatalf("Unable to set user: %v", err) } // 2. Check new user appears in listing usersMap, err := s.adm.ListUsers(ctx) if err != nil { c.Fatalf("error listing: %v", err) } v, ok := usersMap[accessKey] if !ok { c.Fatalf("user not listed: %s", accessKey) }
Registered: Sun Oct 27 19:28:09 UTC 2024 - Last Modified: Sun Sep 22 00:33:43 UTC 2024 - 47.3K bytes - Viewed (0) -
cmd/erasure-healing-common_test.go
for index, err := range test.errs { if err != nil { continue } // Remove a part from a disk // which has a valid xl.meta, // and check if that disk // appears in outDatedDisks. tamperedIndex = index dErr := erasureDisks[index].Delete(context.Background(), bucket, pathJoin(object, fi.DataDir, "part.1"), DeleteOptions{ Recursive: false, Immediate: false,
Registered: Sun Oct 27 19:28:09 UTC 2024 - Last Modified: Tue Oct 01 15:19:10 UTC 2024 - 23.1K bytes - Viewed (0) -
tensorflow/c/c_api_function.cc
} else { auto& indices = iter->second; if (std::find(indices.begin(), indices.end(), idx) != indices.end()) { return InvalidArgument("TF_Output ", node->name(), ":", idx, " appears more than once in the input list"); } indices.push_back(idx); } } return absl::OkStatus(); } // Converts `noutputs` and `outputs` into `outputs_tensors` and does various
Registered: Tue Oct 29 12:39:09 UTC 2024 - Last Modified: Sat Oct 12 16:27:48 UTC 2024 - 13.7K bytes - Viewed (0) -
cmd/data-usage-cache.go
flat.Compacted = true d.deleteRecursive(path) d.replaceHashed(path, nil, *flat) return } total := d.totalChildrenRec(path.Key()) if total < limit { return } // Appears to be printed with _MINIO_SERVER_DEBUG=off // console.Debugf(" %d children found, compacting %v\n", total, path) leaves := make([]struct { objects uint64 path dataUsageHash }, total)
Registered: Sun Oct 27 19:28:09 UTC 2024 - Last Modified: Tue Oct 22 15:30:50 UTC 2024 - 34.7K bytes - Viewed (0) -
src/archive/zip/reader.go
// building. They are used to mark duplicate entries. files := make(map[string]int) knownDirs := make(map[string]int) // dirs[name] is true if name is known to be a directory, // because it appears as a prefix in a path. dirs := make(map[string]bool) for _, file := range r.File { isDir := len(file.Name) > 0 && file.Name[len(file.Name)-1] == '/' name := toValidName(file.Name) if name == "" {
Registered: Tue Oct 29 11:13:09 UTC 2024 - Last Modified: Sat Aug 03 01:05:29 UTC 2024 - 28.1K bytes - Viewed (0) -
src/bytes/bytes.go
} return i + j } } return -1 } // Cut slices s around the first instance of sep, // returning the text before and after sep. // The found result reports whether sep appears in s. // If sep does not appear in s, cut returns s, nil, false. // // Cut returns slices of the original slice s, not copies. func Cut(s, sep []byte) (before, after []byte, found bool) {
Registered: Tue Oct 29 11:13:09 UTC 2024 - Last Modified: Tue Sep 03 20:55:15 UTC 2024 - 35.6K bytes - Viewed (0)