- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 15 for art4 (0.02 sec)
-
docs/de/docs/tutorial/security/get-current-user.md
Verwenden Sie einfach jede Art von Modell, jede Art von Klasse, jede Art von Datenbank, die Sie für Ihre Anwendung benötigen. **FastAPI** deckt das alles mit seinem Dependency Injection System ab. ## Codegröße
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 06 20:36:54 UTC 2024 - 8.3K bytes - Viewed (0) -
guava/src/com/google/common/math/Stats.java
double mean = values.next().doubleValue(); while (values.hasNext()) { double value = values.next().doubleValue(); count++; if (isFinite(value) && isFinite(mean)) { // Art of Computer Programming vol. 2, Knuth, 4.2.2, (15) mean += (value - mean) / count; } else { mean = calculateNewMeanNonFinite(mean, value); } } return mean; } /**
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 23 16:45:30 UTC 2024 - 24.9K bytes - Viewed (0) -
compat/maven-compat/src/test/java/org/apache/maven/repository/legacy/DefaultWagonManagerTest.java
Artifact artifact = new DefaultArtifact( "sample.group", "sample-art", VersionRange.createFromVersion("1.0"), "scope", "jar", "classifier", null); artifact.setFile(getTestFile("target/sample-art")); StringWagon wagon = (StringWagon) wagonManager.getWagon("string");
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 13.4K bytes - Viewed (0) -
guava/src/com/google/common/collect/Collections2.java
* * <p><i>Notes:</i> This is an implementation of the algorithm for Lexicographical Permutations * Generation, described in Knuth's "The Art of Computer Programming", Volume 4, Chapter 7, * Section 7.2.1.2. The iteration order follows the lexicographical order. This means that the * first permutation will be in ascending order, and the last will be in descending order.
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 18 20:24:49 UTC 2024 - 23.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Collections2.java
* * <p><i>Notes:</i> This is an implementation of the algorithm for Lexicographical Permutations * Generation, described in Knuth's "The Art of Computer Programming", Volume 4, Chapter 7, * Section 7.2.1.2. The iteration order follows the lexicographical order. This means that the * first permutation will be in ascending order, and the last will be in descending order.
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 18 20:24:49 UTC 2024 - 22.8K bytes - Viewed (0) -
docs/de/docs/tutorial/security/simple-oauth2.md
* Dem `username`. * Dem `password`. * Einem optionalen `scope`-Feld als langem String, bestehend aus durch Leerzeichen getrennten Strings. * Einem optionalen `grant_type` („Art der Anmeldung“). /// tip | "Tipp" Die OAuth2-Spezifikation *erfordert* tatsächlich ein Feld `grant_type` mit dem festen Wert `password`, aber `OAuth2PasswordRequestForm` erzwingt dies nicht.
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 06 20:36:54 UTC 2024 - 14.1K bytes - Viewed (0) -
docs/de/docs/advanced/security/http-basic-auth.md
if not (credentials.username == "stanleyjobson") or not (credentials.password == "swordfish"): # Einen Error zurückgeben ... ``` Aber durch die Verwendung von `secrets.compare_digest()` ist dieser Code sicher vor einer Art von Angriffen, die „Timing-Angriffe“ genannt werden. ### Timing-Angriffe Aber was ist ein „Timing-Angriff“? Stellen wir uns vor, dass einige Angreifer versuchen, den Benutzernamen und das Passwort zu erraten.
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 27 15:25:54 UTC 2024 - 5.8K bytes - Viewed (0) -
docs/de/docs/advanced/generate-clients.md
Aber ich zeige Ihnen als nächstes, wie Sie das verbessern können. 🤓 ## Benutzerdefinierte Operation-IDs und bessere Methodennamen Sie können die Art und Weise, wie diese Operation-IDs **generiert** werden, **ändern**, um sie einfacher zu machen und **einfachere Methodennamen** in den Clients zu haben.
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 06 20:36:54 UTC 2024 - 11.9K bytes - Viewed (0) -
docs/tr/docs/alternatives.md
Ancak otomatik veri doğrulama, veri dönüştürme ve dökümantasyon sağlamyor. Bu, **FastAPI**'ın onun üzerine tamamen Python tip belirteçlerine bağlı olarak eklediği (Pydantic ile) ana şeylerden biri. **FastAPI** bunun yanında artı olarak bağımlılık enjeksiyonu sistemi, güvenlik araçları, OpenAPI şema üretimi ve benzeri özellikler de ekliyor. /// note | "Teknik Detaylar"
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 20 19:20:23 UTC 2024 - 28.8K bytes - Viewed (0) -
android/guava/src/com/google/common/math/StatsAccumulator.java
min = value; max = value; if (!isFinite(value)) { sumOfSquaresOfDeltas = NaN; } } else { count++; if (isFinite(value) && isFinite(mean)) { // Art of Computer Programming vol. 2, Knuth, 4.2.2, (15) and (16) double delta = value - mean; mean += delta / count; sumOfSquaresOfDeltas += delta * (value - mean); } else {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 23 16:45:30 UTC 2024 - 15.8K bytes - Viewed (0)