lens 5.3.4 → 5.3.5
raw patch · 5 files changed
+99/−99 lines, 5 filesdep +tastydep +tasty-hunitdep +tasty-quickcheckdep −HUnitdep −test-frameworkdep −test-framework-hunitdep ~parallelPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependencies added: tasty, tasty-hunit, tasty-quickcheck
Dependencies removed: HUnit, test-framework, test-framework-hunit, test-framework-quickcheck2
Dependency ranges changed: parallel
API changes (from Hackage documentation)
- Control.Lens.Combinators: type Fold1 s a = forall f. (Contravariant f, Apply f) => (a -> f a) -> s -> f s
- Control.Lens.Combinators: type Equality (s :: k1) (t :: k2) (a :: k1) (b :: k2) = forall k3 (p :: k1 -> k3 -> Type) (f :: k2 -> k3). p a (f b) -> p s (f t)
- Control.Lens.Equality: type Equality (s :: k1) (t :: k2) (a :: k1) (b :: k2) = forall k3 (p :: k1 -> k3 -> Type) (f :: k2 -> k3). p a (f b) -> p s (f t)
- Control.Lens.Fold: type Fold s a = forall f. (Contravariant f, Applicative f) => (a -> f a) -> s -> f s
- Control.Lens.Getter: type Getter s a = forall f. (Contravariant f, Functor f) => (a -> f a) -> s -> f s
- Control.Lens.Lens: type Lens s t a b = forall f. Functor f => (a -> f b) -> s -> f t
- Control.Lens.Setter: type Setter s t a b = forall f. Settable f => (a -> f b) -> s -> f t
- Control.Lens.Traversal: type Traversal1 s t a b = forall f. Apply f => (a -> f b) -> s -> f t
- Control.Lens.Type: type Fold1 s a = forall f. (Contravariant f, Apply f) => (a -> f a) -> s -> f s
- Control.Lens.Type: type Equality (s :: k1) (t :: k2) (a :: k1) (b :: k2) = forall k3 (p :: k1 -> k3 -> Type) (f :: k2 -> k3). p a (f b) -> p s (f t)
+ Control.Lens.At: ($dmix) :: (Ixed m, At m) => Index m -> Traversal' m (IxValue m)
+ Control.Lens.Combinators: ($dm_1) :: (Field1 s t a b, Generic s, Generic t, GIxed N0 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: ($dm_10) :: (Field10 s t a b, Generic s, Generic t, GIxed N9 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: ($dm_11) :: (Field11 s t a b, Generic s, Generic t, GIxed N10 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: ($dm_12) :: (Field12 s t a b, Generic s, Generic t, GIxed N11 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: ($dm_13) :: (Field13 s t a b, Generic s, Generic t, GIxed N12 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: ($dm_14) :: (Field14 s t a b, Generic s, Generic t, GIxed N13 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: ($dm_15) :: (Field15 s t a b, Generic s, Generic t, GIxed N14 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: ($dm_16) :: (Field16 s t a b, Generic s, Generic t, GIxed N15 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: ($dm_17) :: (Field17 s t a b, Generic s, Generic t, GIxed N16 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: ($dm_18) :: (Field18 s t a b, Generic s, Generic t, GIxed N17 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: ($dm_19) :: (Field19 s t a b, Generic s, Generic t, GIxed N18 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: ($dm_2) :: (Field2 s t a b, Generic s, Generic t, GIxed N1 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: ($dm_3) :: (Field3 s t a b, Generic s, Generic t, GIxed N2 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: ($dm_4) :: (Field4 s t a b, Generic s, Generic t, GIxed N3 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: ($dm_5) :: (Field5 s t a b, Generic s, Generic t, GIxed N4 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: ($dm_6) :: (Field6 s t a b, Generic s, Generic t, GIxed N5 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: ($dm_7) :: (Field7 s t a b, Generic s, Generic t, GIxed N6 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: ($dm_8) :: (Field8 s t a b, Generic s, Generic t, GIxed N7 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: ($dm_9) :: (Field9 s t a b, Generic s, Generic t, GIxed N8 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: ($dm_Empty) :: (AsEmpty a, Monoid a, Eq a) => Prism' a ()
+ Control.Lens.Combinators: ($dm_Wrapped') :: forall (d :: Meta) (c :: Meta) (s' :: Meta) a. (Wrapped s, Generic s, D1 d (C1 c (S1 s' (Rec0 a))) ~ Rep s, Unwrapped s ~ GUnwrapped (Rep s)) => Iso' s (Unwrapped s)
+ Control.Lens.Combinators: ($dmeach) :: forall (g :: Type -> Type). (Each s t a b, Traversable g, s ~ g a, t ~ g b) => Traversal s t a b
+ Control.Lens.Combinators: ($dmifoldMap) :: (FoldableWithIndex i f, TraversableWithIndex i f, Monoid m) => (i -> a -> m) -> f a -> m
+ Control.Lens.Combinators: ($dmimap) :: (FunctorWithIndex i f, TraversableWithIndex i f) => (i -> a -> b) -> f a -> f b
+ Control.Lens.Combinators: ($dmitraverse) :: (TraversableWithIndex i t, i ~ Int, Applicative f) => (i -> a -> f b) -> t a -> f (t b)
+ Control.Lens.Combinators: ($dmix) :: (Ixed m, At m) => Index m -> Traversal' m (IxValue m)
+ Control.Lens.Combinators: ($dmplate) :: (Plated a, Data a) => Traversal' a a
+ Control.Lens.Combinators: type Fold1 s a = forall (f :: Type -> Type). (Contravariant f, Apply f) => a -> f a -> s -> f s
+ Control.Lens.Each: ($dmeach) :: forall (g :: Type -> Type). (Each s t a b, Traversable g, s ~ g a, t ~ g b) => Traversal s t a b
+ Control.Lens.Empty: ($dm_Empty) :: (AsEmpty a, Monoid a, Eq a) => Prism' a ()
+ Control.Lens.Equality: type Equality (s :: k1) (t :: k2) (a :: k1) (b :: k2) = forall k3 (p :: k1 -> k3 -> Type) (f :: k2 -> k3). () => p a f b -> p s f t
+ Control.Lens.Fold: type Fold s a = forall (f :: Type -> Type). (Contravariant f, Applicative f) => a -> f a -> s -> f s
+ Control.Lens.Getter: type Getter s a = forall (f :: Type -> Type). (Contravariant f, Functor f) => a -> f a -> s -> f s
+ Control.Lens.Indexed: ($dmifoldMap) :: (FoldableWithIndex i f, TraversableWithIndex i f, Monoid m) => (i -> a -> m) -> f a -> m
+ Control.Lens.Indexed: ($dmimap) :: (FunctorWithIndex i f, TraversableWithIndex i f) => (i -> a -> b) -> f a -> f b
+ Control.Lens.Indexed: ($dmitraverse) :: (TraversableWithIndex i t, i ~ Int, Applicative f) => (i -> a -> f b) -> t a -> f (t b)
+ Control.Lens.Lens: type Lens s t a b = forall (f :: Type -> Type). Functor f => a -> f b -> s -> f t
+ Control.Lens.Plated: ($dmplate) :: (Plated a, Data a) => Traversal' a a
+ Control.Lens.Setter: type Setter s t a b = forall (f :: Type -> Type). Settable f => a -> f b -> s -> f t
+ Control.Lens.Traversal: type Traversal1 s t a b = forall (f :: Type -> Type). Apply f => a -> f b -> s -> f t
+ Control.Lens.Tuple: ($dm_1) :: (Field1 s t a b, Generic s, Generic t, GIxed N0 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Tuple: ($dm_10) :: (Field10 s t a b, Generic s, Generic t, GIxed N9 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Tuple: ($dm_11) :: (Field11 s t a b, Generic s, Generic t, GIxed N10 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Tuple: ($dm_12) :: (Field12 s t a b, Generic s, Generic t, GIxed N11 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Tuple: ($dm_13) :: (Field13 s t a b, Generic s, Generic t, GIxed N12 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Tuple: ($dm_14) :: (Field14 s t a b, Generic s, Generic t, GIxed N13 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Tuple: ($dm_15) :: (Field15 s t a b, Generic s, Generic t, GIxed N14 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Tuple: ($dm_16) :: (Field16 s t a b, Generic s, Generic t, GIxed N15 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Tuple: ($dm_17) :: (Field17 s t a b, Generic s, Generic t, GIxed N16 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Tuple: ($dm_18) :: (Field18 s t a b, Generic s, Generic t, GIxed N17 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Tuple: ($dm_19) :: (Field19 s t a b, Generic s, Generic t, GIxed N18 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Tuple: ($dm_2) :: (Field2 s t a b, Generic s, Generic t, GIxed N1 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Tuple: ($dm_3) :: (Field3 s t a b, Generic s, Generic t, GIxed N2 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Tuple: ($dm_4) :: (Field4 s t a b, Generic s, Generic t, GIxed N3 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Tuple: ($dm_5) :: (Field5 s t a b, Generic s, Generic t, GIxed N4 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Tuple: ($dm_6) :: (Field6 s t a b, Generic s, Generic t, GIxed N5 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Tuple: ($dm_7) :: (Field7 s t a b, Generic s, Generic t, GIxed N6 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Tuple: ($dm_8) :: (Field8 s t a b, Generic s, Generic t, GIxed N7 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Tuple: ($dm_9) :: (Field9 s t a b, Generic s, Generic t, GIxed N8 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Type: type Fold1 s a = forall (f :: Type -> Type). (Contravariant f, Apply f) => a -> f a -> s -> f s
+ Control.Lens.Wrapped: ($dm_Wrapped') :: forall (d :: Meta) (c :: Meta) (s' :: Meta) a. (Wrapped s, Generic s, D1 d (C1 c (S1 s' (Rec0 a))) ~ Rep s, Unwrapped s ~ GUnwrapped (Rep s)) => Iso' s (Unwrapped s)
+ Language.Haskell.TH.Lens: _BndrInvis :: Prism' BndrVis ()
+ Language.Haskell.TH.Lens: _BndrReq :: Prism' BndrVis ()
+ Language.Haskell.TH.Lens: _TypedBracketE :: Prism' Exp Exp
+ Language.Haskell.TH.Lens: _TypedSpliceE :: Prism' Exp Exp
- Control.Lens.At: ix :: (Ixed m, At m) => Index m -> Traversal' m (IxValue m)
+ Control.Lens.At: ix :: Ixed m => Index m -> Traversal' m (IxValue m)
- Control.Lens.At: type family IxValue (m :: Type) :: Type
+ Control.Lens.At: type family IxValue m
- Control.Lens.Combinators: Bazaar :: (forall f. Applicative f => p a (f b) -> f t) -> Bazaar p a b t
+ Control.Lens.Combinators: Bazaar :: (forall (f :: Type -> Type). Applicative f => p a (f b) -> f t) -> Bazaar (p :: Type -> Type -> Type) a b t
- Control.Lens.Combinators: Bazaar1 :: (forall f. Apply f => p a (f b) -> f t) -> Bazaar1 p a b t
+ Control.Lens.Combinators: Bazaar1 :: (forall (f :: Type -> Type). Apply f => p a (f b) -> f t) -> Bazaar1 (p :: Type -> Type -> Type) a b t
- Control.Lens.Combinators: [Identical] :: Identical a b a b
+ Control.Lens.Combinators: [Identical] :: forall {k} {k1} (a :: k) (b :: k1). Identical a b a b
- Control.Lens.Combinators: [runBazaar1] :: Bazaar1 p a b t -> forall f. Apply f => p a (f b) -> f t
+ Control.Lens.Combinators: [runBazaar1] :: Bazaar1 (p :: Type -> Type -> Type) a b t -> forall (f :: Type -> Type). Apply f => p a (f b) -> f t
- Control.Lens.Combinators: [runBazaar] :: Bazaar p a b t -> forall f. Applicative f => p a (f b) -> f t
+ Control.Lens.Combinators: [runBazaar] :: Bazaar (p :: Type -> Type -> Type) a b t -> forall (f :: Type -> Type). Applicative f => p a (f b) -> f t
- Control.Lens.Combinators: _1 :: (Field1 s t a b, Generic s, Generic t, GIxed N0 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: _1 :: Field1 s t a b => Lens s t a b
- Control.Lens.Combinators: _10 :: (Field10 s t a b, Generic s, Generic t, GIxed N9 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: _10 :: Field10 s t a b => Lens s t a b
- Control.Lens.Combinators: _11 :: (Field11 s t a b, Generic s, Generic t, GIxed N10 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: _11 :: Field11 s t a b => Lens s t a b
- Control.Lens.Combinators: _12 :: (Field12 s t a b, Generic s, Generic t, GIxed N11 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: _12 :: Field12 s t a b => Lens s t a b
- Control.Lens.Combinators: _13 :: (Field13 s t a b, Generic s, Generic t, GIxed N12 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: _13 :: Field13 s t a b => Lens s t a b
- Control.Lens.Combinators: _14 :: (Field14 s t a b, Generic s, Generic t, GIxed N13 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: _14 :: Field14 s t a b => Lens s t a b
- Control.Lens.Combinators: _15 :: (Field15 s t a b, Generic s, Generic t, GIxed N14 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: _15 :: Field15 s t a b => Lens s t a b
- Control.Lens.Combinators: _16 :: (Field16 s t a b, Generic s, Generic t, GIxed N15 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: _16 :: Field16 s t a b => Lens s t a b
- Control.Lens.Combinators: _17 :: (Field17 s t a b, Generic s, Generic t, GIxed N16 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: _17 :: Field17 s t a b => Lens s t a b
- Control.Lens.Combinators: _18 :: (Field18 s t a b, Generic s, Generic t, GIxed N17 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: _18 :: Field18 s t a b => Lens s t a b
- Control.Lens.Combinators: _19 :: (Field19 s t a b, Generic s, Generic t, GIxed N18 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: _19 :: Field19 s t a b => Lens s t a b
- Control.Lens.Combinators: _2 :: (Field2 s t a b, Generic s, Generic t, GIxed N1 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: _2 :: Field2 s t a b => Lens s t a b
- Control.Lens.Combinators: _3 :: (Field3 s t a b, Generic s, Generic t, GIxed N2 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: _3 :: Field3 s t a b => Lens s t a b
- Control.Lens.Combinators: _4 :: (Field4 s t a b, Generic s, Generic t, GIxed N3 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: _4 :: Field4 s t a b => Lens s t a b
- Control.Lens.Combinators: _5 :: (Field5 s t a b, Generic s, Generic t, GIxed N4 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: _5 :: Field5 s t a b => Lens s t a b
- Control.Lens.Combinators: _6 :: (Field6 s t a b, Generic s, Generic t, GIxed N5 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: _6 :: Field6 s t a b => Lens s t a b
- Control.Lens.Combinators: _7 :: (Field7 s t a b, Generic s, Generic t, GIxed N6 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: _7 :: Field7 s t a b => Lens s t a b
- Control.Lens.Combinators: _8 :: (Field8 s t a b, Generic s, Generic t, GIxed N7 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: _8 :: Field8 s t a b => Lens s t a b
- Control.Lens.Combinators: _9 :: (Field9 s t a b, Generic s, Generic t, GIxed N8 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Combinators: _9 :: Field9 s t a b => Lens s t a b
- Control.Lens.Combinators: _Empty :: (AsEmpty a, Monoid a, Eq a) => Prism' a ()
+ Control.Lens.Combinators: _Empty :: AsEmpty a => Prism' a ()
- Control.Lens.Combinators: _GWrapped' :: (Generic s, D1 d (C1 c (S1 s' (Rec0 a))) ~ Rep s, Unwrapped s ~ GUnwrapped (Rep s)) => Iso' s (Unwrapped s)
+ Control.Lens.Combinators: _GWrapped' :: forall s (d :: Meta) (c :: Meta) (s' :: Meta) a. (Generic s, D1 d (C1 c (S1 s' (Rec0 a))) ~ Rep s, Unwrapped s ~ GUnwrapped (Rep s)) => Iso' s (Unwrapped s)
- Control.Lens.Combinators: _Just :: Prism (Maybe a) (Maybe b) a b
+ Control.Lens.Combinators: _Just :: forall a b p f. (Choice p, Applicative f) => p a (f b) -> p (Maybe a) (f (Maybe b))
- Control.Lens.Combinators: _Left :: Prism (Either a c) (Either b c) a b
+ Control.Lens.Combinators: _Left :: forall a c b p f. (Choice p, Applicative f) => p a (f b) -> p (Either a c) (f (Either b c))
- Control.Lens.Combinators: _Nothing :: Prism' (Maybe a) ()
+ Control.Lens.Combinators: _Nothing :: forall a p f. (Choice p, Applicative f) => p () (f ()) -> p (Maybe a) (f (Maybe a))
- Control.Lens.Combinators: _Right :: Prism (Either c a) (Either c b) a b
+ Control.Lens.Combinators: _Right :: forall c a b p f. (Choice p, Applicative f) => p a (f b) -> p (Either c a) (f (Either c b))
- Control.Lens.Combinators: _Void :: Prism s s a Void
+ Control.Lens.Combinators: _Void :: forall s a p f. (Choice p, Applicative f) => p a (f Void) -> p s (f s)
- Control.Lens.Combinators: _Wrapped' :: (Wrapped s, Generic s, D1 d (C1 c (S1 s' (Rec0 a))) ~ Rep s, Unwrapped s ~ GUnwrapped (Rep s)) => Iso' s (Unwrapped s)
+ Control.Lens.Combinators: _Wrapped' :: Wrapped s => Iso' s (Unwrapped s)
- Control.Lens.Combinators: argument :: Profunctor p => Setter (p b r) (p a r) a b
+ Control.Lens.Combinators: argument :: forall (p :: Type -> Type -> Type) b r a. Profunctor p => Setter (p b r) (p a r) a b
- Control.Lens.Combinators: below :: Traversable f => APrism' s a -> Prism' (f s) (f a)
+ Control.Lens.Combinators: below :: forall (f :: Type -> Type) s a. Traversable f => APrism' s a -> Prism' (f s) (f a)
- Control.Lens.Combinators: bimapping :: (Bifunctor f, Bifunctor g) => AnIso s t a b -> AnIso s' t' a' b' -> Iso (f s s') (g t t') (f a a') (g b b')
+ Control.Lens.Combinators: bimapping :: forall (f :: Type -> Type -> Type) (g :: Type -> Type -> Type) s t a b s' t' a' b'. (Bifunctor f, Bifunctor g) => AnIso s t a b -> AnIso s' t' a' b' -> Iso (f s s') (g t t') (f a a') (g b b')
- Control.Lens.Combinators: both :: Bitraversable r => Traversal (r a a) (r b b) a b
+ Control.Lens.Combinators: both :: forall (r :: Type -> Type -> Type) a b. Bitraversable r => Traversal (r a a) (r b b) a b
- Control.Lens.Combinators: both1 :: Bitraversable1 r => Traversal1 (r a a) (r b b) a b
+ Control.Lens.Combinators: both1 :: forall (r :: Type -> Type -> Type) a b. Bitraversable1 r => Traversal1 (r a a) (r b b) a b
- Control.Lens.Combinators: chosen :: IndexPreservingLens (Either a a) (Either b b) a b
+ Control.Lens.Combinators: chosen :: forall a b p f. (Conjoined p, Functor f) => p a (f b) -> p (Either a a) (f (Either b b))
- Control.Lens.Combinators: class (Choice p, Corepresentable p, Comonad (Corep p), Traversable (Corep p), Strong p, Representable p, Monad (Rep p), MonadFix (Rep p), Distributive (Rep p), Costrong p, ArrowLoop p, ArrowApply p, ArrowChoice p, Closed p) => Conjoined p
+ Control.Lens.Combinators: class (Choice p, Corepresentable p, Comonad Corep p, Traversable Corep p, Strong p, Representable p, Monad Rep p, MonadFix Rep p, Distributive Rep p, Costrong p, ArrowLoop p, ArrowApply p, ArrowChoice p, Closed p) => Conjoined (p :: Type -> Type -> Type)
- Control.Lens.Combinators: class () => Contravariant (f :: Type -> Type)
+ Control.Lens.Combinators: class Contravariant (f :: Type -> Type)
- Control.Lens.Combinators: class GPlated a g
+ Control.Lens.Combinators: class GPlated a (g :: k -> Type)
- Control.Lens.Combinators: class GPlated1 f g
+ Control.Lens.Combinators: class GPlated1 (f :: k -> Type) (g :: k -> Type)
- Control.Lens.Combinators: class Conjoined p => Indexable i p
+ Control.Lens.Combinators: class Conjoined p => Indexable i (p :: Type -> Type -> Type)
- Control.Lens.Combinators: class (Magnified m ~ Magnified n, MonadReader b m, MonadReader a n) => Magnify m n b a | m -> b, n -> a, m a -> n, n b -> m
+ Control.Lens.Combinators: class (Magnified m ~ Magnified n, MonadReader b m, MonadReader a n) => Magnify (m :: Type -> Type) (n :: Type -> Type) b a | m -> b, n -> a, m a -> n, n b -> m
- Control.Lens.Combinators: class () => Profunctor (p :: Type -> Type -> Type)
+ Control.Lens.Combinators: class Profunctor (p :: Type -> Type -> Type)
- Control.Lens.Combinators: class (Profunctor p, Bifunctor p) => Reviewable p
+ Control.Lens.Combinators: class (Profunctor p, Bifunctor p) => Reviewable (p :: Type -> Type -> Type)
- Control.Lens.Combinators: class Wrapped s => Rewrapped (s :: Type) (t :: Type)
+ Control.Lens.Combinators: class Wrapped s => Rewrapped s t
- Control.Lens.Combinators: class (Applicative f, Distributive f, Traversable f) => Settable f
+ Control.Lens.Combinators: class (Applicative f, Distributive f, Traversable f) => Settable (f :: Type -> Type)
- Control.Lens.Combinators: class Ord k => TraverseMax k m | m -> k
+ Control.Lens.Combinators: class Ord k => TraverseMax k (m :: Type -> Type) | m -> k
- Control.Lens.Combinators: class Ord k => TraverseMin k m | m -> k
+ Control.Lens.Combinators: class Ord k => TraverseMin k (m :: Type -> Type) | m -> k
- Control.Lens.Combinators: class (MonadState s m, MonadState t n) => Zoom m n s t | m -> s, n -> t, m t -> n, n s -> m
+ Control.Lens.Combinators: class (MonadState s m, MonadState t n) => Zoom (m :: Type -> Type) (n :: Type -> Type) s t | m -> s, n -> t, m t -> n, n s -> m
- Control.Lens.Combinators: cloneEquality :: AnEquality s t a b -> Equality s t a b
+ Control.Lens.Combinators: cloneEquality :: forall {k1} {k2} (s :: k1) (t :: k2) (a :: k1) (b :: k2). AnEquality s t a b -> Equality s t a b
- Control.Lens.Combinators: contramapped :: Contravariant f => Setter (f b) (f a) a b
+ Control.Lens.Combinators: contramapped :: forall (f :: Type -> Type) b a. Contravariant f => Setter (f b) (f a) a b
- Control.Lens.Combinators: contramapping :: Contravariant f => AnIso s t a b -> Iso (f a) (f b) (f s) (f t)
+ Control.Lens.Combinators: contramapping :: forall (f :: Type -> Type) s t a b. Contravariant f => AnIso s t a b -> Iso (f a) (f b) (f s) (f t)
- Control.Lens.Combinators: curried :: Iso ((a, b) -> c) ((d, e) -> f) (a -> b -> c) (d -> e -> f)
+ Control.Lens.Combinators: curried :: forall a b c d e f1 p f2. (Profunctor p, Functor f2) => p (a -> b -> c) (f2 (d -> e -> f1)) -> p ((a, b) -> c) (f2 ((d, e) -> f1))
- Control.Lens.Combinators: data () => (a :: k) :~: (b :: k)
+ Control.Lens.Combinators: data (a :: k) :~: (b :: k)
- Control.Lens.Combinators: data Identical a b s t
+ Control.Lens.Combinators: data Identical (a :: k) (b :: k1) (s :: k) (t :: k1)
- Control.Lens.Combinators: data Sequenced a m
+ Control.Lens.Combinators: data Sequenced a (m :: Type -> Type)
- Control.Lens.Combinators: data Traversed a f
+ Control.Lens.Combinators: data Traversed a (f :: Type -> Type)
- Control.Lens.Combinators: devoid :: Over p f Void Void a b
+ Control.Lens.Combinators: devoid :: forall {k} p f (a :: k) b. Over p f Void Void a b
- Control.Lens.Combinators: dimapping :: (Profunctor p, Profunctor q) => AnIso s t a b -> AnIso s' t' a' b' -> Iso (p a s') (q b t') (p s a') (q t b')
+ Control.Lens.Combinators: dimapping :: forall (p :: Type -> Type -> Type) (q :: Type -> Type -> Type) s t a b s' t' a' b'. (Profunctor p, Profunctor q) => AnIso s t a b -> AnIso s' t' a' b' -> Iso (p a s') (q b t') (p s a') (q t b')
- Control.Lens.Combinators: each :: (Each s t a b, Traversable g, s ~ g a, t ~ g b) => Traversal s t a b
+ Control.Lens.Combinators: each :: Each s t a b => Traversal s t a b
- Control.Lens.Combinators: element :: Traversable t => Int -> IndexedTraversal' Int (t a) a
+ Control.Lens.Combinators: element :: forall (t :: Type -> Type) a. Traversable t => Int -> IndexedTraversal' Int (t a) a
- Control.Lens.Combinators: elementOf :: Applicative f => LensLike (Indexing f) s t a a -> Int -> IndexedLensLike Int f s t a a
+ Control.Lens.Combinators: elementOf :: forall (f :: Type -> Type) s t a. Applicative f => LensLike (Indexing f) s t a a -> Int -> IndexedLensLike Int f s t a a
- Control.Lens.Combinators: elements :: Traversable t => (Int -> Bool) -> IndexedTraversal' Int (t a) a
+ Control.Lens.Combinators: elements :: forall (t :: Type -> Type) a. Traversable t => (Int -> Bool) -> IndexedTraversal' Int (t a) a
- Control.Lens.Combinators: elementsOf :: Applicative f => LensLike (Indexing f) s t a a -> (Int -> Bool) -> IndexedLensLike Int f s t a a
+ Control.Lens.Combinators: elementsOf :: forall (f :: Type -> Type) s t a. Applicative f => LensLike (Indexing f) s t a a -> (Int -> Bool) -> IndexedLensLike Int f s t a a
- Control.Lens.Combinators: equality :: (s :~: a) -> (b :~: t) -> Equality s t a b
+ Control.Lens.Combinators: equality :: forall {k1} {k2} (s :: k1) (a :: k1) (b :: k2) (t :: k2). (s :~: a) -> (b :~: t) -> Equality s t a b
- Control.Lens.Combinators: equality' :: (a :~: b) -> Equality' a b
+ Control.Lens.Combinators: equality' :: forall {k2} (a :: k2) (b :: k2). (a :~: b) -> Equality' a b
- Control.Lens.Combinators: firsting :: (Bifunctor f, Bifunctor g) => AnIso s t a b -> Iso (f s x) (g t y) (f a x) (g b y)
+ Control.Lens.Combinators: firsting :: forall (f :: Type -> Type -> Type) (g :: Type -> Type -> Type) s t a b x y. (Bifunctor f, Bifunctor g) => AnIso s t a b -> Iso (f s x) (g t y) (f a x) (g b y)
- Control.Lens.Combinators: flipped :: Iso (a -> b -> c) (a' -> b' -> c') (b -> a -> c) (b' -> a' -> c')
+ Control.Lens.Combinators: flipped :: forall a b c a' b' c' p f. (Profunctor p, Functor f) => p (b -> a -> c) (f (b' -> a' -> c')) -> p (a -> b -> c) (f (a' -> b' -> c'))
- Control.Lens.Combinators: folded :: Foldable f => IndexedFold Int (f a) a
+ Control.Lens.Combinators: folded :: forall (f :: Type -> Type) a. Foldable f => IndexedFold Int (f a) a
- Control.Lens.Combinators: folded64 :: Foldable f => IndexedFold Int64 (f a) a
+ Control.Lens.Combinators: folded64 :: forall (f :: Type -> Type) a. Foldable f => IndexedFold Int64 (f a) a
- Control.Lens.Combinators: fromEq :: AnEquality s t a b -> Equality b a t s
+ Control.Lens.Combinators: fromEq :: forall {k2} {k1} (s :: k2) (t :: k1) (a :: k2) (b :: k1). AnEquality s t a b -> Equality b a t s
- Control.Lens.Combinators: fromLeibniz :: (Identical a b a b -> Identical a b s t) -> Equality s t a b
+ Control.Lens.Combinators: fromLeibniz :: forall {k1} {k2} (a :: k1) (b :: k2) (s :: k1) (t :: k2). (Identical a b a b -> Identical a b s t) -> Equality s t a b
- Control.Lens.Combinators: fromLeibniz' :: ((s :~: s) -> s :~: a) -> Equality' s a
+ Control.Lens.Combinators: fromLeibniz' :: forall {k2} (s :: k2) (a :: k2). ((s :~: s) -> s :~: a) -> Equality' s a
- Control.Lens.Combinators: gplate1 :: (Generic1 f, GPlated1 f (Rep1 f)) => Traversal' (f a) (f a)
+ Control.Lens.Combinators: gplate1 :: forall {k} (f :: k -> Type) (a :: k). (Generic1 f, GPlated1 f (Rep1 f)) => Traversal' (f a) (f a)
- Control.Lens.Combinators: head1 :: Traversable1 t => Lens' (t a) a
+ Control.Lens.Combinators: head1 :: forall (t :: Type -> Type) a. Traversable1 t => Lens' (t a) a
- Control.Lens.Combinators: ifolded :: FoldableWithIndex i f => IndexedFold i (f a) a
+ Control.Lens.Combinators: ifolded :: forall i (f :: Type -> Type) a. FoldableWithIndex i f => IndexedFold i (f a) a
- Control.Lens.Combinators: ilevels :: Applicative f => Traversing (Indexed i) f s t a b -> IndexedLensLike Int f s t (Level i a) (Level j b)
+ Control.Lens.Combinators: ilevels :: forall (f :: Type -> Type) i s t a b j. Applicative f => Traversing (Indexed i) f s t a b -> IndexedLensLike Int f s t (Level i a) (Level j b)
- Control.Lens.Combinators: iloci :: IndexedTraversal i (Bazaar (Indexed i) a c s) (Bazaar (Indexed i) b c s) a b
+ Control.Lens.Combinators: iloci :: forall i a c s b p f. (Indexable i p, Applicative f) => p a (f b) -> Bazaar (Indexed i) a c s -> f (Bazaar (Indexed i) b c s)
- Control.Lens.Combinators: imapped :: FunctorWithIndex i f => IndexedSetter i (f a) (f b) a b
+ Control.Lens.Combinators: imapped :: forall i (f :: Type -> Type) a b. FunctorWithIndex i f => IndexedSetter i (f a) (f b) a b
- Control.Lens.Combinators: inside :: Corepresentable p => ALens s t a b -> Lens (p e s) (p e t) (p e a) (p e b)
+ Control.Lens.Combinators: inside :: forall (p :: Type -> Type -> Type) s t a b e. Corepresentable p => ALens s t a b -> Lens (p e s) (p e t) (p e a) (p e b)
- Control.Lens.Combinators: ipartsOf :: forall i p f s t a. (Indexable [i] p, Functor f) => Traversing (Indexed i) f s t a a -> Over p f s t [a] [a]
+ Control.Lens.Combinators: ipartsOf :: (Indexable [i] p, Functor f) => Traversing (Indexed i) f s t a a -> Over p f s t [a] [a]
- Control.Lens.Combinators: itakingWhile :: (Indexable i p, Profunctor q, Contravariant f, Applicative f) => (i -> a -> Bool) -> Optical' (Indexed i) q (Const (Endo (f s))) s a -> Optical' p q f s a
+ Control.Lens.Combinators: itakingWhile :: (Indexable i p, Profunctor q, Contravariant f, Applicative f) => (i -> a -> Bool) -> Optical' (Indexed i) q (Const (Endo (f s)) :: Type -> Type) s a -> Optical' p q f s a
- Control.Lens.Combinators: itraverseBy :: TraversableWithIndex i t => (forall x. x -> f x) -> (forall x y. f (x -> y) -> f x -> f y) -> (i -> a -> f b) -> t a -> f (t b)
+ Control.Lens.Combinators: itraverseBy :: TraversableWithIndex i t => (forall x. () => x -> f x) -> (forall x y. () => f (x -> y) -> f x -> f y) -> (i -> a -> f b) -> t a -> f (t b)
- Control.Lens.Combinators: itraverseByOf :: IndexedTraversal i s t a b -> (forall x. x -> f x) -> (forall x y. f (x -> y) -> f x -> f y) -> (i -> a -> f b) -> s -> f t
+ Control.Lens.Combinators: itraverseByOf :: IndexedTraversal i s t a b -> (forall x. () => x -> f x) -> (forall x y. () => f (x -> y) -> f x -> f y) -> (i -> a -> f b) -> s -> f t
- Control.Lens.Combinators: itraversed :: TraversableWithIndex i t => IndexedTraversal i (t a) (t b) a b
+ Control.Lens.Combinators: itraversed :: forall i (t :: Type -> Type) a b. TraversableWithIndex i t => IndexedTraversal i (t a) (t b) a b
- Control.Lens.Combinators: iunsafePartsOf :: forall i p f s t a b. (Indexable [i] p, Functor f) => Traversing (Indexed i) f s t a b -> Over p f s t [a] [b]
+ Control.Lens.Combinators: iunsafePartsOf :: (Indexable [i] p, Functor f) => Traversing (Indexed i) f s t a b -> Over p f s t [a] [b]
- Control.Lens.Combinators: ix :: (Ixed m, At m) => Index m -> Traversal' m (IxValue m)
+ Control.Lens.Combinators: ix :: Ixed m => Index m -> Traversal' m (IxValue m)
- Control.Lens.Combinators: last1 :: Traversable1 t => Lens' (t a) a
+ Control.Lens.Combinators: last1 :: forall (t :: Type -> Type) a. Traversable1 t => Lens' (t a) a
- Control.Lens.Combinators: levels :: Applicative f => Traversing (->) f s t a b -> IndexedLensLike Int f s t (Level () a) (Level () b)
+ Control.Lens.Combinators: levels :: forall (f :: Type -> Type) s t a b. Applicative f => Traversing (->) f s t a b -> IndexedLensLike Int f s t (Level () a) (Level () b)
- Control.Lens.Combinators: lifted :: Monad m => Setter (m a) (m b) a b
+ Control.Lens.Combinators: lifted :: forall (m :: Type -> Type) a b. Monad m => Setter (m a) (m b) a b
- Control.Lens.Combinators: lined :: Applicative f => IndexedLensLike' Int f String String
+ Control.Lens.Combinators: lined :: forall (f :: Type -> Type). Applicative f => IndexedLensLike' Int f String String
- Control.Lens.Combinators: lmapping :: (Profunctor p, Profunctor q) => AnIso s t a b -> Iso (p a x) (q b y) (p s x) (q t y)
+ Control.Lens.Combinators: lmapping :: forall (p :: Type -> Type -> Type) (q :: Type -> Type -> Type) s t a b x y. (Profunctor p, Profunctor q) => AnIso s t a b -> Iso (p a x) (q b y) (p s x) (q t y)
- Control.Lens.Combinators: loci :: Traversal (Bazaar (->) a c s) (Bazaar (->) b c s) a b
+ Control.Lens.Combinators: loci :: forall a c s b f. Applicative f => (a -> f b) -> Bazaar (->) a c s -> f (Bazaar (->) b c s)
- Control.Lens.Combinators: locus :: IndexedComonadStore p => Lens (p a c s) (p b c s) a b
+ Control.Lens.Combinators: locus :: forall (p :: Type -> Type -> Type -> Type) a c s b. IndexedComonadStore p => Lens (p a c s) (p b c s) a b
- Control.Lens.Combinators: mapEq :: forall k1 k2 (s :: k1) (t :: k2) (a :: k1) (b :: k2) (f :: k1 -> Type). AnEquality s t a b -> f s -> f a
+ Control.Lens.Combinators: mapEq :: forall k1 k2 (s :: k1) (t :: k2) (a :: k1) (b :: k2) f. AnEquality s t a b -> f s -> f a
- Control.Lens.Combinators: mapped :: Functor f => Setter (f a) (f b) a b
+ Control.Lens.Combinators: mapped :: forall (f :: Type -> Type) a b. Functor f => Setter (f a) (f b) a b
- Control.Lens.Combinators: mapping :: (Functor f, Functor g) => AnIso s t a b -> Iso (f s) (g t) (f a) (g b)
+ Control.Lens.Combinators: mapping :: forall (f :: Type -> Type) (g :: Type -> Type) s t a b. (Functor f, Functor g) => AnIso s t a b -> Iso (f s) (g t) (f a) (g b)
- Control.Lens.Combinators: newtype Bazaar p a b t
+ Control.Lens.Combinators: newtype Bazaar (p :: Type -> Type -> Type) a b t
- Control.Lens.Combinators: newtype Bazaar1 p a b t
+ Control.Lens.Combinators: newtype Bazaar1 (p :: Type -> Type -> Type) a b t
- Control.Lens.Combinators: newtype () => Const a (b :: k)
+ Control.Lens.Combinators: newtype Const a (b :: k)
- Control.Lens.Combinators: newtype () => Identity a
+ Control.Lens.Combinators: newtype Identity a
- Control.Lens.Combinators: outside :: Representable p => APrism s t a b -> Lens (p t r) (p s r) (p b r) (p a r)
+ Control.Lens.Combinators: outside :: forall (p :: Type -> Type -> Type) s t a b r. Representable p => APrism s t a b -> Lens (p t r) (p s r) (p b r) (p a r)
- Control.Lens.Combinators: overEquality :: AnEquality s t a b -> p a b -> p s t
+ Control.Lens.Combinators: overEquality :: forall {k1} {k2} (s :: k1) (t :: k2) (a :: k1) (b :: k2) p. AnEquality s t a b -> p a b -> p s t
- Control.Lens.Combinators: plate :: (Plated a, Data a) => Traversal' a a
+ Control.Lens.Combinators: plate :: Plated a => Traversal' a a
- Control.Lens.Combinators: reviewing :: (Bifunctor p, Functor f) => Optic Tagged Identity s t a b -> Optic' p f t b
+ Control.Lens.Combinators: reviewing :: (Bifunctor p, Functor f) => Optic (Tagged :: Type -> Type -> Type) Identity s t a b -> Optic' p f t b
- Control.Lens.Combinators: rmapping :: (Profunctor p, Profunctor q) => AnIso s t a b -> Iso (p x s) (q y t) (p x a) (q y b)
+ Control.Lens.Combinators: rmapping :: forall (p :: Type -> Type -> Type) (q :: Type -> Type -> Type) s t a b x y. (Profunctor p, Profunctor q) => AnIso s t a b -> Iso (p x s) (q y t) (p x a) (q y b)
- Control.Lens.Combinators: runEq :: AnEquality s t a b -> Identical s t a b
+ Control.Lens.Combinators: runEq :: forall {k1} {k2} (s :: k1) (t :: k2) (a :: k1) (b :: k2). AnEquality s t a b -> Identical s t a b
- Control.Lens.Combinators: seconding :: (Bifunctor f, Bifunctor g) => AnIso s t a b -> Iso (f x s) (g y t) (f x a) (g y b)
+ Control.Lens.Combinators: seconding :: forall (f :: Type -> Type -> Type) (g :: Type -> Type -> Type) s t a b x y. (Bifunctor f, Bifunctor g) => AnIso s t a b -> Iso (f x s) (g y t) (f x a) (g y b)
- Control.Lens.Combinators: sequenceByOf :: Traversal s t (f b) b -> (forall x. x -> f x) -> (forall x y. f (x -> y) -> f x -> f y) -> s -> f t
+ Control.Lens.Combinators: sequenceByOf :: Traversal s t (f b) b -> (forall x. () => x -> f x) -> (forall x y. () => f (x -> y) -> f x -> f y) -> s -> f t
- Control.Lens.Combinators: simple :: Equality' a a
+ Control.Lens.Combinators: simple :: forall {k2} (a :: k2) k3 p (f :: k2 -> k3). p a (f a) -> p a (f a)
- Control.Lens.Combinators: simply :: forall p f s a rep (r :: TYPE rep). (Optic' p f s a -> r) -> Optic' p f s a -> r
+ Control.Lens.Combinators: simply :: forall {k} {k1} p (f :: k -> k1) (s :: k) (a :: k) r. (Optic' p f s a -> r) -> Optic' p f s a -> r
- Control.Lens.Combinators: substEq :: forall s t a b rep (r :: TYPE rep). AnEquality s t a b -> ((s ~ a, t ~ b) => r) -> r
+ Control.Lens.Combinators: substEq :: forall {k1} {k2} (s :: k1) (t :: k2) (a :: k1) (b :: k2) r. AnEquality s t a b -> ((s ~ a, t ~ b) => r) -> r
- Control.Lens.Combinators: swapped :: Swap p => Iso (p a b) (p c d) (p b a) (p d c)
+ Control.Lens.Combinators: swapped :: forall (p :: Type -> Type -> Type) a b c d. Swap p => Iso (p a b) (p c d) (p b a) (p d c)
- Control.Lens.Combinators: traverseByOf :: Traversal s t a b -> (forall x. x -> f x) -> (forall x y. f (x -> y) -> f x -> f y) -> (a -> f b) -> s -> f t
+ Control.Lens.Combinators: traverseByOf :: Traversal s t a b -> (forall x. () => x -> f x) -> (forall x y. () => f (x -> y) -> f x -> f y) -> (a -> f b) -> s -> f t
- Control.Lens.Combinators: traversed :: Traversable f => IndexedTraversal Int (f a) (f b) a b
+ Control.Lens.Combinators: traversed :: forall (f :: Type -> Type) a b. Traversable f => IndexedTraversal Int (f a) (f b) a b
- Control.Lens.Combinators: traversed1 :: Traversable1 f => IndexedTraversal1 Int (f a) (f b) a b
+ Control.Lens.Combinators: traversed1 :: forall (f :: Type -> Type) a b. Traversable1 f => IndexedTraversal1 Int (f a) (f b) a b
- Control.Lens.Combinators: traversed64 :: Traversable f => IndexedTraversal Int64 (f a) (f b) a b
+ Control.Lens.Combinators: traversed64 :: forall (f :: Type -> Type) a b. Traversable f => IndexedTraversal Int64 (f a) (f b) a b
- Control.Lens.Combinators: type ALens s t a b = LensLike (Pretext (->) a b) s t a b
+ Control.Lens.Combinators: type ALens s t a b = LensLike Pretext (->) a b s t a b
- Control.Lens.Combinators: type APrism s t a b = Market a b a (Identity b) -> Market a b s (Identity t)
+ Control.Lens.Combinators: type APrism s t a b = Market a b a Identity b -> Market a b s Identity t
- Control.Lens.Combinators: type AReview t b = Optic' Tagged Identity t b
+ Control.Lens.Combinators: type AReview t b = Optic' Tagged :: Type -> Type -> Type Identity t b
- Control.Lens.Combinators: type ASetter s t a b = (a -> Identity b) -> s -> Identity t
+ Control.Lens.Combinators: type ASetter s t a b = a -> Identity b -> s -> Identity t
- Control.Lens.Combinators: type ATraversal s t a b = LensLike (Bazaar (->) a b) s t a b
+ Control.Lens.Combinators: type ATraversal s t a b = LensLike Bazaar (->) a b s t a b
- Control.Lens.Combinators: type ATraversal1 s t a b = LensLike (Bazaar1 (->) a b) s t a b
+ Control.Lens.Combinators: type ATraversal1 s t a b = LensLike Bazaar1 (->) a b s t a b
- Control.Lens.Combinators: type Accessing p m s a = p a (Const m a) -> s -> Const m s
+ Control.Lens.Combinators: type Accessing (p :: Type -> Type -> Type) m s a = p a Const m a -> s -> Const m s
- Control.Lens.Combinators: type AnEquality s t a b = Identical a (Proxy b) a (Proxy b) -> Identical a (Proxy b) s (Proxy t)
+ Control.Lens.Combinators: type AnEquality (s :: k) (t :: k1) (a :: k) (b :: k2) = Identical a Proxy b a Proxy b -> Identical a Proxy b s Proxy t
- Control.Lens.Combinators: type AnEquality' s a = AnEquality s s a a
+ Control.Lens.Combinators: type AnEquality' (s :: k) (a :: k) = AnEquality s s a a
- Control.Lens.Combinators: type AnIndexedLens i s t a b = Optical (Indexed i) (->) (Pretext (Indexed i) a b) s t a b
+ Control.Lens.Combinators: type AnIndexedLens i s t a b = Optical Indexed i (->) Pretext Indexed i a b s t a b
- Control.Lens.Combinators: type AnIndexedSetter i s t a b = Indexed i a (Identity b) -> s -> Identity t
+ Control.Lens.Combinators: type AnIndexedSetter i s t a b = Indexed i a Identity b -> s -> Identity t
- Control.Lens.Combinators: type AnIndexedTraversal i s t a b = Over (Indexed i) (Bazaar (Indexed i) a b) s t a b
+ Control.Lens.Combinators: type AnIndexedTraversal i s t a b = Over Indexed i Bazaar Indexed i a b s t a b
- Control.Lens.Combinators: type AnIndexedTraversal1 i s t a b = Over (Indexed i) (Bazaar1 (Indexed i) a b) s t a b
+ Control.Lens.Combinators: type AnIndexedTraversal1 i s t a b = Over Indexed i Bazaar1 Indexed i a b s t a b
- Control.Lens.Combinators: type AnIso s t a b = Exchange a b a (Identity b) -> Exchange a b s (Identity t)
+ Control.Lens.Combinators: type AnIso s t a b = Exchange a b a Identity b -> Exchange a b s Identity t
- Control.Lens.Combinators: type As a = Equality' a a
+ Control.Lens.Combinators: type As (a :: k2) = Equality' a a
- Control.Lens.Combinators: type Bazaar' p a = Bazaar p a a
+ Control.Lens.Combinators: type Bazaar' (p :: Type -> Type -> Type) a = Bazaar p a a
- Control.Lens.Combinators: type Bazaar1' p a = Bazaar1 p a a
+ Control.Lens.Combinators: type Bazaar1' (p :: Type -> Type -> Type) a = Bazaar1 p a a
- Control.Lens.Combinators: type ClassyNamer = -- | Name of the data type that lenses are being generated for. Name -> -- | Names of the class and the main method it generates, respectively. Maybe (Name, Name)
+ Control.Lens.Combinators: type ClassyNamer = Name -> Maybe (Name, Name)
- Control.Lens.Combinators: type Equality' s a = Equality s s a a
+ Control.Lens.Combinators: type Equality' (s :: k2) (a :: k2) = Equality s s a a
- Control.Lens.Combinators: type FieldNamer = -- | Name of the data type that lenses are being generated for. Name -> -- | Names of all fields (including the field being named) in the data type. [Name] -> -- | Name of the field being named. Name -> -- | Name(s) of the lens functions. If empty, no lens is created for that field. [DefName]
+ Control.Lens.Combinators: type FieldNamer = Name -> [Name] -> Name -> [DefName]
- Control.Lens.Combinators: type Getting r s a = (a -> Const r a) -> s -> Const r s
+ Control.Lens.Combinators: type Getting r s a = a -> Const r a -> s -> Const r s
- Control.Lens.Combinators: type IndexedGetting i m s a = Indexed i a (Const m a) -> s -> Const m s
+ Control.Lens.Combinators: type IndexedGetting i m s a = Indexed i a Const m a -> s -> Const m s
- Control.Lens.Combinators: type IndexedLensLike' i f s a = IndexedLensLike i f s s a a
+ Control.Lens.Combinators: type IndexedLensLike' i (f :: Type -> Type) s a = IndexedLensLike i f s s a a
- Control.Lens.Combinators: type LensLike f s t a b = (a -> f b) -> s -> f t
+ Control.Lens.Combinators: type LensLike (f :: k -> Type) s (t :: k) a (b :: k) = a -> f b -> s -> f t
- Control.Lens.Combinators: type LensLike' f s a = LensLike f s s a a
+ Control.Lens.Combinators: type LensLike' (f :: Type -> Type) s a = LensLike f s s a a
- Control.Lens.Combinators: type Optic p f s t a b = p a (f b) -> p s (f t)
+ Control.Lens.Combinators: type Optic (p :: k -> k1 -> Type) (f :: k2 -> k1) (s :: k) (t :: k2) (a :: k) (b :: k2) = p a f b -> p s f t
- Control.Lens.Combinators: type Optic' p f s a = Optic p f s s a a
+ Control.Lens.Combinators: type Optic' (p :: k -> k1 -> Type) (f :: k -> k1) (s :: k) (a :: k) = Optic p f s s a a
- Control.Lens.Combinators: type Optical p q f s t a b = p a (f b) -> q s (f t)
+ Control.Lens.Combinators: type Optical (p :: k -> k1 -> Type) (q :: k2 -> k1 -> Type) (f :: k3 -> k1) (s :: k2) (t :: k3) (a :: k) (b :: k3) = p a f b -> q s f t
- Control.Lens.Combinators: type Optical' p q f s a = Optical p q f s s a a
+ Control.Lens.Combinators: type Optical' (p :: k -> k1 -> Type) (q :: k -> k1 -> Type) (f :: k -> k1) (s :: k) (a :: k) = Optical p q f s s a a
- Control.Lens.Combinators: type Over p f s t a b = p a (f b) -> s -> f t
+ Control.Lens.Combinators: type Over (p :: k -> Type -> Type) (f :: k1 -> Type) s (t :: k1) (a :: k) (b :: k1) = p a f b -> s -> f t
- Control.Lens.Combinators: type Over' p f s a = Over p f s s a a
+ Control.Lens.Combinators: type Over' (p :: Type -> Type -> Type) (f :: Type -> Type) s a = Over p f s s a a
- Control.Lens.Combinators: type Setting p s t a b = p a (Identity b) -> s -> Identity t
+ Control.Lens.Combinators: type Setting (p :: Type -> Type -> Type) s t a b = p a Identity b -> s -> Identity t
- Control.Lens.Combinators: type Setting' p s a = Setting p s s a a
+ Control.Lens.Combinators: type Setting' (p :: Type -> Type -> Type) s a = Setting p s s a a
- Control.Lens.Combinators: type Simple f s a = f s s a a
+ Control.Lens.Combinators: type Simple (f :: k1 -> k1 -> k2 -> k2 -> k) (s :: k1) (a :: k2) = f s s a a
- Control.Lens.Combinators: type Traversing p f s t a b = Over p (BazaarT p f a b) s t a b
+ Control.Lens.Combinators: type Traversing (p :: Type -> Type -> Type) (f :: Type -> Type) s t a b = Over p BazaarT p f a b s t a b
- Control.Lens.Combinators: type Traversing' p f s a = Traversing p f s s a a
+ Control.Lens.Combinators: type Traversing' (p :: Type -> Type -> Type) (f :: Type -> Type) s a = Traversing p f s s a a
- Control.Lens.Combinators: type Traversing1 p f s t a b = Over p (BazaarT1 p f a b) s t a b
+ Control.Lens.Combinators: type Traversing1 (p :: Type -> Type -> Type) (f :: Type -> Type) s t a b = Over p BazaarT1 p f a b s t a b
- Control.Lens.Combinators: type Traversing1' p f s a = Traversing1 p f s s a a
+ Control.Lens.Combinators: type Traversing1' (p :: Type -> Type -> Type) (f :: Type -> Type) s a = Traversing1 p f s s a a
- Control.Lens.Combinators: type Unwrapped s = GUnwrapped (Rep s);
+ Control.Lens.Combinators: type Unwrapped s = GUnwrapped Rep s;
- Control.Lens.Combinators: type IndexedLensLike i f s t a b = forall p. Indexable i p => p a (f b) -> s -> f t
+ Control.Lens.Combinators: type IndexedLensLike i (f :: k -> Type) s (t :: k) a (b :: k) = forall (p :: Type -> Type -> Type). Indexable i p => p a f b -> s -> f t
- Control.Lens.Combinators: uncurried :: Iso (a -> b -> c) (d -> e -> f) ((a, b) -> c) ((d, e) -> f)
+ Control.Lens.Combinators: uncurried :: forall a b c d e f1 p f2. (Profunctor p, Functor f2) => p ((a, b) -> c) (f2 ((d, e) -> f1)) -> p (a -> b -> c) (f2 (d -> e -> f1))
- Control.Lens.Combinators: underEquality :: AnEquality s t a b -> p t s -> p b a
+ Control.Lens.Combinators: underEquality :: forall {k1} {k2} (s :: k1) (t :: k2) (a :: k1) (b :: k2) p. AnEquality s t a b -> p t s -> p b a
- Control.Lens.Combinators: united :: Lens' a ()
+ Control.Lens.Combinators: united :: forall a f. Functor f => (() -> f ()) -> a -> f a
- Control.Lens.Combinators: uses :: MonadState s m => LensLike' (Const r) s a -> (a -> r) -> m r
+ Control.Lens.Combinators: uses :: MonadState s m => LensLike' (Const r :: Type -> Type) s a -> (a -> r) -> m r
- Control.Lens.Combinators: views :: MonadReader s m => LensLike' (Const r) s a -> (a -> r) -> m r
+ Control.Lens.Combinators: views :: MonadReader s m => LensLike' (Const r :: Type -> Type) s a -> (a -> r) -> m r
- Control.Lens.Combinators: withEquality :: forall s t a b rep (r :: TYPE rep). AnEquality s t a b -> ((s :~: a) -> (b :~: t) -> r) -> r
+ Control.Lens.Combinators: withEquality :: forall {k1} {k2} (s :: k1) (t :: k2) (a :: k1) (b :: k2) r. AnEquality s t a b -> ((s :~: a) -> (b :~: t) -> r) -> r
- Control.Lens.Combinators: withIso :: forall s t a b rep (r :: TYPE rep). AnIso s t a b -> ((s -> a) -> (b -> t) -> r) -> r
+ Control.Lens.Combinators: withIso :: AnIso s t a b -> ((s -> a) -> (b -> t) -> r) -> r
- Control.Lens.Combinators: withLens :: forall s t a b rep (r :: TYPE rep). ALens s t a b -> ((s -> a) -> (s -> b -> t) -> r) -> r
+ Control.Lens.Combinators: withLens :: ALens s t a b -> ((s -> a) -> (s -> b -> t) -> r) -> r
- Control.Lens.Combinators: worded :: Applicative f => IndexedLensLike' Int f String String
+ Control.Lens.Combinators: worded :: forall (f :: Type -> Type). Applicative f => IndexedLensLike' Int f String String
- Control.Lens.Combinators: xplat :: Optic (Costar ((->) s)) g s t a b -> ((s -> a) -> g b) -> g t
+ Control.Lens.Combinators: xplat :: forall {k2} s g (t :: k2) a (b :: k2). Optic (Costar ((->) s)) g s t a b -> ((s -> a) -> g b) -> g t
- Control.Lens.Combinators: xplatf :: Optic (Costar f) g s t a b -> (f a -> g b) -> f s -> g t
+ Control.Lens.Combinators: xplatf :: forall {k} {k2} f g (s :: k) (t :: k2) (a :: k) (b :: k2). Optic (Costar f) g s t a b -> (f a -> g b) -> f s -> g t
- Control.Lens.Each: each :: (Each s t a b, Traversable g, s ~ g a, t ~ g b) => Traversal s t a b
+ Control.Lens.Each: each :: Each s t a b => Traversal s t a b
- Control.Lens.Empty: _Empty :: (AsEmpty a, Monoid a, Eq a) => Prism' a ()
+ Control.Lens.Empty: _Empty :: AsEmpty a => Prism' a ()
- Control.Lens.Equality: [Identical] :: Identical a b a b
+ Control.Lens.Equality: [Identical] :: forall {k} {k1} (a :: k) (b :: k1). Identical a b a b
- Control.Lens.Equality: cloneEquality :: AnEquality s t a b -> Equality s t a b
+ Control.Lens.Equality: cloneEquality :: forall {k1} {k2} (s :: k1) (t :: k2) (a :: k1) (b :: k2). AnEquality s t a b -> Equality s t a b
- Control.Lens.Equality: data () => (a :: k) :~: (b :: k)
+ Control.Lens.Equality: data (a :: k) :~: (b :: k)
- Control.Lens.Equality: data Identical a b s t
+ Control.Lens.Equality: data Identical (a :: k) (b :: k1) (s :: k) (t :: k1)
- Control.Lens.Equality: equality :: (s :~: a) -> (b :~: t) -> Equality s t a b
+ Control.Lens.Equality: equality :: forall {k1} {k2} (s :: k1) (a :: k1) (b :: k2) (t :: k2). (s :~: a) -> (b :~: t) -> Equality s t a b
- Control.Lens.Equality: equality' :: (a :~: b) -> Equality' a b
+ Control.Lens.Equality: equality' :: forall {k2} (a :: k2) (b :: k2). (a :~: b) -> Equality' a b
- Control.Lens.Equality: fromEq :: AnEquality s t a b -> Equality b a t s
+ Control.Lens.Equality: fromEq :: forall {k2} {k1} (s :: k2) (t :: k1) (a :: k2) (b :: k1). AnEquality s t a b -> Equality b a t s
- Control.Lens.Equality: fromLeibniz :: (Identical a b a b -> Identical a b s t) -> Equality s t a b
+ Control.Lens.Equality: fromLeibniz :: forall {k1} {k2} (a :: k1) (b :: k2) (s :: k1) (t :: k2). (Identical a b a b -> Identical a b s t) -> Equality s t a b
- Control.Lens.Equality: fromLeibniz' :: ((s :~: s) -> s :~: a) -> Equality' s a
+ Control.Lens.Equality: fromLeibniz' :: forall {k2} (s :: k2) (a :: k2). ((s :~: s) -> s :~: a) -> Equality' s a
- Control.Lens.Equality: mapEq :: forall k1 k2 (s :: k1) (t :: k2) (a :: k1) (b :: k2) (f :: k1 -> Type). AnEquality s t a b -> f s -> f a
+ Control.Lens.Equality: mapEq :: forall k1 k2 (s :: k1) (t :: k2) (a :: k1) (b :: k2) f. AnEquality s t a b -> f s -> f a
- Control.Lens.Equality: overEquality :: AnEquality s t a b -> p a b -> p s t
+ Control.Lens.Equality: overEquality :: forall {k1} {k2} (s :: k1) (t :: k2) (a :: k1) (b :: k2) p. AnEquality s t a b -> p a b -> p s t
- Control.Lens.Equality: runEq :: AnEquality s t a b -> Identical s t a b
+ Control.Lens.Equality: runEq :: forall {k1} {k2} (s :: k1) (t :: k2) (a :: k1) (b :: k2). AnEquality s t a b -> Identical s t a b
- Control.Lens.Equality: simple :: Equality' a a
+ Control.Lens.Equality: simple :: forall {k2} (a :: k2) k3 p (f :: k2 -> k3). p a (f a) -> p a (f a)
- Control.Lens.Equality: simply :: forall p f s a rep (r :: TYPE rep). (Optic' p f s a -> r) -> Optic' p f s a -> r
+ Control.Lens.Equality: simply :: forall {k} {k1} p (f :: k -> k1) (s :: k) (a :: k) r. (Optic' p f s a -> r) -> Optic' p f s a -> r
- Control.Lens.Equality: substEq :: forall s t a b rep (r :: TYPE rep). AnEquality s t a b -> ((s ~ a, t ~ b) => r) -> r
+ Control.Lens.Equality: substEq :: forall {k1} {k2} (s :: k1) (t :: k2) (a :: k1) (b :: k2) r. AnEquality s t a b -> ((s ~ a, t ~ b) => r) -> r
- Control.Lens.Equality: type AnEquality s t a b = Identical a (Proxy b) a (Proxy b) -> Identical a (Proxy b) s (Proxy t)
+ Control.Lens.Equality: type AnEquality (s :: k) (t :: k1) (a :: k) (b :: k2) = Identical a Proxy b a Proxy b -> Identical a Proxy b s Proxy t
- Control.Lens.Equality: type AnEquality' s a = AnEquality s s a a
+ Control.Lens.Equality: type AnEquality' (s :: k) (a :: k) = AnEquality s s a a
- Control.Lens.Equality: type Equality' s a = Equality s s a a
+ Control.Lens.Equality: type Equality' (s :: k2) (a :: k2) = Equality s s a a
- Control.Lens.Equality: underEquality :: AnEquality s t a b -> p t s -> p b a
+ Control.Lens.Equality: underEquality :: forall {k1} {k2} (s :: k1) (t :: k2) (a :: k1) (b :: k2) p. AnEquality s t a b -> p t s -> p b a
- Control.Lens.Equality: withEquality :: forall s t a b rep (r :: TYPE rep). AnEquality s t a b -> ((s :~: a) -> (b :~: t) -> r) -> r
+ Control.Lens.Equality: withEquality :: forall {k1} {k2} (s :: k1) (t :: k2) (a :: k1) (b :: k2) r. AnEquality s t a b -> ((s :~: a) -> (b :~: t) -> r) -> r
- Control.Lens.Fold: data Sequenced a m
+ Control.Lens.Fold: data Sequenced a (m :: Type -> Type)
- Control.Lens.Fold: data Traversed a f
+ Control.Lens.Fold: data Traversed a (f :: Type -> Type)
- Control.Lens.Fold: folded :: Foldable f => IndexedFold Int (f a) a
+ Control.Lens.Fold: folded :: forall (f :: Type -> Type) a. Foldable f => IndexedFold Int (f a) a
- Control.Lens.Fold: folded64 :: Foldable f => IndexedFold Int64 (f a) a
+ Control.Lens.Fold: folded64 :: forall (f :: Type -> Type) a. Foldable f => IndexedFold Int64 (f a) a
- Control.Lens.Fold: itakingWhile :: (Indexable i p, Profunctor q, Contravariant f, Applicative f) => (i -> a -> Bool) -> Optical' (Indexed i) q (Const (Endo (f s))) s a -> Optical' p q f s a
+ Control.Lens.Fold: itakingWhile :: (Indexable i p, Profunctor q, Contravariant f, Applicative f) => (i -> a -> Bool) -> Optical' (Indexed i) q (Const (Endo (f s)) :: Type -> Type) s a -> Optical' p q f s a
- Control.Lens.Fold: lined :: Applicative f => IndexedLensLike' Int f String String
+ Control.Lens.Fold: lined :: forall (f :: Type -> Type). Applicative f => IndexedLensLike' Int f String String
- Control.Lens.Fold: type IndexedFold i s a = forall p f. (Indexable i p, Contravariant f, Applicative f) => p a (f a) -> s -> f s
+ Control.Lens.Fold: type IndexedFold i s a = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Indexable i p, Contravariant f, Applicative f) => p a f a -> s -> f s
- Control.Lens.Fold: worded :: Applicative f => IndexedLensLike' Int f String String
+ Control.Lens.Fold: worded :: forall (f :: Type -> Type). Applicative f => IndexedLensLike' Int f String String
- Control.Lens.Getter: class () => Contravariant (f :: Type -> Type)
+ Control.Lens.Getter: class Contravariant (f :: Type -> Type)
- Control.Lens.Getter: newtype () => Const a (b :: k)
+ Control.Lens.Getter: newtype Const a (b :: k)
- Control.Lens.Getter: type Accessing p m s a = p a (Const m a) -> s -> Const m s
+ Control.Lens.Getter: type Accessing (p :: Type -> Type -> Type) m s a = p a Const m a -> s -> Const m s
- Control.Lens.Getter: type Getting r s a = (a -> Const r a) -> s -> Const r s
+ Control.Lens.Getter: type Getting r s a = a -> Const r a -> s -> Const r s
- Control.Lens.Getter: type IndexedGetting i m s a = Indexed i a (Const m a) -> s -> Const m s
+ Control.Lens.Getter: type IndexedGetting i m s a = Indexed i a Const m a -> s -> Const m s
- Control.Lens.Getter: type IndexedGetter i s a = forall p f. (Indexable i p, Contravariant f, Functor f) => p a (f a) -> s -> f s
+ Control.Lens.Getter: type IndexedGetter i s a = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Indexable i p, Contravariant f, Functor f) => p a f a -> s -> f s
- Control.Lens.Getter: uses :: MonadState s m => LensLike' (Const r) s a -> (a -> r) -> m r
+ Control.Lens.Getter: uses :: MonadState s m => LensLike' (Const r :: Type -> Type) s a -> (a -> r) -> m r
- Control.Lens.Getter: views :: MonadReader s m => LensLike' (Const r) s a -> (a -> r) -> m r
+ Control.Lens.Getter: views :: MonadReader s m => LensLike' (Const r :: Type -> Type) s a -> (a -> r) -> m r
- Control.Lens.Indexed: class (Choice p, Corepresentable p, Comonad (Corep p), Traversable (Corep p), Strong p, Representable p, Monad (Rep p), MonadFix (Rep p), Distributive (Rep p), Costrong p, ArrowLoop p, ArrowApply p, ArrowChoice p, Closed p) => Conjoined p
+ Control.Lens.Indexed: class (Choice p, Corepresentable p, Comonad Corep p, Traversable Corep p, Strong p, Representable p, Monad Rep p, MonadFix Rep p, Distributive Rep p, Costrong p, ArrowLoop p, ArrowApply p, ArrowChoice p, Closed p) => Conjoined (p :: Type -> Type -> Type)
- Control.Lens.Indexed: class Conjoined p => Indexable i p
+ Control.Lens.Indexed: class Conjoined p => Indexable i (p :: Type -> Type -> Type)
- Control.Lens.Indexed: ifolded :: FoldableWithIndex i f => IndexedFold i (f a) a
+ Control.Lens.Indexed: ifolded :: forall i (f :: Type -> Type) a. FoldableWithIndex i f => IndexedFold i (f a) a
- Control.Lens.Indexed: imapped :: FunctorWithIndex i f => IndexedSetter i (f a) (f b) a b
+ Control.Lens.Indexed: imapped :: forall i (f :: Type -> Type) a b. FunctorWithIndex i f => IndexedSetter i (f a) (f b) a b
- Control.Lens.Indexed: itraverseBy :: TraversableWithIndex i t => (forall x. x -> f x) -> (forall x y. f (x -> y) -> f x -> f y) -> (i -> a -> f b) -> t a -> f (t b)
+ Control.Lens.Indexed: itraverseBy :: TraversableWithIndex i t => (forall x. () => x -> f x) -> (forall x y. () => f (x -> y) -> f x -> f y) -> (i -> a -> f b) -> t a -> f (t b)
- Control.Lens.Indexed: itraverseByOf :: IndexedTraversal i s t a b -> (forall x. x -> f x) -> (forall x y. f (x -> y) -> f x -> f y) -> (i -> a -> f b) -> s -> f t
+ Control.Lens.Indexed: itraverseByOf :: IndexedTraversal i s t a b -> (forall x. () => x -> f x) -> (forall x y. () => f (x -> y) -> f x -> f y) -> (i -> a -> f b) -> s -> f t
- Control.Lens.Indexed: itraversed :: TraversableWithIndex i t => IndexedTraversal i (t a) (t b) a b
+ Control.Lens.Indexed: itraversed :: forall i (t :: Type -> Type) a b. TraversableWithIndex i t => IndexedTraversal i (t a) (t b) a b
- Control.Lens.Internal.Bazaar: Bazaar :: (forall f. Applicative f => p a (f b) -> f t) -> Bazaar p a b t
+ Control.Lens.Internal.Bazaar: Bazaar :: (forall (f :: Type -> Type). Applicative f => p a (f b) -> f t) -> Bazaar (p :: Type -> Type -> Type) a b t
- Control.Lens.Internal.Bazaar: Bazaar1 :: (forall f. Apply f => p a (f b) -> f t) -> Bazaar1 p a b t
+ Control.Lens.Internal.Bazaar: Bazaar1 :: (forall (f :: Type -> Type). Apply f => p a (f b) -> f t) -> Bazaar1 (p :: Type -> Type -> Type) a b t
- Control.Lens.Internal.Bazaar: BazaarT :: (forall f. Applicative f => p a (f b) -> f t) -> BazaarT p (g :: Type -> Type) a b t
+ Control.Lens.Internal.Bazaar: BazaarT :: (forall (f :: Type -> Type). Applicative f => p a (f b) -> f t) -> BazaarT (p :: Type -> Type -> Type) (g :: Type -> Type) a b t
- Control.Lens.Internal.Bazaar: BazaarT1 :: (forall f. Apply f => p a (f b) -> f t) -> BazaarT1 p (g :: Type -> Type) a b t
+ Control.Lens.Internal.Bazaar: BazaarT1 :: (forall (f :: Type -> Type). Apply f => p a (f b) -> f t) -> BazaarT1 (p :: Type -> Type -> Type) (g :: Type -> Type) a b t
- Control.Lens.Internal.Bazaar: [runBazaar1] :: Bazaar1 p a b t -> forall f. Apply f => p a (f b) -> f t
+ Control.Lens.Internal.Bazaar: [runBazaar1] :: Bazaar1 (p :: Type -> Type -> Type) a b t -> forall (f :: Type -> Type). Apply f => p a (f b) -> f t
- Control.Lens.Internal.Bazaar: [runBazaarT1] :: BazaarT1 p (g :: Type -> Type) a b t -> forall f. Apply f => p a (f b) -> f t
+ Control.Lens.Internal.Bazaar: [runBazaarT1] :: BazaarT1 (p :: Type -> Type -> Type) (g :: Type -> Type) a b t -> forall (f :: Type -> Type). Apply f => p a (f b) -> f t
- Control.Lens.Internal.Bazaar: [runBazaarT] :: BazaarT p (g :: Type -> Type) a b t -> forall f. Applicative f => p a (f b) -> f t
+ Control.Lens.Internal.Bazaar: [runBazaarT] :: BazaarT (p :: Type -> Type -> Type) (g :: Type -> Type) a b t -> forall (f :: Type -> Type). Applicative f => p a (f b) -> f t
- Control.Lens.Internal.Bazaar: [runBazaar] :: Bazaar p a b t -> forall f. Applicative f => p a (f b) -> f t
+ Control.Lens.Internal.Bazaar: [runBazaar] :: Bazaar (p :: Type -> Type -> Type) a b t -> forall (f :: Type -> Type). Applicative f => p a (f b) -> f t
- Control.Lens.Internal.Bazaar: class Profunctor p => Bizarre p w | w -> p
+ Control.Lens.Internal.Bazaar: class Profunctor p => Bizarre (p :: Type -> Type -> Type) (w :: Type -> Type -> Type -> Type) | w -> p
- Control.Lens.Internal.Bazaar: class Profunctor p => Bizarre1 p w | w -> p
+ Control.Lens.Internal.Bazaar: class Profunctor p => Bizarre1 (p :: Type -> Type -> Type) (w :: Type -> Type -> Type -> Type) | w -> p
- Control.Lens.Internal.Bazaar: newtype Bazaar p a b t
+ Control.Lens.Internal.Bazaar: newtype Bazaar (p :: Type -> Type -> Type) a b t
- Control.Lens.Internal.Bazaar: newtype Bazaar1 p a b t
+ Control.Lens.Internal.Bazaar: newtype Bazaar1 (p :: Type -> Type -> Type) a b t
- Control.Lens.Internal.Bazaar: newtype BazaarT p (g :: Type -> Type) a b t
+ Control.Lens.Internal.Bazaar: newtype BazaarT (p :: Type -> Type -> Type) (g :: Type -> Type) a b t
- Control.Lens.Internal.Bazaar: newtype BazaarT1 p (g :: Type -> Type) a b t
+ Control.Lens.Internal.Bazaar: newtype BazaarT1 (p :: Type -> Type -> Type) (g :: Type -> Type) a b t
- Control.Lens.Internal.Bazaar: type Bazaar' p a = Bazaar p a a
+ Control.Lens.Internal.Bazaar: type Bazaar' (p :: Type -> Type -> Type) a = Bazaar p a a
- Control.Lens.Internal.Bazaar: type Bazaar1' p a = Bazaar1 p a a
+ Control.Lens.Internal.Bazaar: type Bazaar1' (p :: Type -> Type -> Type) a = Bazaar1 p a a
- Control.Lens.Internal.Bazaar: type BazaarT' p g a = BazaarT p g a a
+ Control.Lens.Internal.Bazaar: type BazaarT' (p :: Type -> Type -> Type) (g :: Type -> Type) a = BazaarT p g a a
- Control.Lens.Internal.Bazaar: type BazaarT1' p g a = BazaarT1 p g a a
+ Control.Lens.Internal.Bazaar: type BazaarT1' (p :: Type -> Type -> Type) (g :: Type -> Type) a = BazaarT1 p g a a
- Control.Lens.Internal.CTypes: data () => Ptr a
+ Control.Lens.Internal.CTypes: data Ptr a
- Control.Lens.Internal.Context: Pretext :: (forall f. Functor f => p a (f b) -> f t) -> Pretext p a b t
+ Control.Lens.Internal.Context: Pretext :: (forall (f :: Type -> Type). Functor f => p a (f b) -> f t) -> Pretext (p :: Type -> Type -> Type) a b t
- Control.Lens.Internal.Context: PretextT :: (forall f. Functor f => p a (f b) -> f t) -> PretextT p (g :: Type -> Type) a b t
+ Control.Lens.Internal.Context: PretextT :: (forall (f :: Type -> Type). Functor f => p a (f b) -> f t) -> PretextT (p :: Type -> Type -> Type) (g :: Type -> Type) a b t
- Control.Lens.Internal.Context: [runPretextT] :: PretextT p (g :: Type -> Type) a b t -> forall f. Functor f => p a (f b) -> f t
+ Control.Lens.Internal.Context: [runPretextT] :: PretextT (p :: Type -> Type -> Type) (g :: Type -> Type) a b t -> forall (f :: Type -> Type). Functor f => p a (f b) -> f t
- Control.Lens.Internal.Context: [runPretext] :: Pretext p a b t -> forall f. Functor f => p a (f b) -> f t
+ Control.Lens.Internal.Context: [runPretext] :: Pretext (p :: Type -> Type -> Type) a b t -> forall (f :: Type -> Type). Functor f => p a (f b) -> f t
- Control.Lens.Internal.Context: class IndexedFunctor w => IndexedComonad w
+ Control.Lens.Internal.Context: class IndexedFunctor w => IndexedComonad (w :: Type -> Type -> Type -> Type)
- Control.Lens.Internal.Context: class IndexedComonad w => IndexedComonadStore w
+ Control.Lens.Internal.Context: class IndexedComonad w => IndexedComonadStore (w :: Type -> Type -> Type -> Type)
- Control.Lens.Internal.Context: class IndexedFunctor w
+ Control.Lens.Internal.Context: class IndexedFunctor (w :: Type -> Type -> Type -> Type)
- Control.Lens.Internal.Context: class Corepresentable p => Sellable p w | w -> p
+ Control.Lens.Internal.Context: class Corepresentable p => Sellable (p :: Type -> Type -> Type) (w :: Type -> Type -> Type -> Type) | w -> p
- Control.Lens.Internal.Context: newtype Pretext p a b t
+ Control.Lens.Internal.Context: newtype Pretext (p :: Type -> Type -> Type) a b t
- Control.Lens.Internal.Context: newtype PretextT p (g :: Type -> Type) a b t
+ Control.Lens.Internal.Context: newtype PretextT (p :: Type -> Type -> Type) (g :: Type -> Type) a b t
- Control.Lens.Internal.Context: type Pretext' p a = Pretext p a a
+ Control.Lens.Internal.Context: type Pretext' (p :: Type -> Type -> Type) a = Pretext p a a
- Control.Lens.Internal.Context: type PretextT' p g a = PretextT p g a a
+ Control.Lens.Internal.Context: type PretextT' (p :: Type -> Type -> Type) (g :: Type -> Type) a = PretextT p g a a
- Control.Lens.Internal.FieldTH: type ClassyNamer = -- | Name of the data type that lenses are being generated for. Name -> -- | Names of the class and the main method it generates, respectively. Maybe (Name, Name)
+ Control.Lens.Internal.FieldTH: type ClassyNamer = Name -> Maybe (Name, Name)
- Control.Lens.Internal.FieldTH: type FieldNamer = -- | Name of the data type that lenses are being generated for. Name -> -- | Names of all fields (including the field being named) in the data type. [Name] -> -- | Name of the field being named. Name -> -- | Name(s) of the lens functions. If empty, no lens is created for that field. [DefName]
+ Control.Lens.Internal.FieldTH: type FieldNamer = Name -> [Name] -> Name -> [DefName]
- Control.Lens.Internal.FieldTH: type HasFieldClasses = StateT (Set Name) Q
+ Control.Lens.Internal.FieldTH: type HasFieldClasses = StateT Set Name Q
- Control.Lens.Internal.Fold: Folding :: f a -> Folding f a
+ Control.Lens.Internal.Fold: Folding :: f a -> Folding (f :: Type -> Type) a
- Control.Lens.Internal.Fold: Sequenced :: m a -> Sequenced a m
+ Control.Lens.Internal.Fold: Sequenced :: m a -> Sequenced a (m :: Type -> Type)
- Control.Lens.Internal.Fold: Traversed :: f a -> Traversed a f
+ Control.Lens.Internal.Fold: Traversed :: f a -> Traversed a (f :: Type -> Type)
- Control.Lens.Internal.Fold: TraversedF :: f a -> TraversedF a f
+ Control.Lens.Internal.Fold: TraversedF :: f a -> TraversedF a (f :: Type -> Type)
- Control.Lens.Internal.Fold: [getFolding] :: Folding f a -> f a
+ Control.Lens.Internal.Fold: [getFolding] :: Folding (f :: Type -> Type) a -> f a
- Control.Lens.Internal.Fold: [getSequenced] :: Sequenced a m -> m a
+ Control.Lens.Internal.Fold: [getSequenced] :: Sequenced a (m :: Type -> Type) -> m a
- Control.Lens.Internal.Fold: [getTraversedF] :: TraversedF a f -> f a
+ Control.Lens.Internal.Fold: [getTraversedF] :: TraversedF a (f :: Type -> Type) -> f a
- Control.Lens.Internal.Fold: [getTraversed] :: Traversed a f -> f a
+ Control.Lens.Internal.Fold: [getTraversed] :: Traversed a (f :: Type -> Type) -> f a
- Control.Lens.Internal.Fold: data () => ReifiedMonoid a
+ Control.Lens.Internal.Fold: data ReifiedMonoid a
- Control.Lens.Internal.Fold: newtype Folding f a
+ Control.Lens.Internal.Fold: newtype Folding (f :: Type -> Type) a
- Control.Lens.Internal.Fold: newtype Sequenced a m
+ Control.Lens.Internal.Fold: newtype Sequenced a (m :: Type -> Type)
- Control.Lens.Internal.Fold: newtype Traversed a f
+ Control.Lens.Internal.Fold: newtype Traversed a (f :: Type -> Type)
- Control.Lens.Internal.Fold: newtype TraversedF a f
+ Control.Lens.Internal.Fold: newtype TraversedF a (f :: Type -> Type)
- Control.Lens.Internal.Getter: AlongsideLeft :: f (a, b) -> AlongsideLeft f b a
+ Control.Lens.Internal.Getter: AlongsideLeft :: f (a, b) -> AlongsideLeft (f :: Type -> Type) b a
- Control.Lens.Internal.Getter: AlongsideRight :: f (a, b) -> AlongsideRight f a b
+ Control.Lens.Internal.Getter: AlongsideRight :: f (a, b) -> AlongsideRight (f :: Type -> Type) a b
- Control.Lens.Internal.Getter: [getAlongsideLeft] :: AlongsideLeft f b a -> f (a, b)
+ Control.Lens.Internal.Getter: [getAlongsideLeft] :: AlongsideLeft (f :: Type -> Type) b a -> f (a, b)
- Control.Lens.Internal.Getter: [getAlongsideRight] :: AlongsideRight f a b -> f (a, b)
+ Control.Lens.Internal.Getter: [getAlongsideRight] :: AlongsideRight (f :: Type -> Type) a b -> f (a, b)
- Control.Lens.Internal.Getter: newtype AlongsideLeft f b a
+ Control.Lens.Internal.Getter: newtype AlongsideLeft (f :: Type -> Type) b a
- Control.Lens.Internal.Getter: newtype AlongsideRight f a b
+ Control.Lens.Internal.Getter: newtype AlongsideRight (f :: Type -> Type) a b
- Control.Lens.Internal.Indexed: Indexing :: (Int -> (Int, f a)) -> Indexing f a
+ Control.Lens.Internal.Indexed: Indexing :: (Int -> (Int, f a)) -> Indexing (f :: Type -> Type) a
- Control.Lens.Internal.Indexed: Indexing64 :: (Int64 -> (Int64, f a)) -> Indexing64 f a
+ Control.Lens.Internal.Indexed: Indexing64 :: (Int64 -> (Int64, f a)) -> Indexing64 (f :: Type -> Type) a
- Control.Lens.Internal.Indexed: [runIndexing64] :: Indexing64 f a -> Int64 -> (Int64, f a)
+ Control.Lens.Internal.Indexed: [runIndexing64] :: Indexing64 (f :: Type -> Type) a -> Int64 -> (Int64, f a)
- Control.Lens.Internal.Indexed: [runIndexing] :: Indexing f a -> Int -> (Int, f a)
+ Control.Lens.Internal.Indexed: [runIndexing] :: Indexing (f :: Type -> Type) a -> Int -> (Int, f a)
- Control.Lens.Internal.Indexed: class (Choice p, Corepresentable p, Comonad (Corep p), Traversable (Corep p), Strong p, Representable p, Monad (Rep p), MonadFix (Rep p), Distributive (Rep p), Costrong p, ArrowLoop p, ArrowApply p, ArrowChoice p, Closed p) => Conjoined p
+ Control.Lens.Internal.Indexed: class (Choice p, Corepresentable p, Comonad Corep p, Traversable Corep p, Strong p, Representable p, Monad Rep p, MonadFix Rep p, Distributive Rep p, Costrong p, ArrowLoop p, ArrowApply p, ArrowChoice p, Closed p) => Conjoined (p :: Type -> Type -> Type)
- Control.Lens.Internal.Indexed: class Conjoined p => Indexable i p
+ Control.Lens.Internal.Indexed: class Conjoined p => Indexable i (p :: Type -> Type -> Type)
- Control.Lens.Internal.Indexed: newtype Indexing f a
+ Control.Lens.Internal.Indexed: newtype Indexing (f :: Type -> Type) a
- Control.Lens.Internal.Indexed: newtype Indexing64 f a
+ Control.Lens.Internal.Indexed: newtype Indexing64 (f :: Type -> Type) a
- Control.Lens.Internal.Level: Deepening :: (forall r. Int -> (Level i a -> Bool -> r) -> r) -> Deepening i a
+ Control.Lens.Internal.Level: Deepening :: (forall r. () => Int -> (Level i a -> Bool -> r) -> r) -> Deepening i a
- Control.Lens.Internal.Level: [runDeepening] :: Deepening i a -> forall r. Int -> (Level i a -> Bool -> r) -> r
+ Control.Lens.Internal.Level: [runDeepening] :: Deepening i a -> forall r. () => Int -> (Level i a -> Bool -> r) -> r
- Control.Lens.Internal.Magma: TakingWhile :: Bool -> t -> (Bool -> Magma () t b (Corep p a)) -> TakingWhile p (g :: Type -> Type) a b t
+ Control.Lens.Internal.Magma: TakingWhile :: Bool -> t -> (Bool -> Magma () t b (Corep p a)) -> TakingWhile (p :: Type -> Type -> Type) (g :: Type -> Type) a b t
- Control.Lens.Internal.Magma: [MagmaAp] :: Magma i (x -> y) b a -> Magma i x b a -> Magma i y b a
+ Control.Lens.Internal.Magma: [MagmaAp] :: forall i x t b a. Magma i (x -> t) b a -> Magma i x b a -> Magma i t b a
- Control.Lens.Internal.Magma: [MagmaFmap] :: (x -> y) -> Magma i x b a -> Magma i y b a
+ Control.Lens.Internal.Magma: [MagmaFmap] :: forall x t i b a. (x -> t) -> Magma i x b a -> Magma i t b a
- Control.Lens.Internal.Magma: [MagmaPure] :: x -> Magma i x b a
+ Control.Lens.Internal.Magma: [MagmaPure] :: forall t i b a. t -> Magma i t b a
- Control.Lens.Internal.Magma: [Magma] :: i -> a -> Magma i b b a
+ Control.Lens.Internal.Magma: [Magma] :: forall i a t. i -> a -> Magma i t t a
- Control.Lens.Internal.Magma: data TakingWhile p (g :: Type -> Type) a b t
+ Control.Lens.Internal.Magma: data TakingWhile (p :: Type -> Type -> Type) (g :: Type -> Type) a b t
- Control.Lens.Internal.Magma: runTakingWhile :: TakingWhile p f a b t -> Magma () t b (Corep p a)
+ Control.Lens.Internal.Magma: runTakingWhile :: forall (p :: Type -> Type -> Type) (f :: Type -> Type) a b t. TakingWhile p f a b t -> Magma () t b (Corep p a)
- Control.Lens.Internal.Profunctor: WrapPafb :: p a (f b) -> WrappedPafb f p a b
+ Control.Lens.Internal.Profunctor: WrapPafb :: p a (f b) -> WrappedPafb (f :: Type -> Type) (p :: Type -> Type -> Type) a b
- Control.Lens.Internal.Profunctor: [unwrapPafb] :: WrappedPafb f p a b -> p a (f b)
+ Control.Lens.Internal.Profunctor: [unwrapPafb] :: WrappedPafb (f :: Type -> Type) (p :: Type -> Type -> Type) a b -> p a (f b)
- Control.Lens.Internal.Profunctor: newtype WrappedPafb f p a b
+ Control.Lens.Internal.Profunctor: newtype WrappedPafb (f :: Type -> Type) (p :: Type -> Type -> Type) a b
- Control.Lens.Internal.Review: class (Profunctor p, Bifunctor p) => Reviewable p
+ Control.Lens.Internal.Review: class (Profunctor p, Bifunctor p) => Reviewable (p :: Type -> Type -> Type)
- Control.Lens.Internal.Setter: class (Applicative f, Distributive f, Traversable f) => Settable f
+ Control.Lens.Internal.Setter: class (Applicative f, Distributive f, Traversable f) => Settable (f :: Type -> Type)
- Control.Lens.Internal.TH: type TyVarBndrVis = TyVarBndr_ BndrVis
+ Control.Lens.Internal.TH: type TyVarBndrVis = TyVarBndr BndrVis
- Control.Lens.Internal.Zoom: Effect :: m r -> Effect m r a
+ Control.Lens.Internal.Zoom: Effect :: m r -> Effect (m :: Type -> Type) r a
- Control.Lens.Internal.Zoom: EffectRWS :: (st -> m (s, st, w)) -> EffectRWS w st m s a
+ Control.Lens.Internal.Zoom: EffectRWS :: (st -> m (s, st, w)) -> EffectRWS w st (m :: Type -> Type) s a
- Control.Lens.Internal.Zoom: Focusing :: m (s, a) -> Focusing m s a
+ Control.Lens.Internal.Zoom: Focusing :: m (s, a) -> Focusing (m :: Type -> Type) s a
- Control.Lens.Internal.Zoom: FocusingErr :: k (Err e s) a -> FocusingErr e k s a
+ Control.Lens.Internal.Zoom: FocusingErr :: k (Err e s) a -> FocusingErr e (k :: Type -> Type -> Type) s a
- Control.Lens.Internal.Zoom: FocusingFree :: k (Freed f m s) a -> FocusingFree f m k s a
+ Control.Lens.Internal.Zoom: FocusingFree :: k (Freed f m s) a -> FocusingFree (f :: Type -> Type) (m :: Type -> Type) (k :: Type -> Type -> Type) s a
- Control.Lens.Internal.Zoom: FocusingMay :: k (May s) a -> FocusingMay k s a
+ Control.Lens.Internal.Zoom: FocusingMay :: k (May s) a -> FocusingMay (k :: Type -> Type -> Type) s a
- Control.Lens.Internal.Zoom: FocusingOn :: k (f s) a -> FocusingOn f k s a
+ Control.Lens.Internal.Zoom: FocusingOn :: k (f s) a -> FocusingOn (f :: Type -> Type) (k :: Type -> Type -> Type) s a
- Control.Lens.Internal.Zoom: FocusingPlus :: k (s, w) a -> FocusingPlus w k s a
+ Control.Lens.Internal.Zoom: FocusingPlus :: k (s, w) a -> FocusingPlus w (k :: Type -> Type -> Type) s a
- Control.Lens.Internal.Zoom: FocusingWith :: m (s, a, w) -> FocusingWith w m s a
+ Control.Lens.Internal.Zoom: FocusingWith :: m (s, a, w) -> FocusingWith w (m :: Type -> Type) s a
- Control.Lens.Internal.Zoom: Freed :: FreeF f a (FreeT f m a) -> Freed f m a
+ Control.Lens.Internal.Zoom: Freed :: FreeF f a (FreeT f m a) -> Freed (f :: Type -> Type) (m :: Type -> Type) a
- Control.Lens.Internal.Zoom: [getEffectRWS] :: EffectRWS w st m s a -> st -> m (s, st, w)
+ Control.Lens.Internal.Zoom: [getEffectRWS] :: EffectRWS w st (m :: Type -> Type) s a -> st -> m (s, st, w)
- Control.Lens.Internal.Zoom: [getEffect] :: Effect m r a -> m r
+ Control.Lens.Internal.Zoom: [getEffect] :: Effect (m :: Type -> Type) r a -> m r
- Control.Lens.Internal.Zoom: [getFreed] :: Freed f m a -> FreeF f a (FreeT f m a)
+ Control.Lens.Internal.Zoom: [getFreed] :: Freed (f :: Type -> Type) (m :: Type -> Type) a -> FreeF f a (FreeT f m a)
- Control.Lens.Internal.Zoom: [unfocusingErr] :: FocusingErr e k s a -> k (Err e s) a
+ Control.Lens.Internal.Zoom: [unfocusingErr] :: FocusingErr e (k :: Type -> Type -> Type) s a -> k (Err e s) a
- Control.Lens.Internal.Zoom: [unfocusingFree] :: FocusingFree f m k s a -> k (Freed f m s) a
+ Control.Lens.Internal.Zoom: [unfocusingFree] :: FocusingFree (f :: Type -> Type) (m :: Type -> Type) (k :: Type -> Type -> Type) s a -> k (Freed f m s) a
- Control.Lens.Internal.Zoom: [unfocusingMay] :: FocusingMay k s a -> k (May s) a
+ Control.Lens.Internal.Zoom: [unfocusingMay] :: FocusingMay (k :: Type -> Type -> Type) s a -> k (May s) a
- Control.Lens.Internal.Zoom: [unfocusingOn] :: FocusingOn f k s a -> k (f s) a
+ Control.Lens.Internal.Zoom: [unfocusingOn] :: FocusingOn (f :: Type -> Type) (k :: Type -> Type -> Type) s a -> k (f s) a
- Control.Lens.Internal.Zoom: [unfocusingPlus] :: FocusingPlus w k s a -> k (s, w) a
+ Control.Lens.Internal.Zoom: [unfocusingPlus] :: FocusingPlus w (k :: Type -> Type -> Type) s a -> k (s, w) a
- Control.Lens.Internal.Zoom: [unfocusingWith] :: FocusingWith w m s a -> m (s, a, w)
+ Control.Lens.Internal.Zoom: [unfocusingWith] :: FocusingWith w (m :: Type -> Type) s a -> m (s, a, w)
- Control.Lens.Internal.Zoom: [unfocusing] :: Focusing m s a -> m (s, a)
+ Control.Lens.Internal.Zoom: [unfocusing] :: Focusing (m :: Type -> Type) s a -> m (s, a)
- Control.Lens.Internal.Zoom: newtype Effect m r a
+ Control.Lens.Internal.Zoom: newtype Effect (m :: Type -> Type) r a
- Control.Lens.Internal.Zoom: newtype EffectRWS w st m s a
+ Control.Lens.Internal.Zoom: newtype EffectRWS w st (m :: Type -> Type) s a
- Control.Lens.Internal.Zoom: newtype Focusing m s a
+ Control.Lens.Internal.Zoom: newtype Focusing (m :: Type -> Type) s a
- Control.Lens.Internal.Zoom: newtype FocusingErr e k s a
+ Control.Lens.Internal.Zoom: newtype FocusingErr e (k :: Type -> Type -> Type) s a
- Control.Lens.Internal.Zoom: newtype FocusingFree f m k s a
+ Control.Lens.Internal.Zoom: newtype FocusingFree (f :: Type -> Type) (m :: Type -> Type) (k :: Type -> Type -> Type) s a
- Control.Lens.Internal.Zoom: newtype FocusingMay k s a
+ Control.Lens.Internal.Zoom: newtype FocusingMay (k :: Type -> Type -> Type) s a
- Control.Lens.Internal.Zoom: newtype FocusingOn f k s a
+ Control.Lens.Internal.Zoom: newtype FocusingOn (f :: Type -> Type) (k :: Type -> Type -> Type) s a
- Control.Lens.Internal.Zoom: newtype FocusingPlus w k s a
+ Control.Lens.Internal.Zoom: newtype FocusingPlus w (k :: Type -> Type -> Type) s a
- Control.Lens.Internal.Zoom: newtype FocusingWith w m s a
+ Control.Lens.Internal.Zoom: newtype FocusingWith w (m :: Type -> Type) s a
- Control.Lens.Internal.Zoom: newtype Freed f m a
+ Control.Lens.Internal.Zoom: newtype Freed (f :: Type -> Type) (m :: Type -> Type) a
- Control.Lens.Iso: bimapping :: (Bifunctor f, Bifunctor g) => AnIso s t a b -> AnIso s' t' a' b' -> Iso (f s s') (g t t') (f a a') (g b b')
+ Control.Lens.Iso: bimapping :: forall (f :: Type -> Type -> Type) (g :: Type -> Type -> Type) s t a b s' t' a' b'. (Bifunctor f, Bifunctor g) => AnIso s t a b -> AnIso s' t' a' b' -> Iso (f s s') (g t t') (f a a') (g b b')
- Control.Lens.Iso: class () => Profunctor (p :: Type -> Type -> Type)
+ Control.Lens.Iso: class Profunctor (p :: Type -> Type -> Type)
- Control.Lens.Iso: contramapping :: Contravariant f => AnIso s t a b -> Iso (f a) (f b) (f s) (f t)
+ Control.Lens.Iso: contramapping :: forall (f :: Type -> Type) s t a b. Contravariant f => AnIso s t a b -> Iso (f a) (f b) (f s) (f t)
- Control.Lens.Iso: curried :: Iso ((a, b) -> c) ((d, e) -> f) (a -> b -> c) (d -> e -> f)
+ Control.Lens.Iso: curried :: forall a b c d e f1 p f2. (Profunctor p, Functor f2) => p (a -> b -> c) (f2 (d -> e -> f1)) -> p ((a, b) -> c) (f2 ((d, e) -> f1))
- Control.Lens.Iso: dimapping :: (Profunctor p, Profunctor q) => AnIso s t a b -> AnIso s' t' a' b' -> Iso (p a s') (q b t') (p s a') (q t b')
+ Control.Lens.Iso: dimapping :: forall (p :: Type -> Type -> Type) (q :: Type -> Type -> Type) s t a b s' t' a' b'. (Profunctor p, Profunctor q) => AnIso s t a b -> AnIso s' t' a' b' -> Iso (p a s') (q b t') (p s a') (q t b')
- Control.Lens.Iso: firsting :: (Bifunctor f, Bifunctor g) => AnIso s t a b -> Iso (f s x) (g t y) (f a x) (g b y)
+ Control.Lens.Iso: firsting :: forall (f :: Type -> Type -> Type) (g :: Type -> Type -> Type) s t a b x y. (Bifunctor f, Bifunctor g) => AnIso s t a b -> Iso (f s x) (g t y) (f a x) (g b y)
- Control.Lens.Iso: flipped :: Iso (a -> b -> c) (a' -> b' -> c') (b -> a -> c) (b' -> a' -> c')
+ Control.Lens.Iso: flipped :: forall a b c a' b' c' p f. (Profunctor p, Functor f) => p (b -> a -> c) (f (b' -> a' -> c')) -> p (a -> b -> c) (f (a' -> b' -> c'))
- Control.Lens.Iso: lmapping :: (Profunctor p, Profunctor q) => AnIso s t a b -> Iso (p a x) (q b y) (p s x) (q t y)
+ Control.Lens.Iso: lmapping :: forall (p :: Type -> Type -> Type) (q :: Type -> Type -> Type) s t a b x y. (Profunctor p, Profunctor q) => AnIso s t a b -> Iso (p a x) (q b y) (p s x) (q t y)
- Control.Lens.Iso: mapping :: (Functor f, Functor g) => AnIso s t a b -> Iso (f s) (g t) (f a) (g b)
+ Control.Lens.Iso: mapping :: forall (f :: Type -> Type) (g :: Type -> Type) s t a b. (Functor f, Functor g) => AnIso s t a b -> Iso (f s) (g t) (f a) (g b)
- Control.Lens.Iso: rmapping :: (Profunctor p, Profunctor q) => AnIso s t a b -> Iso (p x s) (q y t) (p x a) (q y b)
+ Control.Lens.Iso: rmapping :: forall (p :: Type -> Type -> Type) (q :: Type -> Type -> Type) s t a b x y. (Profunctor p, Profunctor q) => AnIso s t a b -> Iso (p x s) (q y t) (p x a) (q y b)
- Control.Lens.Iso: seconding :: (Bifunctor f, Bifunctor g) => AnIso s t a b -> Iso (f x s) (g y t) (f x a) (g y b)
+ Control.Lens.Iso: seconding :: forall (f :: Type -> Type -> Type) (g :: Type -> Type -> Type) s t a b x y. (Bifunctor f, Bifunctor g) => AnIso s t a b -> Iso (f x s) (g y t) (f x a) (g y b)
- Control.Lens.Iso: simple :: Equality' a a
+ Control.Lens.Iso: simple :: forall {k2} (a :: k2) k3 p (f :: k2 -> k3). p a (f a) -> p a (f a)
- Control.Lens.Iso: swapped :: Swap p => Iso (p a b) (p c d) (p b a) (p d c)
+ Control.Lens.Iso: swapped :: forall (p :: Type -> Type -> Type) a b c d. Swap p => Iso (p a b) (p c d) (p b a) (p d c)
- Control.Lens.Iso: type AnIso s t a b = Exchange a b a (Identity b) -> Exchange a b s (Identity t)
+ Control.Lens.Iso: type AnIso s t a b = Exchange a b a Identity b -> Exchange a b s Identity t
- Control.Lens.Iso: type Iso s t a b = forall p f. (Profunctor p, Functor f) => p a (f b) -> p s (f t)
+ Control.Lens.Iso: type Iso s t a b = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Profunctor p, Functor f) => p a f b -> p s f t
- Control.Lens.Iso: uncurried :: Iso (a -> b -> c) (d -> e -> f) ((a, b) -> c) ((d, e) -> f)
+ Control.Lens.Iso: uncurried :: forall a b c d e f1 p f2. (Profunctor p, Functor f2) => p ((a, b) -> c) (f2 ((d, e) -> f1)) -> p (a -> b -> c) (f2 (d -> e -> f1))
- Control.Lens.Iso: withIso :: forall s t a b rep (r :: TYPE rep). AnIso s t a b -> ((s -> a) -> (b -> t) -> r) -> r
+ Control.Lens.Iso: withIso :: AnIso s t a b -> ((s -> a) -> (b -> t) -> r) -> r
- Control.Lens.Iso: xplat :: Optic (Costar ((->) s)) g s t a b -> ((s -> a) -> g b) -> g t
+ Control.Lens.Iso: xplat :: forall {k2} s g (t :: k2) a (b :: k2). Optic (Costar ((->) s)) g s t a b -> ((s -> a) -> g b) -> g t
- Control.Lens.Iso: xplatf :: Optic (Costar f) g s t a b -> (f a -> g b) -> f s -> g t
+ Control.Lens.Iso: xplatf :: forall {k} {k2} f g (s :: k) (t :: k2) (a :: k) (b :: k2). Optic (Costar f) g s t a b -> (f a -> g b) -> f s -> g t
- Control.Lens.Lens: (%%=) :: MonadState s m => Over p ((,) r) s s a b -> p a (r, b) -> m r
+ Control.Lens.Lens: (%%=) :: forall {k} s m p r (a :: k) b. MonadState s m => Over p ((,) r) s s a b -> p a (r, b) -> m r
- Control.Lens.Lens: (%%@~) :: Over (Indexed i) f s t a b -> (i -> a -> f b) -> s -> f t
+ Control.Lens.Lens: (%%@~) :: forall {k1} i f s (t :: k1) a (b :: k1). Over (Indexed i) f s t a b -> (i -> a -> f b) -> s -> f t
- Control.Lens.Lens: (%%~) :: LensLike f s t a b -> (a -> f b) -> s -> f t
+ Control.Lens.Lens: (%%~) :: forall {k} f s (t :: k) a (b :: k). LensLike f s t a b -> (a -> f b) -> s -> f t
- Control.Lens.Lens: chosen :: IndexPreservingLens (Either a a) (Either b b) a b
+ Control.Lens.Lens: chosen :: forall a b p f. (Conjoined p, Functor f) => p a (f b) -> p (Either a a) (f (Either b b))
- Control.Lens.Lens: devoid :: Over p f Void Void a b
+ Control.Lens.Lens: devoid :: forall {k} p f (a :: k) b. Over p f Void Void a b
- Control.Lens.Lens: head1 :: Traversable1 t => Lens' (t a) a
+ Control.Lens.Lens: head1 :: forall (t :: Type -> Type) a. Traversable1 t => Lens' (t a) a
- Control.Lens.Lens: inside :: Corepresentable p => ALens s t a b -> Lens (p e s) (p e t) (p e a) (p e b)
+ Control.Lens.Lens: inside :: forall (p :: Type -> Type -> Type) s t a b e. Corepresentable p => ALens s t a b -> Lens (p e s) (p e t) (p e a) (p e b)
- Control.Lens.Lens: last1 :: Traversable1 t => Lens' (t a) a
+ Control.Lens.Lens: last1 :: forall (t :: Type -> Type) a. Traversable1 t => Lens' (t a) a
- Control.Lens.Lens: locus :: IndexedComonadStore p => Lens (p a c s) (p b c s) a b
+ Control.Lens.Lens: locus :: forall (p :: Type -> Type -> Type -> Type) a c s b. IndexedComonadStore p => Lens (p a c s) (p b c s) a b
- Control.Lens.Lens: type ALens s t a b = LensLike (Pretext (->) a b) s t a b
+ Control.Lens.Lens: type ALens s t a b = LensLike Pretext (->) a b s t a b
- Control.Lens.Lens: type AnIndexedLens i s t a b = Optical (Indexed i) (->) (Pretext (Indexed i) a b) s t a b
+ Control.Lens.Lens: type AnIndexedLens i s t a b = Optical Indexed i (->) Pretext Indexed i a b s t a b
- Control.Lens.Lens: type IndexedLens i s t a b = forall f p. (Indexable i p, Functor f) => p a (f b) -> s -> f t
+ Control.Lens.Lens: type IndexedLens i s t a b = forall (f :: Type -> Type) (p :: Type -> Type -> Type). (Indexable i p, Functor f) => p a f b -> s -> f t
- Control.Lens.Lens: united :: Lens' a ()
+ Control.Lens.Lens: united :: forall a f. Functor f => (() -> f ()) -> a -> f a
- Control.Lens.Lens: withLens :: forall s t a b rep (r :: TYPE rep). ALens s t a b -> ((s -> a) -> (s -> b -> t) -> r) -> r
+ Control.Lens.Lens: withLens :: ALens s t a b -> ((s -> a) -> (s -> b -> t) -> r) -> r
- Control.Lens.Level: ilevels :: Applicative f => Traversing (Indexed i) f s t a b -> IndexedLensLike Int f s t (Level i a) (Level j b)
+ Control.Lens.Level: ilevels :: forall (f :: Type -> Type) i s t a b j. Applicative f => Traversing (Indexed i) f s t a b -> IndexedLensLike Int f s t (Level i a) (Level j b)
- Control.Lens.Level: levels :: Applicative f => Traversing (->) f s t a b -> IndexedLensLike Int f s t (Level () a) (Level () b)
+ Control.Lens.Level: levels :: forall (f :: Type -> Type) s t a b. Applicative f => Traversing (->) f s t a b -> IndexedLensLike Int f s t (Level () a) (Level () b)
- Control.Lens.Operators: (%%=) :: MonadState s m => Over p ((,) r) s s a b -> p a (r, b) -> m r
+ Control.Lens.Operators: (%%=) :: forall {k} s m p r (a :: k) b. MonadState s m => Over p ((,) r) s s a b -> p a (r, b) -> m r
- Control.Lens.Operators: (%%@~) :: Over (Indexed i) f s t a b -> (i -> a -> f b) -> s -> f t
+ Control.Lens.Operators: (%%@~) :: forall {k1} i f s (t :: k1) a (b :: k1). Over (Indexed i) f s t a b -> (i -> a -> f b) -> s -> f t
- Control.Lens.Operators: (%%~) :: LensLike f s t a b -> (a -> f b) -> s -> f t
+ Control.Lens.Operators: (%%~) :: forall {k} f s (t :: k) a (b :: k). LensLike f s t a b -> (a -> f b) -> s -> f t
- Control.Lens.Operators: (...) :: (Applicative f, Plated c) => LensLike f s t c c -> Over p f c c a b -> Over p f s t a b
+ Control.Lens.Operators: (...) :: forall {k} f c s t p (a :: k) b. (Applicative f, Plated c) => LensLike f s t c c -> Over p f c c a b -> Over p f s t a b
- Control.Lens.Plated: (...) :: (Applicative f, Plated c) => LensLike f s t c c -> Over p f c c a b -> Over p f s t a b
+ Control.Lens.Plated: (...) :: forall {k} f c s t p (a :: k) b. (Applicative f, Plated c) => LensLike f s t c c -> Over p f c c a b -> Over p f s t a b
- Control.Lens.Plated: class GPlated a g
+ Control.Lens.Plated: class GPlated a (g :: k -> Type)
- Control.Lens.Plated: class GPlated1 f g
+ Control.Lens.Plated: class GPlated1 (f :: k -> Type) (g :: k -> Type)
- Control.Lens.Plated: gplate1 :: (Generic1 f, GPlated1 f (Rep1 f)) => Traversal' (f a) (f a)
+ Control.Lens.Plated: gplate1 :: forall {k} (f :: k -> Type) (a :: k). (Generic1 f, GPlated1 f (Rep1 f)) => Traversal' (f a) (f a)
- Control.Lens.Plated: plate :: (Plated a, Data a) => Traversal' a a
+ Control.Lens.Plated: plate :: Plated a => Traversal' a a
- Control.Lens.Prism: _Just :: Prism (Maybe a) (Maybe b) a b
+ Control.Lens.Prism: _Just :: forall a b p f. (Choice p, Applicative f) => p a (f b) -> p (Maybe a) (f (Maybe b))
- Control.Lens.Prism: _Left :: Prism (Either a c) (Either b c) a b
+ Control.Lens.Prism: _Left :: forall a c b p f. (Choice p, Applicative f) => p a (f b) -> p (Either a c) (f (Either b c))
- Control.Lens.Prism: _Nothing :: Prism' (Maybe a) ()
+ Control.Lens.Prism: _Nothing :: forall a p f. (Choice p, Applicative f) => p () (f ()) -> p (Maybe a) (f (Maybe a))
- Control.Lens.Prism: _Right :: Prism (Either c a) (Either c b) a b
+ Control.Lens.Prism: _Right :: forall c a b p f. (Choice p, Applicative f) => p a (f b) -> p (Either c a) (f (Either c b))
- Control.Lens.Prism: _Void :: Prism s s a Void
+ Control.Lens.Prism: _Void :: forall s a p f. (Choice p, Applicative f) => p a (f Void) -> p s (f s)
- Control.Lens.Prism: below :: Traversable f => APrism' s a -> Prism' (f s) (f a)
+ Control.Lens.Prism: below :: forall (f :: Type -> Type) s a. Traversable f => APrism' s a -> Prism' (f s) (f a)
- Control.Lens.Prism: outside :: Representable p => APrism s t a b -> Lens (p t r) (p s r) (p b r) (p a r)
+ Control.Lens.Prism: outside :: forall (p :: Type -> Type -> Type) s t a b r. Representable p => APrism s t a b -> Lens (p t r) (p s r) (p b r) (p a r)
- Control.Lens.Prism: type APrism s t a b = Market a b a (Identity b) -> Market a b s (Identity t)
+ Control.Lens.Prism: type APrism s t a b = Market a b a Identity b -> Market a b s Identity t
- Control.Lens.Prism: type Prism s t a b = forall p f. (Choice p, Applicative f) => p a (f b) -> p s (f t)
+ Control.Lens.Prism: type Prism s t a b = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Choice p, Applicative f) => p a f b -> p s f t
- Control.Lens.Profunctor: type OpticP p s t a b = p a b -> p s t
+ Control.Lens.Profunctor: type OpticP (p :: Type -> Type -> Type) s t a b = p a b -> p s t
- Control.Lens.Review: class (Profunctor p, Bifunctor p) => Reviewable p
+ Control.Lens.Review: class (Profunctor p, Bifunctor p) => Reviewable (p :: Type -> Type -> Type)
- Control.Lens.Review: reviewing :: (Bifunctor p, Functor f) => Optic Tagged Identity s t a b -> Optic' p f t b
+ Control.Lens.Review: reviewing :: (Bifunctor p, Functor f) => Optic (Tagged :: Type -> Type -> Type) Identity s t a b -> Optic' p f t b
- Control.Lens.Review: type AReview t b = Optic' Tagged Identity t b
+ Control.Lens.Review: type AReview t b = Optic' Tagged :: Type -> Type -> Type Identity t b
- Control.Lens.Review: type Review t b = forall p f. (Choice p, Bifunctor p, Settable f) => Optic' p f t b
+ Control.Lens.Review: type Review t b = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Choice p, Bifunctor p, Settable f) => Optic' p f t b
- Control.Lens.Setter: argument :: Profunctor p => Setter (p b r) (p a r) a b
+ Control.Lens.Setter: argument :: forall (p :: Type -> Type -> Type) b r a. Profunctor p => Setter (p b r) (p a r) a b
- Control.Lens.Setter: class (Applicative f, Distributive f, Traversable f) => Settable f
+ Control.Lens.Setter: class (Applicative f, Distributive f, Traversable f) => Settable (f :: Type -> Type)
- Control.Lens.Setter: contramapped :: Contravariant f => Setter (f b) (f a) a b
+ Control.Lens.Setter: contramapped :: forall (f :: Type -> Type) b a. Contravariant f => Setter (f b) (f a) a b
- Control.Lens.Setter: lifted :: Monad m => Setter (m a) (m b) a b
+ Control.Lens.Setter: lifted :: forall (m :: Type -> Type) a b. Monad m => Setter (m a) (m b) a b
- Control.Lens.Setter: mapped :: Functor f => Setter (f a) (f b) a b
+ Control.Lens.Setter: mapped :: forall (f :: Type -> Type) a b. Functor f => Setter (f a) (f b) a b
- Control.Lens.Setter: newtype () => Identity a
+ Control.Lens.Setter: newtype Identity a
- Control.Lens.Setter: type ASetter s t a b = (a -> Identity b) -> s -> Identity t
+ Control.Lens.Setter: type ASetter s t a b = a -> Identity b -> s -> Identity t
- Control.Lens.Setter: type AnIndexedSetter i s t a b = Indexed i a (Identity b) -> s -> Identity t
+ Control.Lens.Setter: type AnIndexedSetter i s t a b = Indexed i a Identity b -> s -> Identity t
- Control.Lens.Setter: type Setting p s t a b = p a (Identity b) -> s -> Identity t
+ Control.Lens.Setter: type Setting (p :: Type -> Type -> Type) s t a b = p a Identity b -> s -> Identity t
- Control.Lens.Setter: type Setting' p s a = Setting p s s a a
+ Control.Lens.Setter: type Setting' (p :: Type -> Type -> Type) s a = Setting p s s a a
- Control.Lens.Setter: type IndexedSetter i s t a b = forall f p. (Indexable i p, Settable f) => p a (f b) -> s -> f t
+ Control.Lens.Setter: type IndexedSetter i s t a b = forall (f :: Type -> Type) (p :: Type -> Type -> Type). (Indexable i p, Settable f) => p a f b -> s -> f t
- Control.Lens.TH: type ClassyNamer = -- | Name of the data type that lenses are being generated for. Name -> -- | Names of the class and the main method it generates, respectively. Maybe (Name, Name)
+ Control.Lens.TH: type ClassyNamer = Name -> Maybe (Name, Name)
- Control.Lens.TH: type FieldNamer = -- | Name of the data type that lenses are being generated for. Name -> -- | Names of all fields (including the field being named) in the data type. [Name] -> -- | Name of the field being named. Name -> -- | Name(s) of the lens functions. If empty, no lens is created for that field. [DefName]
+ Control.Lens.TH: type FieldNamer = Name -> [Name] -> Name -> [DefName]
- Control.Lens.Traversal: Bazaar :: (forall f. Applicative f => p a (f b) -> f t) -> Bazaar p a b t
+ Control.Lens.Traversal: Bazaar :: (forall (f :: Type -> Type). Applicative f => p a (f b) -> f t) -> Bazaar (p :: Type -> Type -> Type) a b t
- Control.Lens.Traversal: Bazaar1 :: (forall f. Apply f => p a (f b) -> f t) -> Bazaar1 p a b t
+ Control.Lens.Traversal: Bazaar1 :: (forall (f :: Type -> Type). Apply f => p a (f b) -> f t) -> Bazaar1 (p :: Type -> Type -> Type) a b t
- Control.Lens.Traversal: [runBazaar1] :: Bazaar1 p a b t -> forall f. Apply f => p a (f b) -> f t
+ Control.Lens.Traversal: [runBazaar1] :: Bazaar1 (p :: Type -> Type -> Type) a b t -> forall (f :: Type -> Type). Apply f => p a (f b) -> f t
- Control.Lens.Traversal: [runBazaar] :: Bazaar p a b t -> forall f. Applicative f => p a (f b) -> f t
+ Control.Lens.Traversal: [runBazaar] :: Bazaar (p :: Type -> Type -> Type) a b t -> forall (f :: Type -> Type). Applicative f => p a (f b) -> f t
- Control.Lens.Traversal: both :: Bitraversable r => Traversal (r a a) (r b b) a b
+ Control.Lens.Traversal: both :: forall (r :: Type -> Type -> Type) a b. Bitraversable r => Traversal (r a a) (r b b) a b
- Control.Lens.Traversal: both1 :: Bitraversable1 r => Traversal1 (r a a) (r b b) a b
+ Control.Lens.Traversal: both1 :: forall (r :: Type -> Type -> Type) a b. Bitraversable1 r => Traversal1 (r a a) (r b b) a b
- Control.Lens.Traversal: class Ord k => TraverseMax k m | m -> k
+ Control.Lens.Traversal: class Ord k => TraverseMax k (m :: Type -> Type) | m -> k
- Control.Lens.Traversal: class Ord k => TraverseMin k m | m -> k
+ Control.Lens.Traversal: class Ord k => TraverseMin k (m :: Type -> Type) | m -> k
- Control.Lens.Traversal: element :: Traversable t => Int -> IndexedTraversal' Int (t a) a
+ Control.Lens.Traversal: element :: forall (t :: Type -> Type) a. Traversable t => Int -> IndexedTraversal' Int (t a) a
- Control.Lens.Traversal: elementOf :: Applicative f => LensLike (Indexing f) s t a a -> Int -> IndexedLensLike Int f s t a a
+ Control.Lens.Traversal: elementOf :: forall (f :: Type -> Type) s t a. Applicative f => LensLike (Indexing f) s t a a -> Int -> IndexedLensLike Int f s t a a
- Control.Lens.Traversal: elements :: Traversable t => (Int -> Bool) -> IndexedTraversal' Int (t a) a
+ Control.Lens.Traversal: elements :: forall (t :: Type -> Type) a. Traversable t => (Int -> Bool) -> IndexedTraversal' Int (t a) a
- Control.Lens.Traversal: elementsOf :: Applicative f => LensLike (Indexing f) s t a a -> (Int -> Bool) -> IndexedLensLike Int f s t a a
+ Control.Lens.Traversal: elementsOf :: forall (f :: Type -> Type) s t a. Applicative f => LensLike (Indexing f) s t a a -> (Int -> Bool) -> IndexedLensLike Int f s t a a
- Control.Lens.Traversal: iloci :: IndexedTraversal i (Bazaar (Indexed i) a c s) (Bazaar (Indexed i) b c s) a b
+ Control.Lens.Traversal: iloci :: forall i a c s b p f. (Indexable i p, Applicative f) => p a (f b) -> Bazaar (Indexed i) a c s -> f (Bazaar (Indexed i) b c s)
- Control.Lens.Traversal: ipartsOf :: forall i p f s t a. (Indexable [i] p, Functor f) => Traversing (Indexed i) f s t a a -> Over p f s t [a] [a]
+ Control.Lens.Traversal: ipartsOf :: (Indexable [i] p, Functor f) => Traversing (Indexed i) f s t a a -> Over p f s t [a] [a]
- Control.Lens.Traversal: iunsafePartsOf :: forall i p f s t a b. (Indexable [i] p, Functor f) => Traversing (Indexed i) f s t a b -> Over p f s t [a] [b]
+ Control.Lens.Traversal: iunsafePartsOf :: (Indexable [i] p, Functor f) => Traversing (Indexed i) f s t a b -> Over p f s t [a] [b]
- Control.Lens.Traversal: loci :: Traversal (Bazaar (->) a c s) (Bazaar (->) b c s) a b
+ Control.Lens.Traversal: loci :: forall a c s b f. Applicative f => (a -> f b) -> Bazaar (->) a c s -> f (Bazaar (->) b c s)
- Control.Lens.Traversal: newtype Bazaar p a b t
+ Control.Lens.Traversal: newtype Bazaar (p :: Type -> Type -> Type) a b t
- Control.Lens.Traversal: newtype Bazaar1 p a b t
+ Control.Lens.Traversal: newtype Bazaar1 (p :: Type -> Type -> Type) a b t
- Control.Lens.Traversal: sequenceByOf :: Traversal s t (f b) b -> (forall x. x -> f x) -> (forall x y. f (x -> y) -> f x -> f y) -> s -> f t
+ Control.Lens.Traversal: sequenceByOf :: Traversal s t (f b) b -> (forall x. () => x -> f x) -> (forall x y. () => f (x -> y) -> f x -> f y) -> s -> f t
- Control.Lens.Traversal: traverseByOf :: Traversal s t a b -> (forall x. x -> f x) -> (forall x y. f (x -> y) -> f x -> f y) -> (a -> f b) -> s -> f t
+ Control.Lens.Traversal: traverseByOf :: Traversal s t a b -> (forall x. () => x -> f x) -> (forall x y. () => f (x -> y) -> f x -> f y) -> (a -> f b) -> s -> f t
- Control.Lens.Traversal: traversed :: Traversable f => IndexedTraversal Int (f a) (f b) a b
+ Control.Lens.Traversal: traversed :: forall (f :: Type -> Type) a b. Traversable f => IndexedTraversal Int (f a) (f b) a b
- Control.Lens.Traversal: traversed1 :: Traversable1 f => IndexedTraversal1 Int (f a) (f b) a b
+ Control.Lens.Traversal: traversed1 :: forall (f :: Type -> Type) a b. Traversable1 f => IndexedTraversal1 Int (f a) (f b) a b
- Control.Lens.Traversal: traversed64 :: Traversable f => IndexedTraversal Int64 (f a) (f b) a b
+ Control.Lens.Traversal: traversed64 :: forall (f :: Type -> Type) a b. Traversable f => IndexedTraversal Int64 (f a) (f b) a b
- Control.Lens.Traversal: type ATraversal s t a b = LensLike (Bazaar (->) a b) s t a b
+ Control.Lens.Traversal: type ATraversal s t a b = LensLike Bazaar (->) a b s t a b
- Control.Lens.Traversal: type ATraversal1 s t a b = LensLike (Bazaar1 (->) a b) s t a b
+ Control.Lens.Traversal: type ATraversal1 s t a b = LensLike Bazaar1 (->) a b s t a b
- Control.Lens.Traversal: type AnIndexedTraversal i s t a b = Over (Indexed i) (Bazaar (Indexed i) a b) s t a b
+ Control.Lens.Traversal: type AnIndexedTraversal i s t a b = Over Indexed i Bazaar Indexed i a b s t a b
- Control.Lens.Traversal: type AnIndexedTraversal1 i s t a b = Over (Indexed i) (Bazaar1 (Indexed i) a b) s t a b
+ Control.Lens.Traversal: type AnIndexedTraversal1 i s t a b = Over Indexed i Bazaar1 Indexed i a b s t a b
- Control.Lens.Traversal: type Bazaar' p a = Bazaar p a a
+ Control.Lens.Traversal: type Bazaar' (p :: Type -> Type -> Type) a = Bazaar p a a
- Control.Lens.Traversal: type Bazaar1' p a = Bazaar1 p a a
+ Control.Lens.Traversal: type Bazaar1' (p :: Type -> Type -> Type) a = Bazaar1 p a a
- Control.Lens.Traversal: type Traversing p f s t a b = Over p (BazaarT p f a b) s t a b
+ Control.Lens.Traversal: type Traversing (p :: Type -> Type -> Type) (f :: Type -> Type) s t a b = Over p BazaarT p f a b s t a b
- Control.Lens.Traversal: type Traversing' p f s a = Traversing p f s s a a
+ Control.Lens.Traversal: type Traversing' (p :: Type -> Type -> Type) (f :: Type -> Type) s a = Traversing p f s s a a
- Control.Lens.Traversal: type Traversing1 p f s t a b = Over p (BazaarT1 p f a b) s t a b
+ Control.Lens.Traversal: type Traversing1 (p :: Type -> Type -> Type) (f :: Type -> Type) s t a b = Over p BazaarT1 p f a b s t a b
- Control.Lens.Traversal: type Traversing1' p f s a = Traversing1 p f s s a a
+ Control.Lens.Traversal: type Traversing1' (p :: Type -> Type -> Type) (f :: Type -> Type) s a = Traversing1 p f s s a a
- Control.Lens.Traversal: type IndexedTraversal1 i s t a b = forall p f. (Indexable i p, Apply f) => p a (f b) -> s -> f t
+ Control.Lens.Traversal: type IndexedTraversal1 i s t a b = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Indexable i p, Apply f) => p a f b -> s -> f t
- Control.Lens.Tuple: _1 :: (Field1 s t a b, Generic s, Generic t, GIxed N0 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Tuple: _1 :: Field1 s t a b => Lens s t a b
- Control.Lens.Tuple: _10 :: (Field10 s t a b, Generic s, Generic t, GIxed N9 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Tuple: _10 :: Field10 s t a b => Lens s t a b
- Control.Lens.Tuple: _11 :: (Field11 s t a b, Generic s, Generic t, GIxed N10 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Tuple: _11 :: Field11 s t a b => Lens s t a b
- Control.Lens.Tuple: _12 :: (Field12 s t a b, Generic s, Generic t, GIxed N11 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Tuple: _12 :: Field12 s t a b => Lens s t a b
- Control.Lens.Tuple: _13 :: (Field13 s t a b, Generic s, Generic t, GIxed N12 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Tuple: _13 :: Field13 s t a b => Lens s t a b
- Control.Lens.Tuple: _14 :: (Field14 s t a b, Generic s, Generic t, GIxed N13 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Tuple: _14 :: Field14 s t a b => Lens s t a b
- Control.Lens.Tuple: _15 :: (Field15 s t a b, Generic s, Generic t, GIxed N14 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Tuple: _15 :: Field15 s t a b => Lens s t a b
- Control.Lens.Tuple: _16 :: (Field16 s t a b, Generic s, Generic t, GIxed N15 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Tuple: _16 :: Field16 s t a b => Lens s t a b
- Control.Lens.Tuple: _17 :: (Field17 s t a b, Generic s, Generic t, GIxed N16 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Tuple: _17 :: Field17 s t a b => Lens s t a b
- Control.Lens.Tuple: _18 :: (Field18 s t a b, Generic s, Generic t, GIxed N17 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Tuple: _18 :: Field18 s t a b => Lens s t a b
- Control.Lens.Tuple: _19 :: (Field19 s t a b, Generic s, Generic t, GIxed N18 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Tuple: _19 :: Field19 s t a b => Lens s t a b
- Control.Lens.Tuple: _2 :: (Field2 s t a b, Generic s, Generic t, GIxed N1 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Tuple: _2 :: Field2 s t a b => Lens s t a b
- Control.Lens.Tuple: _3 :: (Field3 s t a b, Generic s, Generic t, GIxed N2 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Tuple: _3 :: Field3 s t a b => Lens s t a b
- Control.Lens.Tuple: _4 :: (Field4 s t a b, Generic s, Generic t, GIxed N3 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Tuple: _4 :: Field4 s t a b => Lens s t a b
- Control.Lens.Tuple: _5 :: (Field5 s t a b, Generic s, Generic t, GIxed N4 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Tuple: _5 :: Field5 s t a b => Lens s t a b
- Control.Lens.Tuple: _6 :: (Field6 s t a b, Generic s, Generic t, GIxed N5 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Tuple: _6 :: Field6 s t a b => Lens s t a b
- Control.Lens.Tuple: _7 :: (Field7 s t a b, Generic s, Generic t, GIxed N6 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Tuple: _7 :: Field7 s t a b => Lens s t a b
- Control.Lens.Tuple: _8 :: (Field8 s t a b, Generic s, Generic t, GIxed N7 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Tuple: _8 :: Field8 s t a b => Lens s t a b
- Control.Lens.Tuple: _9 :: (Field9 s t a b, Generic s, Generic t, GIxed N8 (Rep s) (Rep t) a b) => Lens s t a b
+ Control.Lens.Tuple: _9 :: Field9 s t a b => Lens s t a b
- Control.Lens.Type: type AReview t b = Optic' Tagged Identity t b
+ Control.Lens.Type: type AReview t b = Optic' Tagged :: Type -> Type -> Type Identity t b
- Control.Lens.Type: type As a = Equality' a a
+ Control.Lens.Type: type As (a :: k2) = Equality' a a
- Control.Lens.Type: type Equality' s a = Equality s s a a
+ Control.Lens.Type: type Equality' (s :: k2) (a :: k2) = Equality s s a a
- Control.Lens.Type: type IndexedLensLike' i f s a = IndexedLensLike i f s s a a
+ Control.Lens.Type: type IndexedLensLike' i (f :: Type -> Type) s a = IndexedLensLike i f s s a a
- Control.Lens.Type: type LensLike f s t a b = (a -> f b) -> s -> f t
+ Control.Lens.Type: type LensLike (f :: k -> Type) s (t :: k) a (b :: k) = a -> f b -> s -> f t
- Control.Lens.Type: type LensLike' f s a = LensLike f s s a a
+ Control.Lens.Type: type LensLike' (f :: Type -> Type) s a = LensLike f s s a a
- Control.Lens.Type: type Optic p f s t a b = p a (f b) -> p s (f t)
+ Control.Lens.Type: type Optic (p :: k -> k1 -> Type) (f :: k2 -> k1) (s :: k) (t :: k2) (a :: k) (b :: k2) = p a f b -> p s f t
- Control.Lens.Type: type Optic' p f s a = Optic p f s s a a
+ Control.Lens.Type: type Optic' (p :: k -> k1 -> Type) (f :: k -> k1) (s :: k) (a :: k) = Optic p f s s a a
- Control.Lens.Type: type Optical p q f s t a b = p a (f b) -> q s (f t)
+ Control.Lens.Type: type Optical (p :: k -> k1 -> Type) (q :: k2 -> k1 -> Type) (f :: k3 -> k1) (s :: k2) (t :: k3) (a :: k) (b :: k3) = p a f b -> q s f t
- Control.Lens.Type: type Optical' p q f s a = Optical p q f s s a a
+ Control.Lens.Type: type Optical' (p :: k -> k1 -> Type) (q :: k -> k1 -> Type) (f :: k -> k1) (s :: k) (a :: k) = Optical p q f s s a a
- Control.Lens.Type: type Over p f s t a b = p a (f b) -> s -> f t
+ Control.Lens.Type: type Over (p :: k -> Type -> Type) (f :: k1 -> Type) s (t :: k1) (a :: k) (b :: k1) = p a f b -> s -> f t
- Control.Lens.Type: type Over' p f s a = Over p f s s a a
+ Control.Lens.Type: type Over' (p :: Type -> Type -> Type) (f :: Type -> Type) s a = Over p f s s a a
- Control.Lens.Type: type Simple f s a = f s s a a
+ Control.Lens.Type: type Simple (f :: k1 -> k1 -> k2 -> k2 -> k) (s :: k1) (a :: k2) = f s s a a
- Control.Lens.Type: type IndexedLensLike i f s t a b = forall p. Indexable i p => p a (f b) -> s -> f t
+ Control.Lens.Type: type IndexedLensLike i (f :: k -> Type) s (t :: k) a (b :: k) = forall (p :: Type -> Type -> Type). Indexable i p => p a f b -> s -> f t
- Control.Lens.Wrapped: _GWrapped' :: (Generic s, D1 d (C1 c (S1 s' (Rec0 a))) ~ Rep s, Unwrapped s ~ GUnwrapped (Rep s)) => Iso' s (Unwrapped s)
+ Control.Lens.Wrapped: _GWrapped' :: forall s (d :: Meta) (c :: Meta) (s' :: Meta) a. (Generic s, D1 d (C1 c (S1 s' (Rec0 a))) ~ Rep s, Unwrapped s ~ GUnwrapped (Rep s)) => Iso' s (Unwrapped s)
- Control.Lens.Wrapped: _Wrapped' :: (Wrapped s, Generic s, D1 d (C1 c (S1 s' (Rec0 a))) ~ Rep s, Unwrapped s ~ GUnwrapped (Rep s)) => Iso' s (Unwrapped s)
+ Control.Lens.Wrapped: _Wrapped' :: Wrapped s => Iso' s (Unwrapped s)
- Control.Lens.Wrapped: class Wrapped s => Rewrapped (s :: Type) (t :: Type)
+ Control.Lens.Wrapped: class Wrapped s => Rewrapped s t
- Control.Lens.Wrapped: type Unwrapped s = GUnwrapped (Rep s);
+ Control.Lens.Wrapped: type Unwrapped s = GUnwrapped Rep s;
- Control.Lens.Zoom: class (Magnified m ~ Magnified n, MonadReader b m, MonadReader a n) => Magnify m n b a | m -> b, n -> a, m a -> n, n b -> m
+ Control.Lens.Zoom: class (Magnified m ~ Magnified n, MonadReader b m, MonadReader a n) => Magnify (m :: Type -> Type) (n :: Type -> Type) b a | m -> b, n -> a, m a -> n, n b -> m
- Control.Lens.Zoom: class (MonadState s m, MonadState t n) => Zoom m n s t | m -> s, n -> t, m t -> n, n s -> m
+ Control.Lens.Zoom: class (MonadState s m, MonadState t n) => Zoom (m :: Type -> Type) (n :: Type -> Type) s t | m -> s, n -> t, m t -> n, n s -> m
- Control.Monad.Error.Lens: Handler :: (e -> Maybe a) -> (a -> m r) -> Handler e m r
+ Control.Monad.Error.Lens: Handler :: (e -> Maybe a) -> (a -> m r) -> Handler e (m :: Type -> Type) r
- Control.Monad.Error.Lens: data Handler e m r
+ Control.Monad.Error.Lens: data Handler e (m :: Type -> Type) r
- Data.Array.Lens: ixmapped :: (IArray a e, Ix i, Ix j) => (i, i) -> IndexPreservingSetter (a j e) (a i e) i j
+ Data.Array.Lens: ixmapped :: forall (a :: Type -> Type -> Type) e i j. (IArray a e, Ix i, Ix j) => (i, i) -> IndexPreservingSetter (a j e) (a i e) i j
- Data.Complex.Lens: _imagPart :: Lens' (Complex a) a
+ Data.Complex.Lens: _imagPart :: forall a f. Functor f => (a -> f a) -> Complex a -> f (Complex a)
- Data.Complex.Lens: _realPart :: Lens' (Complex a) a
+ Data.Complex.Lens: _realPart :: forall a f. Functor f => (a -> f a) -> Complex a -> f (Complex a)
- Data.Data.Lens: biplate :: forall s a. (Data s, Typeable a) => Traversal' s a
+ Data.Data.Lens: biplate :: (Data s, Typeable a) => Traversal' s a
- Data.Data.Lens: onceUpon :: forall s a. (Data s, Typeable a) => (s -> a) -> IndexedTraversal' Int s a
+ Data.Data.Lens: onceUpon :: (Data s, Typeable a) => (s -> a) -> IndexedTraversal' Int s a
- Data.Data.Lens: onceUpon' :: forall s a. (Data s, Typeable a) => (s -> a) -> IndexedLens' Int s a
+ Data.Data.Lens: onceUpon' :: (Data s, Typeable a) => (s -> a) -> IndexedLens' Int s a
- Data.Data.Lens: template :: forall s a. (Data s, Typeable a) => Traversal' s a
+ Data.Data.Lens: template :: (Data s, Typeable a) => Traversal' s a
- Data.Data.Lens: upon :: forall p f s a. (Indexable [Int] p, Applicative f, Data s, Data a) => (s -> a) -> p a (f a) -> s -> f s
+ Data.Data.Lens: upon :: (Indexable [Int] p, Applicative f, Data s, Data a) => (s -> a) -> p a (f a) -> s -> f s
- Data.Data.Lens: upon' :: forall s a. (Data s, Data a) => (s -> a) -> IndexedLens' [Int] s a
+ Data.Data.Lens: upon' :: (Data s, Data a) => (s -> a) -> IndexedLens' [Int] s a
- Data.HashSet.Lens: hashMap :: Iso' (HashSet a) (HashMap a ())
+ Data.HashSet.Lens: hashMap :: forall a p f. (Profunctor p, Functor f) => p (HashMap a ()) (f (HashMap a ())) -> p (HashSet a) (f (HashSet a))
- Data.Sequence.Lens: viewL :: Iso (Seq a) (Seq b) (ViewL a) (ViewL b)
+ Data.Sequence.Lens: viewL :: forall a b p f. (Profunctor p, Functor f) => p (ViewL a) (f (ViewL b)) -> p (Seq a) (f (Seq b))
- Data.Sequence.Lens: viewR :: Iso (Seq a) (Seq b) (ViewR a) (ViewR b)
+ Data.Sequence.Lens: viewR :: forall a b p f. (Profunctor p, Functor f) => p (ViewR a) (f (ViewR b)) -> p (Seq a) (f (Seq b))
- Data.Tree.Lens: branches :: Lens' (Tree a) [Tree a]
+ Data.Tree.Lens: branches :: forall a f. Functor f => ([Tree a] -> f [Tree a]) -> Tree a -> f (Tree a)
- Data.Tree.Lens: root :: Lens' (Tree a) a
+ Data.Tree.Lens: root :: forall a f. Functor f => (a -> f a) -> Tree a -> f (Tree a)
- Data.Typeable.Lens: _gcast :: (Typeable s, Typeable a) => Traversal' (c s) (c a)
+ Data.Typeable.Lens: _gcast :: forall s a (c :: Type -> Type). (Typeable s, Typeable a) => Traversal' (c s) (c a)
- Data.Vector.Generic.Lens: asStream :: (Vector v a, Vector v b) => Iso (v a) (v b) (Bundle v a) (Bundle v b)
+ Data.Vector.Generic.Lens: asStream :: forall (v :: Type -> Type) a b. (Vector v a, Vector v b) => Iso (v a) (v b) (Bundle v a) (Bundle v b)
- Data.Vector.Generic.Lens: asStreamR :: (Vector v a, Vector v b) => Iso (v a) (v b) (Bundle v a) (Bundle v b)
+ Data.Vector.Generic.Lens: asStreamR :: forall (v :: Type -> Type) a b. (Vector v a, Vector v b) => Iso (v a) (v b) (Bundle v a) (Bundle v b)
- Data.Vector.Generic.Lens: cloned :: Vector v a => Iso' (v a) (New v a)
+ Data.Vector.Generic.Lens: cloned :: forall (v :: Type -> Type) a. Vector v a => Iso' (v a) (New v a)
- Data.Vector.Generic.Lens: converted :: (Vector v a, Vector w a, Vector v b, Vector w b) => Iso (v a) (v b) (w a) (w b)
+ Data.Vector.Generic.Lens: converted :: forall (v :: Type -> Type) a (w :: Type -> Type) b. (Vector v a, Vector w a, Vector v b, Vector w b) => Iso (v a) (v b) (w a) (w b)
- Data.Vector.Generic.Lens: forced :: Vector v a => Iso' (v a) (v a)
+ Data.Vector.Generic.Lens: forced :: forall (v :: Type -> Type) a. Vector v a => Iso' (v a) (v a)
- Data.Vector.Generic.Lens: ordinals :: Vector v a => [Int] -> IndexedTraversal' Int (v a) a
+ Data.Vector.Generic.Lens: ordinals :: forall (v :: Type -> Type) a. Vector v a => [Int] -> IndexedTraversal' Int (v a) a
- Data.Vector.Generic.Lens: sliced :: Vector v a => Int -> Int -> Lens' (v a) (v a)
+ Data.Vector.Generic.Lens: sliced :: forall (v :: Type -> Type) a. Vector v a => Int -> Int -> Lens' (v a) (v a)
- Data.Vector.Generic.Lens: vector :: (Vector v a, Vector v b) => Iso [a] [b] (v a) (v b)
+ Data.Vector.Generic.Lens: vector :: forall (v :: Type -> Type) a b. (Vector v a, Vector v b) => Iso [a] [b] (v a) (v b)
- Data.Vector.Generic.Lens: vectorIx :: Vector v a => Int -> Traversal' (v a) a
+ Data.Vector.Generic.Lens: vectorIx :: forall (v :: Type -> Type) a. Vector v a => Int -> Traversal' (v a) a
- Data.Vector.Generic.Lens: vectorTraverse :: (Vector v a, Vector w b) => IndexedTraversal Int (v a) (w b) a b
+ Data.Vector.Generic.Lens: vectorTraverse :: forall (v :: Type -> Type) a (w :: Type -> Type) b. (Vector v a, Vector w b) => IndexedTraversal Int (v a) (w b) a b
- Data.Vector.Lens: forced :: Iso (Vector a) (Vector b) (Vector a) (Vector b)
+ Data.Vector.Lens: forced :: forall a b p f. (Profunctor p, Functor f) => p (Vector a) (f (Vector b)) -> p (Vector a) (f (Vector b))
- Data.Vector.Lens: vector :: Iso [a] [b] (Vector a) (Vector b)
+ Data.Vector.Lens: vector :: forall a b p f. (Profunctor p, Functor f) => p (Vector a) (f (Vector b)) -> p [a] (f [b])
- GHC.Generics.Lens: _K1 :: Iso (K1 i c p) (K1 j d q) c d
+ GHC.Generics.Lens: _K1 :: forall {k1} {k2} i c (p1 :: k1) j d (q :: k2) p2 f. (Profunctor p2, Functor f) => p2 c (f d) -> p2 (K1 i c p1) (f (K1 j d q))
- GHC.Generics.Lens: _L1 :: Prism' ((f :+: g) a) (f a)
+ GHC.Generics.Lens: _L1 :: forall {k} f1 (g :: k -> Type) (a :: k) p f2. (Choice p, Applicative f2) => p (f1 a) (f2 (f1 a)) -> p ((f1 :+: g) a) (f2 ((f1 :+: g) a))
- GHC.Generics.Lens: _M1 :: Iso (M1 i c f p) (M1 j d g q) (f p) (g q)
+ GHC.Generics.Lens: _M1 :: forall {k1} {k2} i (c :: Meta) f1 (p1 :: k1) j (d :: Meta) g (q :: k2) p2 f2. (Profunctor p2, Functor f2) => p2 (f1 p1) (f2 (g q)) -> p2 (M1 i c f1 p1) (f2 (M1 j d g q))
- GHC.Generics.Lens: _Par1 :: Iso (Par1 p) (Par1 q) p q
+ GHC.Generics.Lens: _Par1 :: forall p1 q p2 f. (Profunctor p2, Functor f) => p2 p1 (f q) -> p2 (Par1 p1) (f (Par1 q))
- GHC.Generics.Lens: _R1 :: Prism' ((f :+: g) a) (g a)
+ GHC.Generics.Lens: _R1 :: forall {k} (f1 :: k -> Type) g (a :: k) p f2. (Choice p, Applicative f2) => p (g a) (f2 (g a)) -> p ((f1 :+: g) a) (f2 ((f1 :+: g) a))
- GHC.Generics.Lens: _Rec1 :: Iso (Rec1 f p) (Rec1 g q) (f p) (g q)
+ GHC.Generics.Lens: _Rec1 :: forall {k1} {k2} f1 (p1 :: k1) g (q :: k2) p2 f2. (Profunctor p2, Functor f2) => p2 (f1 p1) (f2 (g q)) -> p2 (Rec1 f1 p1) (f2 (Rec1 g q))
- GHC.Generics.Lens: _U1 :: Iso (U1 p) (U1 q) () ()
+ GHC.Generics.Lens: _U1 :: forall {k1} {k2} (p1 :: k1) (q :: k2) p2 f. (Profunctor p2, Functor f) => p2 () (f ()) -> p2 (U1 p1) (f (U1 q))
- GHC.Generics.Lens: _UAddr :: Iso (UAddr p) (UAddr q) (Ptr c) (Ptr d)
+ GHC.Generics.Lens: _UAddr :: forall {k1} {k2} (p1 :: k1) (q :: k2) c d p2 f. (Profunctor p2, Functor f) => p2 (Ptr c) (f (Ptr d)) -> p2 (UAddr p1) (f (UAddr q))
- GHC.Generics.Lens: _UChar :: Iso (UChar p) (UChar q) Char Char
+ GHC.Generics.Lens: _UChar :: forall {k1} {k2} (p1 :: k1) (q :: k2) p2 f. (Profunctor p2, Functor f) => p2 Char (f Char) -> p2 (UChar p1) (f (UChar q))
- GHC.Generics.Lens: _UDouble :: Iso (UDouble p) (UDouble q) Double Double
+ GHC.Generics.Lens: _UDouble :: forall {k1} {k2} (p1 :: k1) (q :: k2) p2 f. (Profunctor p2, Functor f) => p2 Double (f Double) -> p2 (UDouble p1) (f (UDouble q))
- GHC.Generics.Lens: _UFloat :: Iso (UFloat p) (UFloat q) Float Float
+ GHC.Generics.Lens: _UFloat :: forall {k1} {k2} (p1 :: k1) (q :: k2) p2 f. (Profunctor p2, Functor f) => p2 Float (f Float) -> p2 (UFloat p1) (f (UFloat q))
- GHC.Generics.Lens: _UInt :: Iso (UInt p) (UInt q) Int Int
+ GHC.Generics.Lens: _UInt :: forall {k1} {k2} (p1 :: k1) (q :: k2) p2 f. (Profunctor p2, Functor f) => p2 Int (f Int) -> p2 (UInt p1) (f (UInt q))
- GHC.Generics.Lens: _UWord :: Iso (UWord p) (UWord q) Word Word
+ GHC.Generics.Lens: _UWord :: forall {k1} {k2} (p1 :: k1) (q :: k2) p2 f. (Profunctor p2, Functor f) => p2 Word (f Word) -> p2 (UWord p1) (f (UWord q))
- GHC.Generics.Lens: _V1 :: Over p f (V1 s) (V1 t) a b
+ GHC.Generics.Lens: _V1 :: forall {k1} {k2} {k3} p f (s :: k2) (t :: k3) (a :: k1) b. Over p f (V1 s) (V1 t) a b
- GHC.Generics.Lens: generic1 :: (Generic1 f, Generic1 g) => Iso (f a) (g b) (Rep1 f a) (Rep1 g b)
+ GHC.Generics.Lens: generic1 :: forall {k1} {k2} (f :: k1 -> Type) (g :: k2 -> Type) (a :: k1) (b :: k2). (Generic1 f, Generic1 g) => Iso (f a) (g b) (Rep1 f a) (Rep1 g b)
- Language.Haskell.TH.Lens: _KindedTV :: Prism' (TyVarBndr flag) (Name, flag, Kind)
+ Language.Haskell.TH.Lens: _KindedTV :: forall flag p f. (Choice p, Applicative f) => p (Name, flag, Kind) (f (Name, flag, Kind)) -> p (TyVarBndr flag) (f (TyVarBndr flag))
- Language.Haskell.TH.Lens: _PlainTV :: Prism' (TyVarBndr flag) (Name, flag)
+ Language.Haskell.TH.Lens: _PlainTV :: forall flag p f. (Choice p, Applicative f) => p (Name, flag) (f (Name, flag)) -> p (TyVarBndr flag) (f (TyVarBndr flag))
Files
- CHANGELOG.markdown +4/−0
- lens-properties/lens-properties.cabal +1/−1
- lens.cabal +6/−7
- tests/hunit.hs +59/−61
- tests/properties.hs +29/−30
CHANGELOG.markdown view
@@ -1,3 +1,7 @@+5.3.5 [2025.06.17]+------------------+* Replace `test-framework` with `tasty` in the test suite.+ 5.3.4 [2025.03.03] ------------------ * Reduce the arity of `foldr1Of`, `foldl1Of`, `foldrOf'`, `foldlOf'`,
lens-properties/lens-properties.cabal view
@@ -39,7 +39,7 @@ build-depends: base >= 4.9 && < 5, lens >= 4 && < 6,- QuickCheck >= 2.4 && < 2.16,+ QuickCheck >= 2.4 && < 2.17, transformers >= 0.2 && < 0.7 exposed-modules:
lens.cabal view
@@ -1,6 +1,6 @@ name: lens category: Data, Lenses, Generics-version: 5.3.4+version: 5.3.5 license: BSD2 cabal-version: 1.18 license-file: LICENSE@@ -367,9 +367,9 @@ build-depends: base, lens,- QuickCheck >= 2.4,- test-framework >= 0.6,- test-framework-quickcheck2 >= 0.2,+ QuickCheck >= 2.4,+ tasty >= 1.4 && < 1.6,+ tasty-quickcheck >= 0.10 && < 0.12, transformers test-suite hunit@@ -385,13 +385,12 @@ build-depends: base, containers,- HUnit >= 1.2, lens, mtl, text, bytestring,- test-framework >= 0.6,- test-framework-hunit >= 0.2+ tasty >= 1.4 && < 1.6,+ tasty-hunit >= 0.10 && < 0.11 -- We need this dummy test-suite to add simple-reflect to the install plan --
tests/hunit.hs view
@@ -33,9 +33,8 @@ #if !(MIN_VERSION_base(4,11,0)) import Data.Monoid #endif-import Test.Framework.Providers.HUnit-import Test.Framework-import Test.HUnit hiding (test)+import Test.Tasty (defaultMain, testGroup)+import Test.Tasty.HUnit ((@?=), testCase) data Point =@@ -380,62 +379,61 @@ @?= [Nothing, Just 1, Just 2, Nothing] main :: IO ()-main = defaultMain- [ testGroup "Main"- [ testCase "read record field" case_read_record_field- , testCase "read state record field" case_read_state_record_field- , testCase "read record field and apply function" case_read_record_field_and_apply_function- , testCase "read state record field and apply function" case_read_state_record_field_and_apply_function- , testCase "write record field" case_write_record_field- , testCase "write state record field" case_write_state_record_field- , testCase "write record field and access new value" case_write_record_field_and_access_new_value- , testCase "write state record field and access new value" case_write_state_record_field_and_access_new_value- , testCase "write record field and access old value" case_write_record_field_and_access_old_value- , testCase "write state record field and access old value" case_write_state_record_field_and_access_old_value- , testCase "modify record field" case_modify_record_field- , testCase "modify state record field" case_modify_state_record_field- , testCase "modify record field and access new value" case_modify_record_field_and_access_new_value- , testCase "modify state record field and access new value" case_modify_state_record_field_and_access_new_value- , testCase "modify record field and access old value" case_modify_record_field_and_access_old_value- , testCase "modify state record field and access old value" case_modify_state_record_field_and_access_old_value- , testCase "modify record field and access side result" case_modify_record_field_and_access_side_result- , testCase "increment record field" case_increment_record_field- , testCase "increment state record field" case_increment_state_record_field- , testCase "append to record field" case_append_to_record_field- , testCase "append to state record field" case_append_to_state_record_field- , testCase "prepend to record field" case_prepend_to_record_field- , testCase "prepend to state record field" case_prepend_to_state_record_field- , testCase "cons to record field" case_cons_to_record_field- , testCase "cons to state record field" case_cons_to_state_record_field- , testCase "snoc to record field" case_snoc_to_record_field- , testCase "snoc to state record field" case_snoc_to_state_record_field- , testCase "append to record field and access new value" case_append_to_record_field_and_access_new_value- , testCase "append to state record field and access new value" case_append_to_state_record_field_and_access_new_value- , testCase "prepend to record field and access new value" case_prepend_to_record_field_and_access_new_value- , testCase "prepend to state record field and access new value" case_prepend_to_state_record_field_and_access_new_value- , testCase "cons to record field and access new value" case_cons_to_record_field_and_access_new_value- , testCase "cons to state record field and access new value" case_cons_to_state_record_field_and_access_new_value- , testCase "snoc to record field and access new value" case_snoc_to_record_field_and_access_new_value- , testCase "snoc to state record field and access new value" case_snoc_to_state_record_field_and_access_new_value- , testCase "append to record field and access old value" case_append_to_record_field_and_access_old_value- , testCase "append to state record field and access old value" case_append_to_state_record_field_and_access_old_value- , testCase "cons to record field and access old value" case_cons_to_record_field_and_access_old_value- , testCase "cons to state record field and access old value" case_cons_to_state_record_field_and_access_old_value- , testCase "snoc to record field and access old value" case_snoc_to_record_field_and_access_old_value- , testCase "snoc to state record field and access old value" case_snoc_to_state_record_field_and_access_old_value- , testCase "read maybe map entry" case_read_maybe_map_entry- , testCase "read maybe state map entry" case_read_maybe_state_map_entry- , testCase "read map entry" case_read_map_entry- , testCase "read state map entry" case_read_state_map_entry- , testCase "modify map entry" case_modify_map_entry- , testCase "insert maybe map entry" case_insert_maybe_map_entry- , testCase "delete maybe map entry" case_delete_maybe_map_entry- , testCase "read list entry" case_read_list_entry- , testCase "write list entry" case_write_list_entry- , testCase "write through list entry" case_write_through_list_entry- , testCase "correct indexing strict text" case_correct_indexing_strict_text- , testCase "correct indexing lazy text" case_correct_indexing_lazy_text- , testCase "correct indexing strict bytestring" case_correct_indexing_strict_bytestring- , testCase "correct indexing lazy bytestring" case_correct_indexing_lazy_bytestring- ]+main = defaultMain $+ testGroup "Main"+ [ testCase "read record field" case_read_record_field+ , testCase "read state record field" case_read_state_record_field+ , testCase "read record field and apply function" case_read_record_field_and_apply_function+ , testCase "read state record field and apply function" case_read_state_record_field_and_apply_function+ , testCase "write record field" case_write_record_field+ , testCase "write state record field" case_write_state_record_field+ , testCase "write record field and access new value" case_write_record_field_and_access_new_value+ , testCase "write state record field and access new value" case_write_state_record_field_and_access_new_value+ , testCase "write record field and access old value" case_write_record_field_and_access_old_value+ , testCase "write state record field and access old value" case_write_state_record_field_and_access_old_value+ , testCase "modify record field" case_modify_record_field+ , testCase "modify state record field" case_modify_state_record_field+ , testCase "modify record field and access new value" case_modify_record_field_and_access_new_value+ , testCase "modify state record field and access new value" case_modify_state_record_field_and_access_new_value+ , testCase "modify record field and access old value" case_modify_record_field_and_access_old_value+ , testCase "modify state record field and access old value" case_modify_state_record_field_and_access_old_value+ , testCase "modify record field and access side result" case_modify_record_field_and_access_side_result+ , testCase "increment record field" case_increment_record_field+ , testCase "increment state record field" case_increment_state_record_field+ , testCase "append to record field" case_append_to_record_field+ , testCase "append to state record field" case_append_to_state_record_field+ , testCase "prepend to record field" case_prepend_to_record_field+ , testCase "prepend to state record field" case_prepend_to_state_record_field+ , testCase "cons to record field" case_cons_to_record_field+ , testCase "cons to state record field" case_cons_to_state_record_field+ , testCase "snoc to record field" case_snoc_to_record_field+ , testCase "snoc to state record field" case_snoc_to_state_record_field+ , testCase "append to record field and access new value" case_append_to_record_field_and_access_new_value+ , testCase "append to state record field and access new value" case_append_to_state_record_field_and_access_new_value+ , testCase "prepend to record field and access new value" case_prepend_to_record_field_and_access_new_value+ , testCase "prepend to state record field and access new value" case_prepend_to_state_record_field_and_access_new_value+ , testCase "cons to record field and access new value" case_cons_to_record_field_and_access_new_value+ , testCase "cons to state record field and access new value" case_cons_to_state_record_field_and_access_new_value+ , testCase "snoc to record field and access new value" case_snoc_to_record_field_and_access_new_value+ , testCase "snoc to state record field and access new value" case_snoc_to_state_record_field_and_access_new_value+ , testCase "append to record field and access old value" case_append_to_record_field_and_access_old_value+ , testCase "append to state record field and access old value" case_append_to_state_record_field_and_access_old_value+ , testCase "cons to record field and access old value" case_cons_to_record_field_and_access_old_value+ , testCase "cons to state record field and access old value" case_cons_to_state_record_field_and_access_old_value+ , testCase "snoc to record field and access old value" case_snoc_to_record_field_and_access_old_value+ , testCase "snoc to state record field and access old value" case_snoc_to_state_record_field_and_access_old_value+ , testCase "read maybe map entry" case_read_maybe_map_entry+ , testCase "read maybe state map entry" case_read_maybe_state_map_entry+ , testCase "read map entry" case_read_map_entry+ , testCase "read state map entry" case_read_state_map_entry+ , testCase "modify map entry" case_modify_map_entry+ , testCase "insert maybe map entry" case_insert_maybe_map_entry+ , testCase "delete maybe map entry" case_delete_maybe_map_entry+ , testCase "read list entry" case_read_list_entry+ , testCase "write list entry" case_write_list_entry+ , testCase "write through list entry" case_write_through_list_entry+ , testCase "correct indexing strict text" case_correct_indexing_strict_text+ , testCase "correct indexing lazy text" case_correct_indexing_lazy_text+ , testCase "correct indexing strict bytestring" case_correct_indexing_strict_bytestring+ , testCase "correct indexing lazy bytestring" case_correct_indexing_lazy_bytestring ]
tests/properties.hs view
@@ -26,8 +26,8 @@ import Control.Lens import Test.QuickCheck-import Test.Framework-import Test.Framework.Providers.QuickCheck2+import Test.Tasty (defaultMain, testGroup)+import Test.Tasty.QuickCheck (testProperty) import Data.Char (isAlphaNum, isAscii, toUpper) import qualified Data.Text.Strict.Lens as Text import GHC.Exts (Constraint)@@ -129,32 +129,31 @@ main :: IO ()-main = defaultMain- [ testGroup "Main"- [ testProperty "1" prop_1- , testProperty "2" prop_2- , testProperty "3" prop_3- , testProperty "4" prop_4- , testProperty "5" prop_5- , testProperty "6" prop_6- , testProperty "7" prop_7- , testProperty "8" prop_8- , testProperty "9" prop_9- , testProperty "10" prop_10- , testProperty "2 2" prop_2_2- , testProperty "mapped" prop_mapped- , testProperty "mapped mapped" prop_mapped_mapped- , testProperty "both" prop_both- , testProperty "traverseLeft" prop_traverseLeft- , testProperty "traverseRight" prop_traverseRight- , testProperty "simple" prop_simple- , testProperty " Left" prop__Left- , testProperty " Right" prop__Right- , testProperty " Just" prop__Just- , testProperty "prefixed" prop_prefixed- , testProperty "text" prop_text- , testProperty "base show" prop_base_show- , testProperty "base read" prop_base_read- , testProperty "base readFail" prop_base_readFail- ]+main = defaultMain $+ testGroup "Main"+ [ testProperty "1" prop_1+ , testProperty "2" prop_2+ , testProperty "3" prop_3+ , testProperty "4" prop_4+ , testProperty "5" prop_5+ , testProperty "6" prop_6+ , testProperty "7" prop_7+ , testProperty "8" prop_8+ , testProperty "9" prop_9+ , testProperty "10" prop_10+ , testProperty "2 2" prop_2_2+ , testProperty "mapped" prop_mapped+ , testProperty "mapped mapped" prop_mapped_mapped+ , testProperty "both" prop_both+ , testProperty "traverseLeft" prop_traverseLeft+ , testProperty "traverseRight" prop_traverseRight+ , testProperty "simple" prop_simple+ , testProperty " Left" prop__Left+ , testProperty " Right" prop__Right+ , testProperty " Just" prop__Just+ , testProperty "prefixed" prop_prefixed+ , testProperty "text" prop_text+ , testProperty "base show" prop_base_show+ , testProperty "base read" prop_base_read+ , testProperty "base readFail" prop_base_readFail ]