commit a single tree at a time

decode findex,fpos

Get a specific value associated with a specific key hash TODO, this api should not be exposed

insert a node recursively till it gets inserted at the correct position

these will enable processing of all bits collective from MSB to LSB

delete a specific key from the tree

we only have a keyhash and need to get both the key,value

we have a key and need to get both the key,value

Gets the snapshot version number

this function will export the tree to a dor graph file to understand any issues

estimate number of keys that exist in the tree very crude but only used for use display

minimum size is 3 bytes

Random returns a random key,value from the tree, provided a tree has keys the following are limitations a tree containing 0 key, value pairs will retu

sets a root for the cursor, so the cursor visits only a specific prefix keys

this file contains some functions ( to extend read-only api). these apis are used in the dero blockchain.

makes sure only dirty trees are committed

makes sure only dirty trees are committed

a rare case is tested

this creates a persistant store in tmp dir then commits and does a number of tests the closes the store and reopens and does all the tests again

this test various cursor related code

this test various cursor related code

this test various cursor related code this test uses hard coded values based on hash, chnaging the hash will cause this test to fails NOTE: this test

this test various diffing related code

this test various cursor diff related code

this test various diff related codes tree needs to be a particuar case, as some paths are hardcoded and manually triggered

* func TestIwriteVersionData(t *testing.T) { store, err := NewMemStore() require.NoError(t, err) store.versionrootfile.Close() require.Error(t, st

this creates a persistant store in tmp dir then commits and does a number of tests the closes the store and reopens and does all the tests again

these cannot be generated using exported api

this tests the version tree dag this loading of versions and whether they can be accessed and then moved forward

* func (in *inner) clean_hash(store *Store) { //marks an entire tree as dirty, inclusing leaves, causes to load entiire tree to ram if in.loaded_par

this tests various treename entry points