Moduleone-liner-2.1Haskell2010

Generics.OneLiner.Binary

These generic functions allow changing the types of the constant leaves. They require type classes with 2 parameters, the first for the input type and the second for the output type.

All functions without postfix are for instances of Generic, and functions with postfix 1 are for instances of Generic1 (with kind Type -> Type) which get an extra argument to specify how to deal with the parameter. Functions with postfix 01 are also for Generic1 but they get yet another argument that, like the Generic functions, allows handling of constant leaves.

9 types
11 classes
25 values

Packageone-liner-2.1
Exports46
LanguageHaskell2010
LicenceBSD-3-Clause
SourceBinary.hs

Traversing values

9 declarations

valuegmap

:: (ADT t t', Constraints t t' c)
=> forall s s'. c s s' => s -> s'
-> t
-> t'

Map over a structure, updating each component.

gmap is generic specialized to (->).

valuegtraverse

:: (ADT t t', Constraints t t' c, Applicative f)
=> forall s s'. c s s' => s -> f s'
-> t
-> f t'

Map each component of a structure to an action, evaluate these actions from left to right, and collect the results.

gtraverse is generic specialized to Star.

valueglmap

:: (ADT t t', Constraints t t' c)
=> forall s s'. c s s' => s %1 -> s'
-> t
-> t'

Map over a structure linearly, updating each component.

glmap is generic specialized to the linear arrow.

valuegltraverse

:: (ADT t t', Constraints t t' c, Applicative f)
=> forall s s'. c s s' => s %1 -> f s'
-> t
-> f t'

Map each component of a structure to an action linearly, evaluate these actions from left to right, and collect the results.

gltraverse is generic specialized to linear Kleisli.

valuegmap1

