- Sort Score
- Result 10 results
- Languages All
Results 201 - 210 of 542 for performer (0.13 sec)
-
docs/en/docs/tutorial/path-params.md
<img src="/img/tutorial/path-params/image02.png"> The same way, there are many compatible tools. Including code generation tools for many languages. ## Pydantic All the data validation is performed under the hood by <a href="https://docs.pydantic.dev/" class="external-link" target="_blank">Pydantic</a>, so you get all the benefits from it. And you know you are in good hands.
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 06 20:36:54 UTC 2024 - 9.1K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/AbstractExecutionThreadService.java
* to stop requests. You could poll for lifecycle changes in a work loop: * * <pre> * public void run() { * while ({@link #isRunning()}) { * // perform a unit of work * } * } * </pre> * * <p>...or you could respond to stop requests by implementing {@link #triggerShutdown()}, which * should cause {@link #run()} to return. */
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 17 13:00:28 UTC 2024 - 7.3K bytes - Viewed (0) -
docs/en/docs/contributing.md
``` </div> It will serve the documentation on `http://127.0.0.1:8008`. That way, you can edit the documentation/source files and see the changes live. /// tip Alternatively, you can perform the same steps that scripts does manually. Go into the language directory, for the main docs in English it's at `docs/en/`: ```console $ cd docs/en/ ``` Then run `mkdocs` in that directory:
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Aug 25 02:44:06 UTC 2024 - 12.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/QuantilesAlgorithm.java
} if (array[from + 1] > array[to]) { swap(array, from + 1, to); } if (array[from] > array[from + 1]) { swap(array, from, from + 1); } // Perform a partition with the selected median. int low = from + 1, high = to; // Indexes for partitioning. double partition = array[from + 1]; // Choose partitioning element. while (true) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue Feb 01 16:30:37 UTC 2022 - 7.1K bytes - Viewed (0) -
docs/erasure/README.md
-v /mnt/data7:/data7 \ -v /mnt/data8:/data8 \ quay.io/minio/minio server /data{1...8} --console-address ":9001" ``` ### 3. Test your setup
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Thu Sep 29 04:28:45 UTC 2022 - 4.1K bytes - Viewed (0) -
okhttp-idna-mapping-table/src/main/kotlin/okhttp3/internal/idn/SimpleIdnaMappingTable.kt
import okio.Buffer import okio.BufferedSink import okio.BufferedSource import okio.ByteString import okio.ByteString.Companion.encodeUtf8 import okio.Options /** * A decoded [mapping table] that can perform the [mapping step] of IDNA processing. * * This implementation is optimized for readability over efficiency. * * This implements non-transitional processing by preserving deviation characters. *
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Mon Jan 08 01:13:22 UTC 2024 - 6.8K bytes - Viewed (0) -
cmd/background-newdisks-heal-ops.go
// 1. Only the concerned erasure set will be listed and healed // 2. Only the node hosting the disk is responsible to perform the heal func monitorLocalDisksAndHeal(ctx context.Context, z *erasureServerPools) { // Perform automatic disk healing when a disk is replaced locally. diskCheckTimer := time.NewTimer(defaultMonitorNewDiskInterval) defer diskCheckTimer.Stop() for {
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Sat Oct 26 09:58:27 UTC 2024 - 16.6K bytes - Viewed (0) -
cmd/erasure-coding.go
endShard := (startOffset + length) / e.blockSize tillOffset := endShard*shardSize + shardSize if tillOffset > shardFileSize { tillOffset = shardFileSize } 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. //
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Wed Jan 31 02:11:45 UTC 2024 - 8.6K bytes - Viewed (0) -
guava/src/com/google/common/primitives/Bytes.java
for (int i = fromIndex, j = toIndex - 1; i < j; i++, j--) { byte tmp = array[i]; array[i] = array[j]; array[j] = tmp; } } /** * Performs a right rotation of {@code array} of "distance" places, so that the first element is * moved to index "distance", and the element at index {@code i} ends up at index {@code (distance
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue Aug 27 16:47:48 UTC 2024 - 15.3K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Converter.java
} /* * LegacyConverter violates the contract of Converter by allowing its doForward and doBackward * methods to accept null. We could avoid having unchecked casts in Converter.java itself if we * could perform a cast to LegacyConverter, but we can't because it's an internal-only class. * * TODO(cpovirk): So make it part of the open-source build, albeit package-private there? *
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 23K bytes - Viewed (0)