dave/bricker
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Sort indices before writing, should be faster

Browse Source
This commit is contained in:
PhatPhuckDave
2024-08-31 15:41:06 +02:00
parent 5041f02ba0
commit 58d6cbcb3f
1 changed files with 2 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
main.go
View File

@@ -6,6 +6,7 @@ import (
"io" "io"
"log" "log"
"os" "os"
"sort"
"sync" "sync"
"time" "time"
@@ -73,6 +74,7 @@ func main() {
toCorrupt := int64(float32(filesize) * (float32(*percent) / 100)) toCorrupt := int64(float32(filesize) * (float32(*percent) / 100))
indicesToCorrupt := selectRandomIndices(filesize, toCorrupt) indicesToCorrupt := selectRandomIndices(filesize, toCorrupt)
sort.Slice(indicesToCorrupt, func(i, j int) bool { return indicesToCorrupt[i] < indicesToCorrupt[j] })
log.Printf("Corrupting %d bytes in %s", toCorrupt, file) log.Printf("Corrupting %d bytes in %s", toCorrupt, file)
for _, index := range indicesToCorrupt { for _, index := range indicesToCorrupt {