Data.Extensible.Dictionary

Reification of constraints using extensible data types. Also includes orphan instances.

Documentation

library :: forall c xs. Forall c xs => Comp Dict c :* xs

Reify a collection of dictionaries, as you wish.

type WrapForall c h = Forall (Instance1 c h)

Forall upon a wrapper

class c (h x) => Instance1 c h x

Composition for a class and a wrapper

Instances

c (h x) => Instance1 k2 k1 c h x

class (f x, g x) => And f g x

Instances

(f x, g x) => And k f g x

Orphan instances

Unbox a => Vector Vector (Identity a)

Methods

basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (Identity a) -> m (Vector (Identity a))

basicUnsafeThaw :: PrimMonad m => Vector (Identity a) -> m (Mutable Vector (PrimState m) (Identity a))

basicLength :: Vector (Identity a) -> Int

basicUnsafeSlice :: Int -> Int -> Vector (Identity a) -> Vector (Identity a)

basicUnsafeIndexM :: Monad m => Vector (Identity a) -> Int -> m (Identity a)

basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (Identity a) -> Vector (Identity a) -> m ()

elemseq :: Vector (Identity a) -> Identity a -> b -> b

Unbox a => MVector MVector (Identity a)

Methods

basicLength :: MVector s (Identity a) -> Int

basicUnsafeSlice :: Int -> Int -> MVector s (Identity a) -> MVector s (Identity a)

basicOverlaps :: MVector s (Identity a) -> MVector s (Identity a) -> Bool

basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (Identity a))

basicInitialize :: PrimMonad m => MVector (PrimState m) (Identity a) -> m ()

basicUnsafeReplicate :: PrimMonad m => Int -> Identity a -> m (MVector (PrimState m) (Identity a))

basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (Identity a) -> Int -> m (Identity a)

basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (Identity a) -> Int -> Identity a -> m ()

basicClear :: PrimMonad m => MVector (PrimState m) (Identity a) -> m ()

basicSet :: PrimMonad m => MVector (PrimState m) (Identity a) -> Identity a -> m ()

basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (Identity a) -> MVector (PrimState m) (Identity a) -> m ()

basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (Identity a) -> MVector (PrimState m) (Identity a) -> m ()

basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (Identity a) -> Int -> m (MVector (PrimState m) (Identity a))

Unbox a => Vector Vector (Const' k a b)

Methods

basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (Const' k a b) -> m (Vector (Const' k a b))

basicUnsafeThaw :: PrimMonad m => Vector (Const' k a b) -> m (Mutable Vector (PrimState m) (Const' k a b))

basicLength :: Vector (Const' k a b) -> Int

basicUnsafeSlice :: Int -> Int -> Vector (Const' k a b) -> Vector (Const' k a b)

basicUnsafeIndexM :: Monad m => Vector (Const' k a b) -> Int -> m (Const' k a b)

basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (Const' k a b) -> Vector (Const' k a b) -> m ()

elemseq :: Vector (Const' k a b) -> Const' k a b -> b -> b

WrapForall * a Unbox h ((:) a x xs) => Vector Vector ((:*) a h ((:) a x xs))

Methods

basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) ((a :* h) ((a ': x) xs)) -> m (Vector ((a :* h) ((a ': x) xs)))

basicUnsafeThaw :: PrimMonad m => Vector ((a :* h) ((a ': x) xs)) -> m (Mutable Vector (PrimState m) ((a :* h) ((a ': x) xs)))

