AltPMTrie

Type Members

type Branch = AltPMTrie.Branch[L, V, H]
type Database = PMTrie.Database[AltPMTrie.Node[L, V, H], H] with NodeHashing[AltPMTrie.Node[L, V, H], H]
type Extension = AltPMTrie.Extension[L, V, H]
type Node = AltPMTrie.Node[L, V, H]

Abstract Value Members

abstract val alphabet: IndexedSeq[L]

Definition Classes
AltPMTrie → Trie
abstract val earlyInit: (Database, H)
implicit abstract val hashTypeClassTag: ClassTag[H]
abstract def instantiateSuccessor(newRootHash: H): I

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

Attributes
protected

Concrete Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
val Branch: AltPMTrie.Branch.type
val EmptyHash: H

Definition Classes
AltPMTrie → PMTrie
val Extension: AltPMTrie.Extension.type
val RootHash: H

Definition Classes
AltPMTrie → PMTrie
def apply(key: IndexedSeq[L]): Option[V]

Definition Classes
AltPMTrie → Trie
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate() @throws( ... )
val db: Database
def dumpTrie: Unit
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def excluding(key: IndexedSeq[L]): I

Definition Classes
AltPMTrie → Trie
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
Annotations
@HotSpotIntrinsicCandidate()
def hash(node: Node): H

Definition Classes
AltPMTrie → Regular
def hashCode(): Int

Definition Classes
AnyRef → Any
Annotations
@HotSpotIntrinsicCandidate()
def including(key: IndexedSeq[L], value: V): I

Definition Classes
AltPMTrie → Trie
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate()
final def notifyAll(): Unit

Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate()
def pathAsString(key: IndexedSeq[L]): String
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Deprecated Value Members

def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@Deprecated @deprecated @throws( classOf[java.lang.Throwable] )
Deprecated
(Since version ) see corresponding Javadoc for more information.

Related Docs: object AltPMTrie | package trie

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

Type Members

type Branch = AltPMTrie.Branch[L, V, H]

type Database = PMTrie.Database[AltPMTrie.Node[L, V, H], H] with NodeHashing[AltPMTrie.Node[L, V, H], H]

type Extension = AltPMTrie.Extension[L, V, H]

type Node = AltPMTrie.Node[L, V, H]

Abstract Value Members

abstract val alphabet: IndexedSeq[L]

abstract val earlyInit: (Database, H)

implicit abstract val hashTypeClassTag: ClassTag[H]

abstract def instantiateSuccessor(newRootHash: H): I

Concrete Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

val Branch: AltPMTrie.Branch.type

val EmptyHash: H

val Extension: AltPMTrie.Extension.type

val RootHash: H

def apply(key: IndexedSeq[L]): 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: IndexedSeq[L]): I

final def getClass(): Class[_]

def hash(node: Node): H

def hashCode(): Int

def including(key: IndexedSeq[L], value: V): I

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def pathAsString(key: IndexedSeq[L]): String

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

Deprecated Value Members

def finalize(): Unit

Inherited from Regular[AltPMTrie.Node[L, V, H], H]

Inherited from PMTrie[L, V, H, I]

Inherited from Trie[L, V, I]

Inherited from AnyRef

Inherited from Any

Ungrouped