Data.Lazify.Generic.Internal

Record types in Haskell can be made lazy through lazy pattern matching. This module offers functions for making them lazy generically.

Documentation

class LazifiableG f where

A Generic representation that can be lazified.

Minimal complete definition

lazifyG

Methods

lazifyG :: f a -> f a

Lazify a Generic representation.

Instances

LazifiableG k (U1 k)

Methods

lazifyG :: f a -> f a

(LazifiableG k f, LazifiableG k g) => LazifiableG k ((:*:) k f g)

Methods

lazifyG :: f a -> f a

LazifiableG k (K1 k i c)

Methods

lazifyG :: f a -> f a

LazifiableG k f => LazifiableG k (S1 k c f)

Methods

lazifyG :: f a -> f a

LazifiableG k f => LazifiableG k (C1 k c f)

Methods

lazifyG :: f a -> f a

LazifiableG k f => LazifiableG k (D1 k (MetaData x y z False) f)

Methods

lazifyG :: f a -> f a

IsNewtypeG k f => LazifiableG k (D1 k (MetaData x y z True) f)

Methods

lazifyG :: f a -> f a

class IsNewtypeG f where

A Generic representation that should be lazified newtype-style. That is, its contents should be lazified.

Minimal complete definition

lazifyNewtypeG

Methods

lazifyNewtypeG :: f a -> f a

Dig into a newtype and lazify its payload generically.

Instances

(Generic a, LazifiableG * (Rep a)) => IsNewtypeG k (K1 k i a)

Methods

lazifyNewtypeG :: f a -> f a

IsNewtypeG k f => IsNewtypeG k (M1 k i c f)

Methods

lazifyNewtypeG :: f a -> f a

lazifyGeneric :: (Generic a, LazifiableG (Rep a)) => a -> a

Lazify a record using its generic representation.

Note that newtypes are treated specially: a newtype is lazified by lazifying its underlying type.

($~) :: forall rep a (b :: TYPE rep). (Generic a, LazifiableG (Rep a)) => (a -> b) -> a -> b

Apply a function to a lazified value.