basicLength :: Vector ((a :* h) ((a ': x) xs)) -> Int

basicUnsafeSlice :: Int -> Int -> Vector ((a :* h) ((a ': x) xs)) -> Vector ((a :* h) ((a ': x) xs))

basicUnsafeIndexM :: Monad m => Vector ((a :* h) ((a ': x) xs)) -> Int -> m ((a :* h) ((a ': x) xs))

basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) ((a :* h) ((a ': x) xs)) -> Vector ((a :* h) ((a ': x) xs)) -> m ()

elemseq :: Vector ((a :* h) ((a ': x) xs)) -> (a :* h) ((a ': x) xs) -> b -> b

Unbox a => MVector MVector (Const' k a b)

Methods

basicLength :: MVector s (Const' k a b) -> Int

basicUnsafeSlice :: Int -> Int -> MVector s (Const' k a b) -> MVector s (Const' k a b)

basicOverlaps :: MVector s (Const' k a b) -> MVector s (Const' k a b) -> Bool

basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (Const' k a b))

basicInitialize :: PrimMonad m => MVector (PrimState m) (Const' k a b) -> m ()

basicUnsafeReplicate :: PrimMonad m => Int -> Const' k a b -> m (MVector (PrimState m) (Const' k a b))

basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (Const' k a b) -> Int -> m (Const' k a b)

basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (Const' k a b) -> Int -> Const' k a b -> m ()

basicClear :: PrimMonad m => MVector (PrimState m) (Const' k a b) -> m ()

basicSet :: PrimMonad m => MVector (PrimState m) (Const' k a b) -> Const' k a b -> m ()

basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (Const' k a b) -> MVector (PrimState m) (Const' k a b) -> m ()

basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (Const' k a b) -> MVector (PrimState m) (Const' k a b) -> m ()

basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (Const' k a b) -> Int -> m (MVector (PrimState m) (Const' k a b))

WrapForall * a Unbox h ((:) a x xs) => MVector MVector ((:*) a h ((:) a x xs))

Methods

basicLength :: MVector s ((a :* h) ((a ': x) xs)) -> Int

basicUnsafeSlice :: Int -> Int -> MVector s ((a :* h) ((a ': x) xs)) -> MVector s ((a :* h) ((a ': x) xs))

basicOverlaps :: MVector s ((a :* h) ((a ': x) xs)) -> MVector s ((a :* h) ((a ': x) xs)) -> Bool

basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) ((a :* h) ((a ': x) xs)))

basicInitialize :: PrimMonad m => MVector (PrimState m) ((a :* h) ((a ': x) xs)) -> m ()

basicUnsafeReplicate :: PrimMonad m => Int -> (a :* h) ((a ': x) xs) -> m (MVector (PrimState m) ((a :* h) ((a ': x) xs)))

basicUnsafeRead :: PrimMonad m => MVector (PrimState m) ((a :* h) ((a ': x) xs)) -> Int -> m ((a :* h) ((a ': x) xs))

basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) ((a :* h) ((a ': x) xs)) -> Int -> (a :* h) ((a ': x) xs) -> m ()

basicClear :: PrimMonad m => MVector (PrimState m) ((a :* h) ((a ': x) xs)) -> m ()

basicSet :: PrimMonad m => MVector (PrimState m) ((a :* h) ((a ': x) xs)) -> (a :* h) ((a ': x) xs) -> m ()

basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) ((a :* h) ((a ': x) xs)) -> MVector (PrimState m) ((a :* h) ((a ': x) xs)) -> m ()

basicUnsafeMove :: PrimMonad m => MVector (PrimState m) ((a :* h) ((a ': x) xs)) -> MVector (PrimState m) ((a :* h) ((a ': x) xs)) -> m ()

basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) ((a :* h) ((a ': x) xs)) -> Int -> m (MVector (PrimState m) ((a :* h) ((a ': x) xs)))

Lift a => Lift (Identity a)

Methods

lift :: Identity a -> Q Exp

Pretty a => Pretty (Identity a)

Methods

pretty :: Identity a -> Doc ann

prettyList :: [Identity a] -> Doc ann

Unbox a => Unbox (Identity a)

WrapForall * k Bounded h xs => Bounded ((:*) k h xs)

Methods

minBound :: (k :* h) xs

maxBound :: (k :* h) xs

WrapForall * k Eq h xs => Eq ((:|) k h xs)

Methods

(==) :: (k :| h) xs -> (k :| h) xs -> Bool

(/=) :: (k :| h) xs -> (k :| h) xs -> Bool

WrapForall * k Eq h xs => Eq ((:*) k h xs)

Methods

(==) :: (k :* h) xs -> (k :* h) xs -> Bool

(/=) :: (k :* h) xs -> (k :* h) xs -> Bool

(Eq ((:|) k h xs), WrapForall * k Ord h xs) => Ord ((:|) k h xs)

Methods

compare :: (k :| h) xs -> (k :| h) xs -> Ordering

(<) :: (k :| h) xs -> (k :| h) xs -> Bool

(<=) :: (k :| h) xs -> (k :| h) xs -> Bool

(>) :: (k :| h) xs -> (k :| h) xs -> Bool

(>=) :: (k :| h) xs -> (k :| h) xs -> Bool

max :: (k :| h) xs -> (k :| h) xs -> (k :| h) xs

min :: (k :| h) xs -> (k :| h) xs -> (k :| h) xs

(Eq ((:*) k h xs), WrapForall * k Ord h xs) => Ord ((:*) k h xs)

Methods

compare :: (k :* h) xs -> (k :* h) xs -> Ordering

(<) :: (k :* h) xs -> (k :* h) xs -> Bool

(<=) :: (k :* h) xs -> (k :* h) xs -> Bool

(>) :: (k :* h) xs -> (k :* h) xs -> Bool

(>=) :: (k :* h) xs -> (k :* h) xs -> Bool

max :: (k :* h) xs -> (k :* h) xs -> (k :* h) xs

min :: (k :* h) xs -> (k :* h) xs -> (k :* h) xs

WrapForall * k Show h xs => Show ((:|) k h xs)

Methods

showsPrec :: Int -> (k :| h) xs -> ShowS

show :: (k :| h) xs -> String

showList :: [(k :| h) xs] -> ShowS

WrapForall * k Show h xs => Show ((:*) k h xs)

Methods

showsPrec :: Int -> (k :* h) xs -> ShowS

show :: (k :* h) xs -> String

showList :: [(k :* h) xs] -> ShowS

WrapForall * k Semigroup h xs => Semigroup ((:*) k h xs)

Methods

(<>) :: (k :* h) xs -> (k :* h) xs -> (k :* h) xs

sconcat :: NonEmpty ((k :* h) xs) -> (k :* h) xs

stimes :: Integral b => b -> (k :* h) xs -> (k :* h) xs

(WrapForall * k Semigroup h xs, WrapForall * k Monoid h xs) => Monoid ((:*) k h xs)

Methods

mempty :: (k :* h) xs

mappend :: (k :* h) xs -> (k :* h) xs -> (k :* h) xs

mconcat :: [(k :* h) xs] -> (k :* h) xs

Lift a => Lift (Const k a b)

Methods

lift :: Const k a b -> Q Exp

WrapForall * k Lift h xs => Lift ((:|) k h xs)

Methods

lift :: (k :| h) xs -> Q Exp

WrapForall * k Lift h xs => Lift ((:*) k h xs)

Methods

lift :: (k :* h) xs -> Q Exp

WrapForall * k Arbitrary h xs => Arbitrary ((:|) k h xs)

Methods

arbitrary :: Gen ((k :| h) xs)

shrink :: (k :| h) xs -> [(k :| h) xs]

WrapForall * k Arbitrary h xs => Arbitrary ((:*) k h xs)

Methods

arbitrary :: Gen ((k :* h) xs)

shrink :: (k :* h) xs -> [(k :* h) xs]

WrapForall * k Hashable h xs => Hashable ((:|) k h xs)

Methods

hashWithSalt :: Int -> (k :| h) xs -> Int

hash :: (k :| h) xs -> Int

WrapForall * k Hashable h xs => Hashable ((:*) k h xs)

Methods

hashWithSalt :: Int -> (k :* h) xs -> Int

hash :: (k :* h) xs -> Int

Forall (Assoc Symbol v) (KeyValue Symbol v KnownSymbol (Instance1 * v ToJSON h)) xs => ToJSON ((:*) (Assoc Symbol v) (Nullable (Assoc Symbol v) (Field Symbol v h)) xs)

Methods

toJSON :: (Assoc Symbol v :* Nullable (Assoc Symbol v) (Field Symbol v h)) xs -> Value

toEncoding :: (Assoc Symbol v :* Nullable (Assoc Symbol v) (Field Symbol v h)) xs -> Encoding

toJSONList :: [(Assoc Symbol v :* Nullable (Assoc Symbol v) (Field Symbol v h)) xs] -> Value

toEncodingList :: [(Assoc Symbol v :* Nullable (Assoc Symbol v) (Field Symbol v h)) xs] -> Encoding

Forall (Assoc Symbol v) (KeyValue Symbol v KnownSymbol (Instance1 * v ToJSON h)) xs => ToJSON ((:*) (Assoc Symbol v) (Field Symbol v h) xs)

Methods

toJSON :: (Assoc Symbol v :* Field Symbol v h) xs -> Value

toEncoding :: (Assoc Symbol v :* Field Symbol v h) xs -> Encoding

toJSONList :: [(Assoc Symbol v :* Field Symbol v h) xs] -> Value

toEncodingList :: [(Assoc Symbol v :* Field Symbol v h) xs] -> Encoding

Forall (Assoc Symbol v) (KeyValue Symbol v KnownSymbol (Instance1 * v FromJSON h)) xs => FromJSON ((:*) (Assoc Symbol v) (Nullable (Assoc Symbol v) (Field Symbol v h)) xs)

Methods

parseJSON :: Value -> Parser ((Assoc Symbol v :* Nullable (Assoc Symbol v) (Field Symbol v h)) xs)

parseJSONList :: Value -> Parser [(Assoc Symbol v :* Nullable (Assoc Symbol v) (Field Symbol v h)) xs]

Forall (Assoc Symbol v) (KeyValue Symbol v KnownSymbol (Instance1 * v FromJSON h)) xs => FromJSON ((:*) (Assoc Symbol v) (Field Symbol v h) xs)

parseJSON Null is called for missing fields.

Methods

parseJSON :: Value -> Parser ((Assoc Symbol v :* Field Symbol v h) xs)

parseJSONList :: Value -> Parser [(Assoc Symbol v :* Field Symbol v h) xs]

WrapForall * k FromField h xs => FromRecord ((:*) k h xs)

Methods

parseRecord :: Record -> Parser ((k :* h) xs)

WrapForall * k ToField h xs => ToRecord ((:*) k h xs)

Methods

toRecord :: (k :* h) xs -> Record

Forall (Assoc Symbol v) (KeyValue Symbol v KnownSymbol (Instance1 * v FromField h)) xs => FromNamedRecord ((:*) (Assoc Symbol v) (Field Symbol v h) xs)

Methods

parseNamedRecord :: NamedRecord -> Parser ((Assoc Symbol v :* Field Symbol v h) xs)

Forall (Assoc Symbol v) (KeyValue Symbol v KnownSymbol (Instance1 * v ToField h)) xs => ToNamedRecord ((:*) (Assoc Symbol v) (Field Symbol v h) xs)

Methods

toNamedRecord :: (Assoc Symbol v :* Field Symbol v h) xs -> NamedRecord

WrapForall * k NFData h xs => NFData ((:|) k h xs)

Methods

rnf :: (k :| h) xs -> ()

WrapForall * k NFData h xs => NFData ((:*) k h xs)

Methods

rnf :: (k :* h) xs -> ()

Pretty a => Pretty (Const k a b)

Methods

pretty :: Const k a b -> Doc ann

prettyList :: [Const k a b] -> Doc ann

WrapForall * k Pretty h xs => Pretty ((:|) k h xs)

Methods

pretty :: (k :| h) xs -> Doc ann

prettyList :: [(k :| h) xs] -> Doc ann

WrapForall * k Pretty h xs => Pretty ((:*) k h xs)

Methods

pretty :: (k :* h) xs -> Doc ann

prettyList :: [(k :* h) xs] -> Doc ann

Unbox a => Unbox (Const' k a b)

WrapForall * a Unbox h ((:) a x xs) => Unbox ((:*) a h ((:) a x xs))