Source File
	crc64.go

Belonging Package
	github.com/hamba/avro/v2/pkg/crc64

// Package crc64 implements the Avro CRC-64 checksum.
// See https://avro.apache.org/docs/current/spec.html#schema_fingerprints for information.
package crc64

import (
	"hash"
)

func init() {
	buildTable()
}

// Size is the of a CRC-64 checksum in bytes.
const Size = 8

// ByteOrder denotes how integers are encoded into bytes. The ByteOrder
// interface in encoding/binary cancels some optimizations, so use a more
// direct implementation.
type ByteOrder int

// ByteOrder constants.
const (
	LittleEndian ByteOrder = iota
	BigEndian
)

// Empty is the empty checksum.
const Empty = 0xc15d213aa4d7a795

// Table is a 256-word table representing the polynomial for efficient processing.
type Table [256]uint64

func makeTable() *Table {
	t := new(Table)
	for i := range 256 {
		fp := uint64(i)
		for range 8 {
			fp = (fp >> 1) ^ (Empty & -(fp & 1))
		}
		t[i] = fp
	}
	return t
}

var crc64Table *Table

func buildTable() {
	crc64Table = makeTable()
}

type digest struct {
	crc       uint64
	tab       *Table
	byteOrder ByteOrder
}

// New creates a new hash.Hash64 computing the Avro CRC-64 checksum.
// Its Sum method will lay the value out in big-endian byte order.
func New() hash.Hash64 {
	return newDigest(BigEndian)
}

// NewWithByteOrder creates a new hash.Hash64 computing the Avro CRC-64
// checksum. Its Sum method will lay the value out in specified byte order.
func NewWithByteOrder(byteOrder ByteOrder) hash.Hash64 {
	return newDigest(byteOrder)
}

func newDigest(byteOrder ByteOrder) *digest {
	return &digest{
		crc:       Empty,
		tab:       crc64Table,
		byteOrder: byteOrder,
	}
}

// Size returns the bytes size of the checksum.
func (d *digest) Size() int {
	return Size
}

// BlockSize returns the block size of the checksum.
func (d *digest) BlockSize() int {
	return 1
}

// Reset resets the hash instance.
func (d *digest) Reset() {
	d.crc = Empty
}

// Write accumulatively adds the given data to the checksum.
func (d *digest) Write(p []byte) (n int, err error) {
	for i := range p {
		d.crc = (d.crc >> 8) ^ d.tab[(int)(byte(d.crc)^p[i])&0xff]
	}

	return len(p), nil
}

// Sum64 returns the checksum as a uint64.
func (d *digest) Sum64() uint64 {
	return d.crc
}

// Sum returns the checksum as a byte slice, using the given byte slice.
func (d *digest) Sum(in []byte) []byte {
	b := d.sumBytes()
	return append(in, b[:]...)
}

// sumBytes returns the checksum as a byte array in digest byte order.
func (d *digest) sumBytes() [Size]byte {
	s := d.Sum64()

	switch d.byteOrder {
	case LittleEndian:
		return [Size]byte{
			byte(s),
			byte(s >> 8),
			byte(s >> 16),
			byte(s >> 24),
			byte(s >> 32),
			byte(s >> 40),
			byte(s >> 48),
			byte(s >> 56),
		}
	case BigEndian:
		return [Size]byte{
			byte(s >> 56),
			byte(s >> 48),
			byte(s >> 40),
			byte(s >> 32),
			byte(s >> 24),
			byte(s >> 16),
			byte(s >> 8),
			byte(s),
		}
	}
	panic("unknown byte order")
}

// Sum returns the CRC64 checksum of the data, in big-endian byte order.
func Sum(data []byte) [Size]byte {
	return SumWithByteOrder(data, BigEndian)
}

// SumWithByteOrder returns the CRC64 checksum of the data, in specified byte
// order.
func SumWithByteOrder(data []byte, byteOrder ByteOrder) [Size]byte {
	d := newDigest(byteOrder)
	_, _ = d.Write(data)
	return d.sumBytes()
}

The pages are generated with Golds v0.8.2. (GOOS=linux GOARCH=amd64)
Golds is a Go 101 project developed by Tapir Liu.
PR and bug reports are welcome and can be submitted to the issue list.
Please follow @zigo_101 (reachable from the left QR code) to get the latest news of Golds.