- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 745 for hashed (0.14 sec)
-
src/cmd/compile/internal/types/alg.go
const ( AUNK AlgKind = iota ANOEQ // Types cannot be compared ANOALG // implies ANOEQ, and in addition has a part that is marked Noalg AMEM // Type can be compared/hashed as regular memory. AMEM0 // Specific subvariants of AMEM (TODO: move to ../reflectdata?) AMEM8 AMEM16 AMEM32 AMEM64 AMEM128 ASTRING AINTER ANILINTER AFLOAT32 AFLOAT64 ACPLX64
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 18 15:30:00 UTC 2024 - 2.4K bytes - Viewed (0) -
cmd/kubeadm/app/componentconfigs/checksums.go
// Then iterate over that slice to fetch the values to be hashed. keys := []string{} for key := range cm.Data { keys = append(keys, key) } sort.Strings(keys) for _, key := range keys { hash.Write([]byte(cm.Data[key])) } // Do the same as above, but for binaryData this time. keys = []string{} for key := range cm.BinaryData { keys = append(keys, key) } sort.Strings(keys)
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Aug 17 14:40:46 UTC 2021 - 2.2K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/mod/sumdb/dirhash/hash.go
"sort" "strings" ) // DefaultHash is the default hash function used in new go.sum entries. var DefaultHash Hash = Hash1 // A Hash is a directory hash function. // It accepts a list of files along with a function that opens the content of each file. // It opens, reads, hashes, and closes each file and returns the overall directory hash. type Hash func(files []string, open func(string) (io.ReadCloser, error)) (string, error)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Feb 10 18:59:52 UTC 2023 - 4K bytes - Viewed (0) -
docs/debugging/hash-set/main.go
// https://github.com/dchest/siphash#usage k0, k1 := binary.LittleEndian.Uint64(id[0:8]), binary.LittleEndian.Uint64(id[8:16]) 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.
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/main/java/jcifs/smb1/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). */ public 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: Fri Mar 22 20:39:42 UTC 2019 - 3.4K bytes - Viewed (0) -
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) -
src/internal/zstd/xxhash.go
) // 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. // We assume a seed of 0 since that is what zstd uses. func (xh *xxhash64) reset() { xh.len = 0
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 18 20:34:13 UTC 2023 - 3.3K bytes - Viewed (0) -
subprojects/core/src/main/java/org/gradle/api/internal/changedetection/state/FileTimeStampInspector.java
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Dec 20 16:22:11 UTC 2021 - 5K bytes - Viewed (0)