representable-tries-3.0.2: Tries from representations of polynomial functors

Stability | experimental
Maintainer | ekmett@gmail.com
Safe Haskell | None

Data.Functor.Representable.Trie.List

Description

# Documentation

data ListTrie f a Source

Constructors

ListTrie a (f (ListTrie f a)) |

Instances

Representable f => Monad (ListTrie f) |
Functor f => Functor (ListTrie f) |
Representable f => Applicative (ListTrie f) |
Foldable f => Foldable (ListTrie f) |
Traversable f => Traversable (ListTrie f) |
Representable f => Distributive (ListTrie f) |
Keyed f => Keyed (ListTrie f) |
Zip f => Zip (ListTrie f) |
ZipWithKey f => ZipWithKey (ListTrie f) |
Indexable f => Indexable (ListTrie f) |
Lookup f => Lookup (ListTrie f) |
Adjustable f => Adjustable (ListTrie f) |
FoldableWithKey f => FoldableWithKey (ListTrie f) |
FoldableWithKey1 f => FoldableWithKey1 (ListTrie f) |
TraversableWithKey f => TraversableWithKey (ListTrie f) |
TraversableWithKey1 f => TraversableWithKey1 (ListTrie f) |
Representable f => Representable (ListTrie f) |
Traversable1 f => Traversable1 (ListTrie f) |
Foldable1 f => Foldable1 (ListTrie f) |
Representable f => Apply (ListTrie f) |
Representable f => Bind (ListTrie f) |

nil :: ListTrie f a -> aSource

cons :: Indexable f => Key f -> ListTrie f a -> ListTrie f aSource