stdlib/storageView source ↗
storage
20 items · generated by scribe fromstdlib/storage.fd· synced 2026-11-15
Contents
- MerkleTree (struct)
- merkle_tree_new (function)
- merkle_tree_add (function)
- merkle_tree_build (function)
- merkle_tree_root (function)
- merkle_tree_root_hex (function)
- merkle_tree_leaf_count (function)
- merkle_tree_verify_data (function)
- KVEntry (struct)
- KVStore (struct)
- kv_store_new (function)
- kv_store_set (function)
- kv_store_get (function)
- kv_store_has (function)
- kv_store_delete (function)
- kv_store_count (function)
- kv_store_state_hash (function)
MerkleTree
A Merkle tree — uses parallel arrays for node data.
pub struct MerkleTree {Fields:
| Name | Type |
|---|---|
hashes | Vec<i64> |
left_children | Vec<i64> |
right_children | Vec<i64> |
is_leaf_flags | Vec<i64> |
leaf_data | Vec<i64> |
leaves | Vec<i64> |
root_index | i64 |
node_count | i64 |
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 MerkleTreedata: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:MerkleTreedata:str
Returns: bool
Defined at line 216
KVEntry
A key-value entry.
pub struct KVEntry {Fields:
| Name | Type |
|---|---|
key | str |
value | i64 |
Defined at line 240
KVStore
A simple key-value store.
pub struct KVStore {Fields:
| Name | Type |
|---|---|
keys | Vec<str> |
values | Vec<i64> |
count | i64 |
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 KVStorekey:strvalue: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:KVStorekey: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:KVStorekey: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 KVStorekey: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