- Sort Score
- Result 10 results
- Languages All
Results 961 - 970 of 1,039 for happen (0.07 sec)
-
cmd/metacache-stream_test.go
var noDirs []string for i, entry := range entries.entries() { if entry.name != want[i] { t.Errorf("entry %d, want %q, got %q", i, want[i], entry.name) } if !entry.isDir() { noDirs = append(noDirs, entry.name) } } if entries.len() != len(want) { t.Fatal("unexpected length:", entries.len(), "want:", len(want)) } want = noDirs r = loadMetacacheSample(t) defer r.Close()
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Wed Apr 09 14:28:39 UTC 2025 - 15K bytes - Viewed (0) -
docs/es/docs/help-fastapi.md
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 10:49:48 UTC 2025 - 14.5K bytes - Viewed (0) -
cmd/erasure-object_test.go
t.Fatalf("Erasure Object upload failed: <ERROR> %s", err) } names[i] = ObjectToDelete{ ObjectV: ObjectV{ ObjectName: objInfo.Name, VersionID: objInfo.VersionID, }, } } names = append(names, ObjectToDelete{ ObjectV: ObjectV{ ObjectName: "dir/obj1", VersionID: mustGetUUID(), // add a non-existent UUID. }, }) _, delErrs := obj.DeleteObjects(ctx, bucketName, names, ObjectOptions{
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 38.3K bytes - Viewed (0) -
docs/en/docs/alternatives.md
So, data validation, serialization, and documentation, have to be done in code, not automatically. Or they have to be implemented as a framework on top of Falcon, like Hug. This same distinction happens in other frameworks that are inspired by Falcon's design, of having one request object and one response object as parameters. /// check | Inspired **FastAPI** to Find ways to get great performance.
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 09:15:41 UTC 2025 - 23.6K bytes - Viewed (0) -
docs/it/docs/index.md
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 10:49:48 UTC 2025 - 19.5K bytes - Viewed (0) -
docs/de/docs/tutorial/bigger-applications.md
Wir importieren das Submodul `items` direkt, anstatt nur seine Variable `router` zu importieren. Das liegt daran, dass wir im Submodul `users` auch eine weitere Variable namens `router` haben. Wenn wir eine nach der anderen importiert hätten, etwa: ```Python from .routers.items import router from .routers.users import router ```
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun May 11 13:37:26 UTC 2025 - 21K bytes - Viewed (0) -
cmd/erasure-healing-common_test.go
fi1: fi1, fi2: fiDel, }, } for idx, test := range tests { var metaArr []FileInfo for i := range 12 { fi := test.fi1 if i%2 == 0 { fi = test.fi2 } metaArr = append(metaArr, fi) } parities := listObjectParities(metaArr, make([]error, len(metaArr))) parity := commonParity(parities, 5) var match int for _, fi := range metaArr {Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 22.4K bytes - Viewed (0) -
cmd/metacache-entries_test.go
be := b.entries() for i := range be { // Modify b so it isn't deduplicated. be[i].metadata = []byte("something-else") } // Merge b into a a.merge(b, -1) //nolint:gocritic want := append(loadMetacacheSampleNames, loadMetacacheSampleNames...) sort.Strings(want) got := a.entries().names() if len(got) != len(want) { t.Errorf("unexpected count, want %v, got %v", len(want), len(got)) }
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 31.6K bytes - Viewed (0) -
cmd/erasure-metadata.go
for i, part := range fi.Parts { if partNumber == part.Number { fi.Parts[i] = partInfo return } } // Proceed to include new part info. fi.Parts = append(fi.Parts, partInfo) // Parts in FileInfo should be in sorted order by part number. sort.Slice(fi.Parts, func(i, j int) bool { return fi.Parts[i].Number < fi.Parts[j].Number }) }Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 21.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSet.java
// we can skip them all. knownRunStart += maxRunBeforeFallback; } else { knownRunStart++; // the only case in which maxRunEnd doesn't increase by mRBF // happens about f * (1-f) for f = DESIRED_LOAD_FACTOR, so around 21% of the time } knownRunEnd = knownRunStart; } else {Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 35.2K bytes - Viewed (0)