Data.Trie.Rooted

Documentation

data Rooted t a

Constructors

Rooted (Maybe a) [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

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

set :: Eq t => [t] -> a -> Rooted t a -> Rooted t a

Strictly constructive form of Data.Trie.Pseudo.assign

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

Disjoint cases just merge children to common root