- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 108 for hashHead (1.04 sec)
-
src/main/java/jcifs/util/HMACT64.java
/** * This is an implementation of the HMACT64 keyed hashing algorithm. * HMACT64 is defined by Luke Leighton as a modified HMAC-MD5 (RFC 2104) * in which the key is truncated at 64 bytes (rather than being hashed * via MD5). */ class HMACT64 extends MessageDigest implements Cloneable { private static final int BLOCK_LENGTH = 64; private static final byte IPAD = (byte) 0x36;
Registered: Wed Jun 12 15:45:55 UTC 2024 - Last Modified: Sun Jul 01 13:12:10 UTC 2018 - 3.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/RegularImmutableSet.java
new RegularImmutableSet<>(EMPTY_ARRAY, 0, EMPTY_ARRAY, 0); private final transient Object[] elements; private final transient int hashCode; // the same values as `elements` in hashed positions (plus nulls) @VisibleForTesting final transient @Nullable Object[] table; // 'and' with an int to get a valid table index. private final transient int mask;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 3.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RegularImmutableSet.java
// The first `size` elements are non-null. @VisibleForTesting final transient @Nullable Object[] elements; private final transient int hashCode; // the same values as `elements` in hashed positions (plus nulls) @VisibleForTesting final transient @Nullable Object[] table; // 'and' with an int to get a valid table index. private final transient int mask; private final transient int size;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 3.7K bytes - Viewed (0) -
docs/debugging/hash-set/main.go
sum64 := siphash.Hash(k0, k1, []byte(key)) return int(sum64 % uint64(cardinality)) } // hashOrder - hashes input key to return consistent // hashed integer slice. Returned integer order is salted // with an input key. This results in consistent order. // NOTE: collisions are fine, we are not looking for uniqueness // in the slices returned.
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Mon Sep 19 18:05:16 UTC 2022 - 3.7K bytes - Viewed (0) -
src/internal/zstd/xxhash.go
xxhPrime64c3 = 0x165667b19e3779f9 xxhPrime64c4 = 0x85ebca77c2b2ae63 xxhPrime64c5 = 0x27d4eb2f165667c5 ) // xxhash64 is the state of a xxHash-64 checksum. type xxhash64 struct { len uint64 // total length hashed v [4]uint64 // accumulators buf [32]byte // buffer cnt int // number of bytes in buffer } // reset discards the current state and prepares to compute a new hash.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 18 20:34:13 UTC 2023 - 3.3K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/Striped64.java
* CASes when performing an update operation (see method * retryUpdate). Upon a collision, if the table size is less than * the capacity, it is doubled in size unless some other thread * 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
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 11.5K bytes - Viewed (0) -
guava/src/com/google/common/cache/Striped64.java
* CASes when performing an update operation (see method * retryUpdate). Upon a collision, if the table size is less than * the capacity, it is doubled in size unless some other thread * 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
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 11.5K bytes - Viewed (0) -
guava/src/com/google/common/hash/Striped64.java
* CASes when performing an update operation (see method * retryUpdate). Upon a collision, if the table size is less than * the capacity, it is doubled in size unless some other thread * 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
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 11.5K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hasher.java
/** * Equivalent to processing each {@code char} value in the {@code CharSequence}, in order. In * other words, no character encoding is performed; the low byte and high byte of each {@code * char} are hashed directly (in that order). The input must not be updated while this method is * in progress. * * <p><b>Warning:</b> This method will produce different output than most other languages do when
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Jun 15 20:59:00 UTC 2022 - 5.5K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Striped64.java
* CASes when performing an update operation (see method * retryUpdate). Upon a collision, if the table size is less than * the capacity, it is doubled in size unless some other thread * 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
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 11.5K bytes - Viewed (0)