Data.Extensible.Product

Basic operations

data (s :: [k]) :& (h :: k -> *)

The type of extensible products.

(:&) :: [k] -> (k -> *) -> *

Instances

(Corepresentable p, Comonad (Corep p), Functor f) => Extensible f p ((:&) :: [k] -> (k -> Type) -> Type)

Defined in Data.Extensible.Struct

Associated Types

type ExtensibleConstr (:&) xs h x :: Constraint

Methods

pieceAt :: ExtensibleConstr (:&) xs h x => Membership xs x -> Optic' p f (xs :& h) (h x)

Generate xs => ProductBC ((:&) xs :: (k -> Type) -> Type)

Defined in Data.Extensible.Dictionary

Methods

bdicts :: AllB c ((:&) xs) => xs :& Dict c

ConstraintsB ((:&) xs :: (k -> Type) -> Type)

Defined in Data.Extensible.Dictionary

Associated Types

type AllB c ((:&) xs) :: Constraint

Methods

baddDicts :: AllB c ((:&) xs) => (xs :& f) -> xs :& Product (Dict c) f

Generate xs => ProductB ((:&) xs :: (k -> Type) -> Type)

Defined in Data.Extensible.Dictionary

Methods

bprod :: (xs :& f) -> (xs :& g) -> xs :& Product f g

buniq :: (forall (a :: k0). f a) -> xs :& f

TraversableB ((:&) xs :: (k -> Type) -> Type)

Defined in Data.Extensible.Dictionary

Methods

btraverse :: Applicative t => (forall (a :: k0). f a -> t (g a)) -> (xs :& f) -> t (xs :& g)

FunctorB ((:&) xs :: (k -> Type) -> Type)

Defined in Data.Extensible.Dictionary

Methods

bmap :: (forall (a :: k0). f a -> g a) -> (xs :& f) -> xs :& g

WrapForall Unbox h (x ': xs) => Vector Vector ((x ': xs) :& h)

Defined in Data.Extensible.Dictionary

Methods

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

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

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

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

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

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

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

WrapForall Unbox h (x ': xs) => MVector MVector ((x ': xs) :& h)

Defined in Data.Extensible.Dictionary

Methods

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

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

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

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

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

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

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

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

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

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

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

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

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

WrapForall Bounded h xs => Bounded (xs :& h)

Defined in Data.Extensible.Dictionary

Methods

minBound :: xs :& h

maxBound :: xs :& h

WrapForall Eq h xs => Eq (xs :& h)

Defined in Data.Extensible.Dictionary

Methods

(==) :: (xs :& h) -> (xs :& h) -> Bool

(/=) :: (xs :& h) -> (xs :& h) -> Bool

(Eq (xs :& h), WrapForall Ord h xs) => Ord (xs :& h)

Defined in Data.Extensible.Dictionary

Methods

compare :: (xs :& h) -> (xs :& h) -> Ordering

(<) :: (xs :& h) -> (xs :& h) -> Bool

(<=) :: (xs :& h) -> (xs :& h) -> Bool

(>) :: (xs :& h) -> (xs :& h) -> Bool

(>=) :: (xs :& h) -> (xs :& h) -> Bool

max :: (xs :& h) -> (xs :& h) -> xs :& h

min :: (xs :& h) -> (xs :& h) -> xs :& h

WrapForall Show h xs => Show (xs :& h)

Defined in Data.Extensible.Dictionary

Methods

showsPrec :: Int -> (xs :& h) -> ShowS

show :: (xs :& h) -> String

showList :: [xs :& h] -> ShowS

WrapForall Semigroup h xs => Semigroup (xs :& h)

Defined in Data.Extensible.Dictionary

Methods

(<>) :: (xs :& h) -> (xs :& h) -> xs :& h

sconcat :: NonEmpty (xs :& h) -> xs :& h

stimes :: Integral b => b -> (xs :& h) -> xs :& h

