EthStylePMTrie

abstract val alphabet: IndexedSeq[L]

abstract val earlyInit: (Database, H)

abstract def instantiateSuccessor(newRootHash: H): I

all nodes in the updated path will already have been persisted before this method is called.

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

val Branch: EthStylePMTrie.Branch.type

val Empty: EthStylePMTrie.Empty.type

lazy val EmptyBranchChildren: IndexedSeq[H]

val EmptyHash: H

val EmptySubkey: IndexedSeq[L]

val Extension: EthStylePMTrie.Extension.type

val Leaf: EthStylePMTrie.Leaf.type

object Path

val RootHash: H

lazy val RootNode: EthStylePMTrie.Node[L, V, H]

lazy val alphabetLen: Int

def apply(key: Subkey): Option[V]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

val db: Database

def dumpTrie: Unit

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def excluding(key: Subkey): I

final def getClass(): Class[_]

def hash(node: Node): H

def hashCode(): Int

def including(key: Subkey, value: V): I

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def path(key: Subkey): Path

val self: I

def subkeys(branch: Branch): Seq[L]

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

final def wait(): Unit

def finalize(): Unit