polysemy-optics 0.1.0.0 → 0.1.0.1
raw patch · 1 files changed
+6/−3 lines, 1 filesdep ~basedep ~polysemyPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependency ranges changed: base, polysemy
API changes (from Hackage documentation)
+ Optics.Polysemy: type IxKind m = An_AffineTraversal;
- Optics.Polysemy: (!~) :: Is k A_Setter => Optic k is s t a b -> b -> s -> t
+ Optics.Polysemy: (!~) :: forall k (is :: IxList) s t a b. Is k A_Setter => Optic k is s t a b -> b -> s -> t
- Optics.Polysemy: (#) :: Is k A_Review => Optic' k is t b -> b -> t
+ Optics.Polysemy: (#) :: forall k (is :: IxList) t b. Is k A_Review => Optic' k is t b -> b -> t
- Optics.Polysemy: (%!~) :: Is k A_Setter => Optic k is s t a b -> (a -> b) -> s -> t
+ Optics.Polysemy: (%!~) :: forall k (is :: IxList) s t a b. Is k A_Setter => Optic k is s t a b -> (a -> b) -> s -> t
- Optics.Polysemy: (%%) :: ks ~ Append is js => Optic k is s t u v -> Optic k js u v a b -> Optic k ks s t a b
+ Optics.Polysemy: (%%) :: forall k (is :: [Type]) (js :: [Type]) (ks :: [Type]) s t u v a b. ks ~ Append is js => Optic k is s t u v -> Optic k js u v a b -> Optic k ks s t a b
- Optics.Polysemy: (%&) :: () => Optic k is s t a b -> (Optic k is s t a b -> Optic l js s' t' a' b') -> Optic l js s' t' a' b'
+ Optics.Polysemy: (%&) :: forall k (is :: IxList) s t a b l (js :: IxList) s' t' a' b'. Optic k is s t a b -> (Optic k is s t a b -> Optic l js s' t' a' b') -> Optic l js s' t' a' b'
- Optics.Polysemy: (%) :: (Is k m, Is l m, m ~ Join k l, ks ~ Append is js) => Optic k is s t u v -> Optic l js u v a b -> Optic m ks s t a b
+ Optics.Polysemy: (%) :: forall k m l (ks :: [Type]) (is :: [Type]) (js :: [Type]) s t u v a b. (Is k m, Is l m, m ~ Join k l, ks ~ Append is js) => Optic k is s t u v -> Optic l js u v a b -> Optic m ks s t a b
- Optics.Polysemy: (%>) :: (m ~ Join k l, Is k m, Is l m, IxOptic k s t u v, NonEmptyIndices is) => Optic k is s t u v -> Optic l js u v a b -> Optic m js s t a b
+ Optics.Polysemy: (%>) :: forall m k l s t u v (is :: IxList) (js :: IxList) a b. (m ~ Join k l, Is k m, Is l m, IxOptic k s t u v, NonEmptyIndices is) => Optic k is s t u v -> Optic l js u v a b -> Optic m js s t a b
- Optics.Polysemy: (%~) :: Is k A_Setter => Optic k is s t a b -> (a -> b) -> s -> t
+ Optics.Polysemy: (%~) :: forall k (is :: IxList) s t a b. Is k A_Setter => Optic k is s t a b -> (a -> b) -> s -> t
- Optics.Polysemy: (&) :: () => a -> (a -> b) -> b
+ Optics.Polysemy: (&) :: a -> (a -> b) -> b
- Optics.Polysemy: (.~) :: Is k A_Setter => Optic k is s t a b -> b -> s -> t
+ Optics.Polysemy: (.~) :: forall k (is :: IxList) s t a b. Is k A_Setter => Optic k is s t a b -> b -> s -> t
- Optics.Polysemy: (<%) :: (m ~ Join k l, Is l m, Is k m, IxOptic l u v a b, NonEmptyIndices js) => Optic k is s t u v -> Optic l js u v a b -> Optic m is s t a b
+ Optics.Polysemy: (<%) :: forall m k l u v a b (js :: IxList) (is :: IxList) s t. (m ~ Join k l, Is l m, Is k m, IxOptic l u v a b, NonEmptyIndices js) => Optic k is s t u v -> Optic l js u v a b -> Optic m is s t a b
- Optics.Polysemy: (<%>) :: (m ~ Join k l, Is k m, Is l m, IxOptic m s t a b, HasSingleIndex is i, HasSingleIndex js j) => Optic k is s t u v -> Optic l js u v a b -> Optic m (WithIx (i, j)) s t a b
+ Optics.Polysemy: (<%>) :: forall m k l s t a b (is :: IxList) i (js :: IxList) j u v. (m ~ Join k l, Is k m, Is l m, IxOptic m s t a b, HasSingleIndex is i, HasSingleIndex js j) => Optic k is s t u v -> Optic l js u v a b -> Optic m (WithIx (i, j)) s t a b
- Optics.Polysemy: (?!~) :: Is k A_Setter => Optic k is s t a (Maybe b) -> b -> s -> t
+ Optics.Polysemy: (?!~) :: forall k (is :: IxList) s t a b. Is k A_Setter => Optic k is s t a (Maybe b) -> b -> s -> t
- Optics.Polysemy: (?~) :: Is k A_Setter => Optic k is s t a (Maybe b) -> b -> s -> t
+ Optics.Polysemy: (?~) :: forall k (is :: IxList) s t a b. Is k A_Setter => Optic k is s t a (Maybe b) -> b -> s -> t
- Optics.Polysemy: (^.) :: Is k A_Getter => s -> Optic' k is s a -> a
+ Optics.Polysemy: (^.) :: forall k s (is :: IxList) a. Is k A_Getter => s -> Optic' k is s a -> a
- Optics.Polysemy: (^..) :: Is k A_Fold => s -> Optic' k is s a -> [a]
+ Optics.Polysemy: (^..) :: forall k s (is :: IxList) a. Is k A_Fold => s -> Optic' k is s a -> [a]
- Optics.Polysemy: (^?) :: Is k An_AffineFold => s -> Optic' k is s a -> Maybe a
+ Optics.Polysemy: (^?) :: forall k s (is :: IxList) a. Is k An_AffineFold => s -> Optic' k is s a -> Maybe a
- Optics.Polysemy: _Just :: () => Prism (Maybe a) (Maybe b) a b
+ Optics.Polysemy: _Just :: Prism (Maybe a) (Maybe b) a b
- Optics.Polysemy: _Left :: () => Prism (Either a b) (Either c b) a c
+ Optics.Polysemy: _Left :: Prism (Either a b) (Either c b) a c
- Optics.Polysemy: _Nothing :: () => Prism' (Maybe a) ()
+ Optics.Polysemy: _Nothing :: Prism' (Maybe a) ()
- Optics.Polysemy: _Right :: () => Prism (Either a b) (Either a c) b c
+ Optics.Polysemy: _Right :: Prism (Either a b) (Either a c) b c
- Optics.Polysemy: afailing :: (Is k An_AffineFold, Is l An_AffineFold) => Optic' k is s a -> Optic' l js s a -> AffineFold s a
+ Optics.Polysemy: afailing :: forall k l (is :: IxList) s a (js :: IxList). (Is k An_AffineFold, Is l An_AffineFold) => Optic' k is s a -> Optic' l js s a -> AffineFold s a
- Optics.Polysemy: afoldVL :: () => (forall (f :: Type -> Type). Functor f => (forall r. () => r -> f r) -> (a -> f u) -> s -> f v) -> AffineFold s a
+ Optics.Polysemy: afoldVL :: (forall (f :: Type -> Type). Functor f => (forall r. () => r -> f r) -> (a -> f u) -> s -> f v) -> AffineFold s a
- Optics.Polysemy: afolding :: () => (s -> Maybe a) -> AffineFold s a
+ Optics.Polysemy: afolding :: (s -> Maybe a) -> AffineFold s a
- Optics.Polysemy: allOf :: Is k A_Fold => Optic' k is s a -> (a -> Bool) -> s -> Bool
+ Optics.Polysemy: allOf :: forall k (is :: IxList) s a. Is k A_Fold => Optic' k is s a -> (a -> Bool) -> s -> Bool
- Optics.Polysemy: alongside :: (Is k A_Lens, Is l A_Lens) => Optic k is s t a b -> Optic l js s' t' a' b' -> Lens (s, s') (t, t') (a, a') (b, b')
+ Optics.Polysemy: alongside :: forall k l (is :: IxList) s t a b (js :: IxList) s' t' a' b'. (Is k A_Lens, Is l A_Lens) => Optic k is s t a b -> Optic l js s' t' a' b' -> Lens (s, s') (t, t') (a, a') (b, b')
- Optics.Polysemy: andOf :: Is k A_Fold => Optic' k is s Bool -> s -> Bool
+ Optics.Polysemy: andOf :: forall k (is :: IxList) s. Is k A_Fold => Optic' k is s Bool -> s -> Bool
- Optics.Polysemy: anon :: () => a -> (a -> Bool) -> Iso' (Maybe a) a
+ Optics.Polysemy: anon :: a -> (a -> Bool) -> Iso' (Maybe a) a
- Optics.Polysemy: anyOf :: Is k A_Fold => Optic' k is s a -> (a -> Bool) -> s -> Bool
+ Optics.Polysemy: anyOf :: forall k (is :: IxList) s a. Is k A_Fold => Optic' k is s a -> (a -> Bool) -> s -> Bool
- Optics.Polysemy: aside :: Is k A_Prism => Optic k is s t a b -> Prism (e, s) (e, t) (e, a) (e, b)
+ Optics.Polysemy: aside :: forall k (is :: IxList) s t a b e. Is k A_Prism => Optic k is s t a b -> Prism (e, s) (e, t) (e, a) (e, b)
- Optics.Polysemy: asumOf :: (Is k A_Fold, Alternative f) => Optic' k is s (f a) -> s -> f a
+ Optics.Polysemy: asumOf :: forall k f (is :: IxList) s a. (Is k A_Fold, Alternative f) => Optic' k is s (f a) -> s -> f a
- Optics.Polysemy: atraversal :: () => (s -> Either t a) -> (s -> b -> t) -> AffineTraversal s t a b
+ Optics.Polysemy: atraversal :: (s -> Either t a) -> (s -> b -> t) -> AffineTraversal s t a b
- Optics.Polysemy: atraversalVL :: () => AffineTraversalVL s t a b -> AffineTraversal s t a b
+ Optics.Polysemy: atraversalVL :: AffineTraversalVL s t a b -> AffineTraversal s t a b
- Optics.Polysemy: atraverseOf :: (Is k An_AffineTraversal, Functor f) => Optic k is s t a b -> (forall r. () => r -> f r) -> (a -> f b) -> s -> f t
+ Optics.Polysemy: atraverseOf :: forall k f (is :: IxList) s t a b. (Is k An_AffineTraversal, Functor f) => Optic k is s t a b -> (forall r. () => r -> f r) -> (a -> f b) -> s -> f t
- Optics.Polysemy: atraverseOf_ :: (Is k An_AffineFold, Functor f) => Optic' k is s a -> (forall r. () => r -> f r) -> (a -> f u) -> s -> f ()
+ Optics.Polysemy: atraverseOf_ :: forall k f (is :: IxList) s a u. (Is k An_AffineFold, Functor f) => Optic' k is s a -> (forall r. () => r -> f r) -> (a -> f u) -> s -> f ()
- Optics.Polysemy: backwards :: Is k A_Traversal => Optic k is s t a b -> Traversal s t a b
+ Optics.Polysemy: backwards :: forall k (is :: IxList) s t a b. Is k A_Traversal => Optic k is s t a b -> Traversal s t a b
- Optics.Polysemy: backwards_ :: Is k A_Fold => Optic' k is s a -> Fold s a
+ Optics.Polysemy: backwards_ :: forall k (is :: IxList) s a. Is k A_Fold => Optic' k is s a -> Fold s a
- Optics.Polysemy: below :: (Is k A_Prism, Traversable f) => Optic' k is s a -> Prism' (f s) (f a)
+ Optics.Polysemy: below :: forall k f (is :: IxList) s a. (Is k A_Prism, Traversable f) => Optic' k is s a -> Prism' (f s) (f a)
- Optics.Polysemy: castOptic :: Is srcKind destKind => Optic srcKind is s t a b -> Optic destKind is s t a b
+ Optics.Polysemy: castOptic :: forall destKind srcKind (is :: IxList) s t a b. Is srcKind destKind => Optic srcKind is s t a b -> Optic destKind is s t a b
- Optics.Polysemy: chosen :: () => Lens (Either a a) (Either b b) a b
+ Optics.Polysemy: chosen :: Lens (Either a a) (Either b b) a b
- Optics.Polysemy: class is ~ i : ([] :: [Type]) => HasSingleIndex (is :: IxList) i
+ Optics.Polysemy: class is ~ '[i] => HasSingleIndex (is :: IxList) i
- Optics.Polysemy: coerced1 :: (Coercible s (f s), Coercible a (f a)) => Iso (f s) (f a) s a
+ Optics.Polysemy: coerced1 :: forall f s a. (Coercible s (f s), Coercible a (f a)) => Iso (f s) (f a) s a
- Optics.Polysemy: coercedTo :: Coercible s a => Iso' s a
+ Optics.Polysemy: coercedTo :: forall a s. Coercible s a => Iso' s a
- Optics.Polysemy: conjoined :: HasSingleIndex is i => Optic k NoIx s t a b -> Optic k is s t a b -> Optic k is s t a b
+ Optics.Polysemy: conjoined :: forall (is :: IxList) i k s t a b. HasSingleIndex is i => Optic k NoIx s t a b -> Optic k is s t a b -> Optic k is s t a b
- Optics.Polysemy: curried :: () => Iso ((a, b) -> c) ((d, e) -> f) (a -> b -> c) (d -> e -> f)
+ Optics.Polysemy: curried :: Iso ((a, b) -> c) ((d, e) -> f) (a -> b -> c) (d -> e -> f)
- Optics.Polysemy: devoid :: () => IxLens' i Void a
+ Optics.Polysemy: devoid :: IxLens' i Void a
- Optics.Polysemy: elemOf :: (Is k A_Fold, Eq a) => Optic' k is s a -> a -> s -> Bool
+ Optics.Polysemy: elemOf :: forall k a (is :: IxList) s. (Is k A_Fold, Eq a) => Optic' k is s a -> a -> s -> Bool
- Optics.Polysemy: elementOf :: Is k A_Traversal => Optic' k is s a -> Int -> IxAffineTraversal' Int s a
+ Optics.Polysemy: elementOf :: forall k (is :: IxList) s a. Is k A_Traversal => Optic' k is s a -> Int -> IxAffineTraversal' Int s a
- Optics.Polysemy: elementsOf :: Is k A_Traversal => Optic k is s t a a -> (Int -> Bool) -> IxTraversal Int s t a a
+ Optics.Polysemy: elementsOf :: forall k (is :: IxList) s t a. Is k A_Traversal => Optic k is s t a a -> (Int -> Bool) -> IxTraversal Int s t a a
- Optics.Polysemy: equality' :: () => Lens a b a b
+ Optics.Polysemy: equality' :: Lens a b a b
- Optics.Polysemy: failing :: (Is k A_Fold, Is l A_Fold) => Optic' k is s a -> Optic' l js s a -> Fold s a
+ Optics.Polysemy: failing :: forall k l (is :: IxList) s a (js :: IxList). (Is k A_Fold, Is l A_Fold) => Optic' k is s a -> Optic' l js s a -> Fold s a
- Optics.Polysemy: failover :: Is k A_Traversal => Optic k is s t a b -> (a -> b) -> s -> Maybe t
+ Optics.Polysemy: failover :: forall k (is :: IxList) s t a b. Is k A_Traversal => Optic k is s t a b -> (a -> b) -> s -> Maybe t
- Optics.Polysemy: failover' :: Is k A_Traversal => Optic k is s t a b -> (a -> b) -> s -> Maybe t
+ Optics.Polysemy: failover' :: forall k (is :: IxList) s t a b. Is k A_Traversal => Optic k is s t a b -> (a -> b) -> s -> Maybe t
- Optics.Polysemy: filtered :: () => (a -> Bool) -> AffineFold a a
+ Optics.Polysemy: filtered :: (a -> Bool) -> AffineFold a a
- Optics.Polysemy: filteredBy :: Is k An_AffineFold => Optic' k is a i -> IxAffineFold i a a
+ Optics.Polysemy: filteredBy :: forall k (is :: IxList) a i. Is k An_AffineFold => Optic' k is a i -> IxAffineFold i a a
- Optics.Polysemy: findMOf :: (Is k A_Fold, Monad m) => Optic' k is s a -> (a -> m Bool) -> s -> m (Maybe a)
+ Optics.Polysemy: findMOf :: forall k m (is :: IxList) s a. (Is k A_Fold, Monad m) => Optic' k is s a -> (a -> m Bool) -> s -> m (Maybe a)
- Optics.Polysemy: findOf :: Is k A_Fold => Optic' k is s a -> (a -> Bool) -> s -> Maybe a
+ Optics.Polysemy: findOf :: forall k (is :: IxList) s a. Is k A_Fold => Optic' k is s a -> (a -> Bool) -> s -> Maybe a
- Optics.Polysemy: flipped :: () => Iso (a -> b -> c) (a' -> b' -> c') (b -> a -> c) (b' -> a' -> c')
+ Optics.Polysemy: flipped :: Iso (a -> b -> c) (a' -> b' -> c') (b -> a -> c) (b' -> a' -> c')
- Optics.Polysemy: foldMapOf :: (Is k A_Fold, Monoid m) => Optic' k is s a -> (a -> m) -> s -> m
+ Optics.Polysemy: foldMapOf :: forall k m (is :: IxList) s a. (Is k A_Fold, Monoid m) => Optic' k is s a -> (a -> m) -> s -> m
- Optics.Polysemy: foldOf :: (Is k A_Fold, Monoid a) => Optic' k is s a -> s -> a
+ Optics.Polysemy: foldOf :: forall k a (is :: IxList) s. (Is k A_Fold, Monoid a) => Optic' k is s a -> s -> a
- Optics.Polysemy: foldVL :: () => (forall (f :: Type -> Type). Applicative f => (a -> f u) -> s -> f v) -> Fold s a
+ Optics.Polysemy: foldVL :: (forall (f :: Type -> Type). Applicative f => (a -> f u) -> s -> f v) -> Fold s a
- Optics.Polysemy: foldlOf' :: Is k A_Fold => Optic' k is s a -> (r -> a -> r) -> r -> s -> r
+ Optics.Polysemy: foldlOf' :: forall k (is :: IxList) s a r. Is k A_Fold => Optic' k is s a -> (r -> a -> r) -> r -> s -> r
- Optics.Polysemy: foldrOf :: Is k A_Fold => Optic' k is s a -> (a -> r -> r) -> r -> s -> r
+ Optics.Polysemy: foldrOf :: forall k (is :: IxList) s a r. Is k A_Fold => Optic' k is s a -> (a -> r -> r) -> r -> s -> r
- Optics.Polysemy: foldring :: () => (forall (f :: Type -> Type). Applicative f => (a -> f u -> f u) -> f v -> s -> f w) -> Fold s a
+ Optics.Polysemy: foldring :: (forall (f :: Type -> Type). Applicative f => (a -> f u -> f u) -> f v -> s -> f w) -> Fold s a
- Optics.Polysemy: forOf :: (Is k A_Traversal, Applicative f) => Optic k is s t a b -> s -> (a -> f b) -> f t
+ Optics.Polysemy: forOf :: forall k f (is :: IxList) s t a b. (Is k A_Traversal, Applicative f) => Optic k is s t a b -> s -> (a -> f b) -> f t
- Optics.Polysemy: forOf_ :: (Is k A_Fold, Applicative f) => Optic' k is s a -> s -> (a -> f r) -> f ()
+ Optics.Polysemy: forOf_ :: forall k f (is :: IxList) s a r. (Is k A_Fold, Applicative f) => Optic' k is s a -> s -> (a -> f r) -> f ()
- Optics.Polysemy: getting :: ToReadOnly k s t a b => Optic k is s t a b -> Optic' (Join A_Getter k) is s a
+ Optics.Polysemy: getting :: forall (is :: IxList). ToReadOnly k s t a b => Optic k is s t a b -> Optic' (Join A_Getter k) is s a
- Optics.Polysemy: has :: Is k A_Fold => Optic' k is s a -> s -> Bool
+ Optics.Polysemy: has :: forall k (is :: IxList) s a. Is k A_Fold => Optic' k is s a -> s -> Bool
- Optics.Polysemy: hasn't :: Is k A_Fold => Optic' k is s a -> s -> Bool
+ Optics.Polysemy: hasn't :: forall k (is :: IxList) s a. Is k A_Fold => Optic' k is s a -> s -> Bool
- Optics.Polysemy: headOf :: Is k A_Fold => Optic' k is s a -> s -> Maybe a
+ Optics.Polysemy: headOf :: forall k (is :: IxList) s a. Is k A_Fold => Optic' k is s a -> s -> Maybe a
- Optics.Polysemy: iafailing :: (Is k An_AffineFold, Is l An_AffineFold, HasSingleIndex is1 i, HasSingleIndex is2 i) => Optic' k is1 s a -> Optic' l is2 s a -> IxAffineFold i s a
+ Optics.Polysemy: iafailing :: forall k l (is1 :: IxList) i (is2 :: IxList) s a. (Is k An_AffineFold, Is l An_AffineFold, HasSingleIndex is1 i, HasSingleIndex is2 i) => Optic' k is1 s a -> Optic' l is2 s a -> IxAffineFold i s a
- Optics.Polysemy: iafoldVL :: () => (forall (f :: Type -> Type). Functor f => (forall r. () => r -> f r) -> (i -> a -> f u) -> s -> f v) -> IxAffineFold i s a
+ Optics.Polysemy: iafoldVL :: (forall (f :: Type -> Type). Functor f => (forall r. () => r -> f r) -> (i -> a -> f u) -> s -> f v) -> IxAffineFold i s a
- Optics.Polysemy: iafolding :: () => (s -> Maybe (i, a)) -> IxAffineFold i s a
+ Optics.Polysemy: iafolding :: (s -> Maybe (i, a)) -> IxAffineFold i s a
- Optics.Polysemy: iallOf :: (Is k A_Fold, HasSingleIndex is i) => Optic' k is s a -> (i -> a -> Bool) -> s -> Bool
+ Optics.Polysemy: iallOf :: forall k (is :: IxList) i s a. (Is k A_Fold, HasSingleIndex is i) => Optic' k is s a -> (i -> a -> Bool) -> s -> Bool
- Optics.Polysemy: ianyOf :: (Is k A_Fold, HasSingleIndex is i) => Optic' k is s a -> (i -> a -> Bool) -> s -> Bool
+ Optics.Polysemy: ianyOf :: forall k (is :: IxList) i s a. (Is k A_Fold, HasSingleIndex is i) => Optic' k is s a -> (i -> a -> Bool) -> s -> Bool
- Optics.Polysemy: iatraversal :: () => (s -> Either t (i, a)) -> (s -> b -> t) -> IxAffineTraversal i s t a b
+ Optics.Polysemy: iatraversal :: (s -> Either t (i, a)) -> (s -> b -> t) -> IxAffineTraversal i s t a b
- Optics.Polysemy: iatraversalVL :: () => IxAffineTraversalVL i s t a b -> IxAffineTraversal i s t a b
+ Optics.Polysemy: iatraversalVL :: IxAffineTraversalVL i s t a b -> IxAffineTraversal i s t a b
- Optics.Polysemy: iatraverseOf :: (Is k An_AffineTraversal, Functor f, HasSingleIndex is i) => Optic k is s t a b -> (forall r. () => r -> f r) -> (i -> a -> f b) -> s -> f t
+ Optics.Polysemy: iatraverseOf :: forall k f (is :: IxList) i s t a b. (Is k An_AffineTraversal, Functor f, HasSingleIndex is i) => Optic k is s t a b -> (forall r. () => r -> f r) -> (i -> a -> f b) -> s -> f t
- Optics.Polysemy: iatraverseOf_ :: (Is k An_AffineFold, Functor f, HasSingleIndex is i) => Optic' k is s a -> (forall r. () => r -> f r) -> (i -> a -> f u) -> s -> f ()
+ Optics.Polysemy: iatraverseOf_ :: forall k f (is :: IxList) i s a u. (Is k An_AffineFold, Functor f, HasSingleIndex is i) => Optic' k is s a -> (forall r. () => r -> f r) -> (i -> a -> f u) -> s -> f ()
- Optics.Polysemy: ibackwards :: (Is k A_Traversal, HasSingleIndex is i) => Optic k is s t a b -> IxTraversal i s t a b
+ Optics.Polysemy: ibackwards :: forall k (is :: IxList) i s t a b. (Is k A_Traversal, HasSingleIndex is i) => Optic k is s t a b -> IxTraversal i s t a b
- Optics.Polysemy: ibackwards_ :: (Is k A_Fold, HasSingleIndex is i) => Optic' k is s a -> IxFold i s a
+ Optics.Polysemy: ibackwards_ :: forall k (is :: IxList) i s a. (Is k A_Fold, HasSingleIndex is i) => Optic' k is s a -> IxFold i s a
- Optics.Polysemy: icompose :: () => (i -> j -> ix) -> Optic k (i : (j : ([] :: [Type]))) s t a b -> Optic k (WithIx ix) s t a b
+ Optics.Polysemy: icompose :: (i -> j -> ix) -> Optic k '[i, j] s t a b -> Optic k (WithIx ix) s t a b
- Optics.Polysemy: icompose3 :: () => (i1 -> i2 -> i3 -> ix) -> Optic k (i1 : (i2 : (i3 : ([] :: [Type])))) s t a b -> Optic k (WithIx ix) s t a b
+ Optics.Polysemy: icompose3 :: (i1 -> i2 -> i3 -> ix) -> Optic k '[i1, i2, i3] s t a b -> Optic k (WithIx ix) s t a b
- Optics.Polysemy: icompose4 :: () => (i1 -> i2 -> i3 -> i4 -> ix) -> Optic k (i1 : (i2 : (i3 : (i4 : ([] :: [Type]))))) s t a b -> Optic k (WithIx ix) s t a b
+ Optics.Polysemy: icompose4 :: (i1 -> i2 -> i3 -> i4 -> ix) -> Optic k '[i1, i2, i3, i4] s t a b -> Optic k (WithIx ix) s t a b
- Optics.Polysemy: icompose5 :: () => (i1 -> i2 -> i3 -> i4 -> i5 -> ix) -> Optic k (i1 : (i2 : (i3 : (i4 : (i5 : ([] :: [Type])))))) s t a b -> Optic k (WithIx ix) s t a b
+ Optics.Polysemy: icompose5 :: (i1 -> i2 -> i3 -> i4 -> i5 -> ix) -> Optic k '[i1, i2, i3, i4, i5] s t a b -> Optic k (WithIx ix) s t a b
- Optics.Polysemy: icomposeN :: (CurryCompose is, NonEmptyIndices is) => Curry is i -> Optic k is s t a b -> Optic k (WithIx i) s t a b
+ Optics.Polysemy: icomposeN :: forall k i (is :: IxList) s t a b. (CurryCompose is, NonEmptyIndices is) => Curry is i -> Optic k is s t a b -> Optic k (WithIx i) s t a b
- Optics.Polysemy: ifailing :: (Is k A_Fold, Is l A_Fold, HasSingleIndex is1 i, HasSingleIndex is2 i) => Optic' k is1 s a -> Optic' l is2 s a -> IxFold i s a
+ Optics.Polysemy: ifailing :: forall k l (is1 :: IxList) i (is2 :: IxList) s a. (Is k A_Fold, Is l A_Fold, HasSingleIndex is1 i, HasSingleIndex is2 i) => Optic' k is1 s a -> Optic' l is2 s a -> IxFold i s a
- Optics.Polysemy: ifailover :: (Is k A_Traversal, HasSingleIndex is i) => Optic k is s t a b -> (i -> a -> b) -> s -> Maybe t
+ Optics.Polysemy: ifailover :: forall k (is :: IxList) i s t a b. (Is k A_Traversal, HasSingleIndex is i) => Optic k is s t a b -> (i -> a -> b) -> s -> Maybe t
- Optics.Polysemy: ifailover' :: (Is k A_Traversal, HasSingleIndex is i) => Optic k is s t a b -> (i -> a -> b) -> s -> Maybe t
+ Optics.Polysemy: ifailover' :: forall k (is :: IxList) i s t a b. (Is k A_Traversal, HasSingleIndex is i) => Optic k is s t a b -> (i -> a -> b) -> s -> Maybe t
- Optics.Polysemy: ifiltered :: (Is k A_Fold, HasSingleIndex is i) => (i -> a -> Bool) -> Optic' k is s a -> IxFold i s a
+ Optics.Polysemy: ifiltered :: forall k (is :: IxList) i a s. (Is k A_Fold, HasSingleIndex is i) => (i -> a -> Bool) -> Optic' k is s a -> IxFold i s a
- Optics.Polysemy: ifindMOf :: (Is k A_Fold, Monad m, HasSingleIndex is i) => Optic' k is s a -> (i -> a -> m Bool) -> s -> m (Maybe (i, a))
+ Optics.Polysemy: ifindMOf :: forall k m (is :: IxList) i s a. (Is k A_Fold, Monad m, HasSingleIndex is i) => Optic' k is s a -> (i -> a -> m Bool) -> s -> m (Maybe (i, a))
- Optics.Polysemy: ifindOf :: (Is k A_Fold, HasSingleIndex is i) => Optic' k is s a -> (i -> a -> Bool) -> s -> Maybe (i, a)
+ Optics.Polysemy: ifindOf :: forall k (is :: IxList) i s a. (Is k A_Fold, HasSingleIndex is i) => Optic' k is s a -> (i -> a -> Bool) -> s -> Maybe (i, a)
- Optics.Polysemy: ifoldMapOf :: (Is k A_Fold, Monoid m, HasSingleIndex is i) => Optic' k is s a -> (i -> a -> m) -> s -> m
+ Optics.Polysemy: ifoldMapOf :: forall k m (is :: IxList) i s a. (Is k A_Fold, Monoid m, HasSingleIndex is i) => Optic' k is s a -> (i -> a -> m) -> s -> m
- Optics.Polysemy: ifoldVL :: () => (forall (f :: Type -> Type). Applicative f => (i -> a -> f u) -> s -> f v) -> IxFold i s a
+ Optics.Polysemy: ifoldVL :: (forall (f :: Type -> Type). Applicative f => (i -> a -> f u) -> s -> f v) -> IxFold i s a
- Optics.Polysemy: ifoldlOf' :: (Is k A_Fold, HasSingleIndex is i) => Optic' k is s a -> (i -> r -> a -> r) -> r -> s -> r
+ Optics.Polysemy: ifoldlOf' :: forall k (is :: IxList) i s a r. (Is k A_Fold, HasSingleIndex is i) => Optic' k is s a -> (i -> r -> a -> r) -> r -> s -> r
- Optics.Polysemy: ifoldrOf :: (Is k A_Fold, HasSingleIndex is i) => Optic' k is s a -> (i -> a -> r -> r) -> r -> s -> r
+ Optics.Polysemy: ifoldrOf :: forall k (is :: IxList) i s a r. (Is k A_Fold, HasSingleIndex is i) => Optic' k is s a -> (i -> a -> r -> r) -> r -> s -> r
- Optics.Polysemy: ifoldring :: () => (forall (f :: Type -> Type). Applicative f => (i -> a -> f u -> f u) -> f v -> s -> f w) -> IxFold i s a
+ Optics.Polysemy: ifoldring :: (forall (f :: Type -> Type). Applicative f => (i -> a -> f u -> f u) -> f v -> s -> f w) -> IxFold i s a
- Optics.Polysemy: iforOf :: (Is k A_Traversal, Applicative f, HasSingleIndex is i) => Optic k is s t a b -> s -> (i -> a -> f b) -> f t
+ Optics.Polysemy: iforOf :: forall k f (is :: IxList) i s t a b. (Is k A_Traversal, Applicative f, HasSingleIndex is i) => Optic k is s t a b -> s -> (i -> a -> f b) -> f t
- Optics.Polysemy: iforOf_ :: (Is k A_Fold, Applicative f, HasSingleIndex is i) => Optic' k is s a -> s -> (i -> a -> f r) -> f ()
+ Optics.Polysemy: iforOf_ :: forall k f (is :: IxList) i s a r. (Is k A_Fold, Applicative f, HasSingleIndex is i) => Optic' k is s a -> s -> (i -> a -> f r) -> f ()
- Optics.Polysemy: ignored :: () => IxAffineTraversal i s s a b
+ Optics.Polysemy: ignored :: IxAffineTraversal i s s a b
- Optics.Polysemy: iheadOf :: (Is k A_Fold, HasSingleIndex is i) => Optic' k is s a -> s -> Maybe (i, a)
+ Optics.Polysemy: iheadOf :: forall k (is :: IxList) i s a. (Is k A_Fold, HasSingleIndex is i) => Optic' k is s a -> s -> Maybe (i, a)
- Optics.Polysemy: ilastOf :: (Is k A_Fold, HasSingleIndex is i) => Optic' k is s a -> s -> Maybe (i, a)
+ Optics.Polysemy: ilastOf :: forall k (is :: IxList) i s a. (Is k A_Fold, HasSingleIndex is i) => Optic' k is s a -> s -> Maybe (i, a)
- Optics.Polysemy: ilens :: () => (s -> (i, a)) -> (s -> b -> t) -> IxLens i s t a b
+ Optics.Polysemy: ilens :: (s -> (i, a)) -> (s -> b -> t) -> IxLens i s t a b
- Optics.Polysemy: ilensVL :: () => IxLensVL i s t a b -> IxLens i s t a b
+ Optics.Polysemy: ilensVL :: IxLensVL i s t a b -> IxLens i s t a b
- Optics.Polysemy: imapAccumLOf :: (Is k A_Traversal, HasSingleIndex is i) => Optic k is s t a b -> (i -> acc -> a -> (b, acc)) -> acc -> s -> (t, acc)
+ Optics.Polysemy: imapAccumLOf :: forall k (is :: IxList) i s t a b acc. (Is k A_Traversal, HasSingleIndex is i) => Optic k is s t a b -> (i -> acc -> a -> (b, acc)) -> acc -> s -> (t, acc)
- Optics.Polysemy: imapAccumROf :: (Is k A_Traversal, HasSingleIndex is i) => Optic k is s t a b -> (i -> acc -> a -> (b, acc)) -> acc -> s -> (t, acc)
+ Optics.Polysemy: imapAccumROf :: forall k (is :: IxList) i s t a b acc. (Is k A_Traversal, HasSingleIndex is i) => Optic k is s t a b -> (i -> acc -> a -> (b, acc)) -> acc -> s -> (t, acc)
- Optics.Polysemy: indices :: (Is k A_Traversal, HasSingleIndex is i) => (i -> Bool) -> Optic k is s t a a -> IxTraversal i s t a a
+ Optics.Polysemy: indices :: forall k (is :: IxList) i s t a. (Is k A_Traversal, HasSingleIndex is i) => (i -> Bool) -> Optic k is s t a a -> IxTraversal i s t a a
- Optics.Polysemy: inoneOf :: (Is k A_Fold, HasSingleIndex is i) => Optic' k is s a -> (i -> a -> Bool) -> s -> Bool
+ Optics.Polysemy: inoneOf :: forall k (is :: IxList) i s a. (Is k A_Fold, HasSingleIndex is i) => Optic' k is s a -> (i -> a -> Bool) -> s -> Bool
- Optics.Polysemy: involuted :: () => (a -> a) -> Iso' a a
+ Optics.Polysemy: involuted :: (a -> a) -> Iso' a a
- Optics.Polysemy: iover :: (Is k A_Setter, HasSingleIndex is i) => Optic k is s t a b -> (i -> a -> b) -> s -> t
+ Optics.Polysemy: iover :: forall k (is :: IxList) i s t a b. (Is k A_Setter, HasSingleIndex is i) => Optic k is s t a b -> (i -> a -> b) -> s -> t
- Optics.Polysemy: iover' :: (Is k A_Setter, HasSingleIndex is i) => Optic k is s t a b -> (i -> a -> b) -> s -> t
+ Optics.Polysemy: iover' :: forall k (is :: IxList) i s t a b. (Is k A_Setter, HasSingleIndex is i) => Optic k is s t a b -> (i -> a -> b) -> s -> t
- Optics.Polysemy: ipartsOf :: (Is k A_Traversal, HasSingleIndex is i) => Optic k is s t a a -> IxLens [i] s t [a] [a]
+ Optics.Polysemy: ipartsOf :: forall k (is :: IxList) i s t a. (Is k A_Traversal, HasSingleIndex is i) => Optic k is s t a a -> IxLens [i] s t [a] [a]
- Optics.Polysemy: ipre :: (Is k A_Fold, HasSingleIndex is i) => Optic' k is s a -> IxAffineFold i s a
+ Optics.Polysemy: ipre :: forall k (is :: IxList) i s a. (Is k A_Fold, HasSingleIndex is i) => Optic' k is s a -> IxAffineFold i s a
- Optics.Polysemy: ipreview :: (Is k An_AffineFold, HasSingleIndex is i) => Optic' k is s a -> s -> Maybe (i, a)
+ Optics.Polysemy: ipreview :: forall k (is :: IxList) i s a. (Is k An_AffineFold, HasSingleIndex is i) => Optic' k is s a -> s -> Maybe (i, a)
- Optics.Polysemy: ipreviews :: (Is k An_AffineFold, HasSingleIndex is i) => Optic' k is s a -> (i -> a -> r) -> s -> Maybe r
+ Optics.Polysemy: ipreviews :: forall k (is :: IxList) i s a r. (Is k An_AffineFold, HasSingleIndex is i) => Optic' k is s a -> (i -> a -> r) -> s -> Maybe r
- Optics.Polysemy: iscanl1Of :: (Is k A_Traversal, HasSingleIndex is i) => Optic k is s t a a -> (i -> a -> a -> a) -> s -> t
+ Optics.Polysemy: iscanl1Of :: forall k (is :: IxList) i s t a. (Is k A_Traversal, HasSingleIndex is i) => Optic k is s t a a -> (i -> a -> a -> a) -> s -> t
- Optics.Polysemy: iscanr1Of :: (Is k A_Traversal, HasSingleIndex is i) => Optic k is s t a a -> (i -> a -> a -> a) -> s -> t
+ Optics.Polysemy: iscanr1Of :: forall k (is :: IxList) i s t a. (Is k A_Traversal, HasSingleIndex is i) => Optic k is s t a a -> (i -> a -> a -> a) -> s -> t
- Optics.Polysemy: iset :: (Is k A_Setter, HasSingleIndex is i) => Optic k is s t a b -> (i -> b) -> s -> t
+ Optics.Polysemy: iset :: forall k (is :: IxList) i s t a b. (Is k A_Setter, HasSingleIndex is i) => Optic k is s t a b -> (i -> b) -> s -> t
- Optics.Polysemy: iset' :: (Is k A_Setter, HasSingleIndex is i) => Optic k is s t a b -> (i -> b) -> s -> t
+ Optics.Polysemy: iset' :: forall k (is :: IxList) i s t a b. (Is k A_Setter, HasSingleIndex is i) => Optic k is s t a b -> (i -> b) -> s -> t
- Optics.Polysemy: isets :: () => ((i -> a -> b) -> s -> t) -> IxSetter i s t a b
+ Optics.Polysemy: isets :: ((i -> a -> b) -> s -> t) -> IxSetter i s t a b
- Optics.Polysemy: isingular :: (Is k A_Traversal, HasSingleIndex is i) => Optic' k is s a -> IxAffineTraversal' i s a
+ Optics.Polysemy: isingular :: forall k (is :: IxList) i s a. (Is k A_Traversal, HasSingleIndex is i) => Optic' k is s a -> IxAffineTraversal' i s a
- Optics.Polysemy: isn't :: Is k An_AffineFold => Optic' k is s a -> s -> Bool
+ Optics.Polysemy: isn't :: forall k (is :: IxList) s a. Is k An_AffineFold => Optic' k is s a -> s -> Bool
- Optics.Polysemy: iso :: () => (s -> a) -> (b -> t) -> Iso s t a b
+ Optics.Polysemy: iso :: (s -> a) -> (b -> t) -> Iso s t a b
- Optics.Polysemy: isumming :: (Is k A_Fold, Is l A_Fold, HasSingleIndex is1 i, HasSingleIndex is2 i) => Optic' k is1 s a -> Optic' l is2 s a -> IxFold i s a
+ Optics.Polysemy: isumming :: forall k l (is1 :: IxList) i (is2 :: IxList) s a. (Is k A_Fold, Is l A_Fold, HasSingleIndex is1 i, HasSingleIndex is2 i) => Optic' k is1 s a -> Optic' l is2 s a -> IxFold i s a
- Optics.Polysemy: ito :: () => (s -> (i, a)) -> IxGetter i s a
+ Optics.Polysemy: ito :: (s -> (i, a)) -> IxGetter i s a
- Optics.Polysemy: itoListOf :: (Is k A_Fold, HasSingleIndex is i) => Optic' k is s a -> s -> [(i, a)]
+ Optics.Polysemy: itoListOf :: forall k (is :: IxList) i s a. (Is k A_Fold, HasSingleIndex is i) => Optic' k is s a -> s -> [(i, a)]
- Optics.Polysemy: itraversalVL :: () => IxTraversalVL i s t a b -> IxTraversal i s t a b
+ Optics.Polysemy: itraversalVL :: IxTraversalVL i s t a b -> IxTraversal i s t a b
- Optics.Polysemy: itraverseOf :: (Is k A_Traversal, Applicative f, HasSingleIndex is i) => Optic k is s t a b -> (i -> a -> f b) -> s -> f t
+ Optics.Polysemy: itraverseOf :: forall k f (is :: IxList) i s t a b. (Is k A_Traversal, Applicative f, HasSingleIndex is i) => Optic k is s t a b -> (i -> a -> f b) -> s -> f t
- Optics.Polysemy: itraverseOf_ :: (Is k A_Fold, Applicative f, HasSingleIndex is i) => Optic' k is s a -> (i -> a -> f r) -> s -> f ()
+ Optics.Polysemy: itraverseOf_ :: forall k f (is :: IxList) i s a r. (Is k A_Fold, Applicative f, HasSingleIndex is i) => Optic' k is s a -> (i -> a -> f r) -> s -> f ()
- Optics.Polysemy: iview :: (Is k A_Getter, HasSingleIndex is i) => Optic' k is s a -> s -> (i, a)
+ Optics.Polysemy: iview :: forall k (is :: IxList) i s a. (Is k A_Getter, HasSingleIndex is i) => Optic' k is s a -> s -> (i, a)
- Optics.Polysemy: iviews :: (Is k A_Getter, HasSingleIndex is i) => Optic' k is s a -> (i -> a -> r) -> s -> r
+ Optics.Polysemy: iviews :: forall k (is :: IxList) i s a r. (Is k A_Getter, HasSingleIndex is i) => Optic' k is s a -> (i -> a -> r) -> s -> r
- Optics.Polysemy: lastOf :: Is k A_Fold => Optic' k is s a -> s -> Maybe a
+ Optics.Polysemy: lastOf :: forall k (is :: IxList) s a. Is k A_Fold => Optic' k is s a -> s -> Maybe a
- Optics.Polysemy: lengthOf :: Is k A_Fold => Optic' k is s a -> s -> Int
+ Optics.Polysemy: lengthOf :: forall k (is :: IxList) s a. Is k A_Fold => Optic' k is s a -> s -> Int
- Optics.Polysemy: lens :: () => (s -> a) -> (s -> b -> t) -> Lens s t a b
+ Optics.Polysemy: lens :: (s -> a) -> (s -> b -> t) -> Lens s t a b
- Optics.Polysemy: lensVL :: () => LensVL s t a b -> Lens s t a b
+ Optics.Polysemy: lensVL :: LensVL s t a b -> Lens s t a b
- Optics.Polysemy: lookupOf :: (Is k A_Fold, Eq a) => Optic' k is s (a, v) -> a -> s -> Maybe v
+ Optics.Polysemy: lookupOf :: forall k a (is :: IxList) s v. (Is k A_Fold, Eq a) => Optic' k is s (a, v) -> a -> s -> Maybe v
- Optics.Polysemy: magnifyMany :: (MagnifyMany m n b a, Is k A_Fold, Monoid c) => Optic' k is a b -> m c -> n c
+ Optics.Polysemy: magnifyMany :: forall k c (is :: IxList). (MagnifyMany m n b a, Is k A_Fold, Monoid c) => Optic' k is a b -> m c -> n c
- Optics.Polysemy: mapAccumLOf :: Is k A_Traversal => Optic k is s t a b -> (acc -> a -> (b, acc)) -> acc -> s -> (t, acc)
+ Optics.Polysemy: mapAccumLOf :: forall k (is :: IxList) s t a b acc. Is k A_Traversal => Optic k is s t a b -> (acc -> a -> (b, acc)) -> acc -> s -> (t, acc)
- Optics.Polysemy: mapAccumROf :: Is k A_Traversal => Optic k is s t a b -> (acc -> a -> (b, acc)) -> acc -> s -> (t, acc)
+ Optics.Polysemy: mapAccumROf :: forall k (is :: IxList) s t a b acc. Is k A_Traversal => Optic k is s t a b -> (acc -> a -> (b, acc)) -> acc -> s -> (t, acc)
- Optics.Polysemy: mapping :: (MappingOptic k f g s t a b, AcceptsEmptyIndices "mapping" is) => Optic k is s t a b -> Optic (MappedOptic k) is (f s) (g t) (f a) (g b)
+ Optics.Polysemy: mapping :: forall (is :: IxList). (MappingOptic k f g s t a b, AcceptsEmptyIndices "mapping" is) => Optic k is s t a b -> Optic (MappedOptic k) is (f s) (g t) (f a) (g b)
- Optics.Polysemy: matching :: Is k An_AffineTraversal => Optic k is s t a b -> s -> Either t a
+ Optics.Polysemy: matching :: forall k (is :: IxList) s t a b. Is k An_AffineTraversal => Optic k is s t a b -> s -> Either t a
- Optics.Polysemy: maximumByOf :: Is k A_Fold => Optic' k is s a -> (a -> a -> Ordering) -> s -> Maybe a
+ Optics.Polysemy: maximumByOf :: forall k (is :: IxList) s a. Is k A_Fold => Optic' k is s a -> (a -> a -> Ordering) -> s -> Maybe a
- Optics.Polysemy: maximumOf :: (Is k A_Fold, Ord a) => Optic' k is s a -> s -> Maybe a
+ Optics.Polysemy: maximumOf :: forall k a (is :: IxList) s. (Is k A_Fold, Ord a) => Optic' k is s a -> s -> Maybe a
- Optics.Polysemy: minimumByOf :: Is k A_Fold => Optic' k is s a -> (a -> a -> Ordering) -> s -> Maybe a
+ Optics.Polysemy: minimumByOf :: forall k (is :: IxList) s a. Is k A_Fold => Optic' k is s a -> (a -> a -> Ordering) -> s -> Maybe a
- Optics.Polysemy: minimumOf :: (Is k A_Fold, Ord a) => Optic' k is s a -> s -> Maybe a
+ Optics.Polysemy: minimumOf :: forall k a (is :: IxList) s. (Is k A_Fold, Ord a) => Optic' k is s a -> s -> Maybe a
- Optics.Polysemy: msumOf :: (Is k A_Fold, MonadPlus m) => Optic' k is s (m a) -> s -> m a
+ Optics.Polysemy: msumOf :: forall k m (is :: IxList) s a. (Is k A_Fold, MonadPlus m) => Optic' k is s (m a) -> s -> m a
- Optics.Polysemy: nearly :: () => a -> (a -> Bool) -> Prism' a ()
+ Optics.Polysemy: nearly :: a -> (a -> Bool) -> Prism' a ()
- Optics.Polysemy: noIx :: (IxOptic k s t a b, NonEmptyIndices is) => Optic k is s t a b -> Optic k NoIx s t a b
+ Optics.Polysemy: noIx :: forall (is :: IxList). (IxOptic k s t a b, NonEmptyIndices is) => Optic k is s t a b -> Optic k NoIx s t a b
- Optics.Polysemy: non' :: () => Prism' a () -> Iso' (Maybe a) a
+ Optics.Polysemy: non' :: Prism' a () -> Iso' (Maybe a) a
- Optics.Polysemy: noneOf :: Is k A_Fold => Optic' k is s a -> (a -> Bool) -> s -> Bool
+ Optics.Polysemy: noneOf :: forall k (is :: IxList) s a. Is k A_Fold => Optic' k is s a -> (a -> Bool) -> s -> Bool
- Optics.Polysemy: notElemOf :: (Is k A_Fold, Eq a) => Optic' k is s a -> a -> s -> Bool
+ Optics.Polysemy: notElemOf :: forall k a (is :: IxList) s. (Is k A_Fold, Eq a) => Optic' k is s a -> a -> s -> Bool
- Optics.Polysemy: orOf :: Is k A_Fold => Optic' k is s Bool -> s -> Bool
+ Optics.Polysemy: orOf :: forall k (is :: IxList) s. Is k A_Fold => Optic' k is s Bool -> s -> Bool
- Optics.Polysemy: over :: Is k A_Setter => Optic k is s t a b -> (a -> b) -> s -> t
+ Optics.Polysemy: over :: forall k (is :: IxList) s t a b. Is k A_Setter => Optic k is s t a b -> (a -> b) -> s -> t
- Optics.Polysemy: over' :: Is k A_Setter => Optic k is s t a b -> (a -> b) -> s -> t
+ Optics.Polysemy: over' :: forall k (is :: IxList) s t a b. Is k A_Setter => Optic k is s t a b -> (a -> b) -> s -> t
- Optics.Polysemy: partsOf :: Is k A_Traversal => Optic k is s t a a -> Lens s t [a] [a]
+ Optics.Polysemy: partsOf :: forall k (is :: IxList) s t a. Is k A_Traversal => Optic k is s t a a -> Lens s t [a] [a]
- Optics.Polysemy: passthrough :: PermeableOptic k r => Optic k is s t a b -> (a -> (r, b)) -> s -> (ViewResult k r, t)
+ Optics.Polysemy: passthrough :: forall (is :: IxList) s t a b. PermeableOptic k r => Optic k is s t a b -> (a -> (r, b)) -> s -> (ViewResult k r, t)
- Optics.Polysemy: pattern (:<) :: forall s a. Cons s s a a => () => a -> s -> s
+ Optics.Polysemy: pattern (:<) :: Cons s s a a => a -> s -> s
- Optics.Polysemy: pattern (:>) :: forall s a. Snoc s s a a => () => s -> a -> s
+ Optics.Polysemy: pattern (:>) :: Snoc s s a a => s -> a -> s
- Optics.Polysemy: pre :: Is k A_Fold => Optic' k is s a -> AffineFold s a
+ Optics.Polysemy: pre :: forall k (is :: IxList) s a. Is k A_Fold => Optic' k is s a -> AffineFold s a
- Optics.Polysemy: preview :: Is k An_AffineFold => Optic' k is s a -> s -> Maybe a
+ Optics.Polysemy: preview :: forall k (is :: IxList) s a. Is k An_AffineFold => Optic' k is s a -> s -> Maybe a
- Optics.Polysemy: previews :: Is k An_AffineFold => Optic' k is s a -> (a -> r) -> s -> Maybe r
+ Optics.Polysemy: previews :: forall k (is :: IxList) s a r. Is k An_AffineFold => Optic' k is s a -> (a -> r) -> s -> Maybe r
- Optics.Polysemy: prism :: () => (b -> t) -> (s -> Either t a) -> Prism s t a b
+ Optics.Polysemy: prism :: (b -> t) -> (s -> Either t a) -> Prism s t a b
- Optics.Polysemy: prism' :: () => (b -> s) -> (s -> Maybe a) -> Prism s s a b
+ Optics.Polysemy: prism' :: (b -> s) -> (s -> Maybe a) -> Prism s s a b
- Optics.Polysemy: productOf :: (Is k A_Fold, Num a) => Optic' k is s a -> s -> a
+ Optics.Polysemy: productOf :: forall k a (is :: IxList) s. (Is k A_Fold, Num a) => Optic' k is s a -> s -> a
- Optics.Polysemy: re :: (ReversibleOptic k, AcceptsEmptyIndices "re" is) => Optic k is s t a b -> Optic (ReversedOptic k) is b a t s
+ Optics.Polysemy: re :: forall (is :: IxList) s t a b. (ReversibleOptic k, AcceptsEmptyIndices "re" is) => Optic k is s t a b -> Optic (ReversedOptic k) is b a t s
- Optics.Polysemy: reindexed :: HasSingleIndex is i => (i -> j) -> Optic k is s t a b -> Optic k (WithIx j) s t a b
+ Optics.Polysemy: reindexed :: forall (is :: IxList) i j k s t a b. HasSingleIndex is i => (i -> j) -> Optic k is s t a b -> Optic k (WithIx j) s t a b
- Optics.Polysemy: review :: Is k A_Review => Optic' k is t b -> b -> t
+ Optics.Polysemy: review :: forall k (is :: IxList) t b. Is k A_Review => Optic' k is t b -> b -> t
- Optics.Polysemy: scanl1Of :: Is k A_Traversal => Optic k is s t a a -> (a -> a -> a) -> s -> t
+ Optics.Polysemy: scanl1Of :: forall k (is :: IxList) s t a. Is k A_Traversal => Optic k is s t a a -> (a -> a -> a) -> s -> t
- Optics.Polysemy: scanr1Of :: Is k A_Traversal => Optic k is s t a a -> (a -> a -> a) -> s -> t
+ Optics.Polysemy: scanr1Of :: forall k (is :: IxList) s t a. Is k A_Traversal => Optic k is s t a a -> (a -> a -> a) -> s -> t
- Optics.Polysemy: selfIndex :: () => IxGetter a a a
+ Optics.Polysemy: selfIndex :: IxGetter a a a
- Optics.Polysemy: sequenceOf :: (Is k A_Traversal, Applicative f) => Optic k is s t (f b) b -> s -> f t
+ Optics.Polysemy: sequenceOf :: forall k f (is :: IxList) s t b. (Is k A_Traversal, Applicative f) => Optic k is s t (f b) b -> s -> f t
- Optics.Polysemy: sequenceOf_ :: (Is k A_Fold, Applicative f) => Optic' k is s (f a) -> s -> f ()
+ Optics.Polysemy: sequenceOf_ :: forall k f (is :: IxList) s a. (Is k A_Fold, Applicative f) => Optic' k is s (f a) -> s -> f ()
- Optics.Polysemy: set :: Is k A_Setter => Optic k is s t a b -> b -> s -> t
+ Optics.Polysemy: set :: forall k (is :: IxList) s t a b. Is k A_Setter => Optic k is s t a b -> b -> s -> t
- Optics.Polysemy: set' :: Is k A_Setter => Optic k is s t a b -> b -> s -> t
+ Optics.Polysemy: set' :: forall k (is :: IxList) s t a b. Is k A_Setter => Optic k is s t a b -> b -> s -> t
- Optics.Polysemy: sets :: () => ((a -> b) -> s -> t) -> Setter s t a b
+ Optics.Polysemy: sets :: ((a -> b) -> s -> t) -> Setter s t a b
- Optics.Polysemy: simple :: () => Iso' a a
+ Optics.Polysemy: simple :: Iso' a a
- Optics.Polysemy: singular :: Is k A_Traversal => Optic' k is s a -> AffineTraversal' s a
+ Optics.Polysemy: singular :: forall k (is :: IxList) s a. Is k A_Traversal => Optic' k is s a -> AffineTraversal' s a
- Optics.Polysemy: sumOf :: (Is k A_Fold, Num a) => Optic' k is s a -> s -> a
+ Optics.Polysemy: sumOf :: forall k a (is :: IxList) s. (Is k A_Fold, Num a) => Optic' k is s a -> s -> a
- Optics.Polysemy: summing :: (Is k A_Fold, Is l A_Fold) => Optic' k is s a -> Optic' l js s a -> Fold s a
+ Optics.Polysemy: summing :: forall k l (is :: IxList) s a (js :: IxList). (Is k A_Fold, Is l A_Fold) => Optic' k is s a -> Optic' l js s a -> Fold s a
- Optics.Polysemy: to :: () => (s -> a) -> Getter s a
+ Optics.Polysemy: to :: (s -> a) -> Getter s a
- Optics.Polysemy: toIxLensVL :: (Is k A_Lens, HasSingleIndex is i) => Optic k is s t a b -> IxLensVL i s t a b
+ Optics.Polysemy: toIxLensVL :: forall k (is :: IxList) i s t a b. (Is k A_Lens, HasSingleIndex is i) => Optic k is s t a b -> IxLensVL i s t a b
- Optics.Polysemy: toLensVL :: Is k A_Lens => Optic k is s t a b -> LensVL s t a b
+ Optics.Polysemy: toLensVL :: forall k (is :: IxList) s t a b. Is k A_Lens => Optic k is s t a b -> LensVL s t a b
- Optics.Polysemy: toListOf :: Is k A_Fold => Optic' k is s a -> s -> [a]
+ Optics.Polysemy: toListOf :: forall k (is :: IxList) s a. Is k A_Fold => Optic' k is s a -> s -> [a]
- Optics.Polysemy: transposeOf :: Is k A_Traversal => Optic k is s t [a] a -> s -> [t]
+ Optics.Polysemy: transposeOf :: forall k (is :: IxList) s t a. Is k A_Traversal => Optic k is s t [a] a -> s -> [t]
- Optics.Polysemy: traversalVL :: () => TraversalVL s t a b -> Traversal s t a b
+ Optics.Polysemy: traversalVL :: TraversalVL s t a b -> Traversal s t a b
- Optics.Polysemy: traverseOf :: (Is k A_Traversal, Applicative f) => Optic k is s t a b -> (a -> f b) -> s -> f t
+ Optics.Polysemy: traverseOf :: forall k f (is :: IxList) s t a b. (Is k A_Traversal, Applicative f) => Optic k is s t a b -> (a -> f b) -> s -> f t
- Optics.Polysemy: traverseOf_ :: (Is k A_Fold, Applicative f) => Optic' k is s a -> (a -> f r) -> s -> f ()
+ Optics.Polysemy: traverseOf_ :: forall k f (is :: IxList) s a r. (Is k A_Fold, Applicative f) => Optic' k is s a -> (a -> f r) -> s -> f ()
- Optics.Polysemy: type NoIx = ([] :: [Type])
+ Optics.Polysemy: type NoIx = '[] :: [Type]
- Optics.Polysemy: type WithIx i = i : ([] :: [Type])
+ Optics.Polysemy: type WithIx i = '[i]
- Optics.Polysemy: type family Index s :: Type
+ Optics.Polysemy: type family Index s
- Optics.Polysemy: uncurried :: () => Iso (a -> b -> c) (d -> e -> f) ((a, b) -> c) ((d, e) -> f)
+ Optics.Polysemy: uncurried :: Iso (a -> b -> c) (d -> e -> f) ((a, b) -> c) ((d, e) -> f)
- Optics.Polysemy: under :: () => Iso s t a b -> (t -> s) -> b -> a
+ Optics.Polysemy: under :: Iso s t a b -> (t -> s) -> b -> a
- Optics.Polysemy: unfolded :: () => (s -> Maybe (a, s)) -> Fold s a
+ Optics.Polysemy: unfolded :: (s -> Maybe (a, s)) -> Fold s a
- Optics.Polysemy: united :: () => Lens' a ()
+ Optics.Polysemy: united :: Lens' a ()
- Optics.Polysemy: unsafeFiltered :: () => (a -> Bool) -> AffineTraversal' a a
+ Optics.Polysemy: unsafeFiltered :: (a -> Bool) -> AffineTraversal' a a
- Optics.Polysemy: unsafeFilteredBy :: Is k An_AffineFold => Optic' k is a i -> IxAffineTraversal' i a a
+ Optics.Polysemy: unsafeFilteredBy :: forall k (is :: IxList) a i. Is k An_AffineFold => Optic' k is a i -> IxAffineTraversal' i a a
- Optics.Polysemy: unto :: () => (b -> t) -> Review t b
+ Optics.Polysemy: unto :: (b -> t) -> Review t b
- Optics.Polysemy: view :: Is k A_Getter => Optic' k is s a -> s -> a
+ Optics.Polysemy: view :: forall k (is :: IxList) s a. Is k A_Getter => Optic' k is s a -> s -> a
- Optics.Polysemy: views :: Is k A_Getter => Optic' k is s a -> (a -> r) -> s -> r
+ Optics.Polysemy: views :: forall k (is :: IxList) s a r. Is k A_Getter => Optic' k is s a -> (a -> r) -> s -> r
- Optics.Polysemy: withAffineTraversal :: Is k An_AffineTraversal => Optic k is s t a b -> ((s -> Either t a) -> (s -> b -> t) -> r) -> r
+ Optics.Polysemy: withAffineTraversal :: forall k (is :: IxList) s t a b r. Is k An_AffineTraversal => Optic k is s t a b -> ((s -> Either t a) -> (s -> b -> t) -> r) -> r
- Optics.Polysemy: withIso :: () => Iso s t a b -> ((s -> a) -> (b -> t) -> r) -> r
+ Optics.Polysemy: withIso :: Iso s t a b -> ((s -> a) -> (b -> t) -> r) -> r
- Optics.Polysemy: withIxLensVL :: (Is k A_Lens, HasSingleIndex is i) => Optic k is s t a b -> (IxLensVL i s t a b -> r) -> r
+ Optics.Polysemy: withIxLensVL :: forall k (is :: IxList) i s t a b r. (Is k A_Lens, HasSingleIndex is i) => Optic k is s t a b -> (IxLensVL i s t a b -> r) -> r
- Optics.Polysemy: withLens :: Is k A_Lens => Optic k is s t a b -> ((s -> a) -> (s -> b -> t) -> r) -> r
+ Optics.Polysemy: withLens :: forall k (is :: IxList) s t a b r. Is k A_Lens => Optic k is s t a b -> ((s -> a) -> (s -> b -> t) -> r) -> r
- Optics.Polysemy: withLensVL :: Is k A_Lens => Optic k is s t a b -> (LensVL s t a b -> r) -> r
+ Optics.Polysemy: withLensVL :: forall k (is :: IxList) s t a b r. Is k A_Lens => Optic k is s t a b -> (LensVL s t a b -> r) -> r
- Optics.Polysemy: withPrism :: Is k A_Prism => Optic k is s t a b -> ((b -> t) -> (s -> Either t a) -> r) -> r
+ Optics.Polysemy: withPrism :: forall k (is :: IxList) s t a b r. Is k A_Prism => Optic k is s t a b -> ((b -> t) -> (s -> Either t a) -> r) -> r
- Optics.Polysemy: without :: (Is k A_Prism, Is l A_Prism) => Optic k is s t a b -> Optic l is u v c d -> Prism (Either s u) (Either t v) (Either a c) (Either b d)
+ Optics.Polysemy: without :: forall k l (is :: IxList) s t a b u v c d. (Is k A_Prism, Is l A_Prism) => Optic k is s t a b -> Optic l is u v c d -> Prism (Either s u) (Either t v) (Either a c) (Either b d)
Files
- polysemy-optics.cabal +6/−3
polysemy-optics.cabal view
@@ -1,7 +1,7 @@ cabal-version: 1.22 name: polysemy-optics-version: 0.1.0.0+version: 0.1.0.1 synopsis: Optics for Polysemy. description: Optics for interfacing with Reader, State, and Writer effects in Polysemy.@@ -23,9 +23,9 @@ , Optics.Polysemy.Writer reexported-modules: Optics , Optics.State.Operators- build-depends: base >=4.12 && <4.14+ build-depends: base >=4.12 && <4.15 , optics >=0.1 && <0.4- , polysemy >=0.4 && <1.4+ , polysemy >=0.4 && <1.5 , polysemy-zoo >=0.6 && <0.8 hs-source-dirs: src default-language: Haskell2010@@ -42,6 +42,9 @@ -Wno-missing-import-lists -Wno-missing-local-signatures -Wno-unsafe+ if impl(ghc >= 8.10.1)+ ghc-options: -Wno-missing-safe-haskell-mode+ -Wno-prepositive-qualified-module source-repository head type: git