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

Data.TrieMap.Class

Documentation

newtype TMap k a Source

Constructors TMap getTMap :: TrieMap (Rep k) (K0 a) (Rep k) Instances TKey k => Functor (TMap k) TKey k => Traversable (TMap k) TKey k => Foldable (TMap k) (Eq k, TKey k, Eq a) => Eq (TMap k a) (Ord k, TKey k, Ord a) => Ord (TMap k a) (Show k, Show a, TKey k) => Show (TMap k a) (TKey k, TKey a) => TKey (TMap k a)

class TrieKey (Rep k) (TrieMap (Rep k)) => TKey k where Source

Methods toRep :: k -> Rep k Source fromRep :: Rep k -> k Source Instances TKey Bool TKey Char TKey Double TKey Int TKey Int8 TKey Int16 TKey Int32 TKey Integer TKey Word TKey Word8 TKey Word16 TKey Word32 TKey () TKey a => TKey ([] a) TKey a => TKey (Maybe a) TKey (U0 r) TKey r => TKey (I0 r) (TKey a, TKey b) => TKey (Either a b) (TKey a, TKey b) => TKey ((,) a b) (TKey a, TrieKeyT f (TrieMapT f), Functor f) => TKey (L f a) TKey k => TKey (K0 k r) (TKey k, TKey a) => TKey (TMap k a) (TKey a, TKey b, TKey c) => TKey ((,,) a b c) (TKey a, TrieKeyT f (TrieMapT f), TrieKeyT g (TrieMapT g), Functor f, Functor g) => TKey ((f :+: g) a) (TKey a, TrieKeyT f (TrieMapT f), TrieKeyT g (TrieMapT g), Functor f, Functor g) => TKey ((f :*: g) a) (TKey a, TKey b, TKey c, TKey d) => TKey ((,,,) a b c d) (TKey a, TKey b, TKey c, TKey d, TKey e) => TKey ((,,,,) a b c d e)

type family Rep k Source

newtype Ordered a Source

Constructors Ord unOrd :: a Instances Eq a => Eq (Ordered a) Ord a => Ord (Ordered a) Ord k => TrieKey (Ordered k) (OrdMap k)

type family TrieMap k :: (* -> *) -> * -> * Source

class Ord k => TrieKey k m | m -> k Source

Instances TrieKey Int IntMap TrieKey Int IntMap TrieKey (U0 r) (M r) TrieKey (U0 r) (M r) TrieKey k (TrieMap k) => TrieKey (I0 k) (IMap k) TrieKey k (TrieMap k) => TrieKey (I0 k) (IMap k) Ord k => TrieKey (Ordered k) (OrdMap k) Ord k => TrieKey (Ordered k) (OrdMap k) (m ~ TrieMapT (PF k), Regular k, Functor (PF k), TrieKeyT (PF k) m) => TrieKey (Reg k) (RegMap k m) (m ~ TrieMapT (PF k), Regular k, Functor (PF k), TrieKeyT (PF k) m) => TrieKey (Reg k) (RegMap k m) (OrdT f, TrieKeyT f (TrieMapT f), TrieKey k (TrieMap k)) => TrieKey (L f k) (RadixTrie f k) (OrdT f, TrieKeyT f (TrieMapT f), TrieKey k (TrieMap k)) => TrieKey (L f k) (RadixTrie f k) (m ~ TrieMap k, TrieKey k m) => TrieKey (K0 k r) (KMap m r) (m ~ TrieMap k, TrieKey k m) => TrieKey (K0 k r) (KMap m r) (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) (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) (TrieKeyT f m1, TrieKeyT g m2, TrieKey k (TrieMap k)) => TrieKey ((f :+: g) k) (UnionMap m1 m2 k) (TrieKeyT f m1, TrieKeyT g m2, TrieKey k (TrieMap k)) => TrieKey ((f :+: g) k) (UnionMap m1 m2 k) (TrieKeyT f m1, TrieKeyT g m2, TrieKey k (TrieMap k)) => TrieKey ((f :*: g) k) (PMap m1 m2 k) (TrieKeyT f m1, TrieKeyT g m2, TrieKey k (TrieMap k)) => TrieKey ((f :*: g) k) (PMap m1 m2 k)

Produced by Haddock version 2.4.2