Class InMemoryTrie

Readonlynodes

getRootHash

• getRootHash(): OpaqueHash & WithOpaque<"trie">

  Returns OpaqueHash & WithOpaque<"trie">

getRootNode

• getRootNode(): TrieNode | null

  Returns TrieNode | null

remove

• remove(_: OpaqueHash & WithOpaque<"trieStateKey">): void

  Parameters

  • _: OpaqueHash & WithOpaque<"trieStateKey">

  Returns void

set

• set(
      key: InputKey,
      value: BytesBlob,
      maybeValueHash?: OpaqueHash & WithOpaque<"trieValue">,
  ): LeafNode

  Parameters

  • key: InputKey
  • value: BytesBlob
  • OptionalmaybeValueHash: OpaqueHash & WithOpaque<"trieValue">

  Returns LeafNode

toString

• toString(): string

  Returns string

StaticcomputeStateRoot

• computeStateRoot(
      hasher: TrieHasher,
      leaves: SortedSet<LeafNode>,
  ): OpaqueHash & WithOpaque<"trie">

  Given a collection of leaves, compute the state root.

  Parameters

  • hasher: TrieHasher
  • leaves: SortedSet<LeafNode>

  Returns OpaqueHash & WithOpaque<"trie">

StaticconstructLeaf

• constructLeaf(
      hasher: TrieHasher,
      key: InputKey,
      value: BytesBlob,
      maybeValueHash?: OpaqueHash & WithOpaque<"trieValue">,
  ): LeafNode

  Construct a LeafNode from given key and value.

  NOTE: for large value it WILL NOT be embedded in the leaf node, and should rather be stored separately.

  Parameters

  • hasher: TrieHasher
  • key: InputKey
  • value: BytesBlob
  • OptionalmaybeValueHash: OpaqueHash & WithOpaque<"trieValue">

  Returns LeafNode

Staticempty

• empty(hasher: TrieHasher): InMemoryTrie

  Create an empty in-memory trie.

  Parameters

  • hasher: TrieHasher

  Returns InMemoryTrie

StaticfromLeaves

• fromLeaves(hasher: TrieHasher, leaves: readonly LeafNode[]): InMemoryTrie

  Reconstruct the entire trie from it's leaves.

  Note that if only the state root is needed, this is rather inefficient.

  Parameters

  • hasher: TrieHasher
  • leaves: readonly LeafNode[]

  Returns InMemoryTrie