Packages

trait EthStylePMTrie[L, V, H, I <: EthStylePMTrie[L, V, H, I]] extends PMTrie[L, V, H, I] with Regular[Node[L, V, H], H]

Linear Supertypes
Regular[EthStylePMTrie.Node[L, V, H], H], PMTrie[L, V, H, I], Trie[L, V, I], AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. EthStylePMTrie
  2. Regular
  3. PMTrie
  4. Trie
  5. AnyRef
  6. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. type Branch = EthStylePMTrie.Branch[L, V, H]
  2. type Database = PMTrie.Database[EthStylePMTrie.Node[L, V, H], H] with NodeHashing[EthStylePMTrie.Node[L, V, H], H]
  3. type Extension = EthStylePMTrie.Extension[L, V, H]
  4. type Leaf = EthStylePMTrie.Leaf[L, V, H]
  5. type Node = EthStylePMTrie.Node[L, V, H]
  6. sealed trait Path extends AnyRef
  7. type Subkey = IndexedSeq[L]

Abstract Value Members

  1. abstract val alphabet: IndexedSeq[L]
    Definition Classes
    EthStylePMTrieTrie
  2. abstract val earlyInit: (Database, H)

Concrete Value Members

  1. val Branch: EthStylePMTrie.Branch.type
  2. val Empty: EthStylePMTrie.Empty.type
  3. lazy val EmptyBranchChildren: IndexedSeq[H]
  4. val EmptyHash: H
    Definition Classes
    EthStylePMTriePMTrie
  5. val EmptySubkey: IndexedSeq[L]
  6. val Extension: EthStylePMTrie.Extension.type
  7. val Leaf: EthStylePMTrie.Leaf.type
  8. val RootHash: H
    Definition Classes
    EthStylePMTriePMTrie
  9. lazy val RootNode: EthStylePMTrie.Node[L, V, H]
  10. lazy val alphabetLen: Int
  11. def apply(key: Subkey): Option[V]
    Definition Classes
    EthStylePMTrieTrie
  12. val db: Database
  13. def dumpTrie: Unit
  14. def excluding(key: Subkey): I
    Definition Classes
    EthStylePMTrieTrie
  15. def hash(node: Node): H
    Definition Classes
    EthStylePMTrieRegular
  16. def including(key: Subkey, value: V): I
    Definition Classes
    EthStylePMTrieTrie
  17. def path(key: Subkey): Path
  18. val self: I
  19. def subkeys(branch: Branch): Seq[L]
  20. object Path