- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 476 for right (0.35 sec)
-
android/guava/src/com/google/common/collect/TopKSelector.java
int left = 0; int right = 2 * k - 1; int minThresholdPosition = 0; // The leftmost position at which the greatest of the k lower elements // -- the new value of threshold -- might be found. int iterations = 0; int maxIterations = IntMath.log2(right - left, RoundingMode.CEILING) * 3; while (left < right) { int pivotIndex = (left + right + 1) >>> 1;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 11.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/ComparisonChain.java
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Wed Sep 21 17:28:11 GMT 2022 - 11.2K bytes - Viewed (0) -
src/main/webapp/WEB-INF/view/admin/general/admin_general.jsp
<h4><la:message key="labels.general_menu_system"/></h4> <div class="form-group row"> <span class="font-weight-bold col-sm-3 text-sm-right col-form-label"><la:message key="labels.web_api_json_enabled"/></span> <div class="form-inline col-sm-9">
Others - Registered: Mon Apr 29 08:04:11 GMT 2024 - Last Modified: Mon Jan 16 12:54:35 GMT 2023 - 39.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeMultiset.java
successor(pred(), succ()); if (left == null) { return right; } else if (right == null) { return left; } else if (left.height >= right.height) { AvlNode<E> newTop = pred(); // newTop is the maximum node in my left subtree newTop.left = left.removeMax(newTop); newTop.right = right; newTop.distinctElements = distinctElements - 1;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 34.2K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/UnsignedBytes.java
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 18.3K bytes - Viewed (0) -
docs/tr/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> --- "_**FastAPI**'ı **tahminlerimiz**'i sorgulanabilir hale getirecek bir **REST** sunucu oluşturmak için benimsedik/kullanmaya başladık._"
Plain Text - Registered: Sun Apr 28 07:19:10 GMT 2024 - Last Modified: Thu Apr 18 23:58:47 GMT 2024 - 22K bytes - Viewed (0) -
docs/de/docs/index.md
<div style="text-align: right; margin-right: 10%;">Kevin Glisson, Marc Vilanova, Forest Monsen - <strong>Netflix</strong> <a href="https://netflixtechblog.com/introducing-dispatch-da4b8a2a8072" target="_blank"><small>(Ref)</small></a></div> --- „_Ich bin überglücklich mit **FastAPI**. Es macht so viel Spaß!_“
Plain Text - Registered: Sun Apr 28 07:19:10 GMT 2024 - Last Modified: Sat Mar 30 20:28:17 GMT 2024 - 21.2K bytes - Viewed (0) -
docs/en/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> --- "_We adopted the **FastAPI** library to spawn a **REST** server that can be queried to obtain **predictions**. [for Ludwig]_"
Plain Text - Registered: Sun Apr 28 07:19:10 GMT 2024 - Last Modified: Thu Apr 18 23:58:47 GMT 2024 - 19.2K bytes - Viewed (0) -
docs/fr/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> --- "_Nous avons adopté la bibliothèque **FastAPI** pour créer un serveur **REST** qui peut être interrogé pour obtenir des **prédictions**. [pour Ludwig]_"
Plain Text - Registered: Sun Apr 28 07:19:10 GMT 2024 - Last Modified: Thu Apr 18 23:58:47 GMT 2024 - 22.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/primitives/UnsignedBytesTest.java
rnd.nextBytes(left); byte[] right = left.clone(); assertThat(comparator.compare(left, right)).isEqualTo(0); int i = rnd.nextInt(left.length); left[i] ^= (byte) (1 + rnd.nextInt(255)); assertThat(comparator.compare(left, right)).isNotEqualTo(0); assertThat(UnsignedBytes.compare(left[i], right[i]) > 0) .isEqualTo(comparator.compare(left, right) > 0); } } }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 13.4K bytes - Viewed (0)