Documentation
¶
Index ¶
- func StoreConstructor(db dbm.DB, opts types.StoreOptions) types.CommitStore
- type Store
- func (st *Store) CacheWrap() types.Store
- func (st *Store) Commit() types.CommitID
- func (st *Store) Delete(key []byte)
- func (st *Store) Get(key []byte) (value []byte)
- func (st *Store) GetImmutable(version int64) (*Store, error)
- func (st *Store) GetStoreOptions() types.StoreOptions
- func (st *Store) Has(key []byte) (exists bool)
- func (st *Store) Iterator(start, end []byte) types.Iterator
- func (st *Store) LastCommitID() types.CommitID
- func (st *Store) LoadLatestVersion() error
- func (st *Store) LoadVersion(ver int64) error
- func (st *Store) Query(req abci.RequestQuery) (res abci.ResponseQuery)
- func (st *Store) ReverseIterator(start, end []byte) types.Iterator
- func (st *Store) Set(key, value []byte)
- func (st *Store) SetStoreOptions(opts2 types.StoreOptions)
- func (st *Store) VersionExists(version int64) bool
- func (st *Store) Write()
- type Tree
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
func StoreConstructor ¶
func StoreConstructor(db dbm.DB, opts types.StoreOptions) types.CommitStore
Implements store.CommitStoreConstructor.
Types ¶
type Store ¶
type Store struct {
// contains filtered or unexported fields
}
Store Implements types.Store and CommitStore.
func UnsafeNewStore ¶
func UnsafeNewStore(tree *iavl.MutableTree, opts types.StoreOptions) *Store
func (*Store) GetImmutable ¶
GetImmutable returns a reference to a new store backed by an immutable IAVL tree at a specific version (height) without any pruning options. This should be used for querying and iteration only. If the version does not exist or has been pruned, an error will be returned. Any mutable operations executed will result in a panic.
func (*Store) GetStoreOptions ¶
func (st *Store) GetStoreOptions() types.StoreOptions
Implements Committer.
func (*Store) Query ¶
func (st *Store) Query(req abci.RequestQuery) (res abci.ResponseQuery)
Query implements ABCI interface, allows queries
by default we will return from (latest height -1), as we will have merkle proofs immediately (header height = data height + 1) If latest-1 is not present, use latest (which must be present) if you care to have the latest data to see a tx results, you must explicitly set the height you want to see
func (*Store) ReverseIterator ¶
Implements types.Store.
func (*Store) SetStoreOptions ¶
func (st *Store) SetStoreOptions(opts2 types.StoreOptions)
Implements Committer.
func (*Store) VersionExists ¶
VersionExists returns whether or not a given version is stored.
type Tree ¶
type Tree interface {
Has(key []byte) bool
Get(key []byte) (index int64, value []byte)
Set(key, value []byte) bool
Remove(key []byte) ([]byte, bool)
SaveVersion() ([]byte, int64, error)
DeleteVersion(version int64) error
Version() int64
Hash() []byte
LatestVersion() int64
VersionExists(version int64) bool
GetVersioned(key []byte, version int64) (int64, []byte)
GetVersionedWithProof(key []byte, version int64) ([]byte, *iavl.RangeProof, error)
GetImmutable(version int64) (*iavl.ImmutableTree, error)
}
Tree defines an interface that both mutable and immutable IAVL trees must implement. For mutable IAVL trees, the interface is directly implemented by an iavl.MutableTree. For an immutable IAVL tree, a wrapper must be made.
Source Files