- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 116 for findAny (0.15 sec)
-
pkg/scheduler/apis/config/types.go
// at least "minFeasibleNodesToFind" feasible nodes no matter what the value of this flag is. // Example: if the cluster size is 500 nodes and the value of this flag is 30, // then scheduler stops finding further feasible nodes once it finds 150 feasible ones. // When the value is 0, default percentage (5%--50% based on the size of the cluster) of the // nodes will be scored. It is overridden by profile level PercentageOfNodesToScore.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Jan 19 18:47:23 UTC 2024 - 14.8K bytes - Viewed (0) -
platforms/core-runtime/launcher/src/test/groovy/org/gradle/launcher/daemon/client/DaemonClientTest.groovy
1 * connection.markSuspect() 1 * connection.dispatch({ it instanceof CloseInput }) 1 * connection.stop() 0 * connection._ } def "does not loop forever finding usable daemons"() { given: connector.connect(compatibilitySpec) >> connection connector.startDaemon(compatibilitySpec) >> connection connection.daemon >> Stub(DaemonConnectDetails)
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed May 15 19:54:56 UTC 2024 - 10K bytes - Viewed (0) -
src/internal/testenv/testenv.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 03 16:41:38 UTC 2024 - 15.7K bytes - Viewed (0) -
platforms/documentation/docs/src/docs/userguide/dep-man/04-modeling-features/variant_attributes.adoc
[[sec:abm_algorithm]] === Variant attribute matching algorithm Finding the best variant can get complicated when there are many different variants available for a component and many different attributes. Gradle's dependency resolution engine performs the following algorithm when finding the best result (or failing):
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue Mar 26 18:51:23 UTC 2024 - 17.2K bytes - Viewed (0) -
src/net/listen_test.go
} } } for _, ifi := range []*Interface{loopbackInterface(), nil} { // Note that multicast interface assignment by system // is not recommended because it usually relies on // routing stuff for finding out an appropriate // nexthop containing both network and link layer // adjacencies. if ifi == nil || !*testIPv4 { continue } for _, tt := range ipv4MulticastListenerTests { var err error
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Sep 18 17:20:52 UTC 2023 - 20.5K bytes - Viewed (0) -
platforms/ide/ide/src/main/java/org/gradle/plugins/ide/eclipse/model/internal/EclipseDependenciesCreator.java
* unresolvable dependencies defined in the configuration. * * We can probably do better by inspecting the runtime classpath and finding out which * Configurations are part of it and only traversing any extra file collections manually. */ private Collection<File> collectClasspathFiles(SourceSet sourceSet) {
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Dec 11 13:37:56 UTC 2023 - 13.6K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/cmd/bisect/main.go
// Bisect prints tracing logs to standard error and the minimal change sets // to standard output. // // # Command Line Flags // // Bisect supports the following command-line flags: // // -max=M // // Stop after finding M minimal change sets. The default is no maximum, meaning to run until // all changes that provoke a failure have been identified. // // -maxset=S // // Disallow change sets larger than S elements. The default is no maximum.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 22 18:11:19 UTC 2023 - 23.9K bytes - Viewed (0) -
platforms/documentation/docs/src/docs/userguide/optimizing-performance/build-cache/build_cache_debugging.adoc
This chapter is about finding out why a cache miss happened. If you have a cache hit which you didn't expect we suggest to declare whatever change you expected to trigger the cache miss as an input to the task. [[finding_problems]] == Finding problems with task output caching
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Dec 07 01:37:51 UTC 2023 - 15K bytes - Viewed (0) -
src/bufio/bufio.go
// ReadSlice reads until the first occurrence of delim in the input, // returning a slice pointing at the bytes in the buffer. // The bytes stop being valid at the next read. // If ReadSlice encounters an error before finding a delimiter, // it returns all the data in the buffer and the error itself (often io.EOF). // ReadSlice fails with error [ErrBufferFull] if the buffer fills without a delim.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 12 14:39:08 UTC 2023 - 21.8K bytes - Viewed (0) -
docs/sts/ldap.md
- On finding the user's info, MinIO verifies the login credentials with the AD/LDAP server. - MinIO optionally queries the AD/LDAP server for a list of groups that the user is a member of. - MinIO then checks if there are any policies [explicitly associated](#managing-usergroup-access-policy) with the user or their groups.
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri May 24 23:05:23 UTC 2024 - 18.9K bytes - Viewed (0)