merkel v1.0.3 Merkel
Essentially a driver module but allows for the decoupled addition of e.g. new tree types and/or other proof types.
Link to this section Summary
Link to this section Functions
Link to this function
audit(t, key)
audit(Merkel.BinaryHashTree.t(), Merkel.BinaryHashTree.key()) :: Merkel.Audit.t()
Link to this function
delete(t, key)
delete(Merkel.BinaryHashTree.t(), Merkel.BinaryHashTree.key()) :: Merkel.BinaryHashTree.t()
Link to this function
insert(t, arg)
insert(Merkel.BinaryHashTree.t(), Merkel.BinaryHashTree.pair()) :: Merkel.BinaryHashTree.t()
Link to this function
lookup(t, key)
lookup(Merkel.BinaryHashTree.t(), Merkel.BinaryHashTree.key()) :: tuple()
Link to this function
new()
Link to this function
store(t, path)
store(Merkel.BinaryHashTree.t(), binary()) :: :ok | no_return()