- Sort Score
- Num 10 results
- Language All
Results 651 - 660 of 1,476 for Call (0.01 seconds)
-
cmd/erasure-healing-common.go
) // Boot modTimes up to disk count, setting the value to time sentinel. func bootModtimes(diskCount int) []time.Time { modTimes := make([]time.Time, diskCount) // Boots up all the modtimes. for i := range modTimes { modTimes[i] = timeSentinel } return modTimes } func listObjectETags(partsMetadata []FileInfo, errs []error, quorum int) (etags []string) {
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 12K bytes - Click Count (0) -
docs/en/docs/tutorial/response-model.md
/// `response_model` receives the same type you would declare for a Pydantic model field, so, it can be a Pydantic model, but it can also be, e.g. a `list` of Pydantic models, like `List[Item]`.
Created: Sun Dec 28 07:19:09 GMT 2025 - Last Modified: Sat Dec 20 15:55:38 GMT 2025 - 15.5K bytes - Click Count (0) -
docs_src/path_operation_configuration/tutorial003_py39.py
Created: Sun Dec 28 07:19:09 GMT 2025 - Last Modified: Sat May 14 11:59:59 GMT 2022 - 512 bytes - Click Count (0) -
src/cmd/asm/internal/asm/testdata/duperror.s
// Copyright 2022 The Go Authors. All rights reserved. // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. TEXT foo(SB), 0, $0 RET TEXT foo(SB), 0, $0 // ERROR "symbol foo redeclared" RET GLOBL bar(SB), 0, $8 GLOBL bar(SB), 0, $8 // ERROR "symbol bar redeclared" DATA bar+0(SB)/8, $0
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Mon Dec 05 23:21:07 GMT 2022 - 404 bytes - Click Count (0) -
.github/workflows/go-healing.yml
GO111MODULE: on MINIO_KMS_SECRET_KEY: "my-minio-key:oyArl7zlPECEduNbB1KXgdzDn2Bdpvvw0l8VO51HQnY=" MINIO_KMS_AUTO_ENCRYPTION: on run: | sudo sysctl net.ipv6.conf.all.disable_ipv6=0 sudo sysctl net.ipv6.conf.default.disable_ipv6=0 make verify-healing make verify-healing-inconsistent-versions make verify-healing-with-root-disksCreated: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Wed Apr 09 14:28:39 GMT 2025 - 1.2K bytes - Click Count (0) -
docs_src/path_operation_configuration/tutorial003_py310.py
Created: Sun Dec 28 07:19:09 GMT 2025 - Last Modified: Fri Jan 07 14:11:31 GMT 2022 - 474 bytes - Click Count (0) -
cmd/leak-detect_test.go
return } // wait a test again will deadline. if UTCNow().Before(deadline) { time.Sleep(leakDetectPauseTimeMs * time.Millisecond) continue } // after the deadline time report all the difference in the latest snapshot compared with the initial one. for _, g := range leaked { t.Errorf("Leaked goroutine: %v", g) } return } }
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 5.2K bytes - Click Count (0) -
docs/erasure/README.md
algorithm to reconstruct missing or corrupted data. MinIO uses Reed-Solomon code to shard objects into variable data and parity blocks. For example, in a 12 drive setup, an object can be sharded to a variable number of data and parity blocks across all the drives - ranging from six data and six parity blocks to ten data and two parity blocks. By default, MinIO shards the objects across N/2 data and N/2 parity drives. Though, you can use [storage classes](https://github.com/minio/minio/tree...
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Tue Aug 12 18:20:36 GMT 2025 - 4.2K bytes - Click Count (0) -
docs/de/docs/deployment/https.md
In diesem Fall würde er das Zertifikat für `someapp.example.com` verwenden. <img src="/img/deployment/https/https03.drawio.svg"> Der Client **vertraut** bereits der Entität, die das TLS-Zertifikat generiert hat (in diesem Fall Let's Encrypt, aber wir werden später mehr darüber erfahren), sodass er **verifizieren** kann, dass das Zertifikat gültig ist.
Created: Sun Dec 28 07:19:09 GMT 2025 - Last Modified: Sat Sep 20 15:10:09 GMT 2025 - 16.1K bytes - Click Count (0) -
docs/de/docs/tutorial/dependencies/sub-dependencies.md
//// ## Zusammenfassung { #recap } Abgesehen von all den ausgefallenen Wörtern, die hier verwendet werden, ist das **Dependency Injection**-System recht simpel. Einfach Funktionen, die genauso aussehen wie *Pfadoperation-Funktionen*. Dennoch ist es sehr mächtig und ermöglicht Ihnen die Deklaration beliebig tief verschachtelter Abhängigkeits-„Graphen“ (Bäume). /// tip | TippCreated: Sun Dec 28 07:19:09 GMT 2025 - Last Modified: Wed Dec 17 20:41:43 GMT 2025 - 4.5K bytes - Click Count (0)