Agda-2.2.10: A dependently typed functional programming language and proof assistantSource codeContentsIndex
Agda.Utils.Trie
Synopsis
data Trie k v
empty :: Trie k v
singleton :: [k] -> v -> Trie k v
insert :: Ord k => [k] -> v -> Trie k v -> Trie k v
lookupPath :: Ord k => [k] -> Trie k v -> [v]
union :: Ord k => Trie k v -> Trie k v -> Trie k v
Documentation
data Trie k v Source
empty :: Trie k vSource
singleton :: [k] -> v -> Trie k vSource
insert :: Ord k => [k] -> v -> Trie k v -> Trie k vSource
lookupPath :: Ord k => [k] -> Trie k v -> [v]Source
union :: Ord k => Trie k v -> Trie k v -> Trie k vSource
Left biased union.
Produced by Haddock version 2.6.1