types

type FullTreer interface {
	ReadTreer
	LeafWriter
	ReorganizeTreer
}

type Leaf struct {
	Index uint32
	Hash  common.Hash
}

type LeafWriter interface {
	PutLeaf(tx dbtypes.Txer, blockNum, blockPosition uint64, leaf Leaf) (common.Hash, error)
}

type Proof [DefaultHeight]common.Hash

type ReadTreer interface {
	GetRootByIndex(ctx context.Context, index uint32) (Root, error)
	GetRootByHash(ctx context.Context, hash common.Hash) (*Root, error)
	GetLastRoot(tx dbtypes.Querier) (Root, error)
	GetLeaf(tx dbtypes.Querier, index uint32, root common.Hash) (common.Hash, error)
	GetProof(ctx context.Context, index uint32, root common.Hash) (Proof, error)
}

type ReorganizeTreer interface {
	ReadTreer
	Reorg(tx dbtypes.Txer, firstReorgedBlock uint64) error
	BackwardToIndex(ctx context.Context, tx dbtypes.Txer, targetIndex uint32) error
}

type Root struct {
	Hash          common.Hash `meddler:"hash,hash"`
	Index         uint32      `meddler:"position"`
	BlockNum      uint64      `meddler:"block_num"`
	BlockPosition uint64      `meddler:"block_position"`
	// BlockHash is the hash of the block BlockNum, as stored by the syncer. It is not a column of
	// the tree, so the tree never fills it: only the syncer queries that serve a root with its block
	// hash (e.g. BridgeSync.GetRootByLER) set it, reading it in the same statement as the root.
	// Zero if that block has no hash, or when the root was read by any other query.
	BlockHash common.Hash `meddler:"-"`
}

type TreeNode struct {
	Hash  common.Hash `meddler:"hash,hash"`
	Left  common.Hash `meddler:"left,hash"`
	Right common.Hash `meddler:"right,hash"`
}