- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 37 for crc32 (0.11 sec)
-
src/archive/zip/testdata/crc32-not-streamed.zip
Russ Cox <******@****.***> 1410149331 -0400
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Mon Sep 08 04:08:51 UTC 2014 - 314 bytes - Viewed (0) -
src/archive/zip/writer_test.go
} if got.Flags != want.flags { t.Errorf("%s: got Flags %#x; want %#x", want.name, got.Flags, want.flags) } if got.CRC32 != want.crc32 { t.Errorf("%s: got CRC32 %#x; want %#x", want.name, got.CRC32, want.crc32) } if got.CompressedSize64 != want.compressedSize { t.Errorf("%s: got CompressedSize64 %d; want %d", want.name, got.CompressedSize64, want.compressedSize) }Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Tue Jan 28 04:20:09 UTC 2025 - 14.4K bytes - Viewed (0) -
internal/hash/crc.go
} } // crc32Combine returns the combined CRC-32 hash value of the two passed CRC-32 // hash values crc1 and crc2. poly represents the generator polynomial // and len2 specifies the byte length that the crc2 hash covers. func crc32Combine(poly uint32, crc1, crc2 uint32, len2 int64) uint32 { // degenerate case (also disallow negative lengths) if len2 <= 0 { return crc1 }
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Mon Jan 20 14:49:07 UTC 2025 - 5.8K bytes - Viewed (0) -
lib/time/mkzip.go
w, err := zw.CreateRaw(&zip.FileHeader{ Name: name, Method: zip.Store, CompressedSize64: uint64(len(data)), UncompressedSize64: uint64(len(data)), CRC32: crc32.ChecksumIEEE(data), }) if err != nil { log.Fatal(err) } if _, err := w.Write(data); err != nil { log.Fatal(err) } seen[name] = true return nil }) if err != nil {
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Mon Mar 04 17:32:07 UTC 2024 - 2.1K bytes - Viewed (0) -
src/archive/zip/writer.go
fh.UncompressedSize64 = 0 ow = dirWriter{} } else { fh.Flags |= 0x8 // we will write a data descriptor fw = &fileWriter{ zipw: w.cw, compCount: &countWriter{w: w.cw}, crc32: crc32.NewIEEE(), } comp := w.compressor(fh.Method) if comp == nil { return nil, ErrAlgorithm } var err error fw.comp, err = comp(fw.compCount) if err != nil { return nil, errRegistered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Tue Jan 28 04:20:09 UTC 2025 - 19.4K bytes - Viewed (0) -
internal/hash/checksum_test.go
tests := []struct { name string checksum ChecksumType fullobj bool wantErr bool }{ {"CRC32-composite", ChecksumCRC32, false, false}, {"CRC32-full-object", ChecksumCRC32, true, false}, {"CRC32C-composite", ChecksumCRC32C, false, false}, {"CRC32C-full-object", ChecksumCRC32C, true, false}, {"CRC64NVME-full-object", ChecksumCRC64NVME, false, false}, // CRC64NVME is always full objectRegistered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Fri Aug 22 14:15:21 UTC 2025 - 7.1K bytes - Viewed (0) -
internal/hash/checksum.go
// Returns nil if no checksum. func (c ChecksumType) Hasher() hash.Hash { switch { case c.Is(ChecksumCRC32): return crc32.NewIEEE() case c.Is(ChecksumCRC32C): return crc32.New(crc32.MakeTable(crc32.Castagnoli)) case c.Is(ChecksumSHA1): return sha1.New() case c.Is(ChecksumSHA256): return sha256.New() case c.Is(ChecksumCRC64NVME): return crc64.New(crc64Table)
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Fri Aug 22 14:15:21 UTC 2025 - 18.3K bytes - Viewed (0) -
internal/s3select/genmessage.go
binary.Write(buf, binary.BigEndian, uint32(headerLength)) prelude := buf.Bytes() binary.Write(buf, binary.BigEndian, crc32.ChecksumIEEE(prelude)) buf.Write(header) message := buf.Bytes() binary.Write(buf, binary.BigEndian, crc32.ChecksumIEEE(message)) fmt.Println(buf.Bytes()) } func genProgressHeader() { buf := new(bytes.Buffer) buf.WriteByte(13)
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Thu Aug 19 01:35:22 UTC 2021 - 4.4K bytes - Viewed (0) -
docs/debugging/hash-set/main.go
func hashOrder(key string, cardinality int) []int { if cardinality <= 0 { // Returns an empty int slice for cardinality < 0. return nil } nums := make([]int, cardinality) keyCrc := crc32.Checksum([]byte(key), crc32.IEEETable) start := int(keyCrc % uint32(cardinality)) for i := 1; i <= cardinality; i++ { nums[i-1] = 1 + ((start + i) % cardinality) } return nums } var (
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Mon Sep 19 18:05:16 UTC 2022 - 3.7K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hashing.java
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Thu Jul 17 15:26:41 UTC 2025 - 29.8K bytes - Viewed (0)