Safe Haskell | None |
---|---|
Language | Haskell2010 |
- data PseudoTrie t a
- = More (t, Maybe a) (NonEmpty (PseudoTrie t a))
- | Rest (NonEmpty t) a
- | Nil
- toAssocs :: Default t => PseudoTrie t a -> [(NonEmpty t, a)]
- fromAssocs :: (Eq t, Default t) => [(NonEmpty t, a)] -> PseudoTrie t a
- lookup :: Eq t => NonEmpty t -> PseudoTrie t a -> Maybe a
- union :: (Eq t, Default t) => PseudoTrie t a -> PseudoTrie t a -> PseudoTrie t a
- add :: (Eq t, Default t) => NonEmpty t -> a -> PseudoTrie t a -> PseudoTrie t a
Documentation
data PseudoTrie t a Source
Non-Empty Rose Tree with explicit emptyness
More (t, Maybe a) (NonEmpty (PseudoTrie t a)) | |
Rest (NonEmpty t) a | |
Nil |
Functor (PseudoTrie t) | |
Foldable (PseudoTrie t) | |
(Eq t, Eq a) => Eq (PseudoTrie t a) | |
(Show t, Show a) => Show (PseudoTrie t a) | |
(Eq t, Default t) => Monoid (PseudoTrie t a) |
toAssocs :: Default t => PseudoTrie t a -> [(NonEmpty t, a)] Source
fromAssocs :: (Eq t, Default t) => [(NonEmpty t, a)] -> PseudoTrie t a Source
lookup :: Eq t => NonEmpty t -> PseudoTrie t a -> Maybe a Source
union :: (Eq t, Default t) => PseudoTrie t a -> PseudoTrie t a -> PseudoTrie t a Source
Rightward bias
add :: (Eq t, Default t) => NonEmpty t -> a -> PseudoTrie t a -> PseudoTrie t a Source