Versions in this module Expand all Collapse all v0 v0.1.0 Dec 10, 2018 Changes in this version + type IAVLNode struct + func MakeIAVLNode(buf []byte, t *IAVLTree) (node *IAVLNode, err error) + func NewIAVLNode(key []byte, value []byte) *IAVLNode + type IAVLProof struct + InnerNodes []IAVLProofInnerNode + LeafHash []byte + RootHash []byte + func ReadProof(data []byte) (*IAVLProof, error) + func (proof *IAVLProof) Root() []byte + func (proof *IAVLProof) Verify(key []byte, value []byte, root []byte) bool + type IAVLProofInnerNode struct + Height int8 + Left []byte + Right []byte + Size int + func (branch IAVLProofInnerNode) Hash(childHash []byte) []byte + type IAVLProofLeafNode struct + KeyBytes []byte + ValueBytes []byte + func (leaf IAVLProofLeafNode) Hash() []byte + type IAVLTree struct + func NewIAVLTree(cacheSize int, db dbm.DB) *IAVLTree + func (t *IAVLTree) BatchSet(key []byte, value []byte) + func (t *IAVLTree) ConstructProof(key []byte) (value []byte, proof *IAVLProof) + func (t *IAVLTree) Copy() merkle.Tree + func (t *IAVLTree) Get(key []byte) (index int, value []byte, exists bool) + func (t *IAVLTree) GetByIndex(index int) (key []byte, value []byte) + func (t *IAVLTree) Has(key []byte) bool + func (t *IAVLTree) Hash() []byte + func (t *IAVLTree) HashWithCount() ([]byte, int) + func (t *IAVLTree) Height() int8 + func (t *IAVLTree) Iterate(fn func(key []byte, value []byte) bool) (stopped bool) + func (t *IAVLTree) IterateRange(start, end []byte, ascending bool, fn func(key []byte, value []byte) bool) (stopped bool) + func (t *IAVLTree) Load(hash []byte) + func (t *IAVLTree) Proof(key []byte) (value []byte, proofBytes []byte, exists bool) + func (t *IAVLTree) Remove(key []byte) (value []byte, removed bool) + func (t *IAVLTree) Save() []byte + func (t *IAVLTree) Set(key []byte, value []byte) (updated bool) + func (t *IAVLTree) Size() int