Documentation

This handler stores a polymorphic function which changes the type of the containers.

>>> let f (x :: f a) = Const @String @a $ show x

>>> let xs = (Just @Int 5) ./ Right @Int False ./ "X" ./ (Left @Int @Bool 6) ./ nil

>>> afmap (CasedIxedFunc @Show f) xs :: Many '[Const String Int, Const String Bool, Const String Char, Const String Bool]
Const "Just 5" ./ Const "Right False" ./ Const "\"X\"" ./ Const "Left 6" ./ nil

>>> atraverse (CasedIxedFunc @Show f) xs :: Const String (Many '[Int, Bool, Char, Bool])
Const "Just 5Right False\"X\"Left 6"

A variant of CaseIxedFunc for which the type of both containers is fixed.

A variant of CaseIxedFunc with more constraints.

>>> let xs = (Just @Int 5) ./ Right @Int False ./ "X" ./ (Left @Int @Bool 6) ./ nil

>>> afmap (CaseIxedFunc1 @C0 @Foldable @C0 toList) xs
[5] ./ [False] ./ "X" ./ [] ./ nil

>>> atraverse (CaseIxedFunc1 @C0 @Foldable @C0 toList) xs
[]

>>> let ys = (Just @Int 5) ./ Right @Int False ./ "XYZ" ./ nil

>>> atraverse (CaseIxedFunc1 @C0 @Foldable @C0 toList) ys
[5 ./ False ./ 'X' ./ nil,5 ./ False ./ 'Y' ./ nil,5 ./ False ./ 'Z' ./ nil]

A variant of CaseIxedFunc1 for which the type of both containers is fixed.

A variant of CaseIxedFunc which maps containers within an additional layer.

>>> let f (x :: f a) = Const @String @a $ show x

>>> let xs = (Just @Int 5) ./ Right @Int False ./ "X" ./ (Left @Int @Bool 6) ./ nil

>>> atraverse (CaseIxedFuncM @Show $ \x -> f x <$ print x) xs
Just 5
Right False
"X"
Left 6
Const "Just 5" ./ Const "Right False" ./ Const "\"X\"" ./ Const "Left 6" ./ nil

A variant of CaseIxedFuncM for which the type of both containers is fixed.

A variant of CaseIxedFuncM with more constraints.

>>> let xs = (Just @Int 5) ./ Right @Int False ./ "XYZ" ./ nil

>>> atraverse (CaseIxedFuncM1 @C0 @Foldable @C0 @[] @Maybe $ Just . toList) xs
Just ([5] ./ [False] ./ "XYZ" ./ nil)

A variant of CaseIxedFuncM1 for which the type of both containers is fixed.

This handler stores a polymorphic function which maps containers to continuations.

This is especially useful for building Cases using afmap.

A variant of CaseIxedCont for which the type of both containers is fixed.

>>> let ps = Predicate @Int (> 5) ./ Predicate isLetter ./ Predicate id ./ nil

>>> let ps' = cases $ afmap (CaseIxedCont_ @C0 getPredicate) ps

>>> switch (pick @Int @'[Int, Bool, Char] 5) ps' :: Bool
False

>>> switch (pick @Char @'[Int, Bool, Char] 6) ps' :: Bool
True

>>> switch (pick @Char @'[Int, Bool, Char] '_') ps' :: Bool
False

>>> switch (pick @Int @'[Int, Bool, Char] 'a') ps' :: Bool
True

>>> switch (pick @Bool @'[Int, Bool, Char] False) ps' :: Bool
False

>>> switch (pick @Bool @'[Int, Bool, Char] True) ps' :: Bool
True

A variant of CaseIxedCont with more constraints.

A variant of CaseIxedCont1_ for which the type of both containers is fixed.