tree

type Data interface {
	// New creates a new instance, of the same concrete type, initialized to the default/empty state.
	New() Data
	// Clone creates an exact copy using the current instance as a prototype.
	Clone() Data
	// Insert a new transaction reference.
	Insert(ref hash.SHA256Hash)
	// Delete a transaction reference.
	Delete(ref hash.SHA256Hash)
	// Add other Data to this one. Returns an error if the underlying datastructures are incompatible.
	Add(other Data) error
	// Subtract other Data from this one. Returns an error if the underlying datastructures are incompatible.
	Subtract(other Data) error
	// Empty returns true if the concrete type is in its default/empty state.
	Empty() bool
	encoding.BinaryMarshaler
	encoding.BinaryUnmarshaler
}

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

type Tree interface {
	// Insert a transaction reference at the specified clock value.
	// The result of inserting the same ref multiple times is undefined.
	Insert(ref hash.SHA256Hash, clock uint32)
	// Delete a transaction reference without checking if ref is in the Tree
	Delete(ref hash.SHA256Hash, clock uint32)
	// Root returns the accumulated Data for the entire tree
	Root() Data
	// ZeroTo returns the LC value closest to the requested clock value together with Data of the same leaf/page.
	// The LC value closest to requested clock is defined as the lowest of:
	// 	- highest LC known to the Tree
	// 	- highest LC of the leaf that clock is on: ceil(clock/leafSize)*leafSize - 1
	ZeroTo(clock uint32) (Data, uint32)
	// DropLeaves shrinks the tree by dropping all leaves. The parent of a leaf will become the new leaf.
	DropLeaves()
	// Updates return the leaves that have been orphaned or updated since the last call to ResetUpdate.
	// dirty and orphaned are mutually exclusive.
	Updates() (dirty map[uint32][]byte, orphaned []uint32)
	// ResetUpdates forgets all currently tracked changes.
	ResetUpdates()
	// Load builds a tree from binary leaf data. The keys in leaves correspond to a node's split value.
	// All consecutive leaves must be present. Gaps must be filled with zero value of the corresponding Data implementation.
	Load(leaves map[uint32][]byte) error
	// Replace replaces the Data at the leaf starting with the given clock value with the given Data.
	// It adds the leaf to the dirtyLeaves map.
	Replace(clock uint32, data Data) error
}

type Xor hash.SHA256Hash