- Sort Score
- Result 10 results
- Languages All
Results 81 - 90 of 550 for Hashing (0.13 sec)
-
testing/internal-testing/src/main/groovy/org/gradle/test/fixtures/file/TestFile.java
import org.apache.tools.ant.taskdefs.Zip; import org.codehaus.groovy.runtime.ResourceGroovyMethods; import org.gradle.api.UncheckedIOException; import org.gradle.internal.hash.HashCode; import org.gradle.internal.hash.Hashing; import org.gradle.testing.internal.util.RetryUtil; import org.hamcrest.Matcher; import org.intellij.lang.annotations.Language; import org.junit.Assert; import java.io.BufferedReader; import java.io.File;
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Apr 11 18:31:52 UTC 2024 - 30.3K bytes - Viewed (0) -
cmd/format-erasure.go
// time when fresh disks were supplied, it is a two dimensional // array second dimension represents list of disks used per set. Sets [][]string `json:"sets"` // Distribution algorithm represents the hashing algorithm // to pick the right set index for an object. DistributionAlgo string `json:"distributionAlgo"` } `json:"xl"` }
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri May 24 23:05:23 UTC 2024 - 23.2K bytes - Viewed (0) -
android/guava/src/com/google/common/net/InetAddresses.java
addressAsLong = ByteBuffer.wrap(ip6.getAddress(), 0, 8).getLong(); } // Many strategies for hashing are possible. This might suffice for now. int coercedHash = Hashing.murmur3_32_fixed().hashLong(addressAsLong).asInt(); // Squash into 224/4 Multicast and 240/4 Reserved space (i.e. 224/3). coercedHash |= 0xe0000000;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 24 16:44:05 UTC 2024 - 47.1K bytes - Viewed (0) -
guava/src/com/google/common/net/InetAddresses.java
addressAsLong = ByteBuffer.wrap(ip6.getAddress(), 0, 8).getLong(); } // Many strategies for hashing are possible. This might suffice for now. int coercedHash = Hashing.murmur3_32_fixed().hashLong(addressAsLong).asInt(); // Squash into 224/4 Multicast and 240/4 Reserved space (i.e. 224/3). coercedHash |= 0xe0000000;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 24 16:44:05 UTC 2024 - 47.1K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/-UtilCommon.kt
* if any intersection is found. The sizes of both arguments are assumed to be so small, and the * likelihood of an intersection so great, that it is not worth the CPU cost of sorting or the * memory cost of hashing. */ internal fun Array<String>.hasIntersection( other: Array<String>?, comparator: Comparator<in String>, ): Boolean { if (isEmpty() || other == null || other.isEmpty()) { return false }
Registered: Sun Jun 16 04:42:17 UTC 2024 - Last Modified: Mon May 13 13:42:37 UTC 2024 - 11K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/BloomFilter.java
* <p>Implementations should be collections of pure functions (i.e. stateless). */ interface Strategy extends java.io.Serializable { /** * Sets {@code numHashFunctions} bits of the given bit array, by hashing a user element. * * <p>Returns whether any bits changed as a result of this operation. */ <T extends @Nullable Object> boolean put( @ParametricNullness T object,
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 23.1K bytes - Viewed (0) -
guava/src/com/google/common/hash/Striped64.java
* holds the lock. If a hashed slot is empty, and lock is * available, a new Cell is created. Otherwise, if the slot * 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,
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 11.5K bytes - Viewed (0) -
subprojects/core/src/test/groovy/org/gradle/api/internal/tasks/execution/ExecuteActionsTaskExecuterTest.groovy
import org.gradle.internal.file.PathToFileResolver import org.gradle.internal.file.ReservedFileSystemLocationRegistry import org.gradle.internal.fingerprint.DirectorySensitivity import org.gradle.internal.fingerprint.hashing.FileSystemLocationSnapshotHasher import org.gradle.internal.fingerprint.impl.AbsolutePathFileCollectionFingerprinter import org.gradle.internal.fingerprint.impl.DefaultFileCollectionSnapshotter
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Mar 08 13:46:07 UTC 2024 - 19.8K bytes - Viewed (0) -
guava/src/com/google/common/hash/BloomFilter.java
* <p>Implementations should be collections of pure functions (i.e. stateless). */ interface Strategy extends java.io.Serializable { /** * Sets {@code numHashFunctions} bits of the given bit array, by hashing a user element. * * <p>Returns whether any bits changed as a result of this operation. */ <T extends @Nullable Object> boolean put( @ParametricNullness T object,
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 26.3K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Striped64.java
* holds the lock. If a hashed slot is empty, and lock is * available, a new Cell is created. Otherwise, if the slot * 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,
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 11.5K bytes - Viewed (0)