Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. newtype IxForgetM r i a b

   indexed-profunctors	Data.Profunctor.Indexed

   Needed for indexed affine folds.

2. IxForgetM :: (i -> a -> Maybe r) -> IxForgetM r i a b

   indexed-profunctors	Data.Profunctor.Indexed

   No documentation available.

3. newtype IxFunArrow i a b

   indexed-profunctors	Data.Profunctor.Indexed

   Needed for indexed setters.

4. IxFunArrow :: (i -> a -> b) -> IxFunArrow i a b

   indexed-profunctors	Data.Profunctor.Indexed

   No documentation available.

5. newtype IxStar (f :: Type -> Type) i a b

   indexed-profunctors	Data.Profunctor.Indexed

   Needed for indexed traversals.

6. IxStar :: (i -> a -> f b) -> IxStar (f :: Type -> Type) i a b

   indexed-profunctors	Data.Profunctor.Indexed

   No documentation available.

7. data IxStarA (f :: Type -> Type) i a b

   indexed-profunctors	Data.Profunctor.Indexed

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

8. IxStarA :: (forall r . () => r -> f r) -> (i -> a -> f b) -> IxStarA (f :: Type -> Type) i a b

   indexed-profunctors	Data.Profunctor.Indexed

   No documentation available.

9. data IxMap c

   apecs	Apecs.Experimental.Reactive

   Allows you to look up entities by component value. Based on an IOArray c IntSet internally

10. type IxKind m = An_AffineTraversal

    optics-extra	Optics.At

    No documentation available.

Page 17 of many | Previous | Next