TrieMap-0.5.1: Automatic type inference of generalized tries. Source code Contents Index

Data.TrieMap.MultiRec

Documentation

class HOrd0 phi r => HTrieKey phi r m | m -> phi r Source

Instances (Fam phi, HFunctor phi (PF phi), HTrieKeyT phi (PF phi) m) => HTrieKey phi (Family phi) (FamMap phi m) (Fam phi, HFunctor phi (PF phi), HTrieKeyT phi (PF phi) m) => HTrieKey phi (Family phi) (FamMap phi m) HTrieKey phi (U r) (UMap phi r) HTrieKey phi (U r) (UMap phi r) TrieKey k m => HTrieKey phi (K k r) (KMap phi m r) TrieKey k m => HTrieKey phi (K k r) (KMap phi m r) (El phi xi, HTrieKey phi r (HTrieMap phi r)) => HTrieKey phi (I xi r) (IMap phi xi r) (El phi xi, HTrieKey phi r (HTrieMap phi r)) => HTrieKey phi (I xi r) (IMap phi xi r) (m1 ~ HTrieMapT phi f, m2 ~ HTrieMapT phi g, HTrieKeyT phi f m1, HTrieKeyT phi g m2, HTrieKey phi r (HTrieMap phi r)) => HTrieKey phi ((f :*: g) r) (ProdMap phi m1 m2 r) (m1 ~ HTrieMapT phi f, m2 ~ HTrieMapT phi g, HTrieKeyT phi f m1, HTrieKeyT phi g m2, HTrieKey phi r (HTrieMap phi r)) => HTrieKey phi ((f :*: g) r) (ProdMap phi m1 m2 r) (m ~ HTrieMapT phi f, HTrieKeyT phi f m, HTrieKey phi r (HTrieMap phi r)) => HTrieKey phi ((f :>: ix) r) (TagMap phi m ix r) (m ~ HTrieMapT phi f, HTrieKeyT phi f m, HTrieKey phi r (HTrieMap phi r)) => HTrieKey phi ((f :>: ix) r) (TagMap phi m ix r) (m1 ~ HTrieMapT phi f, m2 ~ HTrieMapT phi g, HTrieKeyT phi f m1, HTrieKeyT phi g m2, HTrieKey phi r (HTrieMap phi r)) => HTrieKey phi ((f :+: g) r) (UnionMap phi m1 m2 r) (m1 ~ HTrieMapT phi f, m2 ~ HTrieMapT phi g, HTrieKeyT phi f m1, HTrieKeyT phi g m2, HTrieKey phi r (HTrieMap phi r)) => HTrieKey phi ((f :+: g) r) (UnionMap phi m1 m2 r)

class HOrd phi f => HTrieKeyT phi f m | m -> phi f Source

Instances HTrieKeyT phi U (UMap phi) HTrieKeyT phi U (UMap phi) TrieKey k m => HTrieKeyT phi (K k) (KMap phi m) TrieKey k m => HTrieKeyT phi (K k) (KMap phi m) El phi xi => HTrieKeyT phi (I xi) (IMap phi xi) El phi xi => HTrieKeyT phi (I xi) (IMap phi xi) (m1 ~ HTrieMapT phi f, m2 ~ HTrieMapT phi g, HTrieKeyT phi f m1, HTrieKeyT phi g m2) => HTrieKeyT phi (f :*: g) (ProdMap phi m1 m2) (m1 ~ HTrieMapT phi f, m2 ~ HTrieMapT phi g, HTrieKeyT phi f m1, HTrieKeyT phi g m2) => HTrieKeyT phi (f :*: g) (ProdMap phi m1 m2) (m ~ HTrieMapT phi f, HTrieKeyT phi f m) => HTrieKeyT phi (f :>: ix) (TagMap phi m ix) (m ~ HTrieMapT phi f, HTrieKeyT phi f m) => HTrieKeyT phi (f :>: ix) (TagMap phi m ix) (HTrieKeyT phi f m1, HTrieKeyT phi g m2) => HTrieKeyT phi (f :+: g) (UnionMap phi m1 m2) (HTrieKeyT phi f m1, HTrieKeyT phi g m2) => HTrieKeyT phi (f :+: g) (UnionMap phi m1 m2)

newtype Family phi ix Source

Constructors F ix Instances (Fam phi, HEq phi (PF phi), HFunctor phi (PF phi)) => HEq0 phi (Family phi) (Fam phi, HOrd phi (PF phi), HFunctor phi (PF phi)) => HOrd0 phi (Family phi) (Fam phi, HFunctor phi (PF phi), HTrieKeyT phi (PF phi) m) => HTrieKey phi (Family phi) (FamMap phi m) (El phi ix, Fam phi, HEq phi (PF phi), HFunctor phi (PF phi)) => Eq (Family phi ix) (El phi ix, Fam phi, HOrd phi (PF phi), HFunctor phi (PF phi)) => Ord (Family phi ix) (m ~ HTrieMap phi (Family phi), El phi ix, Fam phi, HFunctor phi (PF phi), HTrieKey phi (Family phi) m, HOrd phi (PF phi)) => TrieKey (Family phi ix) (FMap phi m ix)

class HEq0 phi r where Source

Methods heqH :: phi ix -> r ix -> r ix -> Bool Source Instances HEq phi f => HEq0 phi (HFix f) HEq0 phi (U r) (Fam phi, HEq phi (PF phi), HFunctor phi (PF phi)) => HEq0 phi (Family phi) (El phi xi, HEq0 phi r) => HEq0 phi (I xi r) Eq k => HEq0 phi (K k r) (HEq phi f, HEq0 phi r) => HEq0 phi ((f :>: ix) r) (HEq phi f, HEq phi g, HEq0 phi r) => HEq0 phi ((f :+: g) r) (HEq phi f, HEq phi g, HEq0 phi r) => HEq0 phi ((f :*: g) r)

class HEq0 phi r => HOrd0 phi r where Source

Methods compareH0 :: phi ix -> Comparator (r ix) Source Instances HOrd phi f => HOrd0 phi (HFix f) HOrd0 phi (U r) (Fam phi, HOrd phi (PF phi), HFunctor phi (PF phi)) => HOrd0 phi (Family phi) (El phi xi, HOrd0 phi r) => HOrd0 phi (I xi r) Ord k => HOrd0 phi (K k r) (HOrd phi f, HOrd0 phi r) => HOrd0 phi ((f :>: ix) r) (HOrd phi f, HOrd phi g, HOrd0 phi r) => HOrd0 phi ((f :+: g) r) (HOrd phi f, HOrd phi g, HOrd0 phi r) => HOrd0 phi ((f :*: g) r)

class HEq phi f => HOrd phi f where Source

Methods compareH :: (forall ix. phi ix -> Comparator (r ix)) -> phi ix -> Comparator (f r ix) Source Instances HOrd phi U El phi xi => HOrd phi (I xi) Ord k => HOrd phi (K k) HOrd phi f => HOrd phi (f :>: ix) (HOrd phi f, HOrd phi g) => HOrd phi (f :+: g) (HOrd phi f, HOrd phi g) => HOrd phi (f :*: g)

Produced by Haddock version 2.4.2