:: (ADT1 t t', Constraints1 t t' c)
=> forall d e (s :: Type -> Type) (s' :: Type -> Type). c s s' => (d -> e) -> s d -> s' e
-> a -> b
-> t a
-> t' b

gmap1 is generic1 specialized to (->).

valuegtraverse1

:: (ADT1 t t', Constraints1 t t' c, Applicative f)
=> forall d e (s :: Type -> Type) (s' :: Type -> Type). c s s' => (d -> f e) -> s d -> f (s' e)
-> a -> f b
-> t a
-> f (t' b)

gtraverse1 is generic1 specialized to Star.

valueglmap1

:: (ADT1 t t', Constraints1 t t' c)
=> forall d e (s :: Type -> Type) (s' :: Type -> Type). c s s' => (d %1 -> e) -> s d %1 -> s' e
-> a %1 -> b
-> t a
-> t' b

glmap1 is generic1 specialized to the linear arrow.

valuegltraverse1

:: (ADT1 t t', Constraints1 t t' c, Applicative f)
=> forall d e (s :: Type -> Type) (s' :: Type -> Type). c s s' => (d %1 -> f e) -> s d %1 -> f (s' e)
-> a %1 -> f b
-> t a
-> f (t' b)

gltraverse1 is generic1 specialized to linear Kleisli.

valuegltraverse01

:: (ADT1 t t', Constraints01 t t' (D Movable) c, Applicative f)
=> forall d e (s :: Type -> Type) (s' :: Type -> Type). c s s' => (d %1 -> f e) -> s d %1 -> f (s' e)
-> a %1 -> f b
-> t a
-> f (t' b)

gltraverse01 is generic01 specialized to linear Kleisli, requiring Movable for constants.

Combining values

2 declarations

valuezipWithA

:: (ADT t t', Constraints t t' c, Alternative f)
=> forall s s'. c s s' => s -> s -> f s'
-> t
-> t
-> f t'

Combine two values by combining each component of the structures with the given function, under an applicative effect. Returns empty if the constructors don't match.

zipWithA is generic specialized to Zip

valuezipWithA1

:: (ADT1 t t', Constraints1 t t' c, Alternative f)
=> forall d e (s :: Type -> Type) (s' :: Type -> Type). c s s' => (d -> d -> f e) -> s d -> s d -> f (s' e)
-> a -> a -> f b
-> t a
-> t a
-> f (t' b)

zipWithA1 is generic1 specialized to Zip

Functions for records

5 declarations

These functions only work for single constructor data types.

valueunaryOp

:: (ADTRecord t t', Constraints t t' c)
=> forall s s'. c s s' => s -> s'
-> t
-> t'

Implement a unary operator by calling the operator on the components. This is here for consistency, it is the same as record.

negate = unaryOp @Num negate

valuebinaryOp

:: (ADTRecord t t', Constraints t t' c)
=> forall s s'. c s s' => s -> s -> s'
-> t
-> t
-> t'

Implement a binary operator by calling the operator on the components.

mappend = binaryOp @Monoid mappend
(+) = binaryOp @Num (+)

binaryOp is algebra specialized to pairs.

valuealgebra

:: (ADTRecord t t', Constraints t t' c, Functor f)
=> forall s s'. c s s' => f s -> s'
-> f t
-> t'

Create an F-algebra, given an F-algebra for each of the components.

binaryOp f l r = algebra @c (\(Pair a b) -> f a b) (Pair l r)

algebra is record specialized to Costar.

valuedialgebra

:: (ADTRecord t t', Constraints t t' c, Functor f, Applicative g)
=> forall s s'. c s s' => f s -> g s'
-> f t
-> g t'

dialgebra is record specialized to Biff (->).

valuegcotraverse1

:: (ADTRecord1 t t', Constraints1 t t' c, Functor f)
=> forall d e (s :: Type -> Type) (s' :: Type -> Type). c s s' => (f d -> e) -> f (s d) -> s' e
-> f a -> b
-> f (t a)
-> t' b

gcotraverse1 is record1 specialized to Costar.

Generic programming with profunctors

9 declarations

All the above functions have been implemented using these functions, using different profunctors.

valuerecord

:: (ADTRecord t t', Constraints t t' c, GenericRecordProfunctor p)
=> forall s s'. c s s' => p s s'
-> p t t'

valuenonEmpty

:: (ADTNonEmpty t t', Constraints t t' c, GenericNonEmptyProfunctor p)
=> forall s s'. c s s' => p s s'
-> p t t'

valuegeneric

:: (ADT t t', Constraints t t' c, GenericProfunctor p)
=> forall s s'. c s s' => p s s'
-> p t t'

valuerecord1

:: (ADTRecord1 t t', Constraints1 t t' c, GenericRecordProfunctor p)
=> forall d e (s :: Type -> Type) (s' :: Type -> Type). c s s' => p d e -> p (s d) (s' e)
-> p a b
-> p (t a) (t' b)

valuenonEmpty1

:: (ADTNonEmpty1 t t', Constraints1 t t' c, GenericNonEmptyProfunctor p)
=> forall d e (s :: Type -> Type) (s' :: Type -> Type). c s s' => p d e -> p (s d) (s' e)
-> p a b
-> p (t a) (t' b)

valuegeneric1

:: (ADT1 t t', Constraints1 t t' c, Generic1Profunctor p)
=> forall d e (s :: Type -> Type) (s' :: Type -> Type). c s s' => p d e -> p (s d) (s' e)
-> p a b
-> p (t a) (t' b)

valuerecord01

:: (ADTRecord1 t t', Constraints01 t t' c0 c1, GenericRecordProfunctor p)
=> forall s s'. c0 s s' => p s s'
-> forall d e (s :: Type -> Type) (s' :: Type -> Type). c1 s s' => p d e -> p (s d) (s' e)
-> p a b
-> p (t a) (t' b)

valuenonEmpty01

:: (ADTNonEmpty1 t t', Constraints01 t t' c0 c1, GenericNonEmptyProfunctor p)
=> forall s s'. c0 s s' => p s s'
-> forall d e (s :: Type -> Type) (s' :: Type -> Type). c1 s s' => p d e -> p (s d) (s' e)
-> p a b
-> p (t a) (t' b)

valuegeneric01

:: (ADT1 t t', Constraints01 t t' c0 c1, GenericProfunctor p)
=> forall s s'. c0 s s' => p s s'
-> forall d e (s :: Type -> Type) (s' :: Type -> Type). c1 s s' => p d e -> p (s d) (s' e)
-> p a b
-> p (t a) (t' b)

Classes

class

class (Profunctor p, GenericUnitProfunctor p, GenericProductProfunctor p) => GenericRecordProfunctor (p :: Type -> Type -> Type)

A generic function using a GenericRecordProfunctor works on any data type with exactly one constructor, a.k.a. records, with multiple fields (mult) or no fields (unit).

GenericRecordProfunctor is similar to ProductProfuctor from the product-profunctor package, but using types from GHC.Generics.

Instances1GenericRecordProfunctor

(Profunctor p, GenericUnitProfunctor p, GenericProductProfunctor p) => GenericRecordProfunctor pDefined in one-liner-2.1 · Generics.OneLiner.Classes

classclass (GenericRecordProfunctor p, GenericSumProfunctor p) => GenericNonEmptyProfunctor (p :: Type -> Type -> Type)

A generic function using a GenericNonEmptyProfunctor works on any data type with at least one constructor.

Instances1GenericNonEmptyProfunctor

(GenericRecordProfunctor p, GenericSumProfunctor p) => GenericNonEmptyProfunctor pDefined in one-liner-2.1 · Generics.OneLiner.Classes

classclass (GenericNonEmptyProfunctor p, GenericEmptyProfunctor p) => GenericProfunctor (p :: Type -> Type -> Type)

A generic function using a GenericProfunctor works on any algebraic data type of kind Type, including those with no constructors and constants.

Instances1GenericProfunctor

(GenericNonEmptyProfunctor p, GenericEmptyProfunctor p) => GenericProfunctor pDefined in one-liner-2.1 · Generics.OneLiner.Classes

classclass (GenericProfunctor p, GenericConstantProfunctor p) => Generic1Profunctor (p :: Type -> Type -> Type)

A generic function using a Generic1Profunctor works on any algebraic data type of kind Type -> Type, including those with no constructors and constants.

Instances1Generic1Profunctor

(GenericProfunctor p, GenericConstantProfunctor p) => Generic1Profunctor pDefined in one-liner-2.1 · Generics.OneLiner.Classes

classclass Profunctor p => GenericUnitProfunctor (p :: Type -> Type -> Type) where

Methods

unit :: p (U1 a) (U1 a')

Instances13GenericUnitProfunctor, …

Applicative f => GenericUnitProfunctor (Zip f)Defined in one-liner-2.1 · Generics.OneLiner.Classes
Applicative f => GenericUnitProfunctor (Kleisli f)Defined in one-liner-2.1 · Generics.OneLiner.Classes
GenericUnitProfunctor CtorDefined in one-liner-2.1 · Generics.OneLiner.Internal
GenericUnitProfunctor TaggedDefined in one-liner-2.1 · Generics.OneLiner.Classes
Applicative f => GenericUnitProfunctor (Star f)Defined in one-liner-2.1 · Generics.OneLiner.Classes
Functor f => GenericUnitProfunctor (Costar f)Defined in one-liner-2.1 · Generics.OneLiner.Classes
GenericUnitProfunctor (->)Defined in one-liner-2.1 · Generics.OneLiner.Classes
Divisible f => GenericUnitProfunctor (Clown f)Defined in one-liner-2.1 · Generics.OneLiner.Classes
Applicative f => GenericUnitProfunctor (Joker f)Defined in one-liner-2.1 · Generics.OneLiner.Classes
GenericUnitProfunctor (FUN 'One)Defined in one-liner-2.1 · Generics.OneLiner.Classes
(GenericUnitProfunctor p, GenericUnitProfunctor q) => GenericUnitProfunctor (Product p q)Defined in one-liner-2.1 · Generics.OneLiner.Classes
(Applicative f, GenericUnitProfunctor p) => GenericUnitProfunctor (Tannen f p)Defined in one-liner-2.1 · Generics.OneLiner.Classes
(Functor f, Applicative g, Profunctor p, GenericUnitProfunctor p) => GenericUnitProfunctor (Biff p f g)Defined in one-liner-2.1 · Generics.OneLiner.Classes

classclass Profunctor p => GenericProductProfunctor (p :: Type -> Type -> Type) where

Methods

mult :: p (f a) (f' a') -> p (g a) (g' a') -> p ((:*:) f g a) ((:*:) f' g' a')

Instances13GenericProductProfunctor, …

Applicative f => GenericProductProfunctor (Zip f)Defined in one-liner-2.1 · Generics.OneLiner.Classes
Applicative f => GenericProductProfunctor (Kleisli f)Defined in one-liner-2.1 · Generics.OneLiner.Classes
GenericProductProfunctor CtorDefined in one-liner-2.1 · Generics.OneLiner.Internal
GenericProductProfunctor TaggedDefined in one-liner-2.1 · Generics.OneLiner.Classes
Applicative f => GenericProductProfunctor (Star f)Defined in one-liner-2.1 · Generics.OneLiner.Classes
Functor f => GenericProductProfunctor (Costar f)Defined in one-liner-2.1 · Generics.OneLiner.Classes
GenericProductProfunctor (->)Defined in one-liner-2.1 · Generics.OneLiner.Classes
Divisible f => GenericProductProfunctor (Clown f)Defined in one-liner-2.1 · Generics.OneLiner.Classes
Applicative f => GenericProductProfunctor (Joker f)Defined in one-liner-2.1 · Generics.OneLiner.Classes
GenericProductProfunctor (FUN 'One)Defined in one-liner-2.1 · Generics.OneLiner.Classes
(GenericProductProfunctor p, GenericProductProfunctor q) => GenericProductProfunctor (Product p q)Defined in one-liner-2.1 · Generics.OneLiner.Classes
(Applicative f, GenericProductProfunctor p) => GenericProductProfunctor (Tannen f p)Defined in one-liner-2.1 · Generics.OneLiner.Classes
(Functor f, Applicative g, Profunctor p, GenericProductProfunctor p) => GenericProductProfunctor (Biff p f g)Defined in one-liner-2.1 · Generics.OneLiner.Classes

classclass Profunctor p => GenericSumProfunctor (p :: Type -> Type -> Type) where

Methods

plus :: p (f a) (f' a') -> p (g a) (g' a') -> p ((:+:) f g a) ((:+:) f' g' a')

Instances10GenericSumProfunctor, …

Alternative f => GenericSumProfunctor (Zip f)Defined in one-liner-2.1 · Generics.OneLiner.Classes
Applicative f => GenericSumProfunctor (Kleisli f)Defined in one-liner-2.1 · Generics.OneLiner.Classes
GenericSumProfunctor CtorDefined in one-liner-2.1 · Generics.OneLiner.Internal
Applicative f => GenericSumProfunctor (Star f)Defined in one-liner-2.1 · Generics.OneLiner.Classes
GenericSumProfunctor (->)Defined in one-liner-2.1 · Generics.OneLiner.Classes
Decidable f => GenericSumProfunctor (Clown f)Defined in one-liner-2.1 · Generics.OneLiner.Classes
Alternative f => GenericSumProfunctor (Joker f)Defined in one-liner-2.1 · Generics.OneLiner.Classes
GenericSumProfunctor (FUN 'One)Defined in one-liner-2.1 · Generics.OneLiner.Classes
(GenericSumProfunctor p, GenericSumProfunctor q) => GenericSumProfunctor (Product p q)Defined in one-liner-2.1 · Generics.OneLiner.Classes
(Applicative f, GenericSumProfunctor p) => GenericSumProfunctor (Tannen f p)Defined in one-liner-2.1 · Generics.OneLiner.Classes

classclass Profunctor p => GenericEmptyProfunctor (p :: Type -> Type -> Type) where

Methods

zero :: p (V1 a) (V1 a')

Instances10GenericEmptyProfunctor, …

Functor f => GenericEmptyProfunctor (Zip f)Defined in one-liner-2.1 · Generics.OneLiner.Classes
Applicative f => GenericEmptyProfunctor (Kleisli f)Defined in one-liner-2.1 · Generics.OneLiner.Classes
GenericEmptyProfunctor CtorDefined in one-liner-2.1 · Generics.OneLiner.Internal
Functor f => GenericEmptyProfunctor (Star f)Defined in one-liner-2.1 · Generics.OneLiner.Classes
GenericEmptyProfunctor (->)Defined in one-liner-2.1 · Generics.OneLiner.Classes
Decidable f => GenericEmptyProfunctor (Clown f)Defined in one-liner-2.1 · Generics.OneLiner.Classes
Alternative f => GenericEmptyProfunctor (Joker f)Defined in one-liner-2.1 · Generics.OneLiner.Classes
GenericEmptyProfunctor (FUN 'One)Defined in one-liner-2.1 · Generics.OneLiner.Classes
(GenericEmptyProfunctor p, GenericEmptyProfunctor q) => GenericEmptyProfunctor (Product p q)Defined in one-liner-2.1 · Generics.OneLiner.Classes
(Applicative f, GenericEmptyProfunctor p) => GenericEmptyProfunctor (Tannen f p)Defined in one-liner-2.1 · Generics.OneLiner.Classes

classclass Profunctor p => GenericConstantProfunctor (p :: Type -> Type -> Type) where

Methods

identity :: p c c

Instances10GenericConstantProfunctor, …

Alternative f => GenericConstantProfunctor (Zip f)Defined in one-liner-2.1 · Generics.OneLiner.Classes
Applicative f => GenericConstantProfunctor (Kleisli f)Defined in one-liner-2.1 · Generics.OneLiner.Classes
GenericConstantProfunctor CtorDefined in one-liner-2.1 · Generics.OneLiner.Internal
Applicative f => GenericConstantProfunctor (Star f)Defined in one-liner-2.1 · Generics.OneLiner.Classes
GenericConstantProfunctor (->)Defined in one-liner-2.1 · Generics.OneLiner.Classes
Decidable f => GenericConstantProfunctor (Clown f)Defined in one-liner-2.1 · Generics.OneLiner.Classes
Alternative f => GenericConstantProfunctor (Joker f)Defined in one-liner-2.1 · Generics.OneLiner.Classes
GenericConstantProfunctor (FUN 'One)Defined in one-liner-2.1 · Generics.OneLiner.Classes
(GenericConstantProfunctor p, GenericConstantProfunctor q) => GenericConstantProfunctor (Product p q)Defined in one-liner-2.1 · Generics.OneLiner.Classes
(Applicative f, GenericConstantProfunctor p) => GenericConstantProfunctor (Tannen f p)Defined in one-liner-2.1 · Generics.OneLiner.Classes

Types

12 declarations

typetype ADT t t' = (Generic t, Generic t', ADT' (Rep t) (Rep t'), Constraints t t' AnyType)

ADT is a constraint type synonym. The Generic instance can be derived, and any generic representation will be an instance of ADT' and AnyType.

typetype ADTNonEmpty t t' = (Generic t, Generic t', ADTNonEmpty' (Rep t) (Rep t'), Constraints t t' AnyType)

ADTNonEmpty is a constraint type synonym. An instance is an ADT with *at least* one constructor.

typetype ADTRecord t t' = (Generic t, Generic t', ADTRecord' (Rep t) (Rep t'), Constraints t t' AnyType)

ADTRecord is a constraint type synonym. An instance is an ADT with *exactly* one constructor.

typetype Constraints t t' (c :: Type -> Type -> Constraint) = Constraints' (Rep t) (Rep t') c AnyType

Constraints is a constraint type synonym, containing the constraint requirements for an instance for t of class c. It requires an instance of class c for each component of t.

type

type ADT1 (t :: Type -> Type) (t' :: Type -> Type) = (Generic1 t, Generic1 t', ADT1' (Rep1 t) (Rep1 t'), Constraints1 t t' AnyType)

type

type ADTNonEmpty1 (t :: Type -> Type) (t' :: Type -> Type) = (Generic1 t, Generic1 t', ADTNonEmpty1' (Rep1 t) (Rep1 t'), Constraints1 t t' AnyType)

type

type ADTRecord1 (t :: Type -> Type) (t' :: Type -> Type) = (Generic1 t, Generic1 t', ADTRecord1' (Rep1 t) (Rep1 t'), Constraints1 t t' AnyType)

type

type Constraints1 (t :: Type -> Type) (t' :: Type -> Type) (c :: (Type -> Type) -> (Type -> Type) -> Constraint) = Constraints' (Rep1 t) (Rep1 t') AnyType c

type

type Constraints01 (t :: Type -> Type) (t' :: Type -> Type) (c0 :: Type -> Type -> Constraint) (c1 :: (Type -> Type) -> (Type -> Type) -> Constraint) = Constraints' (Rep1 t) (Rep1 t') c0 c1

classclass FunConstraints (c :: Type -> Constraint) t where

Automatically apply a lifted function to a polymorphic argument as many times as possible.

A constraint `FunConstraint c t` is equivalent to the conjunction of constraints `c s` for every argument type of t.

If r is not a function type:

c a :- FunConstraints c (a -> r)
(c a, c b) :- FunConstraints c (a -> b -> r)
(c a, c b, c d) :- FunConstraints c (a -> b -> d -> r)

Instances2FunConstraints

FunResult r ~ r => FunConstraints c rDefined in one-liner-2.1 · Generics.OneLiner.Internal
(c a, FunConstraints c b) => FunConstraints c (a -> b)Defined in one-liner-2.1 · Generics.OneLiner.Internal

familytype family FunResult t where

The result type of a curried function.

If r is not a function type (i.e., does not unify with `_ -> _`):

FunResult (a -> r) ~ r
FunResult (a -> b -> r) ~ r
FunResult (a -> b -> c -> r) ~ r

Equations

FunResult (a -> b) = FunResult b
FunResult r = r

classclass AnyType (a :: k) (b :: k1)

Instances1AnyType

AnyType a bDefined in one-liner-2.1 · Generics.OneLiner.Internal