- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 485 for right (0.16 sec)
-
docs/en/docs/advanced/events.md
And then, right after the `yield`, we unload the model. This code will be executed **after** the application **finishes handling requests**, right before the *shutdown*. This could, for example, release resources like memory or a GPU. !!! tip
Plain Text - Registered: Sun May 05 07:19:11 GMT 2024 - Last Modified: Thu Apr 18 19:53:19 GMT 2024 - 7.8K bytes - Viewed (0) -
docs/fa/docs/index.md
<div style="text-align: right; margin-right: 10%;">Brian Okken - <strong><a href="https://pythonbytes.fm/episodes/show/123/time-to-right-the-py-wrongs?time_in_sec=855" target="_blank">Python Bytes</a> podcast host</strong> <a href="https://twitter.com/brianokken/status/1112220079972728832" target="_blank"><small>(ref)</small></a></div> ---
Plain Text - Registered: Sun May 05 07:19:11 GMT 2024 - Last Modified: Thu Apr 18 23:58:47 GMT 2024 - 25.9K bytes - Viewed (0) -
guava-testlib/src/com/google/common/testing/CollectorTester.java
accum = collector.combiner().apply(accum, newAccum); } return accum; } }, /** Get one accumulator for each element and merge the accumulators right-to-left. */ MERGE_RIGHT_ASSOCIATIVE { @Override final <T extends @Nullable Object, A extends @Nullable Object, R extends @Nullable Object> A result(Collector<T, A, R> collector, Iterable<T> inputs) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 6.5K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/UnsignedInts.java
INSTANCE; @Override public int compare(int[] left, int[] right) { int minLength = Math.min(left.length, right.length); for (int i = 0; i < minLength; i++) { if (left[i] != right[i]) { return UnsignedInts.compare(left[i], right[i]); } } return left.length - right.length; } @Override public String toString() {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 13.4K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompoundOrdering.java
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 2.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompoundOrdering.java
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 2.4K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Booleans.java
INSTANCE; @Override public int compare(boolean[] left, boolean[] right) { int minLength = Math.min(left.length, right.length); for (int i = 0; i < minLength; i++) { int result = Booleans.compare(left[i], right[i]); if (result != 0) { return result; } } return left.length - right.length; } @Override public String toString() {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 19.9K bytes - Viewed (0) -
docs/vi/docs/index.md
<div style="text-align: right; margin-right: 10%;">Kabir Khan - <strong>Microsoft</strong> <a href="https://github.com/tiangolo/fastapi/pull/26" target="_blank"><small>(ref)</small></a></div> --- "_Chúng tôi tích hợp thư viện **FastAPI** để sinh ra một **REST** server, nó có thể được truy vấn để thu được những **dự đoán**._ [bởi Ludwid] "
Plain Text - Registered: Sun May 05 07:19:11 GMT 2024 - Last Modified: Mon Apr 29 05:18:04 GMT 2024 - 21.9K bytes - Viewed (0) -
analysis/analysis-api-fe10/src/org/jetbrains/kotlin/analysis/api/descriptors/components/KtFe10CallResolver.kt
} } private fun handleAsCompoundAssignment(context: BindingContext, binaryExpression: KtBinaryExpression): KtCallInfo? { val left = binaryExpression.left ?: return null val right = binaryExpression.right val resolvedCalls = mutableListOf<ResolvedCall<*>>() return when (binaryExpression.operationToken) { KtTokens.EQ -> {
Plain Text - Registered: Fri May 03 08:18:13 GMT 2024 - Last Modified: Mon Apr 29 12:48:54 GMT 2024 - 34.8K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/UnsignedLongs.java
INSTANCE; @Override public int compare(long[] left, long[] right) { int minLength = Math.min(left.length, right.length); for (int i = 0; i < minLength; i++) { if (left[i] != right[i]) { return UnsignedLongs.compare(left[i], right[i]); } } return left.length - right.length; } @Override public String toString() {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 17.6K bytes - Viewed (0)