- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 1,863 for hash4 (0.04 sec)
-
src/cmd/compile/internal/coverage/cover.go
} hv[i] = byte(x) } // Return hash and meta-data len return hv, base.Flag.Cfg.CoverageInfo.MetaLen } func registerMeta(cnames names, hashv [16]byte, mdlen int) { // Materialize expression for hash (an array literal) pos := cnames.InitFn.Pos() elist := make([]ir.Node, 0, 16) for i := 0; i < 16; i++ { elem := ir.NewInt(base.Pos, int64(hashv[i])) elist = append(elist, elem) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 29 21:55:46 UTC 2024 - 6K bytes - Viewed (0) -
cmd/kubeadm/app/util/staticpod/utils.go
}) return usersAndGroups, err } // DeepHashObject writes specified object to hash using the spew library // which follows pointers and prints actual values of the nested objects // ensuring the hash does not change when a pointer changes. // Copied from k8s.io/kubernetes/pkg/util/hash/hash.go#DeepHashObject func DeepHashObject(hasher hash.Hash, objectToWrite interface{}) { hasher.Reset()
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sun Jan 14 13:07:56 UTC 2024 - 14.1K bytes - Viewed (0) -
src/runtime/map_fast32.go
fatal("concurrent map read and map write") } var b *bmap if h.B == 0 { // One-bucket table. No need to hash. b = (*bmap)(h.buckets) } else { hash := t.Hasher(noescape(unsafe.Pointer(&key)), uintptr(h.hash0)) m := bucketMask(h.B) b = (*bmap)(add(h.buckets, (hash&m)*uintptr(t.BucketSize))) if c := h.oldbuckets; c != nil { if !h.sameSizeGrow() {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:17:26 UTC 2024 - 13.9K bytes - Viewed (0) -
src/runtime/map_fast64.go
fatal("concurrent map read and map write") } var b *bmap if h.B == 0 { // One-bucket table. No need to hash. b = (*bmap)(h.buckets) } else { hash := t.Hasher(noescape(unsafe.Pointer(&key)), uintptr(h.hash0)) m := bucketMask(h.B) b = (*bmap)(add(h.buckets, (hash&m)*uintptr(t.BucketSize))) if c := h.oldbuckets; c != nil { if !h.sameSizeGrow() {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:17:26 UTC 2024 - 14.1K bytes - Viewed (0) -
src/hash/maphash/maphash_test.go
t.Errorf("hashes don't match: want %x, got %x", x, y) } } // Make sure a Hash implements the hash.Hash and hash.Hash64 interfaces. var _ hash.Hash = &Hash{} var _ hash.Hash64 = &Hash{} func benchmarkSize(b *testing.B, size int) { h := &Hash{} buf := make([]byte, size) s := string(buf) b.Run("Write", func(b *testing.B) { b.SetBytes(int64(size)) for i := 0; i < b.N; i++ { h.Reset()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jun 14 00:03:57 UTC 2023 - 5.2K bytes - Viewed (0) -
src/hash/crc64/crc64.go
tab *Table } // New creates a new hash.Hash64 computing the CRC-64 checksum using the // polynomial represented by the [Table]. Its Sum method will lay the // value out in big-endian byte order. The returned Hash64 also // implements [encoding.BinaryMarshaler] and [encoding.BinaryUnmarshaler] to // marshal and unmarshal the internal state of the hash. func New(tab *Table) hash.Hash64 { return &digest{0, tab} }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat May 18 22:36:41 UTC 2024 - 5.2K bytes - Viewed (0) -
src/hash/fnv/fnv.go
// Its Sum method will lay the value out in big-endian byte order. func New64() hash.Hash64 { var s sum64 = offset64 return &s } // New64a returns a new 64-bit FNV-1a [hash.Hash]. // Its Sum method will lay the value out in big-endian byte order. func New64a() hash.Hash64 { var s sum64a = offset64 return &s } // New128 returns a new 128-bit FNV-1 [hash.Hash].
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat May 18 22:36:41 UTC 2024 - 8.5K bytes - Viewed (0) -
src/runtime/map_faststr.go
return unsafe.Pointer(&zeroVal[0]) } dohash: hash := t.Hasher(noescape(unsafe.Pointer(&ky)), uintptr(h.hash0)) m := bucketMask(h.B) b := (*bmap)(add(h.buckets, (hash&m)*uintptr(t.BucketSize))) if c := h.oldbuckets; c != nil { if !h.sameSizeGrow() { // There used to be half as many buckets; mask down one more power of two. m >>= 1 } oldb := (*bmap)(add(c, (hash&m)*uintptr(t.BucketSize))) if !evacuated(oldb) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:17:26 UTC 2024 - 15.3K bytes - Viewed (0) -
tensorflow/compiler/jit/device_compilation_cluster_signature.cc
} }; // Functor that incrementally computes a Signature's hash given its current hash // and one of its args. struct SignatureHashCombiner { explicit SignatureHashCombiner(const uint64 h) : h(h) {} uint64 h; uint64 operator()(const Tensor& arg) { h = Hash64Combine(h, std::hash<int>()(static_cast<int>(arg.dtype()))); h = Hash64Combine( h, Hash64(arg.tensor_data().data(), arg.tensor_data().size()));
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Feb 22 06:59:07 UTC 2024 - 4.7K bytes - Viewed (0) -
src/runtime/map.go
if !h.sameSizeGrow() { // Compute hash to make our evacuation decision (whether we need // to send this key/elem to bucket x or bucket y). hash := t.Hasher(k2, uintptr(h.hash0)) if h.flags&iterator != 0 && !t.ReflexiveKey() && !t.Key.Equal(k2, k2) { // If key != key (NaNs), then the hash could be (and probably // will be) entirely different from the old hash. Moreover,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 57.6K bytes - Viewed (0)