Function _augHash

mtree/aug_mt.go:81–97

(a, b NodeData)

}

func _augHash(a, b NodeData) NodeData {
	left := a.(AugData)
	right := b.(AugData)
	h := smartpool.SPHash{}
	keccak := crypto.Keccak256(
		left.CounterBytes(),
		append([]byte{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, left.Hash[:]...),
		right.CounterBytes(),
		append([]byte{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, right.Hash[:]...),
	)
	copy(h[:smartpool.HashLength], keccak[smartpool.HashLength:])
	return AugData{
		Min:  _min(left.Min, right.Min),
		Max:  _max(left.Max, right.Max),
		Hash: h,
	}
}

func NewAugTree() *AugTree {
	mtbuf := list.New()