(WrapForall Semigroup h xs, WrapForall Monoid h xs) => Monoid (xs :& h)

Defined in Data.Extensible.Dictionary

Methods

mempty :: xs :& h

mappend :: (xs :& h) -> (xs :& h) -> xs :& h

mconcat :: [xs :& h] -> xs :& h

WrapForall Lift h xs => Lift (xs :& h)

Defined in Data.Extensible.Dictionary

Methods

lift :: (xs :& h) -> Q Exp

WrapForall Arbitrary h xs => Arbitrary (xs :& h)

Defined in Data.Extensible.Dictionary

Methods

arbitrary :: Gen (xs :& h)

shrink :: (xs :& h) -> [xs :& h]

WrapForall Hashable h xs => Hashable (xs :& h)

Defined in Data.Extensible.Dictionary

Methods

hashWithSalt :: Int -> (xs :& h) -> Int

hash :: (xs :& h) -> Int

Forall (KeyTargetAre KnownSymbol (Instance1 ToJSON h)) xs => ToJSON (xs :& Nullable (Field h :: Assoc Symbol v -> Type))

Defined in Data.Extensible.Dictionary

Methods

toJSON :: (xs :& Nullable (Field h)) -> Value

toEncoding :: (xs :& Nullable (Field h)) -> Encoding

toJSONList :: [xs :& Nullable (Field h)] -> Value

toEncodingList :: [xs :& Nullable (Field h)] -> Encoding

Forall (KeyTargetAre KnownSymbol (Instance1 ToJSON h)) xs => ToJSON (xs :& (Field h :: Assoc Symbol v -> Type))

Defined in Data.Extensible.Dictionary

Methods

toJSON :: (xs :& Field h) -> Value

toEncoding :: (xs :& Field h) -> Encoding

toJSONList :: [xs :& Field h] -> Value

toEncodingList :: [xs :& Field h] -> Encoding

Forall (KeyTargetAre KnownSymbol (Instance1 FromJSON h)) xs => FromJSON (xs :& Nullable (Field h :: Assoc Symbol v -> Type))

Defined in Data.Extensible.Dictionary

Methods

parseJSON :: Value -> Parser (xs :& Nullable (Field h))

parseJSONList :: Value -> Parser [xs :& Nullable (Field h)]

Forall (KeyTargetAre KnownSymbol (Instance1 FromJSON h)) xs => FromJSON (xs :& (Field h :: Assoc Symbol v -> Type))

parseJSON Null is called for missing fields.

Defined in Data.Extensible.Dictionary

Methods

parseJSON :: Value -> Parser (xs :& Field h)

parseJSONList :: Value -> Parser [xs :& Field h]

WrapForall FromField h xs => FromRecord (xs :& h)

Defined in Data.Extensible.Dictionary

Methods

parseRecord :: Record -> Parser (xs :& h)

WrapForall ToField h xs => ToRecord (xs :& h)

Defined in Data.Extensible.Dictionary

Methods

toRecord :: (xs :& h) -> Record

Forall (KeyTargetAre KnownSymbol (Instance1 FromField h)) xs => FromNamedRecord (xs :& (Field h :: Assoc Symbol v -> Type))

Defined in Data.Extensible.Dictionary

Methods

parseNamedRecord :: NamedRecord -> Parser (xs :& Field h)

Forall (KeyTargetAre KnownSymbol (Instance1 ToField h)) xs => ToNamedRecord (xs :& (Field h :: Assoc Symbol v -> Type))

Defined in Data.Extensible.Dictionary

Methods

toNamedRecord :: (xs :& Field h) -> NamedRecord

WrapForall NFData h xs => NFData (xs :& h)

Defined in Data.Extensible.Dictionary

Methods

rnf :: (xs :& h) -> ()

WrapForall Pretty h xs => Pretty (xs :& h)

Defined in Data.Extensible.Dictionary

