Moduleproduct-profunctors-0.11.1.1Haskell2010

Data.Profunctor.Product.Examples

5 types
5 values

Packageproduct-profunctors-0.11.1.1
Exports10
LanguageHaskell2010
LicenceBSD-3-Clause
SourceExamples.hs

newtypenewtype Replicator r (f :: Type -> Type) a b

Constructors

Replicator (r -> f b)

Instances5Profunctor, ProductProfunctor, Default, Functor, Applicative

Functor f => Profunctor (Replicator r f)Defined in product-profunctors-0.11.1.1 · Data.Profunctor.Product.Examples
Applicative f => ProductProfunctor (Replicator r f)Defined in product-profunctors-0.11.1.1 · Data.Profunctor.Product.Examples
Applicative f => Default (Replicator (f b) f) b bDefined in product-profunctors-0.11.1.1 · Data.Profunctor.Product.Examples
Functor f => Functor (Replicator r f a)Defined in product-profunctors-0.11.1.1 · Data.Profunctor.Product.Examples
Applicative f => Applicative (Replicator r f a)Defined in product-profunctors-0.11.1.1 · Data.Profunctor.Product.Examples

valuereplicateT :: Default (Replicator r f) b b => r -> f b

A higher-order generalisation of replicate. For example

foo :: IO (String, String, String)
foo = replicateT getLine

> foo
Hello
world
!
("Hello","world","!")

newtypenewtype Take a z b

Constructors

Take ([a] -> Maybe ([a], b))

Instances5Profunctor, ProductProfunctor, Default, Functor, Applicative

Profunctor (Take a)Defined in product-profunctors-0.11.1.1 · Data.Profunctor.Product.Examples
ProductProfunctor (Take a)Defined in product-profunctors-0.11.1.1 · Data.Profunctor.Product.Examples
Default (Take a) z aDefined in product-profunctors-0.11.1.1 · Data.Profunctor.Product.Examples
Functor (Take a z)Defined in product-profunctors-0.11.1.1 · Data.Profunctor.Product.Examples
Applicative (Take a z)Defined in product-profunctors-0.11.1.1 · Data.Profunctor.Product.Examples

valuetakeT :: Default (Take a) b b => [a] -> Maybe b

A type safe generalisation of take. For example

> let count = [1..] :: [Int]
> takeT count :: Maybe (Int, Int)
Just (1,2)
> takeT count
    :: Maybe (Int, Int, (Int, (Int, Int), Int, Int),
              Const Int Bool, Identity (Int, Int), Tagged String Int)
Just (1,2,(3,(4,5),6,7),Const 8,Identity (9,10),Tagged 11)

newtypenewtype Traverse (f :: Type -> Type) a b

Constructors

Traverse
- runTraverse :: a -> f b

Instances5Profunctor, ProductProfunctor, Default, Functor, Applicative

Functor f => Profunctor (Traverse f)Defined in product-profunctors-0.11.1.1 · Data.Profunctor.Product.Examples
Applicative f => ProductProfunctor (Traverse f)Defined in product-profunctors-0.11.1.1 · Data.Profunctor.Product.Examples
Default (Traverse f) (f a) aDefined in product-profunctors-0.11.1.1 · Data.Profunctor.Product.Examples
Functor f => Functor (Traverse f a)Defined in product-profunctors-0.11.1.1 · Data.Profunctor.Product.Examples
Applicative f => Applicative (Traverse f a)Defined in product-profunctors-0.11.1.1 · Data.Profunctor.Product.Examples

valuetraverseT :: Default (Traverse f) a b => a -> f b

Use sequenceT instead. It has a better name.

typetype Sequence = Traverse

Actually, Sequence is a better name for this

valuesequenceT :: Default (Sequence f) a b => a -> f b

A higher-order generalisation of sequenceA. For example

> sequenceT (print 3110, putStrLn World) :: IO ((), ())
3110
World
((),())

newtypenewtype Zipper a b

Constructors

Zipper
- unZipper :: Traverse ZipList a b

Instances5Profunctor, ProductProfunctor, Default, Functor, Applicative

Profunctor ZipperDefined in product-profunctors-0.11.1.1 · Data.Profunctor.Product.Examples
ProductProfunctor ZipperDefined in product-profunctors-0.11.1.1 · Data.Profunctor.Product.Examples
a ~ b => Default Zipper [a] bDefined in product-profunctors-0.11.1.1 · Data.Profunctor.Product.Examples
Functor (Zipper a)Defined in product-profunctors-0.11.1.1 · Data.Profunctor.Product.Examples
Applicative (Zipper a)Defined in product-profunctors-0.11.1.1 · Data.Profunctor.Product.Examples

valuecl_map :: Default Zipper a b => (b -> r) -> a -> [r]

A challenge from a Clojurist on Hacker News (https://news.ycombinator.com/item?id=23939350)

> cl_map (uncurry (+)) ([1,2,3], [4,5,6])
[5,7,9]

> cl_map (+3) [1,2,3]
[4,5,6]

> let max3 (x, y, z) = x `max` y `max` z
> cl_map max3 ([1,20], [3,4], [5,6])
[5,20]