- Sort Score
- Result 10 results
- Languages All
Results 331 - 340 of 661 for mean (0.68 sec)
-
.teamcity/src/main/kotlin/configurations/PerformanceTest.kt
type.defaultBaselines, display = ParameterDisplay.PROMPT, allowEmpty = true, description = "The baselines you want to run performance tests against. Empty means default baseline.", ) param("env.PERFORMANCE_STAGE", stage.stageName.toString()) param("env.PERFORMANCE_CHANNEL", performanceTestBuildSpec.channel())Registered: Wed Dec 31 11:36:14 UTC 2025 - Last Modified: Mon Dec 22 07:15:16 UTC 2025 - 6K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/app/service/RequestHeaderService.java
}); } /** * Sets up the database query conditions for retrieving request headers based on pager criteria. * * @param cb the condition bean for building the database query * @param requestHeaderPager the pager containing search and filter criteria */ protected void setupListCondition(final RequestHeaderCB cb, final ReqHeaderPager requestHeaderPager) {Registered: Sat Dec 20 09:19:18 UTC 2025 - Last Modified: Thu Jul 17 08:28:31 UTC 2025 - 5.2K 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 Dec 26 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 Dec 26 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 Dec 28 19:28:13 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 4.5K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/app/service/RelatedContentService.java
} /** * Sets up the search conditions for listing related content entities. * Configures wildcard searches for term and content fields, and sets up ordering. * * @param cb the condition bean for building the query * @param relatedContentPager the pager containing search parameters */ protected void setupListCondition(final RelatedContentCB cb, final RelatedContentPager relatedContentPager) {Registered: Sat Dec 20 09:19:18 UTC 2025 - Last Modified: Thu Jul 17 08:28:31 UTC 2025 - 5.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/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 Dec 26 12:43:10 UTC 2025 - Last Modified: Wed Aug 13 20:49:47 UTC 2025 - 3.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/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 Dec 26 12:43:10 UTC 2025 - Last Modified: Wed Aug 13 20:49:47 UTC 2025 - 3.6K bytes - Viewed (0) -
utils/utils.go
} // RTrimSlice Right trims the given slice by given length func RTrimSlice[T any](v []T, trimLen int) []T { if trimLen >= len(v) { // trimLen greater than slice len means fully sliced return v[:0] } if trimLen < 0 { // negative trimLen is ignored return v[:] } return v[:len(v)-trimLen]
Registered: Sun Dec 28 09:35:17 UTC 2025 - Last Modified: Thu Oct 30 10:56:26 UTC 2025 - 4.5K bytes - Viewed (0) -
build-logic/documentation/src/main/groovy/gradlebuild/docs/dsl/docbook/LinkRenderer.java
Registered: Wed Dec 31 11:36:14 UTC 2025 - Last Modified: Wed May 21 06:20:45 UTC 2025 - 6.3K bytes - Viewed (0)