- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 37 for Asgard (0.21 sec)
-
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) -
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) -
guava-tests/test/com/google/common/hash/AbstractStreamingHasherTest.java
// yes, that's a lot of sinks! sinks.add(new Sink(chunkSize, bufferSize)); // For convenience, testing only with big endianness, to match DataOutputStream. // I regard highly unlikely that both the little endianness tests above and this one // passes, and there is still a little endianness bug lurking around. } } Control control = new Control();
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 8.5K bytes - Viewed (0) -
docs/erasure/README.md
## What is Erasure Code?
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) -
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) -
android/guava-tests/test/com/google/common/hash/AbstractStreamingHasherTest.java
// yes, that's a lot of sinks! sinks.add(new Sink(chunkSize, bufferSize)); // For convenience, testing only with big endianness, to match DataOutputStream. // I regard highly unlikely that both the little endianness tests above and this one // passes, and there is still a little endianness bug lurking around. } } Control control = new Control();
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 8.5K bytes - Viewed (0) -
docs/LICENSE
c. Copyright and Similar Rights means copyright and/or similar rights closely related to copyright including, without limitation, performance, broadcast, sound recording, and Sui Generis Database Rights, without regard to how the rights are labeled or categorized. For purposes of this Public License, the rights specified in Section 2(b)(1)-(2) are not Copyright and Similar Rights.
Plain Text - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Mon May 10 16:50:06 GMT 2021 - 18.2K bytes - Viewed (0) -
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) -
docs/debugging/xl-meta/main.go
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) -
docs/distributed/DESIGN.md
- Erasure coding used by MinIO is [Reed-Solomon](https://github.com/klauspost/reedsolomon) erasure coding scheme, which has a total shard maximum of 256 i.e 128 data and 128 parity. MinIO design goes beyond this limitation by doing some practical architecture choices.
Plain Text - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Tue Aug 15 23:04:20 GMT 2023 - 8K bytes - Viewed (0)