- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 591 for choosing (0.21 sec)
-
android/guava/src/com/google/common/hash/HashFunction.java
* in the hash code should be as evenly "spread out" through the hash code's bits as possible. * The result is that, for example, when choosing a bucket in a hash table of size 2^8, * <i>any</i> eight bits could be consistently used. * <li><b>cryptographic:</b> certain hash functions such as {@link Hashing#sha512} are designed to
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 25 18:22:59 UTC 2021 - 10.9K bytes - Viewed (0) -
guava/src/com/google/common/hash/HashFunction.java
* in the hash code should be as evenly "spread out" through the hash code's bits as possible. * The result is that, for example, when choosing a bucket in a hash table of size 2^8, * <i>any</i> eight bits could be consistently used. * <li><b>cryptographic:</b> certain hash functions such as {@link Hashing#sha512} are designed to
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 25 18:22:59 UTC 2021 - 10.9K bytes - Viewed (0) -
src/sort/sort.go
// ergonomic and runs faster. func Sort(data Interface) { n := data.Len() if n <= 1 { return } limit := bits.Len(uint(n)) pdqsort(data, 0, n, limit) } type sortedHint int // hint for pdqsort when choosing the pivot const ( unknownHint sortedHint = iota increasingHint decreasingHint ) // xorshift paper: https://www.jstatsoft.org/article/view/v008i14/xorshift.pdf type xorshift uint64
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 28 16:40:32 UTC 2023 - 10.1K bytes - Viewed (0) -
platforms/documentation/docs/src/docs/userguide/reference/ci-systems/github-actions.adoc
---- === Initialize the Gradle project and commit to the repository Use `gradle init` to create a fresh Gradle project. You can choose any of the available options during `init`, but we recommend choosing "library" as the project type. Once the project is generated, commit the changes and push to the repository. [listing.terminal.sample-command] ---- $ gradle init $ git add . $ git commit -m "Initial commit"
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Apr 08 14:41:08 UTC 2024 - 11.3K bytes - Viewed (0) -
pkg/registry/core/service/strategy.go
} // NOTE: there are other fields like `selector` which we could wipe. // Historically we did not wipe them and they are not allocated from // finite pools, so we are (currently) choosing to leave them alone. // Clear the load-balancer status if it is no longer appropriate. Although // LB de-provisioning is actually asynchronous, we don't need to expose the // user to that complexity.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Apr 11 13:09:36 UTC 2024 - 14.1K bytes - Viewed (0) -
platforms/documentation/docs/src/docs/userguide/dep-man/01-core-dependency-management/declaring_dependencies.adoc
[[sec:choosing-configuration]] == Choosing the right configuration for dependencies The choice of the configuration where you declare a dependency is important. However there is no fixed rule into which configuration a dependency must go.
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Dec 07 01:37:51 UTC 2023 - 30.1K bytes - Viewed (0) -
cmd/endpoint-ellipses.go
}) return setCounts } // getSetIndexes returns list of indexes which provides the set size // on each index, this function also determines the final set size // The final set size has the affinity towards choosing smaller // indexes (total sets) func getSetIndexes(args []string, totalSizes []uint64, setDriveCount uint64, argPatterns []ellipses.ArgPattern) (setIndexes [][]uint64, err error) { if len(totalSizes) == 0 || len(args) == 0 {
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri May 24 23:05:23 UTC 2024 - 14.7K bytes - Viewed (0) -
staging/src/k8s.io/apimachinery/third_party/forked/golang/json/fields.go
// except that fields with JSON tags are promoted. // The fields are sorted in primary order of name, secondary order // of field index length. Loop over names; for each name, delete // hidden fields by choosing the one dominant field that survives. out := fields[:0] for advance, i := 0, 0; i < len(fields); i += advance { // One iteration per name. // Find the sequence of fields with the name of this first field.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat Jun 25 16:23:43 UTC 2022 - 13.1K bytes - Viewed (0) -
helm/minio/values.yaml
## If defined, storageClassName: <storageClass> ## If set to "-", storageClassName: "", which disables dynamic provisioning ## If undefined (the default) or set to null, no storageClassName spec is ## set, choosing the default provisioner. (gp2 on AWS, standard on ## GKE, AWS & OpenStack) ## ## Storage class of PV to bind. By default it looks for standard storage class.
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Sun Apr 28 10:14:37 UTC 2024 - 18.4K bytes - Viewed (1) -
android/guava/src/com/google/common/collect/Multimaps.java
* perform well, {@code function} should be fast. To avoid lazy evaluation when the returned * multimap doesn't need to be a view, copy the returned multimap into a new multimap of your * choosing. * * @since 7.0 */ public static < K extends @Nullable Object, V1 extends @Nullable Object, V2 extends @Nullable Object> Multimap<K, V2> transformValues(
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sun Jun 02 13:36:19 UTC 2024 - 86.3K bytes - Viewed (0)