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
Known Subclasses
Ordering
- Alphabetic
- By Inheritance
Inherited
- EthStylePMTrie
- Regular
- PMTrie
- Trie
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Type Members
- type Branch = EthStylePMTrie.Branch[L, V, H]
- type Database = PMTrie.Database[EthStylePMTrie.Node[L, V, H], H] with NodeHashing[EthStylePMTrie.Node[L, V, H], H]
- type Extension = EthStylePMTrie.Extension[L, V, H]
- type Leaf = EthStylePMTrie.Leaf[L, V, H]
- type Node = EthStylePMTrie.Node[L, V, H]
- sealed trait Path extends AnyRef
- type Subkey = IndexedSeq[L]
Abstract Value Members
-
abstract
val
alphabet: IndexedSeq[L]
- Definition Classes
- EthStylePMTrie → Trie
- abstract val earlyInit: (Database, H)
Concrete Value Members
- val Branch: EthStylePMTrie.Branch.type
- val Empty: EthStylePMTrie.Empty.type
- lazy val EmptyBranchChildren: IndexedSeq[H]
-
val
EmptyHash: H
- Definition Classes
- EthStylePMTrie → PMTrie
- val EmptySubkey: IndexedSeq[L]
- val Extension: EthStylePMTrie.Extension.type
- val Leaf: EthStylePMTrie.Leaf.type
-
val
RootHash: H
- Definition Classes
- EthStylePMTrie → PMTrie
- lazy val RootNode: EthStylePMTrie.Node[L, V, H]
- lazy val alphabetLen: Int
-
def
apply(key: Subkey): Option[V]
- Definition Classes
- EthStylePMTrie → Trie
- val db: Database
- def dumpTrie: Unit
-
def
excluding(key: Subkey): I
- Definition Classes
- EthStylePMTrie → Trie
-
def
hash(node: Node): H
- Definition Classes
- EthStylePMTrie → Regular
-
def
including(key: Subkey, value: V): I
- Definition Classes
- EthStylePMTrie → Trie
- def path(key: Subkey): Path
- val self: I
- def subkeys(branch: Branch): Seq[L]
- object Path