- Sort Score
- Result 10 results
- Languages All
Results 191 - 200 of 485 for meanOf (1.13 sec)
-
docs/en/docs/advanced/using-request-directly.md
It would also mean that if you get data from the `Request` object directly (for example, read the body) it won't be validated, converted or documented (with OpenAPI, for the automatic API user interface) by FastAPI.
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 09:15:41 UTC 2025 - 2.4K bytes - Viewed (0) -
src/test/java/jcifs/internal/smb2/session/Smb2LogoffResponseTest.java
} @Test @DisplayName("Insufficient buffer causes ArrayIndexOutOfBoundsException") void shortBuffer_throwsAIOOBE() { // Arrange: length 1 means readInt2 will access index 1 and fail byte[] buffer = new byte[1]; Smb2LogoffResponse resp = newResponse(); // Act & Assert
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 4.7K bytes - Viewed (0) -
docs/site-replication/README.md
because STS tokens are now signed with the site replicator service account credentials, thus allowing flexibility in the independent management of root accounts across sites and the ability to disable root accounts eventually. However, this means that STS tokens signed previously by root credentials will no longer be valid upon upgrading to the latest version with this change. Please re-generate them as you usually do. Additionally, if site replication is ever removed - the STS tokens will...
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Tue Aug 12 18:20:36 UTC 2025 - 3.4K bytes - Viewed (0) -
.teamcity/README.md
## How the configuration works We use Kotlin portable DSL to store TeamCity configuration, which means you can easily create a new pipeline based on a specific branch. Currently, we have two pipelines: `master` and `release`, but you can easily create and test another isolated pipeline from any branch.
Registered: Wed Sep 10 11:36:15 UTC 2025 - Last Modified: Wed Mar 06 23:02:25 UTC 2024 - 4K bytes - Viewed (0) -
LICENSE
Each licensee is addressed as "you". A "library" means a collection of software functions and/or data prepared so as to be conveniently linked with application programs (which use some of those functions and data) to form executables. The "Library", below, refers to any such software library or work which has been distributed under these terms. A "work based on the Library" means either the Library or any derivative work under
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Mon Jan 18 20:25:38 UTC 2016 - 25.8K bytes - Viewed (0) -
guava/src/com/google/common/base/NullnessCasts.java
* doesn't work: Because nullness analyses typically infer the nullness of local variables, * there's no way to assign a {@code @Nullable T} to a field {@code T foo;} and instruct the * analysis that that means "plain {@code T}" rather than the inferred type {@code @Nullable T}. * (And even if annotations on local variables were permitted as an optional hint, no annotation
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Wed Aug 13 20:49:47 UTC 2025 - 3.3K bytes - Viewed (0) -
src/cmd/asm/internal/arch/arm.go
arm.ABGE, arm.ABLT, arm.ABGT, arm.ABLE, arm.AB, obj.ANOP, } // ARMConditionCodes handles the special condition code situation for the ARM. // It returns a boolean to indicate success; failure means cond was unrecognized. func ARMConditionCodes(prog *obj.Prog, cond string) bool { if cond == "" { return true } bits, ok := ParseARMCondition(cond) if !ok { return false }
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Oct 23 15:18:14 UTC 2024 - 6.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/PredecessorsFunction.java
import com.google.errorprone.annotations.DoNotMock; /** * A functional interface for <a * href="https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)">graph</a>-structured data. * * <p>This interface is meant to be used as the type of a parameter to graph algorithms (such as * topological sort) that only need a way of accessing the predecessors of a node in a graph. * * <h3>Usage</h3> * * Given an algorithm, for example:
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/SuccessorsFunction.java
import com.google.errorprone.annotations.DoNotMock; /** * A functional interface for <a * href="https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)">graph</a>-structured data. * * <p>This interface is meant to be used as the type of a parameter to graph algorithms (such as * breadth first traversal) that only need a way of accessing the successors of a node in a graph. * * <h3>Usage</h3> * * Given an algorithm, for example:
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 4.2K bytes - Viewed (0) -
cmd/jwt.go
} cred := u.Credentials // Expired credentials return error. if cred.IsTemp() && cred.IsExpired() { return nil, errInvalidAccessKeyID } return []byte(cred.SecretKey), nil } // this means claims.AccessKey == rootAccessKey if !globalAPIConfig.permitRootAccess() { // if root access is disabled, fail this request. return nil, errAccessKeyDisabled } return []byte(globalActiveCred.SecretKey), nil
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 4.5K bytes - Viewed (0)