HORIZON HASKELLDocslts/ghc-9.10.xc74966e2026-09-27Search names, modules, packages, or :: a typeCtrl K

GHC 9.10.3 · lts/ghc-9.10.x · c74966e · 2026-09-27

Moduleindexed-profunctors-0.1.1.1Haskell2010

Data.Profunctor.Indexed

Definitions of concrete profunctors and profunctor classes.

  • 16 types
  • 8 classes
  • 9 values

Profunctor classes

10 declarations
classclass Profunctor (p :: Type -> Type -> Type -> Type) where
#

Methods

  • dimap :: (a -> b) -> (c -> d) -> p i b c -> p i a d
  • lmap :: (a -> b) -> p i b c -> p i a c
  • rmap :: (c -> d) -> p i b c -> p i b d
  • lcoerce' :: Coercible a b => p i a c -> p i b c
  • rcoerce' :: Coercible a b => p i c a -> p i c b
  • conjoined__ :: (p i a b -> p i s t) -> (p i a b -> p j s t) -> p i a b -> p j s t
  • ixcontramap :: (j -> i) -> p i a b -> p j a b
Instances15Profunctor, …
classclass Profunctor p => Strong (p :: Type -> Type -> Type -> Type) where
#

Methods

  • first' :: p i a b -> p i (a, c) (b, c)
  • second' :: p i a b -> p i (c, a) (c, b)
  • linear :: (forall (f :: Type -> Type). Functor f => (a -> f b) -> s -> f t) -> p i a b -> p i s t
  • ilinear :: (forall (f :: Type -> Type). Functor f => (i -> a -> f b) -> s -> f t) -> p j a b -> p (i -> j) s t
Instances12Strong, …
  • Strong FunArrowDefined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Strong IxFunArrowDefined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Functor f => Strong (IxStar f)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Functor f => Strong (IxStarA f)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Functor f => Strong (Star f)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Functor f => Strong (StarA f)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Strong (Forget r)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Strong (ForgetM r)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Strong (IxForget r)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Strong (IxForgetM r)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Strong (AffineMarket a b)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Strong (Store a b)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
classclass Profunctor p => Choice (p :: Type -> Type -> Type -> Type) where
#

Methods

Instances13Choice, …
  • Choice FunArrowDefined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Choice IxFunArrowDefined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Choice TaggedDefined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Applicative f => Choice (IxStar f)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Applicative f => Choice (Star f)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Functor f => Choice (IxStarA f)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Functor f => Choice (StarA f)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Monoid r => Choice (Forget r)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Monoid r => Choice (IxForget r)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Choice (ForgetM r)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Choice (IxForgetM r)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Choice (AffineMarket a b)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Choice (Market a b)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
classclass Profunctor p => Cochoice (p :: Type -> Type -> Type -> Type) where
#

Methods

Instances4Cochoice
  • Cochoice (Forget r)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Cochoice (ForgetM r)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Cochoice (IxForget r)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Cochoice (IxForgetM r)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
classclass (Choice p, Strong p) => Visiting (p :: Type -> Type -> Type -> Type) where
#

Methods

  • visit :: (forall (f :: Type -> Type). Functor f => (forall r. r -> f r) -> (a -> f b) -> s -> f t) -> p i a b -> p i s t
  • ivisit :: (forall (f :: Type -> Type). Functor f => (forall r. r -> f r) -> (i -> a -> f b) -> s -> f t) -> p j a b -> p (i -> j) s t
Instances11Visiting, …
classclass Traversing p => Mapping (p :: Type -> Type -> Type -> Type) where
#

Methods

  • roam :: ((a -> b) -> s -> t) -> p i a b -> p i s t
  • iroam :: ((i -> a -> b) -> s -> t) -> p j a b -> p (i -> j) s t
Instances2Mapping
  • Mapping FunArrowDefined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Mapping IxFunArrowDefined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
classclass Visiting p => Traversing (p :: Type -> Type -> Type -> Type) where
#

Methods

Instances6Traversing

Concrete profunctors

21 declarations
newtypenewtype Star (f :: Type -> Type) i a b
#

Needed for traversals.

Constructors

Instances5Choice, Profunctor, Strong, Traversing, Visiting
newtypenewtype Forget r i a b
#

