- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 136 for lent (0.02 sec)
-
docs/fr/docs/tutorial/background-tasks.md
* Étant donné que se connecter à un serveur et envoyer un email a tendance à être «lent» (plusieurs secondes), vous pouvez retourner la réponse directement et envoyer la notification en arrière-plan. * Traiter des données : * Par exemple, si vous recevez un fichier qui doit passer par un traitement lent, vous pouvez retourner une réponse «Accepted» (HTTP 202) puis faire le traitement en arrière-plan.Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Sat Oct 11 17:48:49 UTC 2025 - 5.5K bytes - Viewed (0) -
docs_src/request_files/tutorial001_02_py39.py
Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Wed Dec 17 20:41:43 UTC 2025 - 508 bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeMultiset.java
this.elemCount = 0; 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;Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue Dec 09 15:58:48 UTC 2025 - 33.9K bytes - Viewed (0) -
src/main/webapp/WEB-INF/view/common/admin/header.jsp
<li class="nav-item" data-toggle="tooltip" data-placement="left" title="<la:message key="labels.eol_error" />"> <a class="nav-link active" href="${eolLink}" target="_olh"><i class="fas fa-times-circle text-danger" aria-hidden="true"></i></a></li> </c:if> <c:if test="${developmentMode}"> <li class="nav-item" data-toggle="tooltip" data-placement="left" title="<la:message key="labels.development_mode_warning" />">
Registered: Sat Dec 20 09:19:18 UTC 2025 - Last Modified: Thu Nov 13 05:54:52 UTC 2025 - 2.4K bytes - Viewed (0) -
guava/src/com/google/common/collect/TreeMultiset.java
this.elemCount = 0; 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;Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue Dec 09 15:58:48 UTC 2025 - 34.3K bytes - Viewed (0) -
docs_src/path_params/tutorial005_py39.py
class ModelName(str, Enum): alexnet = "alexnet" resnet = "resnet" lenet = "lenet" app = FastAPI() @app.get("/models/{model_name}") async def get_model(model_name: ModelName): if model_name is ModelName.alexnet: return {"model_name": model_name, "message": "Deep Learning FTW!"} if model_name.value == "lenet": return {"model_name": model_name, "message": "LeCNN all the images"}
Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Wed Dec 17 20:41:43 UTC 2025 - 546 bytes - Viewed (0) -
fastapi/background.py
Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Wed Dec 17 21:25:59 UTC 2025 - 1.8K bytes - Viewed (0) -
docs/en/docs/css/custom.css
.termynal-comment { color: #4a968f; font-style: italic; display: block; } .termy { /* For right to left languages */ direction: ltr; } .termy [data-termynal] { white-space: pre-wrap; } .termy .linenos { display: none; } a.external-link { /* For right to left languages */ direction: ltr; display: inline-block; } a.external-link::after {Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Fri Nov 28 15:55:15 UTC 2025 - 3.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/primitives/UnsignedBytesTest.java
for (int trial = 0; trial < 100; trial++) { byte[] left = new byte[1 + rnd.nextInt(32)]; rnd.nextBytes(left); byte[] right = left.clone(); assertThat(comparator1.compare(left, right)).isEqualTo(0); assertThat(comparator2.compare(left, right)).isEqualTo(0); int i = rnd.nextInt(left.length); left[i] ^= (byte) (1 + rnd.nextInt(255));
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Thu Dec 11 20:45:32 UTC 2025 - 13.5K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Longs.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++) { int result = Long.compare(left[i], right[i]); if (result != 0) { return result; } } return left.length - right.length; } @Override public String toString() {Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Wed Oct 22 18:14:49 UTC 2025 - 29K bytes - Viewed (0)