- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 284 for Nash (0.13 sec)
-
guava-tests/test/com/google/common/hash/HashCodeTest.java
} } else { assertEquals(expectedHashCode.asLong.longValue(), hash.asLong()); } assertEquals(expectedHashCode.toString, hash.toString()); assertSideEffectFree(hash); assertReadableBytes(hash); } private static void assertSideEffectFree(HashCode hash) { byte[] original = hash.asBytes(); byte[] mutated = hash.asBytes(); mutated[0]++;
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 13.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/MacHashFunctionTest.java
assertThrows(IllegalStateException.class, () -> hasher.putInt(42)); } public void testHashTwice() { Hasher hasher = Hashing.hmacMd5(MD5_KEY).newHasher(); assertEquals( "9753980fe94daa8ecaa82216519393a9", hasher.putString("The quick brown fox jumps over the lazy dog", UTF_8).hash().toString());
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 13.8K bytes - Viewed (0) -
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) -
maven-compat/src/main/java/org/apache/maven/project/artifact/DefaultMavenMetadataCache.java
this.repositories.addAll(remoteRepositories); int hash = 17; hash = hash * 31 + artifactHashCode(artifact); hash = hash * 31 + (resolveManagedVersions ? 1 : 2); hash = hash * 31 + repositoriesHashCode(repositories); this.hashCode = hash; } @Override public int hashCode() { return hashCode;
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Thu Jun 15 14:24:56 GMT 2023 - 11.8K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/MacHashFunctionTest.java
assertThrows(IllegalStateException.class, () -> hasher.putInt(42)); } public void testHashTwice() { Hasher hasher = Hashing.hmacMd5(MD5_KEY).newHasher(); assertEquals( "9753980fe94daa8ecaa82216519393a9", hasher.putString("The quick brown fox jumps over the lazy dog", UTF_8).hash().toString());
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 13.8K 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 May 05 19:28:20 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 May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
operator/README.md
### CLI To build the operator CLI, simply: ```bash make build ``` Ensure the created binary is in your PATH to run the examples below. ### Controller (in cluster) Building a custom controller requires a Dockerhub (or similar) account. To build using the container based build: ```bash HUB=docker.io/<your-account> TAG=latest make docker.operator ```
Plain Text - Registered: Wed May 08 22:53:08 GMT 2024 - Last Modified: Sun Sep 17 08:27:52 GMT 2023 - 17.5K 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 May 05 19:28:20 GMT 2024 - Last Modified: Mon Apr 22 17:49:30 GMT 2024 - 41.4K bytes - Viewed (1) -
android/guava-tests/test/com/google/common/hash/HashingTest.java
HashFunction func = cell.getRowKey(); String input = cell.getColumnKey(); String expected = cell.getValue(); assertEquals( String.format(Locale.ROOT, "Known hash for hash(%s, UTF_8) failed", input), expected, func.hashString(input, UTF_8).toString()); } } public void testNullPointers() { NullPointerTester tester =
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 26.5K bytes - Viewed (0)