Needed for getters and folds.

Constructors

Instances6Choice, Cochoice, Profunctor, Strong, Traversing, Visiting
  • Monoid r => Choice (Forget r)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Cochoice (Forget r)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Profunctor (Forget r)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Strong (Forget r)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Monoid r => Traversing (Forget r)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Monoid r => Visiting (Forget r)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
newtypenewtype ForgetM r i a b
#

Needed for affine folds.

Constructors

Instances5Choice, Cochoice, Profunctor, Strong, Visiting
  • Choice (ForgetM r)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Cochoice (ForgetM r)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Profunctor (ForgetM r)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Strong (ForgetM r)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Visiting (ForgetM r)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
newtypenewtype FunArrow i a b
#

Needed for setters.

Constructors

Instances6Choice, Mapping, Profunctor, Strong, Traversing, Visiting
  • Choice FunArrowDefined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Mapping FunArrowDefined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Profunctor FunArrowDefined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Strong FunArrowDefined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Traversing FunArrowDefined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Visiting FunArrowDefined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
newtypenewtype IxStar (f :: Type -> Type) i a b
#

Needed for indexed traversals.

Constructors

Instances5Choice, Profunctor, Strong, Traversing, Visiting
newtypenewtype IxForget r i a b
#

Needed for indexed folds.

Constructors

Instances6Choice, Cochoice, Profunctor, Strong, Traversing, Visiting
newtypenewtype IxForgetM r i a b
#

Needed for indexed affine folds.

Constructors

Instances5Choice, Cochoice, Profunctor, Strong, Visiting
  • Choice (IxForgetM r)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Cochoice (IxForgetM r)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Profunctor (IxForgetM r)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Strong (IxForgetM r)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Visiting (IxForgetM r)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
newtypenewtype IxFunArrow i a b
#

Needed for indexed setters.

Constructors

Instances6Choice, Mapping, Profunctor, Strong, Traversing, Visiting
datadata StarA (f :: Type -> Type) i a b
#

Needed for conversion of affine traversal back to its VL representation.

Constructors

  • StarA (forall r. r -> f r) (a -> f b)
Instances4Choice, Profunctor, Strong, Visiting
datadata IxStarA (f :: Type -> Type) i a b
#

Needed for conversion of indexed affine traversal back to its VL representation.

Constructors

  • IxStarA (forall r. r -> f r) (i -> a -> f b)
Instances4Choice, Profunctor, Strong, Visiting
datadata Exchange a b i s t
#

Constructors

Instances1Profunctor
  • Profunctor (Exchange a b)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
datadata Store a b i s t
#

Type to represent the components of a lens.

Constructors

  • Store (s -> a) (s -> b -> t)
Instances2Profunctor, Strong
  • Profunctor (Store a b)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Strong (Store a b)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
datadata Market a b i s t
#

Type to represent the components of a prism.

Constructors

Instances3Choice, Profunctor, Functor
  • Choice (Market a b)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Profunctor (Market a b)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Functor (Market a b i s)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
datadata AffineMarket a b i s t
#

Type to represent the components of an affine traversal.

Constructors

Instances4Choice, Profunctor, Strong, Visiting
newtypenewtype Tagged i a b
#

Tag a value with not one but two phantom type parameters (so that Tagged can be used as an indexed profunctor).

Constructors

Instances4Choice, Costrong, Profunctor, Functor
  • Choice TaggedDefined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Costrong TaggedDefined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Profunctor TaggedDefined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
  • Functor (Tagged i a)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed
datadata Context a b t
#

Constructors

Instances1Functor
  • Functor (Context a b)Defined in indexed-profunctors-0.1.1.1 · Data.Profunctor.Indexed

Utilities

2 declarations
value(#.) :: Coercible b c => (b -> c) -> (a -> b) -> a -> c
#

Composition operator where the first argument must be an identity function up to representational equivalence (e.g. a newtype wrapper or unwrapper), and will be ignored at runtime.

value(.#) :: Coercible a b => (b -> c) -> (a -> b) -> a -> c
#

Composition operator where the second argument must be an identity function up to representational equivalence (e.g. a newtype wrapper or unwrapper), and will be ignored at runtime.