- Sort Score
- Result 10 results
- Languages All
Results 1 - 5 of 5 for Ward (0.13 sec)
-
cmd/naughty-disk_test.go
"io" "sync" "time" "github.com/minio/madmin-go/v3" ) // naughtyDisk wraps a POSIX disk and returns programmed errors // specified by the developer. The purpose is to simulate errors // that are hard to simulate in practice like DiskNotFound. // Programmed errors are stored in errors field. type naughtyDisk struct { // The real disk disk StorageAPI // Programmed errors: API call number => error to return
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Tue Apr 23 17:15:52 GMT 2024 - 9.3K bytes - Viewed (0) -
.gitignore
docs/debugging/hash-set/hash-set docs/debugging/healing-bin/healing-bin docs/debugging/inspect/inspect docs/debugging/pprofgoparser/pprofgoparser docs/debugging/reorder-disks/reorder-disks docs/debugging/populate-hard-links/populate-hardlinks
Plain Text - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri Dec 29 23:52:41 GMT 2023 - 707 bytes - Viewed (0) -
cmd/bitrot.go
} } return nil } // bitrotSelfTest performs a self-test to ensure that bitrot // algorithms compute correct checksums. If any algorithm // produces an incorrect checksum it fails with a hard error. // // bitrotSelfTest tries to catch any issue in the bitrot implementation // early instead of silently corrupting data. func bitrotSelfTest() { checksums := map[BitrotAlgorithm]string{
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Tue Jan 30 20:43:25 GMT 2024 - 7.6K bytes - Viewed (0) -
docs/kms/IAM.md
There used to be two different mechanisms - one for regular S3 objects and one for IAM data. - Reduced server startup time. For IAM encryption with the root credentials, MinIO had to use a memory-hard function (Argon2) that (on purpose) consumes a lot of memory and CPU. The new KMS-based approach can use a key derivation function that is orders of magnitudes cheaper w.r.t. memory and CPU.
Plain Text - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Jan 18 07:03:17 GMT 2024 - 5.3K bytes - Viewed (0) -
cmd/erasure-coding.go
} return tillOffset } // erasureSelfTest performs a self-test to ensure that erasure // algorithms compute expected erasure codes. If any algorithm // produces an incorrect value it fails with a hard error. // // erasureSelfTest tries to catch any issue in the erasure implementation // early instead of silently corrupting data. func erasureSelfTest() { // Approx runtime ~1ms var testConfigs [][2]uint8
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Wed Jan 31 02:11:45 GMT 2024 - 8.6K bytes - Viewed (0)