- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 579 for shard (0.21 sec)
-
android/guava-tests/test/com/google/common/hash/HashingTest.java
} for (int shard = 2; shard <= MAX_SHARDS; shard++) { // Rough: don't exceed 1.2x the expected number of remaps by more than 20 assertTrue(map.get(shard) <= 1.2 * ITERS / shard + 20); } } private void countRemaps(long h, AtomicLongMap<Integer> map) { int last = 0; for (int shards = 2; shards <= MAX_SHARDS; shards++) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 26.5K bytes - Viewed (0) -
internal/config/storageclass/storage-class.go
StandardEnv = "MINIO_STORAGE_CLASS_STANDARD" // Optimize storage class environment variable OptimizeEnv = "MINIO_STORAGE_CLASS_OPTIMIZE" // Inline block indicates the size of the shard // that is considered for inlining, remember this // shard value is the value per drive shard it // will vary based on the parity that is configured // for the STANDARD storage_class. // inlining means data and metadata are written
Go - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Thu Apr 04 12:04:40 GMT 2024 - 11.8K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/HashingTest.java
} for (int shard = 2; shard <= MAX_SHARDS; shard++) { // Rough: don't exceed 1.2x the expected number of remaps by more than 20 assertTrue(map.get(shard) <= 1.2 * ITERS / shard + 20); } } private void countRemaps(long h, AtomicLongMap<Integer> map) { int last = 0; for (int shards = 2; shards <= MAX_SHARDS; shards++) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 26.5K bytes - Viewed (0) -
cmd/erasure_test.go
if test.reconstructParity { for j := range decoded { if decoded[j] == nil { t.Errorf("Test %d: failed to reconstruct shard %d", i, j) } } } else { for j := range decoded[:test.dataBlocks] { if decoded[j] == nil { t.Errorf("Test %d: failed to reconstruct data shard %d", i, j) } } } decodedData := new(bytes.Buffer)
Go - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Mon Jul 25 19:37:26 GMT 2022 - 4.8K bytes - Viewed (0) -
cmd/bitrot-whole.go
"hash" "io" ) // Implementation to calculate bitrot for the whole file. type wholeBitrotWriter struct { disk StorageAPI volume string filePath string shardSize int64 // This is the shard size of the erasure logic hash.Hash // For bitrot hash } func (b *wholeBitrotWriter) Write(p []byte) (int, error) { err := b.disk.AppendFile(context.TODO(), b.volume, b.filePath, p) if err != nil {
Go - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Wed Jan 31 02:11:45 GMT 2024 - 2.7K bytes - Viewed (0) -
docs/erasure/README.md
code is a mathematical algorithm to reconstruct missing or corrupted data. MinIO uses Reed-Solomon code to shard objects into variable data and parity blocks. For example, in a 12 drive setup, an object can be sharded to a variable number of data and parity blocks across all the drives - ranging from six data and six parity blocks to ten data and two parity blocks. By default, MinIO shards the objects across N/2 data and N/2 parity drives. Though, you can use [storage classes](https://github...
Plain Text - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Thu Sep 29 04:28:45 GMT 2022 - 4.1K bytes - Viewed (0) -
cmd/erasure-decode.go
// Reading first time on this disk, hence the buffer needs to be allocated. // Subsequent reads will reuse this buffer. p.buf[bufIdx] = make([]byte, p.shardSize) } // For the last shard, the shardsize might be less than previous shard sizes. // Hence the following statement ensures that the buffer size is reset to the right size. p.buf[bufIdx] = p.buf[bufIdx][:p.shardSize] n, err := rr.ReadAt(p.buf[bufIdx], p.offset)
Go - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Fri Apr 19 16:44:59 GMT 2024 - 9.4K bytes - Viewed (0) -
ci/official/containers/linux_arm64/devel.usertools/squash_testlogs.py
r._elem.remove(testsuite._elem) if len(r) > 0: # pylint: disable=g-explicit-length-test result += r # Insert the number of failures for each test to help identify flakes # need to clarify for shard for p in result._elem.xpath(".//error | .//failure"): key = re.sub(r"0x\w+", "", p.getparent().get("name", "")) + p.text p.text = runfiles_matcher.sub("[testroot]/", p.text)
Python - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Mon Sep 18 19:00:37 GMT 2023 - 4.8K bytes - Viewed (0) -
docs/debugging/xl-meta/main.go
mapped = make([]byte, size) filled = make([]byte, size) } data = ei.V2Obj.EcM parity = ei.V2Obj.EcN if shards == 0 { shards = data + parity } idx = ei.V2Obj.EcIndex - 1 fmt.Println("Read shard", ei.V2Obj.EcIndex, "Data shards", data, "Parity", parity, fmt.Sprintf("(%s)", file)) if ei.V2Obj.Size != size { return fmt.Errorf("size mismatch. Meta size: %d", ei.V2Obj.Size) }
Go - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Wed Apr 24 17:56:22 GMT 2024 - 20.2K bytes - Viewed (1) -
cmd/erasure-coding.go
fmt.Fprintf(os.Stderr, "%v: error on self-test [d:%d,p:%d]: want %#v, got %#v\n", algo, conf[0], conf[1], a, b) ok = false continue } // Delete first shard and reconstruct... first := encoded[0] encoded[0] = nil failOnErr(e.DecodeDataBlocks(encoded)) if a, b := first, encoded[0]; !bytes.Equal(a, b) {
Go - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Wed Jan 31 02:11:45 GMT 2024 - 8.6K bytes - Viewed (0)