Skip to content

stdlib/storageView source ↗

storage

20 items · generated by scribe fromstdlib/storage.fd· synced 2026-11-15

stdlib/storage20 items

Contents

MerkleTree

A Merkle tree — uses parallel arrays for node data.

pub struct MerkleTree {

Fields:

NameType
hashesVec<i64>
left_childrenVec<i64>
right_childrenVec<i64>
is_leaf_flagsVec<i64>
leaf_dataVec<i64>
leavesVec<i64>
root_indexi64
node_counti64

Defined at line 84


merkle_tree_new

Create a new empty Merkle tree.

pub fn merkle_tree_new() -> MerkleTree {

Returns: MerkleTree

Defined at line 103


merkle_tree_add

Add a data leaf to the tree. Must call merkle_tree_build() after adding all leaves to compute the root.

pub fn merkle_tree_add(tree: & mut MerkleTree, data: str) -> i64 {

Parameters:

  • tree: & mut MerkleTree
  • data: str

Returns: i64

Defined at line 121


merkle_tree_build

Build the tree from leaves and compute the root. Must be called after adding all leaves.

pub fn merkle_tree_build(tree: & mut MerkleTree) -> i64 {

Parameters:

  • tree: & mut MerkleTree

Returns: i64

Defined at line 151


merkle_tree_root

Get the root hash of the tree. Returns empty Vec if tree is empty.

pub fn merkle_tree_root(tree: MerkleTree) -> Vec<i64> {

Parameters:

  • tree: MerkleTree

Returns: Vec<i64>

Defined at line 193


merkle_tree_root_hex

Get the root hash as a hex string.

pub fn merkle_tree_root_hex(tree: MerkleTree) -> str {

Parameters:

  • tree: MerkleTree

Returns: str

Defined at line 201


merkle_tree_leaf_count

Get the number of leaves in the tree.

pub fn merkle_tree_leaf_count(tree: MerkleTree) -> i64 {

Parameters:

  • tree: MerkleTree

Returns: i64

Defined at line 210


merkle_tree_verify_data

Verify that a piece of data is in the tree by recomputing its hash and checking against leaf hashes.

pub fn merkle_tree_verify_data(tree: MerkleTree, data: str) -> bool {

Parameters:

  • tree: MerkleTree
  • data: str

Returns: bool

Defined at line 216


KVEntry

A key-value entry.

pub struct KVEntry {

Fields:

NameType
keystr
valuei64

Defined at line 240


KVStore

A simple key-value store.

pub struct KVStore {

Fields:

NameType
keysVec<str>
valuesVec<i64>
counti64

Defined at line 246


kv_store_new

Create a new empty KV store.

pub fn kv_store_new() -> KVStore {

Returns: KVStore

Defined at line 253


kv_store_set

Set a key-value pair. If key exists, updates the value.

pub fn kv_store_set(store: & mut KVStore, key: str, value: i64) -> void {

Parameters:

  • store: & mut KVStore
  • key: str
  • value: i64

Returns: void

Defined at line 260


kv_store_get

Get a value by key. Returns -1 if key not found.

pub fn kv_store_get(store: KVStore, key: str) -> i64 {

Parameters:

  • store: KVStore
  • key: str

Returns: i64

Defined at line 273


kv_store_has

Check if a key exists.

pub fn kv_store_has(store: KVStore, key: str) -> bool {

Parameters:

  • store: KVStore
  • key: str

Returns: bool

Defined at line 283


kv_store_delete

Delete a key. Returns true if key was found and deleted.

pub fn kv_store_delete(store: & mut KVStore, key: str) -> bool {

Parameters:

  • store: & mut KVStore
  • key: str

Returns: bool

Defined at line 293


kv_store_count

Get the number of entries.

pub fn kv_store_count(store: KVStore) -> i64 {

Parameters:

  • store: KVStore

Returns: i64

Defined at line 313


kv_store_state_hash

Compute a hash of all key-value pairs (for state root verification).

pub fn kv_store_state_hash(store: KVStore) -> Vec<i64> {

Parameters:

  • store: KVStore

Returns: Vec<i64>

Defined at line 318


Generated by scribe, the Fides documentation generator