- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 423 for Nash (0.15 sec)
-
cmd/post-policy-fan-out.go
Go - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Thu Jan 18 07:03:17 GMT 2024 - 3.5K bytes - Viewed (0) -
cmd/format-erasure_test.go
} formatCountMap := make(map[string]int) for _, hash := range formatHashes { if hash == "" { continue } formatCountMap[hash]++ } maxHash := "" maxCount := 0 for hash, count := range formatCountMap { if count > maxCount { maxCount = count maxHash = hash } } if maxCount < len(formats)/2 { return nil, errErasureReadQuorum
Go - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Mon Apr 15 08:25:46 GMT 2024 - 12.9K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/Striped64.java
* exists, a CAS is tried. Retries proceed by "double hashing", * using a secondary hash (Marsaglia XorShift) to try to find a * free slot. * * The table size is capped because, when there are more threads * than CPUs, supposing that each thread were bound to a CPU, * there would exist a perfect hash function mapping threads to * slots that eliminates collisions. When we reach capacity, we
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
cmd/xl-storage-format-utils.go
return crc } // hashDeterministicBytes will return a deterministic (weak) hash for the map values. // Trivial collisions are avoided, but this is by no means a strong hash. func hashDeterministicBytes(m map[string][]byte) uint64 { crc := uint64(0x1bbc7e1dde654743) for k, v := range m { crc ^= (xxh3.HashString(k) ^ 0x4ee3bbaf7ab2506b) + (xxh3.Hash(v) ^ 0x8da4c8da66194257) } return crc
Go - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Thu Apr 11 17:45:28 GMT 2024 - 4.7K bytes - Viewed (0) -
.github/workflows/arm-cd.yml
./tensorflow/tools/ci_build/ci_build.sh cpu.arm64 bash tensorflow/tools/ci_build/rel/ubuntu/cpu_arm64_test_build.sh - name: Upload pip wheel to PyPI if: github.event_name == 'schedule' || (github.event_name == 'push' && startsWith(github.ref, 'refs/tags/v2')) # only if it is a scheduled nightly or tagged shell: bash
Others - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Tue Mar 05 10:24:16 GMT 2024 - 3K bytes - Viewed (1) -
android/guava/src/com/google/common/hash/Striped64.java
* exists, a CAS is tried. Retries proceed by "double hashing", * using a secondary hash (Marsaglia XorShift) to try to find a * free slot. * * The table size is capped because, when there are more threads * than CPUs, supposing that each thread were bound to a CPU, * there would exist a perfect hash function mapping threads to * slots that eliminates collisions. When we reach capacity, we
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
ci/official/code_check_full.sh
#!/bin/bash # Copyright 2023 The TensorFlow Authors. All Rights Reserved. # # Licensed under the Apache License, Version 2.0 (the "License"); # you may not use this file except in compliance with the License. # You may obtain a copy of the License at # # http://www.apache.org/licenses/LICENSE-2.0 # # Unless required by applicable law or agreed to in writing, software # distributed under the License is distributed on an "AS IS" BASIS,
Shell Script - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Tue Feb 06 17:29:44 GMT 2024 - 840 bytes - Viewed (0) -
cmd/data-usage-cache.go
} // 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) } e.Children[hash.Key()] = struct{}{} } // Create a clone of the entry.
Go - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Mon Apr 22 17:49:30 GMT 2024 - 41.4K bytes - Viewed (1) -
android/guava/src/com/google/common/collect/MultimapBuilder.java
*/ private MultimapBuilder() {} private static final int DEFAULT_EXPECTED_KEYS = 8; /** Uses a hash table to map keys to value collections. */ public static MultimapBuilderWithKeys<@Nullable Object> hashKeys() { return hashKeys(DEFAULT_EXPECTED_KEYS); } /** * Uses a hash table to map keys to value collections, initialized to expect the specified number * of keys. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 17.5K bytes - Viewed (0) -
.teamcity/src/main/kotlin/configurations/Gradleception.kt
1. Build a Gradle distribution with a fixed timestamp and hash it, but never use this distribution. 2. Build a Gradle distribution with this hash as a version + fixed timestamp -> dogfood-first 3. Build a Gradle distribution using dogfood-first with this hash as a version + fixed timestamp different from the one above -> dogfood-second
Plain Text - Registered: Wed May 01 11:36:15 GMT 2024 - Last Modified: Tue Feb 27 09:57:17 GMT 2024 - 6K bytes - Viewed (0)