NLP.Adict.Trie

Documentation

type TrieD a b = Trie a (Maybe b)

data Trie a b

Constructors

Trie

Fields

valueIn :: b

edgeMap :: Map a (Trie a b)

Instances

Functor (Trie a)

(Eq a, Eq b) => Eq (Trie a b)

(Ord a, Ord b) => Ord (Trie a b)

(Show a, Show b) => Show (Trie a b)

(Ord a, Binary a, Binary b) => Binary (Trie a b)

unTrie :: Trie a b -> (b, [(a, Trie a b)])

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

anyChild :: Trie a b -> [(a, Trie a b)]

mkTrie :: Ord a => b -> [(a, Trie a b)] -> Trie a b

setValue :: b -> Trie a b -> Trie a b

substChild :: Ord a => a -> Trie a b -> Trie a b -> Trie a b

insert :: Ord a => [a] -> b -> TrieD a b -> TrieD a b

size :: Trie a b -> Int

follow :: Ord a => [a] -> Trie a b -> Maybe (Trie a b)

lookup :: Ord a => [a] -> TrieD a b -> Maybe b

fromLang :: Ord a => [[a]] -> TrieD a ()

fromList :: Ord a => [([a], b)] -> TrieD a b

toList :: TrieD a b -> [([a], b)]

serialize :: (Ord a, Ord b) => Trie a b -> [Node a b]

deserialize :: (Ord a, Ord b) => [Node a b] -> Trie a b

FIXME: Null node list case.

toDAWG :: (Ord a, Ord b) => Trie a b -> Trie a b