- Sort Score
- Num 10 results
- Language All
Results 121 - 126 of 126 for Cases (0.04 seconds)
-
cmd/site-replication.go
ErrDetail: fmt.Sprintf("unable to update peer targets on local: %v", err), }, nil } } // set partial error message if remote site updates failed for few cases if len(errs) > 0 { successMsg = fmt.Sprintf("%s\n- partially failed for few remote sites as they could be down/unreachable at the moment", successMsg) } result := madmin.ReplicateEditStatus{ Success: true,
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 184.8K bytes - Click Count (1) -
cmd/iam-store.go
case regUser: // For regular users, we load the mapped policy. err = store.loadMappedPolicy(ctx, accessKey, userType, false, cache.iamUserPolicyMap) default: // This is just to ensure that we have covered all cases for new // code in future. panic("unknown user type") } // Ignore policy not mapped error if err != nil && !errors.Is(err, errNoSuchPolicy) { return err } return nil }
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 87.1K bytes - Click Count (0) -
lib/fips140/v1.1.0-rc1.zip
subtraction tells us if // x >= m as a side effect, and taking care of the broken invariant is // highly undesirable (see https://go.dev/issue/13907). copy(x.reset(n).limbs, T[n:]) x.maybeSubtractModulus(choice(c), m) // The following specialized cases follow the exact same algorithm, but // optimized for the sizes most used in RSA. addMulVVW is implemented in // assembly with loop unrolling depending on the architecture and bounds // checks are removed by the compiler thanks to the constant size....
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Thu Dec 11 16:27:41 GMT 2025 - 663K bytes - Click Count (0) -
internal/config/lambda/event/event.go
OutputRoute string `json:"outputRoute"` OutputToken string `json:"outputToken"` InputS3URL string `json:"inputS3Url"` } // Event represents lambda function event, this is undocumented in AWS S3. This // structure bases itself on this structure but there is no binding. // // { // "xAmzRequestId": "a2871150-1df5-4dc9-ad9f-3da283ca1bf3", // "getObjectContext": { // "outputRoute": "...", // "outputToken": "...",
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Tue Mar 07 16:12:41 GMT 2023 - 2.6K bytes - Click Count (0) -
lib/fips140/v1.0.0-c2097c7c.zip
subtraction tells us if // x >= m as a side effect, and taking care of the broken invariant is // highly undesirable (see https://go.dev/issue/13907). copy(x.reset(n).limbs, T[n:]) x.maybeSubtractModulus(choice(c), m) // The following specialized cases follow the exact same algorithm, but // optimized for the sizes most used in RSA. addMulVVW is implemented in // assembly with loop unrolling depending on the architecture and bounds // checks are removed by the compiler thanks to the constant size....
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Thu Sep 25 19:53:19 GMT 2025 - 642.7K bytes - Click Count (0) -
VULNERABILITY_REPORT.md
- The conditions that are required such that the vulnerability can be exploited. - The steps required to fix the vulnerability. In general, if the vulnerability exists in one of the MinIO code bases itself - not in a code dependency - then MinIO will, if possible, fix the vulnerability or implement reasonable countermeasures such that the
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Sat Feb 12 00:51:25 GMT 2022 - 1.5K bytes - Click Count (0)