Cryptol.REPL.Trie

Documentation

data Trie a

Maps string names to values, allowing for partial key matches and querying.

Constructors

Node (Map Char (Trie a)) (Maybe a)

Instances

Show a => Show (Trie a)

Defined in Cryptol.REPL.Trie

Methods

showsPrec :: Int -> Trie a -> ShowS

show :: Trie a -> String

showList :: [Trie a] -> ShowS

emptyTrie :: Trie a

insertTrie :: String -> a -> Trie a -> Trie a

Insert a value into the Trie, forcing the key value to lower case. Will call panic if a value already exists with that key.

lookupTrie :: String -> Trie a -> [a]

Return all matches with the given prefix.

lookupTrieExact :: String -> Trie a -> [a]

Given a key, return either an exact match for that key, or all matches with the given prefix.

leaves :: Trie a -> [a]

Return all of the values from a Trie.