- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 61 for border (0.17 sec)
-
cmd/bucket-replication.go
ObjectLockLegalHoldTimestamp = "objectlock-legalhold-timestamp" // ReplicationWorkerMultiplier is suggested worker multiplier if traffic exceeds replication worker capacity ReplicationWorkerMultiplier = 1.5 ) // gets replication config associated to a given bucket name.
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Wed May 01 01:09:56 GMT 2024 - 112.2K bytes - Viewed (1) -
cmd/site-replication.go
ExpiryLCConfig: &configStr, UpdatedAt: time.Now(), }) if err != nil { return errSRBucketMetaError(err) } } } } // Order matters from now on how the information is // synced to remote sites. // Policies should be synced first. { // Replicate IAM policies on local to all peers.
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Wed May 01 01:09:56 GMT 2024 - 184.2K bytes - Viewed (1) -
cmd/object-api-interface.go
// WalkVersionsSortOrder represents the sort order in which versions of an // object should be returned by ObjectLayer.Walk method type WalkVersionsSortOrder uint8 const ( // WalkVersionsSortAsc - Sort in ascending order of ModTime WalkVersionsSortAsc WalkVersionsSortOrder = iota // WalkVersionsSortDesc - Sort in descending order of ModTime WalkVersionsSortDesc )
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri May 03 20:08:20 GMT 2024 - 17K bytes - Viewed (0) -
cmd/metacache-walk.go
pop := dirStack[len(dirStack)-1] select { case <-ctx.Done(): return ctx.Err() case out <- metaCacheEntry{name: pop}: } if opts.Recursive { // Scan folder we found. Should be in correct sort order where we are. err := scanDir(pop) if err != nil && !IsErrIgnored(err, context.Canceled) { internalLogIf(ctx, err) } } dirStack = dirStack[:len(dirStack)-1] }
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Mon Apr 15 08:25:46 GMT 2024 - 12.4K bytes - Viewed (0) -
cmd/xl-storage-format-utils.go
// Trivial collisions are avoided, but this is by no means a strong hash. func hashDeterministicString(m map[string]string) uint64 { // Seed (random) crc := uint64(0xc2b40bbac11a7295) // Xor each value to make order independent for k, v := range m { // Separate key and value with an individual xor with a random number. // Add values of each, so they cannot be trivially collided.
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Apr 11 17:45:28 GMT 2024 - 4.7K bytes - Viewed (0) -
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 for _, idx := range permutes {
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri Apr 26 06:32:14 GMT 2024 - 16K bytes - Viewed (1) -
cmd/erasure-multipart.go
} // Calculate full object size. var objectSize int64 // Calculate consolidated actual size. var objectActualSize int64 // Order online disks in accordance with distribution order. // Order parts metadata in accordance with distribution order. onlineDisks, partsMetadata = shuffleDisksAndPartsMetadataByIndex(onlineDisks, partsMetadata, fi) // Save current erasure metadata for validation.
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Sun Apr 28 17:53:50 GMT 2024 - 43K bytes - Viewed (0) -
internal/config/config.go
kvs.Set(kv.Key, kv.Value) } } targets = append(targets, Target{ SubSystem: inputs[0], KVS: kvs, }) } else { // Use help for sub-system to preserve the order. Add deprecated // keys at the end (in some order). kvsOrder := append([]HelpKV{}, HelpSubSysMap[""]...) for _, v := range HelpDeprecatedSubSysMap { kvsOrder = append(kvsOrder, v) } for _, hkv := range kvsOrder {
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) -
cmd/erasure-metadata-utils_test.go
} // Tests hashing order to be consistent. for i, testCase := range testCases { hashedOrder := hashOrder(testCase.objectName, 16) if !reflect.DeepEqual(testCase.hashedOrder, hashedOrder) { t.Errorf("Test case %d: Expected \"%v\" but failed \"%v\"", i+1, testCase.hashedOrder, hashedOrder) } } // Tests hashing order to fail for when order is '-1'.
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Jan 18 07:03:17 GMT 2024 - 7.4K 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)