TODO simplify node

Cursor represents an iterator that can traverse over all key/value pairs in a tree in hash sorted order. Cursors can be obtained from a tree and are v

All changes are reported of this type, deleted, modified, inserted

This structure is used to prove existence/non-existence of a key

Snapshot are used to access any arbitrary snapshot of entire database at any point in time snapshot refers to collective state of all trees + data

Store is the backend which is used to store the data in serialized form to disk. The data is stored in files in split format and total number of files

Tree structure which is the end result, TODO: tree does not cache anything currently, just caching the top level tree entries, will increase the speed

import "sync" import "encoding/binary" import "golang.org/x/xerrors" Cursor represents an iterator that can traverse over all key/value pairs in a tre

used to test certain code paths, which though can be avoid now but may arise when code is maintained, developed, rewritten over a period of time

all file operations will go through this If this is implemented through an interface, it will trigger memory allocations on heap this crude implementa

TODO optimize these structures for less RAM/DISK

all gets go through value checks