pseudo-trie-0.0.3: A tagged rose-tree with short circuited unique leaves
Data.Trie.Rooted
Synopsis
data Rooted t a Source
Constructors
Instances
Intersection instance
Union instance
set :: Eq t => [t] -> a -> Rooted t a -> Rooted t a Source
Strictly constructive form of Data.Trie.Pseudo.assign
Data.Trie.Pseudo.assign
unionWith :: Eq t => (a -> a -> a) -> Rooted t a -> Rooted t a -> Rooted t a Source
Disjoint cases just merge children to common root