- Sort Score
- Result 10 results
- Languages All
Results 601 - 610 of 611 for Effect (0.46 sec)
-
cmd/batch-handlers.go
if err != nil { batchLogIf(ctx, err) return err } return saveConfig(ctx, api, path, buf) } ri.mu.Unlock() return nil } // Note: to be used only with batch jobs that affect multiple versions through // a single action. e.g batch-expire has an option to expire all versions of an // object which matches the given filters.Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 63.5K bytes - Viewed (1) -
docs/de/docs/async.md
beschriebene Weise funktioniert, und Sie es gewohnt sind, triviale, nur-berechnende *Pfadoperation-Funktionen* mit einfachem `def` zu definieren, um einen geringfügigen Geschwindigkeitsgewinn (etwa 100 Nanosekunden) zu erzielen, beachten Sie bitte, dass der Effekt in **FastAPI** genau gegenteilig wäre. In solchen Fällen ist es besser, `async def` zu verwenden, es sei denn, Ihre *Pfadoperation-Funktionen* verwenden Code, der blockierende <abbr title="Input/Output – Eingabe/Ausgabe: Lesen oder Schreiben von/auf...
Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Sat Sep 20 15:10:09 UTC 2025 - 27.9K bytes - Viewed (0) -
CHANGELOG.md
chunked but has no data. * Breaking: Replace `SocketPolicy` with a new type, `SocketEffect`. It splits triggers (request start, response body, etc.) from effects (closing the socket, closing the stream, etc.). * Breaking: Rename `RecordedRequest.sequenceNumber` to `exchangeIndex` and introduce `connectionIndex` on that type. These properties may be useful when testing features like
Registered: Fri Dec 26 11:42:13 UTC 2025 - Last Modified: Fri Dec 05 16:02:59 UTC 2025 - 36.2K bytes - Viewed (2) -
guava/src/com/google/common/collect/Iterators.java
} } /** * Returns a {@code PeekingIterator} backed by the given iterator. * * <p>Calls to the {@code peek} method with no intervening calls to {@code next} do not affect the * iteration, and hence return the same object each time. A subsequent call to {@code next} is * guaranteed to return the same object again. For example: * * {@snippet :Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue Sep 16 12:42:11 UTC 2025 - 51.4K bytes - Viewed (0) -
cmd/test-utils_test.go
} // sets globalIAMSys to `nil`. func resetGlobalIAMSys() { globalIAMSys = nil } // Resets all the globals used modified in tests. // Resetting ensures that the changes made to globals by one test doesn't affect others. func resetTestGlobals() { // set globalObjectAPI to `nil`. resetGlobalObjectAPI() // Reset config path set. resetGlobalConfigPath() // Reset Global server config. resetGlobalConfig()
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 77K bytes - Viewed (0) -
CHANGELOG/CHANGELOG-1.29.md
- `--sync-frequency` will not affect the update interval of volumes that use `ConfigMaps` or `Secrets` when the `configMapAndSecretChangeDetectionStrategy` is set to `Cache`.
Registered: Fri Dec 26 09:05:12 UTC 2025 - Last Modified: Wed Mar 12 00:36:01 UTC 2025 - 429.6K bytes - Viewed (1) -
cmd/object-handlers.go
ObjectV: ObjectV{ ObjectName: object, VersionID: opts.VersionID, }, }, *oi, opts, gerr) // Mutations of objects on versioning suspended buckets // affect its null version. Through opts below we select // the null version's remote object to delete if // transitioned. if gerr == nil { os.SetTransitionState(oi.TransitionedObject) } return dsc, nilRegistered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Sun Sep 28 20:59:21 UTC 2025 - 120.6K bytes - Viewed (0) -
docs/en/docs/release-notes.md
Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Sat Dec 27 19:06:15 UTC 2025 - 586.7K bytes - Viewed (0) -
lib/fips140/v1.0.0-c2097c7c.zip
overflowed). // // The paper suggests in Section 4 that we can do an "Almost Montgomery // Multiplication" by subtracting only in the overflow case, but the // cost is very similar since the constant time 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...
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Thu Sep 25 19:53:19 UTC 2025 - 642.7K bytes - Viewed (0) -
lib/fips140/v1.1.0-rc1.zip
overflowed). // // The paper suggests in Section 4 that we can do an "Almost Montgomery // Multiplication" by subtracting only in the overflow case, but the // cost is very similar since the constant time 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...
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Thu Dec 11 16:27:41 UTC 2025 - 663K bytes - Viewed (0)