Struct near_store::Trie

pub struct Trie {
    pub counter: TouchedNodesCounter,
    // some fields omitted
}

Fields

counter: TouchedNodesCounter

Implementations

impl Trie

pub fn get_trie_nodes_for_part(
    &self,
    part_id: u64,
    num_parts: u64,
    state_root: &StateRoot
) -> Result<PartialState, StorageError>

Computes the set of trie nodes for a state part.

Panics

storage must be a TrieCachingStorage part_id must be in [0..num_parts)

Errors

StorageError if the storage is corrupted

pub fn validate_trie_nodes_for_part(
    state_root: &StateRoot,
    part_id: u64,
    num_parts: u64,
    trie_nodes: PartialState
) -> Result<(), StorageError>

Validate state part

Panics

part_id must be in [0..num_parts)

Errors

StorageError::TrieNodeWithMissing if some nodes are missing

pub fn apply_state_part(
    state_root: &StateRoot,
    part_id: u64,
    num_parts: u64,
    part: Vec<Vec<u8>>
) -> Result<TrieChanges, StorageError>

Returns the storage changes for the state part. Writing all storage changes gives the complete trie.

pub fn get_memory_usage_from_serialized(
    bytes: &Vec<u8>
) -> Result<u64, StorageError>

impl Trie

pub fn new(store: Box<dyn TrieStorage>, _shard_id: ShardId) -> Self

pub fn recording_reads(&self) -> Self

pub fn empty_root() -> StateRoot

pub fn recorded_storage(&self) -> Option<PartialStorage>

pub fn from_recorded_storage(partial_storage: PartialStorage) -> Self

pub fn retrieve_root_node(
    &self,
    root: &StateRoot
) -> Result<StateRootNode, StorageError>

pub fn get_ref(
    &self,
    root: &CryptoHash,
    key: &[u8]
) -> Result<Option<(u32, CryptoHash)>, StorageError>

pub fn get(
    &self,
    root: &CryptoHash,
    key: &[u8]
) -> Result<Option<Vec<u8>>, StorageError>

pub fn update<I>(
    &self,
    root: &CryptoHash,
    changes: I
) -> Result<TrieChanges, StorageError> where
    I: Iterator<Item = (Vec<u8>, Option<Vec<u8>>)>, 

pub fn iter<'a>(
    &'a self,
    root: &CryptoHash
) -> Result<TrieIterator<'a>, StorageError>