- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 10 for Ward (0.21 sec)
-
docs/bucket/quota/README.md
Buckets can be configured to have `Hard` quota - it disallows writes to the bucket after configured quota limit is reached. ## Prerequisites - Install MinIO - [MinIO Quickstart Guide](https://min.io/docs/minio/linux/index.html#procedure). - [Use `mc` with MinIO Server](https://min.io/docs/minio/linux/reference/minio-mc.html#quickstart) ## Set bucket quota configuration
Plain Text - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Tue Oct 25 00:44:15 GMT 2022 - 1.1K bytes - Viewed (0) -
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) -
docs/erasure/README.md
Bit Rot, also known as data rot or silent data corruption is a data loss issue faced by disk drives today. Data on the drive may silently get corrupted without signaling an error has occurred, making bit rot more dangerous than a permanent hard drive failure. MinIO's erasure coded backend uses high speed [HighwayHash](https://github.com/minio/highwayhash) checksums to protect against Bit Rot. ## How are drives used for Erasure Code?
Plain Text - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Sep 29 04:28:45 GMT 2022 - 4.1K 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/sts/wso2.md
### 2. Configure WSO2 Once WSO2 is up and running, configure WSO2 to generate Self contained id_tokens. In OAuth 2.0 specification there are primarily two ways to provide id_tokens 1. The id_token is an identifier that is hard to guess. For example, a randomly generated string of sufficient length, that the server handling the protected resource can use to lookup the associated authorization information.
Plain Text - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Sep 29 04:28:45 GMT 2022 - 8.7K 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) -
internal/ioutil/hardlimitreader.go
// Package ioutil implements some I/O utility functions which are not covered // by the standard library. package ioutil import ( "errors" "io" ) // ErrOverread is returned to the reader when the hard limit of HardLimitReader is exceeded. var ErrOverread = errors.New("input provided more bytes than specified") // HardLimitReader returns a Reader that reads from r
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Sat May 06 02:53:12 GMT 2023 - 2K 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) -
cmd/namespace-lock_test.go
"time" ) // WARNING: // // Expected source line number is hard coded, 35, in the // following test. Adding new code before this test or changing its // position will cause the line number to change and the test to FAIL // Tests getSource(). func TestGetSource(t *testing.T) { currentSource := func() string { return getSource(2) } gotSource := currentSource() // Hard coded line number, 35, in the "expectedSource" value
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri Apr 23 18:58:53 GMT 2021 - 3.1K bytes - Viewed (0)