Data.Trie.Rooted

Documentation

data Rooted t a

Constructors

Rooted

Fields

root :: Maybe a

children :: [PseudoTrie t a]

Instances

Functor (Rooted t)

Eq t => Applicative (Rooted t)

Intersection instance

(Eq t, Eq a) => Eq (Rooted t a)

(Show t, Show a) => Show (Rooted t a)

(Eq t, Monoid a) => Monoid (Rooted t a)

Union instance

newtype MergeRooted t a

Constructors

MergeRooted

Fields

unMergeRooted :: Rooted t a

Instances

Functor (MergeRooted t)

Eq t => Monoid (MergeRooted t a)

assign :: Eq t => [t] -> Maybe a -> Rooted t a -> Rooted t a

Strictly constructive form of Data.Trie.Pseudo.assign

lookup :: Eq t => [t] -> Rooted t a -> Maybe a

merge :: Eq t => Rooted t a -> Rooted t a -> Rooted t a

unionWith :: Eq t => (a -> a -> a) -> Rooted t a -> Rooted t a -> Rooted t a

Disjoint cases just pull children to common root