hashtree

package
v1.37.3 Latest Latest
Warning

This package is not in the latest version of its module.

 Go to latest Published: May 11, 2026 License: BSD-3-Clause Imports: 8 Imported by: 0

Documentation

Index

Constants

View Source 
const DigestLength int = 16

Variables

View Source 
var (
	ErrIllegalArguments = errors.New("illegal arguments")
	ErrIllegalState     = errors.New("illegal state")
)
View Source 
var ErrNoMoreRanges = errors.New("no more ranges")

Functions

func InnerNodesCount added in v1.28.5 

func InnerNodesCount(height int) int

func LeavesCount 

func LeavesCount(height int) int

func NodesCount 

func NodesCount(height int) int

Types

type AggregatedHashTree 

type AggregatedHashTree interface {
	Height() int
	AggregateLeafWith(i uint64, val []byte) error
	Sync()
	Root() Digest
	Level(level int, discriminant *Bitset, digests []Digest) (n int, err error)
	Reset()
	Clone() AggregatedHashTree

	Diff(ht AggregatedHashTree) (discriminant *Bitset, err error)

	NewRangeReader(discriminant *Bitset) (AggregatedHashTreeRangeReader, error)

	Serialize(w io.Writer) (n int64, err error)
}

type AggregatedHashTreeRangeReader 

type AggregatedHashTreeRangeReader interface {
	Next() (uint64, uint64, error)
}

type Bitset 

type Bitset struct {
	// contains filtered or unexported fields
}

func LevelDiff 

func LevelDiff(l, height int, discriminant *Bitset, digests1, digests2 []Digest) (nextDiscriminant *Bitset, levelDiffCount int, err error)

LevelDiff compares level-l digests1 and digests2, clearing matched bits in discriminant. For l < height it returns a level-(l+1) discriminant with the children of mismatched nodes set; at l == height it returns nil.

func NewBitset 

func NewBitset(size int) *Bitset

func (*Bitset) AllSet 

func (bset *Bitset) AllSet() bool

func (*Bitset) Clone 

func (bset *Bitset) Clone() *Bitset

func (*Bitset) IsSet 

func (bset *Bitset) IsSet(i int) bool

func (*Bitset) Marshal 

func (bset *Bitset) Marshal() ([]byte, error)

func (*Bitset) Reset 

func (bset *Bitset) Reset() *Bitset

func (*Bitset) Set 

func (bset *Bitset) Set(i int) *Bitset

func (*Bitset) SetAll 

func (bset *Bitset) SetAll() *Bitset

func (*Bitset) SetCount 

func (bset *Bitset) SetCount() int

func (*Bitset) Size 

func (bset *Bitset) Size() int

func (*Bitset) Unmarshal 

func (bset *Bitset) Unmarshal(b []byte) error

func (*Bitset) Unset 

func (bset *Bitset) Unset(i int) *Bitset

type CompactHashTree 

type CompactHashTree struct {
	// contains filtered or unexported fields
}

func DeserializeCompactHashTree 

func DeserializeCompactHashTree(r io.Reader) (*CompactHashTree, error)

func NewCompactHashTree 

func NewCompactHashTree(capacity uint64, maxHeight int) (*CompactHashTree, error)

func (*CompactHashTree) AggregateLeafWith 

func (ht *CompactHashTree) AggregateLeafWith(i uint64, val []byte) error

AggregateLeafWith aggregates a new value into a shared leaf Each compacted leaf is shared by a number of consecutive leaves

func (*CompactHashTree) Capacity 

func (ht *CompactHashTree) Capacity() uint64

func (*CompactHashTree) Clone 

func (ht *CompactHashTree) Clone() AggregatedHashTree

func (*CompactHashTree) Diff 

func (ht *CompactHashTree) Diff(ht2 AggregatedHashTree) (*Bitset, error)

func (*CompactHashTree) Height 

func (ht *CompactHashTree) Height() int

func (*CompactHashTree) Level 

func (ht *CompactHashTree) Level(level int, discriminant *Bitset, digests []Digest) (n int, err error)

func (*CompactHashTree) NewRangeReader 

func (ht *CompactHashTree) NewRangeReader(discriminant *Bitset) (AggregatedHashTreeRangeReader, error)

func (*CompactHashTree) Reset 

func (ht *CompactHashTree) Reset()

func (*CompactHashTree) Root 

func (ht *CompactHashTree) Root() Digest

func (*CompactHashTree) Serialize 

func (ht *CompactHashTree) Serialize(w io.Writer) (n int64, err error)

func (*CompactHashTree) Sync 

func (ht *CompactHashTree) Sync()

type CompactHashTreeDiffReader 

type CompactHashTreeDiffReader struct {
	// contains filtered or unexported fields
}

func (*CompactHashTreeDiffReader) Next 

func (r *CompactHashTreeDiffReader) Next() (uint64, uint64, error)

type Digest 

type Digest [2]uint64

func (*Digest) MarshalBinary 

func (d *Digest) MarshalBinary() ([]byte, error)

func (*Digest) MarshalJSON 

func (d *Digest) MarshalJSON() ([]byte, error)

func (*Digest) UnmarshalBinary 

func (d *Digest) UnmarshalBinary(bs []byte) error

func (*Digest) UnmarshalJSON 

func (d *Digest) UnmarshalJSON(b []byte) error

type HashTree 

type HashTree struct {
	// contains filtered or unexported fields
}

HashTree is a fixed-size hash tree with leaf aggregation and partial root recalculation.

func DeserializeHashTree 

func DeserializeHashTree(r io.Reader) (*HashTree, error)

func NewHashTree 

func NewHashTree(height int) (*HashTree, error)

func (*HashTree) AggregateLeafWith 

func (ht *HashTree) AggregateLeafWith(i uint64, val []byte) error

func (*HashTree) Clone 

func (ht *HashTree) Clone() AggregatedHashTree

func (*HashTree) Diff 

func (ht *HashTree) Diff(ht2 AggregatedHashTree) (*Bitset, error)

Diff returns a leaf-level discriminant; bit i is set when leaf i differs.

func (*HashTree) Height 

func (ht *HashTree) Height() int

func (*HashTree) Level 

func (ht *HashTree) Level(level int, discriminant *Bitset, digests []Digest) (n int, err error)

Level returns digests for nodes selected by discriminant, which is level-local: Size() must equal nodesAtLevel(level), bit i selects node i.

func (*HashTree) NewRangeReader 

func (ht *HashTree) NewRangeReader(discriminant *Bitset) (AggregatedHashTreeRangeReader, error)

NewRangeReader expects a leaf-level discriminant (Size() == LeavesCount(ht.Height())); bit i indicates leaf i differs.

func (*HashTree) Reset 

func (ht *HashTree) Reset()

func (*HashTree) Root 

func (ht *HashTree) Root() Digest

func (*HashTree) Serialize 

func (ht *HashTree) Serialize(w io.Writer) (n int64, err error)

func (*HashTree) Sync 

func (ht *HashTree) Sync()

type HashTreeDiffReader 

type HashTreeDiffReader struct {
	// contains filtered or unexported fields
}

func (*HashTreeDiffReader) Next 

func (r *HashTreeDiffReader) Next() (uint64, uint64, error)

Source Files

View all Source files

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL
go.dev uses cookies from Google to deliver and enhance the quality of its services and to analyze traffic. Learn more.