- Sort Score
- Result 10 results
- Languages All
Results 171 - 180 of 738 for already (0.67 sec)
-
src/bufio/bufio.go
const maxConsecutiveEmptyReads = 100 // NewReaderSize returns a new [Reader] whose buffer has at least the specified // size. If the argument io.Reader is already a [Reader] with large enough // size, it returns the underlying [Reader]. func NewReaderSize(rd io.Reader, size int) *Reader { // Is it already a Reader? b, ok := rd.(*Reader) if ok && len(b.buf) >= size { return b } r := new(Reader)
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Sep 03 14:04:47 UTC 2025 - 22K bytes - Viewed (0) -
docs/en/docs/tutorial/security/get-current-user.md
{* ../../docs_src/security/tutorial002_an_py310.py hl[30:32] *} ## Recap { #recap } You can now get the current user directly in your *path operation function*. We are already halfway there. We just need to add a *path operation* for the user/client to actually send the `username` and `password`.
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 09:15:41 UTC 2025 - 4K bytes - Viewed (0) -
android/guava/src/com/google/common/reflect/TypeVisitor.java
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue May 13 17:27:14 UTC 2025 - 3.6K bytes - Viewed (0) -
src/main/java/jcifs/smb1/smb1/SmbComOpenAndX.java
} else // don't truncate the file if ((flags & SmbFile.O_CREAT) == SmbFile.O_CREAT) { // create it if necessary if ((flags & SmbFile.O_EXCL) == SmbFile.O_EXCL) { // fail if already exists openFunction = OPEN_FN_CREATE | OPEN_FN_FAIL_IF_EXISTS; } else { openFunction = OPEN_FN_CREATE | OPEN_FN_OPEN; } } else {
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 07:14:38 UTC 2025 - 5.6K bytes - Viewed (0) -
docs/en/docs/deployment/versions.md
# About FastAPI versions { #about-fastapi-versions } **FastAPI** is already being used in production in many applications and systems. And the test coverage is kept at 100%. But its development is still moving quickly. New features are added frequently, bugs are fixed regularly, and the code is still continuously improving.
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 09:15:41 UTC 2025 - 3.5K bytes - Viewed (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/EventListener.kt
* * OkHttp won't retry when it is configured not to: * * * If retries are forbidden with [OkHttpClient.retryOnConnectionFailure]. (OkHttp's defaults * permit retries.) * * If OkHttp already attempted to transmit the request body, and [RequestBody.isOneShot] is * true. * * It won't retry if the exception is a bug or a configuration problem, such as: *
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Tue May 27 14:58:02 UTC 2025 - 17.4K bytes - Viewed (0) -
docs/en/docs/tutorial/dependencies/dependencies-in-path-operation-decorators.md
### Return values { #return-values } And they can return values or not, the values won't be used. So, you can reuse a normal dependency (that returns a value) you already use somewhere else, and even though the value won't be used, the dependency will be executed: {* ../../docs_src/dependencies/tutorial006_an_py39.py hl[11,16] *}
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 09:15:41 UTC 2025 - 2.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/Multimap.java
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 15.7K bytes - Viewed (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/connection/RealConnectionPool.kt
} fun scheduleCloser() { cleanupQueue.schedule(cleanupTask) } /** * Ensure enough connections open to [address] to satisfy its [ConnectionPool.AddressPolicy]. * If there are already enough connections, we're done. * If not, we create one and then schedule the task to run again immediately. */ private fun openConnections(state: AddressState): Long {
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Tue Jun 03 17:10:08 UTC 2025 - 16.1K bytes - Viewed (0) -
cmd/data-usage-cache.go
if cycles <= 1 { return cycles == 1 } return uint32(xxhash.Sum64String(string(h))>>32)%(cycles) == cycle%cycles } // addChild will add a child based on its hash. // If it already exists it will not be added again. func (e *dataUsageEntry) addChild(hash dataUsageHash) { if _, ok := e.Children[hash.Key()]; ok { return } if e.Children == nil { e.Children = make(dataUsageHashMap, 1)
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 34.7K bytes - Viewed (0)