Methods

pretty :: (xs :& h) -> Doc ann

prettyList :: [xs :& h] -> Doc ann

WrapForall Unbox h (x ': xs) => Unbox ((x ': xs) :& h)

Defined in Data.Extensible.Dictionary

type AllB (c :: k -> Constraint) ((:&) xs :: (k -> Type) -> Type)

Defined in Data.Extensible.Dictionary

type AllB (c :: k -> Constraint) ((:&) xs :: (k -> Type) -> Type) = Forall c xs

type ExtensibleConstr ((:&) :: [k] -> (k -> Type) -> Type) (xs :: [k]) (h :: k -> Type) (x :: k)

Defined in Data.Extensible.Struct

type ExtensibleConstr ((:&) :: [k] -> (k -> Type) -> Type) (xs :: [k]) (h :: k -> Type) (x :: k) = ()

newtype MVector s (xs :& h)

Defined in Data.Extensible.Dictionary

newtype MVector s (xs :& h) = MV_Product (xs :& Comp (MVector s) h)

newtype Vector (xs :& h)

Defined in Data.Extensible.Dictionary

newtype Vector (xs :& h) = V_Product (xs :& Comp Vector h)

type (:*) h xs = xs :& h

Deprecated: Use :& instead

nil :: '[] :& h

An empty product.

