- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 51 for Cordier (0.2 sec)
-
internal/bucket/replication/replication_test.go
} for i := range got { if got[i].Destination.ARN != tc.ExpectedRules[i].Destination.ARN || got[i].Priority != tc.ExpectedRules[i].Priority { t.Fatalf("Expected order of filtered rules to be identical: `%v`, got: `%v`", tc.ExpectedRules, got) } } }
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Mar 28 17:44:56 GMT 2024 - 32.5K bytes - Viewed (0) -
src/archive/tar/common.go
// Since the Reader liberally reads some non-compliant files, // it is possible for this to be FormatUnknown. // // If the format is unspecified when Writer.WriteHeader is called, // then it uses the first format (in the order of USTAR, PAX, GNU) // capable of encoding this Header (see Format). Format Format } // sparseEntry represents a Length-sized fragment at Offset in the file. type sparseEntry struct{ Offset, Length int64 }
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Fri Mar 15 16:01:50 GMT 2024 - 24.7K bytes - Viewed (2) -
cmd/xl-storage-format-v2_test.go
reqVersions: 0, want: []xlMetaV2ShallowVersion{vDelMarker, vObj}, }, } for _, test := range testCases { t.Run(test.name, func(t *testing.T) { // Run multiple times, shuffling the input order. for i := int64(0); i < 50; i++ { t.Run(fmt.Sprint(i), func(t *testing.T) { rng := rand.New(rand.NewSource(i)) rng.Shuffle(len(test.input), func(i, j int) {
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri Mar 08 17:50:48 GMT 2024 - 36.4K bytes - Viewed (0) -
internal/logger/logger.go
errorFmtFunc = f } // uniq swaps away duplicate elements in data, returning the size of the // unique set. data is expected to be pre-sorted, and the resulting set in // the range [0:size] will remain in sorted order. Uniq, following a // sort.Sort call, can be used to prepare arbitrary inputs for use as sets. func uniq(data sort.Interface) (size int) { p, l := 0, data.Len() if l <= 1 { return l }
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Sat May 04 00:17:57 GMT 2024 - 12.4K bytes - Viewed (0) -
cmd/background-newdisks-heal-ops.go
// Delete... h.QueuedBuckets = append(h.QueuedBuckets[:i], h.QueuedBuckets[i+1:]...) } } } // setQueuedBuckets will add buckets, but exclude any that is already in h.HealedBuckets. // Order is preserved. func (h *healingTracker) setQueuedBuckets(buckets []BucketInfo) { h.mu.Lock() defer h.mu.Unlock() s := set.CreateStringSet(h.HealedBuckets...) h.QueuedBuckets = make([]string, 0, len(buckets))
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Apr 04 12:04:40 GMT 2024 - 14.7K bytes - Viewed (0) -
cmd/xl-storage-format_test.go
checksum, err := hex.DecodeString(hash) if err != nil { panic(err) } m.Erasure.Checksums[partNumber-1] = ChecksumInfo{partNumber, algorithm, checksum} } // AddTestObjectPart - add a new object part in order. func (m *xlMetaV1Object) AddTestObjectPart(partNumber int, partSize int64) { partInfo := ObjectPartInfo{ Number: partNumber, Size: partSize, } // Proceed to include new part info.
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Feb 22 06:26:06 GMT 2024 - 17.6K bytes - Viewed (0) -
cmd/erasure-metadata-utils.go
continue } diskCount++ } return diskCount } // hashOrder - hashes input key to return consistent // hashed integer slice. Returned integer order is salted // with an input key. This results in consistent order. // NOTE: collisions are fine, we are not looking for uniqueness // in the slices returned. func hashOrder(key string, cardinality int) []int { if cardinality <= 0 {
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Tue Apr 23 17:15:52 GMT 2024 - 11.3K bytes - Viewed (0) -
cmd/metrics-v3-types.go
for metricName, mv := range m.values { desc := m.descriptors[metricName] promDesc := desc.toPromDesc(namePrefix, extraLabels) for _, v := range mv { // labelValues is in the same order as the variable labels in the // descriptor. labelValues := make([]string, 0, len(v.Labels)) for _, k := range desc.VariableLabels { labelValues = append(labelValues, v.Labels[k]) }
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Tue Apr 30 15:05:22 GMT 2024 - 14.7K bytes - Viewed (0) -
cmd/postpolicyform.go
d := jstream.NewDecoder(r, 0).ObjectAsKVS() sset := set.NewStringSet() for mv := range d.Stream() { var kvs jstream.KVS if mv.ValueType == jstream.Object { // This is a JSON object type (that preserves key order) kvs = mv.Value.(jstream.KVS) for _, kv := range kvs { if sset.Contains(kv.Key) { // Reject duplicate conditions or expiration.
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri Apr 19 16:45:54 GMT 2024 - 12.2K bytes - Viewed (0) -
cmd/iam-object-store.go
bootstrapTraceMsg("loading all IAM items") listedConfigItems, err := iamOS.listAllIAMConfigItems(ctx) if err != nil { return fmt.Errorf("unable to list IAM data: %w", err) } // Loads things in the same order as `LoadIAMCache()` bootstrapTraceMsg("loading policy documents") policiesList := listedConfigItems[policiesListKey] for _, item := range policiesList { policyName := path.Dir(item)
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri Apr 05 21:26:41 GMT 2024 - 19.9K bytes - Viewed (0)