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]

Concrete Value Members

  1. val Branch: AltPMTrie.Branch.type
  2. val EmptyHash: H
    Definition Classes
    AltPMTrie → PMTrie
  3. val Extension: AltPMTrie.Extension.type
  4. val RootHash: H
    Definition Classes
    AltPMTrie → PMTrie
  5. def apply(key: IndexedSeq[L]): Option[V]
    Definition Classes
    AltPMTrie → Trie
  6. val db: Database
  7. def dumpTrie: Unit
  8. def excluding(key: IndexedSeq[L]): I
    Definition Classes
    AltPMTrie → Trie
  9. def hash(node: Node): H
    Definition Classes
    AltPMTrie → Regular
  10. def including(key: IndexedSeq[L], value: V): I
    Definition Classes
    AltPMTrie → Trie
  11. def pathAsString(key: IndexedSeq[L]): String