(<:) :: h x -> (xs :& h) -> (x ': xs) :& h infixr 0

O(n) Prepend an element onto a product. Expressions like a <: b <: c <: nil are transformed to a single fromHList.

(<!) :: h x -> (xs :& h) -> (x ': xs) :& h infixr 0

Strict version of (<:).

(=<:) :: Wrapper h => Repr h x -> (xs :& h) -> (x ': xs) :& h infixr 0

hlength :: (xs :& h) -> Int

The size of a product.

type family (xs :: [k]) ++ (ys :: [k]) :: [k] where ... infixr 5

Concatenate type level lists

Equations

'[] ++ ys = ys

(x ': xs) ++ ys = x ': (xs ++ ys)

happend :: (xs :& h) -> (ys :& h) -> (xs ++ ys) :& h infixr 5

Combine products.

hmap :: (forall x. g x -> h x) -> (xs :& g) -> xs :& h

Transform every element in a product, preserving the order.

hmap id ≡ id
hmap (f . g) ≡ hmap f . hmap g

hmapWithIndex :: (forall x. Membership xs x -> g x -> h x) -> (xs :& g) -> xs :& h

Map a function to every element of a product.

hzipWith :: (forall x. f x -> g x -> h x) -> (xs :& f) -> (xs :& g) -> xs :& h

zipWith for heterogeneous product

hzipWith3 :: (forall x. f x -> g x -> h x -> i x) -> (xs :& f) -> (xs :& g) -> (xs :& h) -> xs :& i

zipWith3 for heterogeneous product

hfoldMap :: Monoid a => (forall x. h x -> a) -> (xs :& h) -> a

Map elements to a monoid and combine the results.

hfoldMap f . hmap g ≡ hfoldMap (f . g)

hfoldMapWithIndex :: Monoid a => (forall x. Membership xs x -> g x -> a) -> (xs :& g) -> a

hfoldMap with the membership of elements.

hfoldrWithIndex :: (forall x. Membership xs x -> h x -> r -> r) -> r -> (xs :& h) -> r

Right-associative fold of a product.

hfoldlWithIndex :: (forall x. Membership xs x -> r -> h x -> r) -> r -> (xs :& h) -> r

Perform a strict left fold over the elements.

htraverse :: Applicative f => (forall x. g x -> f (h x)) -> (xs :& g) -> f (xs :& h)

Traverse all elements and combine the result sequentially. htraverse (fmap f . g) ≡ fmap (hmap f) . htraverse g htraverse pure ≡ pure htraverse (Comp . fmap g . f) ≡ Comp . fmap (htraverse g) . htraverse f

htraverseWithIndex :: Applicative f => (forall x. Membership xs x -> g x -> f (h x)) -> (xs :& g) -> f (xs :& h)

htraverse with Memberships.

hsequence :: Applicative f => (xs :& Comp f h) -> f (xs :& h)

sequence analog for extensible products

Constrained fold

hmapWithIndexFor :: Forall c xs => proxy c -> (forall x. c x => Membership xs x -> g x -> h x) -> (xs :& g) -> xs :& h

Map a function to every element of a product.

hfoldMapFor :: (Forall c xs, Monoid a) => proxy c -> (forall x. c x => h x -> a) -> (xs :& h) -> a

Constrained hfoldMap

hfoldMapWithIndexFor :: (Forall c xs, Monoid a) => proxy c -> (forall x. c x => Membership xs x -> h x -> a) -> (xs :& h) -> a

hfoldMapWithIndex with a constraint for each element.

hfoldrWithIndexFor :: forall c xs h r proxy. Forall c xs => proxy c -> (forall x. c x => Membership xs x -> h x -> r -> r) -> r -> (xs :& h) -> r

hfoldrWithIndex with a constraint for each element.

hfoldlWithIndexFor :: Forall c xs => proxy c -> (forall x. c x => Membership xs x -> r -> h x -> r) -> r -> (xs :& h) -> r

Constrained hfoldlWithIndex

Constraind fold without proxies

hfoldMapWith :: forall c xs h a. (Forall c xs, Monoid a) => (forall x. c x => h x -> a) -> (xs :& h) -> a

Constrained hfoldMap

hfoldMapWithIndexWith :: forall c xs h a. (Forall c xs, Monoid a) => (forall x. c x => Membership xs x -> h x -> a) -> (xs :& h) -> a

hfoldMapWithIndex with a constraint for each element.

hfoldrWithIndexWith :: forall c xs h r. Forall c xs => (forall x. c x => Membership xs x -> h x -> r -> r) -> r -> (xs :& h) -> r

hfoldlWithIndexWith :: forall c xs h r. Forall c xs => (forall x. c x => Membership xs x -> r -> h x -> r) -> r -> (xs :& h) -> r

Constrained hfoldlWithIndex

hmapWithIndexWith :: forall c xs g h. Forall c xs => (forall x. c x => Membership xs x -> g x -> h x) -> (xs :& g) -> xs :& h

Evaluating

hforce :: (xs :& h) -> xs :& h

Evaluate every element in a product.

Update

haccumMap :: Foldable f => (a -> xs :/ g) -> (forall x. Membership xs x -> g x -> h x -> h x) -> (xs :& h) -> f a -> xs :& h

Accumulate sums on a product.

haccum :: Foldable f => (forall x. Membership xs x -> g x -> h x -> h x) -> (xs :& h) -> f (xs :/ g) -> xs :& h

haccum = haccumMap id

hpartition :: (Foldable f, Generate xs) => (a -> xs :/ h) -> f a -> xs :& Comp [] h

Group sums by type.

Lookup

hlookup :: Membership xs x -> (xs :& h) -> h x

Get an element in a product.

hindex :: (xs :& h) -> Membership xs x -> h x

Flipped hlookup

Generation

class Generate (xs :: [k]) where

Every type-level list is an instance of Generate.

Methods

henumerate :: (forall (x :: k). Membership xs x -> r -> r) -> r -> r

Enumerate all possible Memberships of xs.

hcount :: proxy xs -> Int

Count the number of memberships.

hgenerateList :: Applicative f => (forall (x :: k). Membership xs x -> f (h x)) -> f (HList h xs)

Enumerate Memberships and construct an HList.

Instances

Generate ([] :: [k])

Defined in Type.Membership

Methods

henumerate :: (forall (x :: k0). Membership [] x -> r -> r) -> r -> r

hcount :: proxy [] -> Int

hgenerateList :: Applicative f => (forall (x :: k0). Membership [] x -> f (h x)) -> f (HList h [])

Generate xs => Generate (x ': xs :: [k])

Defined in Type.Membership

Methods

henumerate :: (forall (x0 :: k0). Membership (x ': xs) x0 -> r -> r) -> r -> r

hcount :: proxy (x ': xs) -> Int

hgenerateList :: Applicative f => (forall (x0 :: k0). Membership (x ': xs) x0 -> f (h x0)) -> f (HList h (x ': xs))

hgenerate :: (Generate xs, Applicative f) => (forall x. Membership xs x -> f (h x)) -> f (xs :& h)

Applicative version of htabulate.

htabulate :: Generate xs => (forall x. Membership xs x -> h x) -> xs :& h

Construct a product using a function which takes a Membership.

hmap f (htabulate g) ≡ htabulate (f . g)
htabulate (hindex m) ≡ m
hindex (htabulate k) ≡ k

hrepeat :: Generate xs => (forall x. h x) -> xs :& h

A product filled with the specified value.

hcollect :: (Functor f, Generate xs) => (a -> xs :& h) -> f a -> xs :& Comp f h

The dual of htraverse

hdistribute :: (Functor f, Generate xs) => f (xs :& h) -> xs :& Comp f h

The dual of hsequence

fromHList :: HList h xs -> xs :& h

Convert HList into a product.

toHList :: forall h xs. (xs :& h) -> HList h xs

Convert a product into an HList.

class (ForallF c xs, Generate xs) => Forall (c :: k -> Constraint) (xs :: [k]) where

Every element in xs satisfies c

Methods

henumerateFor :: proxy c -> proxy' xs -> (forall (x :: k). c x => Membership xs x -> r -> r) -> r -> r

Enumerate all possible Memberships of xs with an additional context.

hgenerateListFor :: Applicative f => proxy c -> (forall (x :: k). c x => Membership xs x -> f (h x)) -> f (HList h xs)

Instances

Forall (c :: k -> Constraint) ([] :: [k])

Defined in Type.Membership

Methods

henumerateFor :: proxy c -> proxy' [] -> (forall (x :: k0). c x => Membership [] x -> r -> r) -> r -> r

hgenerateListFor :: Applicative f => proxy c -> (forall (x :: k0). c x => Membership [] x -> f (h x)) -> f (HList h [])

(c x, Forall c xs) => Forall (c :: a -> Constraint) (x ': xs :: [a])

Defined in Type.Membership

Methods

henumerateFor :: proxy c -> proxy' (x ': xs) -> (forall (x0 :: k). c x0 => Membership (x ': xs) x0 -> r -> r) -> r -> r

hgenerateListFor :: Applicative f => proxy c -> (forall (x0 :: k). c x0 => Membership (x ': xs) x0 -> f (h x0)) -> f (HList h (x ': xs))

hgenerateFor :: (Forall c xs, Applicative f) => proxy c -> (forall x. c x => Membership xs x -> f (h x)) -> f (xs :& h)

Applicative version of htabulateFor.

htabulateFor :: Forall c xs => proxy c -> (forall x. c x => Membership xs x -> h x) -> xs :& h

Pure version of hgenerateFor.

hrepeatFor :: Forall c xs => proxy c -> (forall x. c x => h x) -> xs :& h

A product filled with the specified value.

hgenerateWith :: forall c xs f h. (Forall c xs, Applicative f) => (forall x. c x => Membership xs x -> f (h x)) -> f (xs :& h)

Applicative version of htabulateFor.

htabulateWith :: forall c xs h. Forall c xs => (forall x. c x => Membership xs x -> h x) -> xs :& h

Pure version of hgenerateFor.

hrepeatWith :: forall c xs h. Forall c xs => (forall x. c x => h x) -> xs :& h

A product filled with the specified value.