vitalif
/
reedsolomon-go
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

bench: Fix reconstruct benchmarks (#133) 

Always corrupt at least one shard and don't shuffle shards.
master
Klaus Post 2020-05-06 15:42:49 +02:00 committed by GitHub
parent 151d8c7a05
commit 696c4018f8
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 7 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
reedsolomon_test.go
View File

@ -836,9 +836,10 @@ func BenchmarkVerify10x4x16M(b *testing.B) {
}
func corruptRandom(shards [][]byte, dataShards, parityShards int) {
shardsToCorrupt := rand.Intn(parityShards)
for i := 1; i <= shardsToCorrupt; i++ {
shards[rand.Intn(dataShards+parityShards)] = shards[rand.Intn(dataShards+parityShards)][:0]
shardsToCorrupt := rand.Intn(parityShards) + 1
for i := 0; i < shardsToCorrupt; i++ {
n := rand.Intn(dataShards + parityShards)
shards[n] = shards[n][:0]
}
}
@ -909,9 +910,10 @@ func BenchmarkReconstruct10x4x16M(b *testing.B) {
}
func corruptRandomData(shards [][]byte, dataShards, parityShards int) {
shardsToCorrupt := rand.Intn(parityShards)
shardsToCorrupt := rand.Intn(parityShards) + 1
for i := 1; i <= shardsToCorrupt; i++ {
shards[rand.Intn(dataShards)] = shards[rand.Intn(dataShards)][:0]
n := rand.Intn(dataShards)
shards[n] = shards[n][:0]
}
}