Skip to content
ratranqu edited this page Apr 7, 2021 · 4 revisions

Types

  • InMemoryNodeStorage
  • InMemoryNode
  • InMemoryNode.NodeType.CodingKeys
  • IAVLErrors
  • LazyBox
  • ProofLeafNode
  • Side
  • ProofInnerNode
  • AbsenceOp
  • ValueOp
  • PathWithLeaf
  • PathToLeaf1: PathToLeaf represents an inner path to a leaf node. Note that the nodes are ordered such that the last one is closest to the root of the tree.
  • RangeProof
  • ImmutableTree: The ImmutableTree implementation aims to mimic the equivalent Go ImmutableTree. However, the design we implement ere is such that we have encapsulated the storage and access to the nodes into the NodeStorageProtocol. Therefore, any loading, saving, deleting, managing of cache, memory and such is expected to be handled and delegated to the storage implementation itself. We are providing this struct because as part of the design process, it was implemented before eventually being carved out in favour of the NodeStorageProtocol and the NodeProtocol. As it may be useful as part of the coming development of future CosmosSwift milestones, we keep it as suc for now, albeit as part of the Legacy module. This tree is not thread safe.
  • MutableTree: The MutableTree implementation aims to mimic the equivalent Go MutableTree. However, the design we implement ere is such that we have encapsulated the storage and access to the nodes into the NodeStorageProtocol. Therefore, any loading, saving, deleting, managing of cache, memory and such is expected to be handled and delegated to the storage implementation itself. We are providing this struct because as part of the design process, it was implemented before eventually being carved out in favour of the NodeStorageProtocol and the NodeProtocol. As it may be useful as part of the coming development of future CosmosSwift milestones, we keep it as suc for now, albeit as part of the Legacy module.
  • NodeKey

Protocols

Global Typealiases

  • PathToLeaf: PathToLeaf represents an inner path to a leaf node. Note that the nodes are ordered such that the last one is closest to the root of the tree.