- Sort Score
- Num 10 results
- Language All
Results 41 - 50 of 4,774 for It (0.05 seconds)
-
docs/en/docs/tutorial/dependencies/dependencies-with-yield.md
opt Tasks operation -->> tasks: Send background tasks end opt Raise other exception tasks -->> tasks: Handle exceptions in the background task code end ``` /// info Only **one response** will be sent to the client. It might be one of the error responses or it will be the response from the *path operation*.Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 05 18:13:19 GMT 2026 - 12.6K bytes - Click Count (0) -
docs/en/docs/tutorial/dependencies/classes-as-dependencies.md
But that's not the only way to declare dependencies (although it would probably be the more common). The key factor is that a dependency should be a "callable". A "**callable**" in Python is anything that Python can "call" like a function. So, if you have an object `something` (that might _not_ be a function) and you can "call" it (execute it) like: ```Python something() ``` or ```Python
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Wed Feb 11 18:32:12 GMT 2026 - 6.8K bytes - Click Count (0) -
docs/en/docs/tutorial/security/index.md
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Sun Aug 31 10:49:48 GMT 2025 - 4.4K bytes - Click Count (0) -
docs/en/docs/how-to/separate-openapi-schemas.md
Since **Pydantic v2** was released, the generated OpenAPI is a bit more exact and **correct** than before. 😎 In fact, in some cases, it will even have **two JSON Schemas** in OpenAPI for the same Pydantic model, for input and output, depending on if they have **default values**. Let's see how that works and how to change it if you need to do that. ## Pydantic Models for Input and Output { #pydantic-models-for-input-and-output }Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Sat Dec 20 15:55:38 GMT 2025 - 4.5K bytes - Click Count (0) -
internal/http/dial_dnscache.go
// It randomly fetches an IP via custom LookupHost function and dials it by the given dial // function. LookupHost may implement an internal DNS caching implementation, lookupHost // input if nil then net.DefaultResolver.LookupHost is used. // // It dials one by one and returns first connected `net.Conn`. // If it fails to dial all IPs from cache it returns first error. If no baseDialFunc
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 2.6K bytes - Click Count (0) -
cmd/object-api-deleteobject_test.go
// This file is part of MinIO Object Storage stack // // This program is free software: you can redistribute it and/or modify // it under the terms of the GNU Affero General Public License as published by // the Free Software Foundation, either version 3 of the License, or // (at your option) any later version. // // This program is distributed in the hope that it will be useful // but WITHOUT ANY WARRANTY; without even the implied warranty of
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Thu Aug 29 01:40:52 GMT 2024 - 4.1K bytes - Click Count (0) -
docs/en/docs/advanced/wsgi.md
/// note Previously, it was recommended to use `WSGIMiddleware` from `fastapi.middleware.wsgi`, but it is now deprecated. It’s advised to use the `a2wsgi` package instead. The usage remains the same. Just ensure that you have the `a2wsgi` package installed and import `WSGIMiddleware` correctly from `a2wsgi`. /// ## Check it { #check-it }Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 05 18:13:19 GMT 2026 - 1.4K bytes - Click Count (0) -
src/test/java/jcifs/smb/DirFileEntryEnumIteratorBaseTest.java
// Act TestIterator it = TestIterator.create(tree, parent, wildcard, null, attrs, initial, pages); // Assert assertSame(tree, it.getTreeHandle(), "tree handle should be same instance returned by acquire"); assertEquals(attrs, it.getSearchAttributes()); assertEquals(wildcard, it.getWildcard()); assertSame(parent, it.getParent()); verify(tree, times(1)).acquire();Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 14.5K bytes - Click Count (0) -
android/guava/src/com/google/common/math/StatsAccumulator.java
* contains both {@link Double#POSITIVE_INFINITY} and {@link Double#NEGATIVE_INFINITY} then the * result is {@link Double#NaN}. If it contains {@link Double#POSITIVE_INFINITY} and finite values * only or {@link Double#POSITIVE_INFINITY} only, the result is {@link Double#POSITIVE_INFINITY}. * If it contains {@link Double#NEGATIVE_INFINITY} and finite values only or {@linkCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Apr 14 16:36:11 GMT 2025 - 15.8K bytes - Click Count (0) -
LICENSE
of this license document, but changing it is not allowed. (This is the first released version of the Lesser GPL. It also counts as the successor of the GNU Library Public License, version 2, hence the version number 2.1.) Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General PublicCreated: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Mon Jan 18 20:25:38 GMT 2016 - 25.8K bytes - Click Count (0)