Data.TrieMap.Regular
Documentation
class OrdT f => TrieKeyT f m | m -> f, f -> mSource
Instances
TrieKeyT [] RadixTrie | |
TrieKeyT I0 IMap | |
TrieKeyT U0 M | |
TrieKeyT Rev ReverseMap | |
TrieKey k1 m1 => TrieKeyT (Either k1) (UMap m1) | |
TrieKey k1 m1 => TrieKeyT ((,) k1) (PMap m1) | |
(m ~ TrieMap k, TrieKey k m) => TrieKeyT (K0 k) (KMap m) | |
(m ~ TrieMapT f, OrdT f, TrieKeyT f m) => TrieKeyT (L f) (RadixTrie f) | |
TrieKeyT f m => TrieKeyT (App f) (AppMap m) | |
(TrieKeyT f m1, TrieKeyT g m2) => TrieKeyT (:*: f g) (PMap m1 m2) | |
(TrieKeyT f m1, TrieKeyT g m2) => TrieKeyT (:+: f g) (UnionMap m1 m2) | |
(TrieKeyT f m, Functor f, TrieKeyT g (TrieMapT g)) => TrieKeyT (O f g) (CompMap m g) |
Constructors
U0 |
Constructors
(f r) :*: (g r) |
Instances
(Functor f, Functor g) => Functor (:*: f g) | |
(EqT f, EqT g) => EqT (:*: f g) | |
(OrdT f, OrdT g) => OrdT (:*: f g) | |
(ReprT f[agPL], ReprT g[agPM]) => ReprT (:*: f[agPL] g[agPM]) | |
(TrieKeyT f m1, TrieKeyT g m2) => TrieKeyT (:*: f g) (PMap m1 m2) | |
(EqT f, EqT g, Eq r) => Eq (:*: f g r) | |
(OrdT f, OrdT g, Ord r) => Ord (:*: f g r) | |
(Show (f r), Show (g r)) => Show (:*: f g r) | |
(Repr a[agPT], ReprT f[agPL], ReprT g[agPM]) => Repr (:*: f[agPL] g[agPM] a[agPT]) | |
(TrieKeyT f m1, TrieKeyT g m2, TrieKey k (TrieMap k)) => TrieKey (:*: f g k) (PMap m1 m2 k) |
Instances
(Functor f, Functor g) => Functor (:+: f g) | |
(EqT f, EqT g) => EqT (:+: f g) | |
(OrdT f, OrdT g) => OrdT (:+: f g) | |
(ReprT f[ah17], ReprT g[ah18]) => ReprT (:+: f[ah17] g[ah18]) | |
(TrieKeyT f m1, TrieKeyT g m2) => TrieKeyT (:+: f g) (UnionMap m1 m2) | |
(EqT f, EqT g, Eq r) => Eq (:+: f g r) | |
(OrdT f, OrdT g, Ord r) => Ord (:+: f g r) | |
(Show (f r), Show (g r)) => Show (:+: f g r) | |
(Repr a[ah1h], ReprT f[ah17], ReprT g[ah18]) => Repr (:+: f[ah17] g[ah18] a[ah1h]) | |
(TrieKeyT f m1, TrieKeyT g m2, TrieKey k (TrieMap k)) => TrieKey (:+: f g k) (UnionMap m1 m2 k) |
Constructors
List [f r] |
Instances
Functor f => Functor (L f) | |
EqT f => EqT (L f) | |
OrdT f => OrdT (L f) | |
ReprT f[agGW] => ReprT (L f[agGW]) | |
(m ~ TrieMapT f, OrdT f, TrieKeyT f m) => TrieKeyT (L f) (RadixTrie f) | |
(EqT f, Eq r) => Eq (L f r) | |
(OrdT f, Ord r) => Ord (L f r) | |
Show (f r) => Show (L f r) | |
(Repr a[agH1], ReprT f[agGW]) => Repr (L f[agGW] a[agH1]) | |
(OrdT f, TrieKeyT f (TrieMapT f), TrieKey k (TrieMap k)) => TrieKey (L f k) (RadixTrie f k) |
Constructors
O (f (g r)) |
Instances
(Functor f, Functor g) => Functor (O f g) | |
(EqT f, EqT g) => EqT (O f g) | |
(OrdT f, OrdT g) => OrdT (O f g) | |
(ReprT f[ahac], ReprT g[ahad]) => ReprT (O f[ahac] g[ahad]) | |
(TrieKeyT f m, Functor f, TrieKeyT g (TrieMapT g)) => TrieKeyT (O f g) (CompMap m g) | |
(EqT f, EqT g, Eq r) => Eq (O f g r) | |
(OrdT f, OrdT g, Ord r) => Ord (O f g r) | |
(Repr a[ahai], ReprT f[ahac], ReprT g[ahad]) => Repr (O f[ahac] g[ahad] a[ahai]) | |
(TrieKeyT f m, Functor f, TrieKeyT g (TrieMapT g), TrieKey k (TrieMap k)) => TrieKey (O f g k) (CompMap m g k) |
partEithers :: [((f :+: g) r, a)] -> ([(f r, a)], [(g r, a)])Source
type Comparator a = a -> a -> OrderingSource
class EqT f => OrdT f whereSource
Methods
compareT0 :: Comparator a -> Comparator (f a)Source