Data.Trie

MkTrie : (node : These b (SortedMap a (Trie a b))) -> Trie a b

record Trie a b

a

 

b

 

MkTrie : (node : These b (SortedMap a (Trie a b))) -> Trie a b

node : (rec : Trie a b) -> These b (SortedMap a (Trie a b))

empty : Ord a => Trie a b

foldWithKeysM : Ord a => Monad m => Monoid c => (List a -> m c) -> (List a -> b -> m c) -> Trie a b -> m c

fromList : Ord a => List (List a, b) -> Trie a b

insert : Ord a => List a -> b -> Trie a b -> Trie a b

insertWith : Ord a => List a -> (Maybe b -> b) -> Trie a b -> Trie a b

lookup : Ord a => List a -> Trie a b -> Maybe (These b (SortedMap a (Trie a b)))

lookupTrie : Ord a => a -> Trie a b -> Maybe (Trie a b)

lookupTries : Ord a => List a -> Trie a b -> Maybe (SortedMap a (Trie a b))

lookupValue : Ord a => List a -> Trie a b -> Maybe b

mapSingleton : Ord a => a -> b -> SortedMap a b

singleton : Ord a => List a -> b -> Trie a b