- Sort Score
- Result 10 results
- Languages All
Results 1 - 8 of 8 for ReedSolomon (0.27 sec)
-
cmd/erasure-coding.go
if dataBlocks <= 0 || parityBlocks < 0 { return e, reedsolomon.ErrInvShardNum } if dataBlocks+parityBlocks > 256 { return e, reedsolomon.ErrMaxShardNum } e = Erasure{ dataBlocks: dataBlocks, parityBlocks: parityBlocks, blockSize: blockSize, } // Encoder when needed. var enc reedsolomon.Encoder var once sync.Once e.encoder = func() reedsolomon.Encoder { once.Do(func() {
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Wed Jan 31 02:11:45 UTC 2024 - 8.6K bytes - Viewed (0) -
cmd/erasure-utils.go
if offset < 0 || length < 0 { return 0, errUnexpected } // Do we have enough blocks? if len(enBlocks) < dataBlocks { return 0, reedsolomon.ErrTooFewShards } // Do we have enough data? if int64(getDataBlockLen(enBlocks, dataBlocks)) < length { return 0, reedsolomon.ErrShortData } // Counter to decrement total left to write. write := length // Counter to increment total written.
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Wed Jan 31 02:11:45 UTC 2024 - 3.1K bytes - Viewed (0) -
internal/bpool/bpool.go
return nil } select { case b = <-bp.c: // reuse existing buffer default: // create new aligned buffer if bp.wcap > 0 { b = reedsolomon.AllocAligned(1, bp.wcap)[0][:bp.w] } else { b = reedsolomon.AllocAligned(1, bp.w)[0] } } return } // Put returns the given Buffer to the BytePool. func (bp *BytePoolCap) Put(b []byte) { if bp == nil { return } select { case bp.c <- b:
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri Apr 19 16:44:59 UTC 2024 - 2.6K bytes - Viewed (0) -
cmd/storage-datatypes_test.go
var buf bytes.Buffer msgp.Encode(&buf, &v)
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Mon Sep 19 18:05:16 UTC 2022 - 9.4K bytes - Viewed (0) -
cmd/xl-storage-format-v2_string.go
} func _() { // An "invalid array index" compiler error signifies that the constant values have changed. // Re-run the stringer command to generate them again. var x [1]struct{} _ = x[invalidErasureAlgo-0] _ = x[ReedSolomon-1] _ = x[lastErasureAlgo-2] } const _ErasureAlgo_name = "invalidErasureAlgoReedSolomonlastErasureAlgo" var _ErasureAlgo_index = [...]uint8{0, 18, 29, 44} func (i ErasureAlgo) String() string {
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Thu Dec 02 19:29:16 UTC 2021 - 1.4K bytes - Viewed (0) -
cmd/xl-storage-free-version_test.go
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Sat Mar 02 05:11:03 UTC 2024 - 7.8K bytes - Viewed (0) -
cmd/xl-storage-format-utils_test.go
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri Jun 07 22:18:44 UTC 2024 - 7.1K bytes - Viewed (0) -
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.
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Tue Aug 15 23:04:20 UTC 2023 - 8K bytes - Viewed (0)