TrieMap-0.6.3: Automatic type inference of generalized tries.

Data.TrieMap.MultiRec

Documentation

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

Instances

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

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

Instances

(Fam phi, HFunctor phi (PF phi), HTrieKeyT phi (PF phi) m) => HTrieKey phi (Family phi) (FamMap phi m) 

type family HTrieMapT phi f :: (* -> *) -> * -> * -> *Source

type family HTrieMap phi r :: * -> * -> *Source

newtype Family phi ix Source

Constructors

F 

Fields

unF :: ix
 

Instances

(Fam phi, HFunctor phi (PF phi), HEq phi (PF phi)) => HEq0 phi (Family phi) 
(Fam phi, HFunctor phi (PF phi), HOrd 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) 
(Fam phi, HFunctor phi (PF phi), HEq phi (PF phi), El phi ix) => Eq (Family phi ix) 
(Fam phi, HFunctor phi (PF phi), HOrd phi (PF phi), El phi ix) => Ord (Family phi ix) 
(Fam phi, HFunctor phi (PF phi), El phi ix, HTrieKeyT phi (PF phi) m) => TrieKey (Family phi ix) (FamMap phi m ix) 

class HEq phi f => HOrd phi f whereSource

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)