Packages

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

Linear Supertypes
Regular[AltPMTrie.Node[L, V, H], H], PMTrie[L, V, H, I], Trie[L, V, I], AnyRef, Any
Known Subclasses
AltLowercaseTrie
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. AltPMTrie
  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 = AltPMTrie.Branch[L, V, H]
  2. type Database = PMTrie.Database[AltPMTrie.Node[L, V, H], H] with NodeHashing[AltPMTrie.Node[L, V, H], H]
  3. type Extension = AltPMTrie.Extension[L, V, H]
  4. type Node = AltPMTrie.Node[L, V, H]

Abstract Value Members

  1. abstract val alphabet: IndexedSeq[L]
    Definition Classes
    AltPMTrie → Trie
  2. abstract val earlyInit: (Database, H)
  3. implicit abstract val hashTypeClassTag: ClassTag[H]
  4. 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

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. val Branch: AltPMTrie.Branch.type
  5. val EmptyHash: H
    Definition Classes
    AltPMTrie → PMTrie
  6. val Extension: AltPMTrie.Extension.type
  7. val RootHash: H
    Definition Classes
    AltPMTrie → PMTrie
  8. def apply(key: IndexedSeq[L]): Option[V]
    Definition Classes
    AltPMTrie → Trie
  9. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  10. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native() @HotSpotIntrinsicCandidate()
  11. val db: Database
  12. def dumpTrie: Unit
  13. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  14. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  15. def excluding(key: IndexedSeq[L]): I
    Definition Classes
    AltPMTrie → Trie
  16. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  17. def hash(node: Node): H
    Definition Classes
    AltPMTrie → Regular
  18. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  19. def including(key: IndexedSeq[L], value: V): I
    Definition Classes
    AltPMTrie → Trie
  20. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  21. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  22. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  23. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  24. def pathAsString(key: IndexedSeq[L]): String
  25. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  26. def toString(): String
    Definition Classes
    AnyRef → Any
  27. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  28. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  29. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] ) @Deprecated
    Deprecated

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