- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 247 for deps (0.03 sec)
-
guava-tests/benchmark/com/google/common/hash/MessageDigestAlgorithmBenchmark.java
void setUp() { testBytes = new byte[size]; new Random(RANDOM_SEED).nextBytes(testBytes); } @Benchmark byte hashing(int reps) { byte result = 0x01; HashMethod hashMethod = this.hashMethod; Algorithm algorithm = this.algorithm; for (int i = 0; i < reps; i++) { result ^= hashMethod.hash(algorithm, testBytes)[0]; } return result; }
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Jul 14 14:44:08 UTC 2025 - 3.5K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/cache/LoadingCacheSingleThreadBenchmark.java
requests.set(0); misses.set(0); } @Benchmark int time(int reps) { int dummy = 0; for (int i = 0; i < reps; i++) { dummy += cache.getUnchecked(nextRandomKey()); } requests.addAndGet(reps); return dummy; } private int nextRandomKey() { int a = random.nextInt(max); /*
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 3.4K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/collect/ComparatorDelegationOverheadBenchmark.java
} } @Benchmark int arraysSortNoComparator(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { Integer[] copy = inputArrays[i & 0xFF].clone(); sort(copy); tmp += copy[0]; } return tmp; } @Benchmark int arraysSortOrderingNatural(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { Integer[] copy = inputArrays[i & 0xFF].clone();
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 2.6K bytes - Viewed (0) -
docs/fr/docs/advanced/additional-status-codes.md
/// ## Documents OpenAPI et API
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Mon Nov 18 02:25:44 UTC 2024 - 2.2K bytes - Viewed (0) -
docs/fr/docs/tutorial/path-params-numeric-validations.md
`Query`, `Path`, et d'autres classes que vous verrez plus tard sont des sous-classes d'une classe commune `Param`. Tous partagent les mêmes paramètres pour des validations supplémentaires et des métadonnées que vous avez vu précédemment. /// /// note | Détails techniques Lorsque vous importez `Query`, `Path` et d'autres de `fastapi`, ce sont en fait des fonctions.
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sat Nov 09 16:39:20 UTC 2024 - 6.9K bytes - Viewed (0) -
docs/fr/docs/benchmarks.md
* Si on compare Starlette, il faut le comparer à d'autres frameworks web (ou micorframework) comme Sanic, Flask, Django, etc. * **FastAPI** : * Comme Starlette, FastAPI utilise Uvicorn et ne peut donc pas être plus rapide que ce dernier.
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Thu Jul 27 18:49:56 UTC 2023 - 3.9K bytes - Viewed (0) -
docs/ja/docs/tutorial/dependencies/dependencies-with-yield.md
participant handler as Exception handler participant dep as Dep with yield participant operation as Path Operation participant tasks as Background tasks Note over client,tasks: Can raise exception for dependency, handled after response is sent Note over client,operation: Can raise HTTPException and can change the response client ->> dep: Start request Note over dep: Run code up to yield opt raise
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Mon Nov 18 02:25:44 UTC 2024 - 12.3K bytes - Viewed (0) -
docs/fr/docs/async.md
#### Burgers parallèles Imaginons désormais que ce ne sont pas des "burgers concurrents" mais des "burgers parallèles". Vous allez avec votre crush 😍 dans un fast food 🍔 parallélisé. Vous attendez pendant que plusieurs (disons 8) serveurs qui sont aussi des cuisiniers 👨🍳👨🍳👨🍳👨🍳👨🍳👨🍳👨🍳👨🍳 prennent les commandes des personnes devant vous.
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 09:56:21 UTC 2025 - 25.4K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java
} @Benchmark int slowFactorial(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; tmp += oldSlowFactorial(slowFactorials[j]).intValue(); } return tmp; } @Benchmark int factorial(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK;
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 3.5K bytes - Viewed (0) -
docs/fr/docs/tutorial/body.md
/// ## Sans Pydantic
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sat Nov 09 16:39:20 UTC 2024 - 7.6K bytes - Viewed (0)