-- Hoogle documentation, generated by Haddock
-- See Hoogle, http://www.haskell.org/hoogle/


-- | microlens + all batteries included (best for apps)
--   
--   This package exports a module which is the recommended starting point
--   for using <a>microlens</a> if you aren't trying to keep your
--   dependencies minimal. By importing <tt>Lens.Micro.Platform</tt> you
--   get all functions and instances from <a>microlens</a>,
--   <a>microlens-th</a>, <a>microlens-mtl</a>, <a>microlens-ghc</a>, as
--   well as instances for <tt>Vector</tt>, <tt>Text</tt>, and
--   <tt>HashMap</tt>.
--   
--   The minor and major versions of microlens-platform are incremented
--   whenever the minor and major versions of any other microlens package
--   are incremented, so you can depend on the exact version of
--   microlens-platform without specifying the version of microlens
--   (microlens-mtl, etc) you need.
--   
--   This package is a part of the <a>microlens</a> family; see the readme
--   <a>on Github</a>.
@package microlens-platform
@version 0.4.4.1


module Lens.Micro.Platform.Internal
class IsText t

-- | <a>packed</a> lets you convert between <a>String</a> and <tt>Text</tt>
--   (strict or lazy). It can be used as a replacement for <tt>pack</tt> or
--   as a way to modify some <a>String</a> if you have a function like
--   <tt>Text -&gt; Text</tt>.
packed :: IsText t => Lens' String t

-- | <a>unpacked</a> is like <a>packed</a> but works in the opposite
--   direction.
unpacked :: IsText t => Lens' t String
instance Lens.Micro.Platform.Internal.IsText GHC.Internal.Base.String
instance Lens.Micro.Platform.Internal.IsText Data.Text.Internal.Lazy.Text
instance Lens.Micro.Platform.Internal.IsText Data.Text.Internal.Text


-- | This module is an approximation for <tt><a>Control.Lens</a></tt> from
--   <a>lens</a>; by importing it you get all functions and instances from
--   <a>microlens</a>, <a>microlens-mtl</a>, <a>microlens-ghc</a>, as well
--   as the following instances:
--   
--   <ul>
--   <li><a>at</a> for <a>HashMap</a></li>
--   <li><a>each</a> and <a>ix</a>
--   for<ul><li><a>HashMap</a></li><li><a>Vector</a> and variants (unboxed
--   vectors, etc)</li><li>strict <a>Text</a> and lazy
--   <a>Text</a></li></ul></li>
--   <li><a>_head</a>, <a>_tail</a>, <a>_init</a>, <a>_last</a>
--   for<ul><li><a>Vector</a> and variants</li><li>strict and lazy
--   <tt>Text</tt></li></ul></li>
--   <li><a>strict</a> and <a>lazy</a> for <tt>Text</tt></li>
--   </ul>
module Lens.Micro.Platform
lazy :: Strict lazy strict => Lens' strict lazy
strict :: Strict lazy strict => Lens' lazy strict

-- | Flipped version of <a>&lt;$&gt;</a>.
--   
--   <pre>
--   (<a>&lt;&amp;&gt;</a>) = <a>flip</a> <a>fmap</a>
--   </pre>
--   
--   <h4><b>Examples</b></h4>
--   
--   Apply <tt>(+1)</tt> to a list, a <a>Just</a> and a <a>Right</a>:
--   
--   <pre>
--   &gt;&gt;&gt; Just 2 &lt;&amp;&gt; (+1)
--   Just 3
--   </pre>
--   
--   <pre>
--   &gt;&gt;&gt; [1,2,3] &lt;&amp;&gt; (+1)
--   [2,3,4]
--   </pre>
--   
--   <pre>
--   &gt;&gt;&gt; Right 3 &lt;&amp;&gt; (+1)
--   Right 4
--   </pre>
(<&>) :: Functor f => f a -> (a -> b) -> f b
infixl 1 <&>

-- | <a>&amp;</a> is a reverse application operator. This provides
--   notational convenience. Its precedence is one higher than that of the
--   forward application operator <a>$</a>, which allows <a>&amp;</a> to be
--   nested in <a>$</a>.
--   
--   This is a version of <tt><a>flip</a> <a>id</a></tt>, where <a>id</a>
--   is specialized from <tt>a -&gt; a</tt> to <tt>(a -&gt; b) -&gt; (a
--   -&gt; b)</tt> which by the associativity of <tt>(-&gt;)</tt> is <tt>(a
--   -&gt; b) -&gt; a -&gt; b</tt>. flipping this yields <tt>a -&gt; (a
--   -&gt; b) -&gt; b</tt> which is the type signature of <a>&amp;</a>
--   
--   <h4><b>Examples</b></h4>
--   
--   <pre>
--   &gt;&gt;&gt; 5 &amp; (+1) &amp; show
--   "6"
--   </pre>
--   
--   <pre>
--   &gt;&gt;&gt; sqrt $ [1 / n^2 | n &lt;- [1..1000]] &amp; sum &amp; (*6)
--   3.1406380562059946
--   </pre>
(&) :: a -> (a -> b) -> b
infixl 1 &
to :: (s -> a) -> SimpleGetter s a
(<<%~) :: LensLike ((,) a) s t a b -> (a -> b) -> s -> (a, t)
(^.) :: s -> Getting a s a -> a
(^..) :: s -> Getting (Endo [a]) s a -> [a]
(^?) :: s -> Getting (First a) s a -> Maybe a
(.~) :: ASetter s t a b -> b -> s -> t
(?~) :: ASetter s t a (Maybe b) -> b -> s -> t
non :: Eq a => a -> Lens' (Maybe a) a
type LensLike' (f :: Type -> Type) s a = LensLike f s s a a
type LensLike (f :: Type -> Type) s t a b = a -> f b -> s -> f t
type Traversal' s a = Traversal s s a a
type Traversal s t a b = forall (f :: Type -> Type). Applicative f => a -> f b -> s -> f t
type Lens' s a = Lens s s a a
type Lens s t a b = forall (f :: Type -> Type). Functor f => a -> f b -> s -> f t
type SimpleFold s a = forall r. Monoid r => Getting r s a
type Getting r s a = a -> Const r a -> s -> Const r s
type SimpleGetter s a = forall r. () => Getting r s a
type ASetter' s a = ASetter s s a a
type ASetter s t a b = a -> Identity b -> s -> Identity t
_5 :: Field5 s t a b => Lens s t a b
_4 :: Field4 s t a b => Lens s t a b
_3 :: Field3 s t a b => Lens s t a b
_2 :: Field2 s t a b => Lens s t a b
_1 :: Field1 s t a b => Lens s t a b
at :: At m => Index m -> Lens' m (Maybe (IxValue m))
ix :: Ixed m => Index m -> Traversal' m (IxValue m)
each :: Each s t a b => Traversal s t a b
traversed :: forall (f :: Type -> Type) a b. Traversable f => Traversal (f a) (f b) a b
folded :: forall (f :: Type -> Type) a. Foldable f => SimpleFold (f a) a
foldMapOf :: Getting r s a -> (a -> r) -> s -> r
sets :: ((a -> b) -> s -> t) -> ASetter s t a b
(%~) :: ASetter s t a b -> (a -> b) -> s -> t
over :: ASetter s t a b -> (a -> b) -> s -> t
(+~) :: Num a => ASetter s t a a -> a -> s -> t
(-~) :: Num a => ASetter s t a a -> a -> s -> t
(<>~) :: Monoid a => ASetter s t a a -> a -> s -> t
set :: ASetter s t a b -> b -> s -> t
mapped :: Functor f => ASetter (f a) (f b) a b
mapMOf :: LensLike (WrappedMonad m) s t a b -> (a -> m b) -> s -> m t
(<%~) :: LensLike ((,) b) s t a b -> (a -> b) -> s -> (b, t)
(<<.~) :: LensLike ((,) a) s t a b -> b -> s -> (a, t)
rewriteOf :: ASetter a b a b -> (b -> Maybe a) -> a -> b
rewriteMOf :: Monad m => LensLike (WrappedMonad m) a b a b -> (b -> m (Maybe a)) -> a -> m b
transformOf :: ASetter a b a b -> (b -> b) -> a -> b
transformMOf :: Monad m => LensLike (WrappedMonad m) a b a b -> (b -> m b) -> a -> m b
toListOf :: Getting (Endo [a]) s a -> s -> [a]
(^?!) :: HasCallStack => s -> Getting (Endo a) s a -> a
traverseOf_ :: Functor f => Getting (Traversed r f) s a -> (a -> f r) -> s -> f ()
forOf_ :: Functor f => Getting (Traversed r f) s a -> s -> (a -> f r) -> f ()
has :: Getting Any s a -> s -> Bool
folding :: Foldable f => (s -> f a) -> SimpleFold s a
anyOf :: Getting Any s a -> (a -> Bool) -> s -> Bool
allOf :: Getting All s a -> (a -> Bool) -> s -> Bool
noneOf :: Getting Any s a -> (a -> Bool) -> s -> Bool
lens :: (s -> a) -> (s -> b -> t) -> Lens s t a b
traverseOf :: LensLike f s t a b -> (a -> f b) -> s -> f t
forOf :: LensLike f s t a b -> s -> (a -> f b) -> f t
singular :: HasCallStack => Traversal s t a a -> Lens s t a a
failing :: Traversal s t a b -> Traversal s t a b -> Traversal s t a b
filtered :: (a -> Bool) -> Traversal' a a
both :: forall a b f. Applicative f => (a -> f b) -> (a, a) -> f (b, b)
_head :: Cons s s a a => Traversal' s a
_tail :: Cons s s a a => Traversal' s s
_init :: Snoc s s a a => Traversal' s s
_last :: Snoc s s a a => Traversal' s a
mapAccumLOf :: LensLike (State acc) s t a b -> (acc -> a -> (acc, b)) -> acc -> s -> (acc, t)
worded :: Traversal' String String
lined :: Traversal' String String
cosmosOf :: Traversal a t a t -> Traversal a t a b'
_Left :: forall a b a' f. Applicative f => (a -> f a') -> Either a b -> f (Either a' b)
_Right :: forall a b b' f. Applicative f => (b -> f b') -> Either a b -> f (Either a b')
_Just :: forall a a' f. Applicative f => (a -> f a') -> Maybe a -> f (Maybe a')
_Nothing :: forall a f. Applicative f => (() -> f ()) -> Maybe a -> f (Maybe a)
_Show :: (Show a, Read a) => Traversal' String a
lazy :: Strict lazy strict => Lens' strict lazy
strict :: Strict lazy strict => Lens' lazy strict

-- | Flipped version of <a>&lt;$&gt;</a>.
--   
--   <pre>
--   (<a>&lt;&amp;&gt;</a>) = <a>flip</a> <a>fmap</a>
--   </pre>
--   
--   <h4><b>Examples</b></h4>
--   
--   Apply <tt>(+1)</tt> to a list, a <a>Just</a> and a <a>Right</a>:
--   
--   <pre>
--   &gt;&gt;&gt; Just 2 &lt;&amp;&gt; (+1)
--   Just 3
--   </pre>
--   
--   <pre>
--   &gt;&gt;&gt; [1,2,3] &lt;&amp;&gt; (+1)
--   [2,3,4]
--   </pre>
--   
--   <pre>
--   &gt;&gt;&gt; Right 3 &lt;&amp;&gt; (+1)
--   Right 4
--   </pre>
(<&>) :: Functor f => f a -> (a -> b) -> f b
infixl 1 <&>

-- | <a>&amp;</a> is a reverse application operator. This provides
--   notational convenience. Its precedence is one higher than that of the
--   forward application operator <a>$</a>, which allows <a>&amp;</a> to be
--   nested in <a>$</a>.
--   
--   This is a version of <tt><a>flip</a> <a>id</a></tt>, where <a>id</a>
--   is specialized from <tt>a -&gt; a</tt> to <tt>(a -&gt; b) -&gt; (a
--   -&gt; b)</tt> which by the associativity of <tt>(-&gt;)</tt> is <tt>(a
--   -&gt; b) -&gt; a -&gt; b</tt>. flipping this yields <tt>a -&gt; (a
--   -&gt; b) -&gt; b</tt> which is the type signature of <a>&amp;</a>
--   
--   <h4><b>Examples</b></h4>
--   
--   <pre>
--   &gt;&gt;&gt; 5 &amp; (+1) &amp; show
--   "6"
--   </pre>
--   
--   <pre>
--   &gt;&gt;&gt; sqrt $ [1 / n^2 | n &lt;- [1..1000]] &amp; sum &amp; (*6)
--   3.1406380562059946
--   </pre>
(&) :: a -> (a -> b) -> b
infixl 1 &
to :: (s -> a) -> SimpleGetter s a
(<<%~) :: LensLike ((,) a) s t a b -> (a -> b) -> s -> (a, t)
(^.) :: s -> Getting a s a -> a
(^..) :: s -> Getting (Endo [a]) s a -> [a]
(^?) :: s -> Getting (First a) s a -> Maybe a
(.~) :: ASetter s t a b -> b -> s -> t
(?~) :: ASetter s t a (Maybe b) -> b -> s -> t
non :: Eq a => a -> Lens' (Maybe a) a
type LensLike' (f :: Type -> Type) s a = LensLike f s s a a
type LensLike (f :: Type -> Type) s t a b = a -> f b -> s -> f t
type Traversal' s a = Traversal s s a a
type Traversal s t a b = forall (f :: Type -> Type). Applicative f => a -> f b -> s -> f t
type Lens' s a = Lens s s a a
type Lens s t a b = forall (f :: Type -> Type). Functor f => a -> f b -> s -> f t
type SimpleFold s a = forall r. Monoid r => Getting r s a
type Getting r s a = a -> Const r a -> s -> Const r s
type SimpleGetter s a = forall r. () => Getting r s a
type ASetter' s a = ASetter s s a a
type ASetter s t a b = a -> Identity b -> s -> Identity t
_5 :: Field5 s t a b => Lens s t a b
_4 :: Field4 s t a b => Lens s t a b
_3 :: Field3 s t a b => Lens s t a b
_2 :: Field2 s t a b => Lens s t a b
_1 :: Field1 s t a b => Lens s t a b
at :: At m => Index m -> Lens' m (Maybe (IxValue m))
ix :: Ixed m => Index m -> Traversal' m (IxValue m)
each :: Each s t a b => Traversal s t a b
traversed :: forall (f :: Type -> Type) a b. Traversable f => Traversal (f a) (f b) a b
folded :: forall (f :: Type -> Type) a. Foldable f => SimpleFold (f a) a
foldMapOf :: Getting r s a -> (a -> r) -> s -> r
sets :: ((a -> b) -> s -> t) -> ASetter s t a b
(%~) :: ASetter s t a b -> (a -> b) -> s -> t
over :: ASetter s t a b -> (a -> b) -> s -> t
(+~) :: Num a => ASetter s t a a -> a -> s -> t
(-~) :: Num a => ASetter s t a a -> a -> s -> t
(<>~) :: Monoid a => ASetter s t a a -> a -> s -> t
set :: ASetter s t a b -> b -> s -> t
mapped :: Functor f => ASetter (f a) (f b) a b
mapMOf :: LensLike (WrappedMonad m) s t a b -> (a -> m b) -> s -> m t
(<%~) :: LensLike ((,) b) s t a b -> (a -> b) -> s -> (b, t)
(<<.~) :: LensLike ((,) a) s t a b -> b -> s -> (a, t)
rewriteOf :: ASetter a b a b -> (b -> Maybe a) -> a -> b
rewriteMOf :: Monad m => LensLike (WrappedMonad m) a b a b -> (b -> m (Maybe a)) -> a -> m b
transformOf :: ASetter a b a b -> (b -> b) -> a -> b
transformMOf :: Monad m => LensLike (WrappedMonad m) a b a b -> (b -> m b) -> a -> m b
toListOf :: Getting (Endo [a]) s a -> s -> [a]
(^?!) :: HasCallStack => s -> Getting (Endo a) s a -> a
traverseOf_ :: Functor f => Getting (Traversed r f) s a -> (a -> f r) -> s -> f ()
forOf_ :: Functor f => Getting (Traversed r f) s a -> s -> (a -> f r) -> f ()
has :: Getting Any s a -> s -> Bool
folding :: Foldable f => (s -> f a) -> SimpleFold s a
anyOf :: Getting Any s a -> (a -> Bool) -> s -> Bool
allOf :: Getting All s a -> (a -> Bool) -> s -> Bool
noneOf :: Getting Any s a -> (a -> Bool) -> s -> Bool
lens :: (s -> a) -> (s -> b -> t) -> Lens s t a b
traverseOf :: LensLike f s t a b -> (a -> f b) -> s -> f t
forOf :: LensLike f s t a b -> s -> (a -> f b) -> f t
singular :: HasCallStack => Traversal s t a a -> Lens s t a a
failing :: Traversal s t a b -> Traversal s t a b -> Traversal s t a b
filtered :: (a -> Bool) -> Traversal' a a
both :: forall a b f. Applicative f => (a -> f b) -> (a, a) -> f (b, b)
_head :: Cons s s a a => Traversal' s a
_tail :: Cons s s a a => Traversal' s s
_init :: Snoc s s a a => Traversal' s s
_last :: Snoc s s a a => Traversal' s a
mapAccumLOf :: LensLike (State acc) s t a b -> (acc -> a -> (acc, b)) -> acc -> s -> (acc, t)
worded :: Traversal' String String
lined :: Traversal' String String
cosmosOf :: Traversal a t a t -> Traversal a t a b'
_Left :: forall a b a' f. Applicative f => (a -> f a') -> Either a b -> f (Either a' b)
_Right :: forall a b b' f. Applicative f => (b -> f b') -> Either a b -> f (Either a b')
_Just :: forall a a' f. Applicative f => (a -> f a') -> Maybe a -> f (Maybe a')
_Nothing :: forall a f. Applicative f => (() -> f ()) -> Maybe a -> f (Maybe a)
_Show :: (Show a, Read a) => Traversal' String a
packedBytes :: IsByteString t => Lens' [Word8] t
unpackedBytes :: IsByteString t => Lens' t [Word8]
packedChars :: IsByteString t => Lens' String t
unpackedChars :: IsByteString t => Lens' t String
chars :: IsByteString t => Traversal' t Char
view :: MonadReader s m => Getting a s a -> m a
preview :: MonadReader s m => Getting (First a) s a -> m (Maybe a)
(+=) :: (MonadState s m, Num a) => ASetter s s a a -> a -> m ()
use :: MonadState s m => Getting a s a -> m a
(.=) :: MonadState s m => ASetter s s a b -> b -> m ()
magnify :: Magnify m n b a => LensLike' (Magnified m c) a b -> m c -> n c
zoom :: Zoom m n s t => LensLike' (Zoomed m c) t s -> m c -> n c
type family Zoomed (m :: Type -> Type) :: Type -> Type -> Type
preuse :: MonadState s m => Getting (First a) s a -> m (Maybe a)
(&~) :: s -> State s a -> s
assign :: MonadState s m => ASetter s s a b -> b -> m ()
(?=) :: MonadState s m => ASetter s s a (Maybe b) -> b -> m ()
(<~) :: MonadState s m => ASetter s s a b -> m b -> m ()
(%=) :: MonadState s m => ASetter s s a b -> (a -> b) -> m ()
modifying :: MonadState s m => ASetter s s a b -> (a -> b) -> m ()
(-=) :: (MonadState s m, Num a) => ASetter s s a a -> a -> m ()
(*=) :: (MonadState s m, Num a) => ASetter s s a a -> a -> m ()
(//=) :: (MonadState s m, Fractional a) => ASetter s s a a -> a -> m ()
(<%=) :: MonadState s m => LensLike ((,) b) s s a b -> (a -> b) -> m b
(<<%=) :: MonadState s m => LensLike ((,) a) s s a b -> (a -> b) -> m a
(<<.=) :: MonadState s m => LensLike ((,) a) s s a b -> b -> m a
(<.=) :: MonadState s m => LensLike ((,) b) s s a b -> b -> m b
(<?=) :: MonadState s m => LensLike ((,) b) s s a (Maybe b) -> b -> m b
data DefName
TopName :: Name -> DefName
MethodName :: Name -> Name -> DefName
data LensRules
makeLenses :: Name -> DecsQ
makeLensesFor :: [(String, String)] -> Name -> DecsQ
makeLensesWith :: LensRules -> Name -> DecsQ
makeFields :: Name -> DecsQ
makeClassy :: Name -> DecsQ
simpleLenses :: Lens' LensRules Bool
generateSignatures :: Lens' LensRules Bool
generateUpdateableOptics :: Lens' LensRules Bool
generateLazyPatterns :: Lens' LensRules Bool
lensField :: Lens' LensRules (Name -> [Name] -> Name -> [DefName])
lensClass :: Lens' LensRules (Name -> Maybe (Name, Name))
createClass :: Lens' LensRules Bool
lensRules :: LensRules
lensRulesFor :: [(String, String)] -> LensRules
camelCaseFields :: LensRules
abbreviatedFields :: LensRules
classyRules :: LensRules

-- | <a>packed</a> lets you convert between <a>String</a> and <tt>Text</tt>
--   (strict or lazy). It can be used as a replacement for <tt>pack</tt> or
--   as a way to modify some <a>String</a> if you have a function like
--   <tt>Text -&gt; Text</tt>.
packed :: IsText t => Lens' String t

-- | <a>unpacked</a> is like <a>packed</a> but works in the opposite
--   direction.
unpacked :: IsText t => Lens' t String
instance (GHC.Classes.Eq k, Data.Hashable.Class.Hashable k) => Lens.Micro.Internal.At (Data.HashMap.Internal.HashMap k a)
instance (GHC.Classes.Eq k, Data.Hashable.Class.Hashable k) => Lens.Micro.Internal.At (Data.HashSet.Internal.HashSet k)
instance Lens.Micro.Internal.Cons Data.Text.Internal.Lazy.Text Data.Text.Internal.Lazy.Text GHC.Types.Char GHC.Types.Char
instance Lens.Micro.Internal.Cons Data.Text.Internal.Text Data.Text.Internal.Text GHC.Types.Char GHC.Types.Char
instance (Data.Vector.Unboxed.Base.Unbox a, Data.Vector.Unboxed.Base.Unbox b) => Lens.Micro.Internal.Cons (Data.Vector.Unboxed.Base.Vector a) (Data.Vector.Unboxed.Base.Vector b) a b
instance (GHC.Internal.Foreign.Storable.Storable a, GHC.Internal.Foreign.Storable.Storable b) => Lens.Micro.Internal.Cons (Data.Vector.Storable.Vector a) (Data.Vector.Storable.Vector b) a b
instance (Data.Primitive.Types.Prim a, Data.Primitive.Types.Prim b) => Lens.Micro.Internal.Cons (Data.Vector.Primitive.Vector a) (Data.Vector.Primitive.Vector b) a b
instance Lens.Micro.Internal.Cons (Data.Vector.Vector a) (Data.Vector.Vector b) a b
instance (c GHC.Types.~ d) => Lens.Micro.Internal.Each (Data.HashMap.Internal.HashMap c a) (Data.HashMap.Internal.HashMap d b) a b
instance (a GHC.Types.~ GHC.Types.Char, b GHC.Types.~ GHC.Types.Char) => Lens.Micro.Internal.Each Data.Text.Internal.Lazy.Text Data.Text.Internal.Lazy.Text a b
instance (a GHC.Types.~ GHC.Types.Char, b GHC.Types.~ GHC.Types.Char) => Lens.Micro.Internal.Each Data.Text.Internal.Text Data.Text.Internal.Text a b
instance (Data.Vector.Unboxed.Base.Unbox a, Data.Vector.Unboxed.Base.Unbox b) => Lens.Micro.Internal.Each (Data.Vector.Unboxed.Base.Vector a) (Data.Vector.Unboxed.Base.Vector b) a b
instance (GHC.Internal.Foreign.Storable.Storable a, GHC.Internal.Foreign.Storable.Storable b) => Lens.Micro.Internal.Each (Data.Vector.Storable.Vector a) (Data.Vector.Storable.Vector b) a b
instance (Data.Primitive.Types.Prim a, Data.Primitive.Types.Prim b) => Lens.Micro.Internal.Each (Data.Vector.Primitive.Vector a) (Data.Vector.Primitive.Vector b) a b
instance Lens.Micro.Internal.Each (Data.Vector.Vector a) (Data.Vector.Vector b) a b
instance (GHC.Classes.Eq k, Data.Hashable.Class.Hashable k) => Lens.Micro.Internal.Ixed (Data.HashMap.Internal.HashMap k a)
instance (GHC.Classes.Eq k, Data.Hashable.Class.Hashable k) => Lens.Micro.Internal.Ixed (Data.HashSet.Internal.HashSet k)
instance Lens.Micro.Internal.Ixed Data.Text.Internal.Lazy.Text
instance Lens.Micro.Internal.Ixed Data.Text.Internal.Text
instance Data.Vector.Unboxed.Base.Unbox a => Lens.Micro.Internal.Ixed (Data.Vector.Unboxed.Base.Vector a)
instance GHC.Internal.Foreign.Storable.Storable a => Lens.Micro.Internal.Ixed (Data.Vector.Storable.Vector a)
instance Data.Primitive.Types.Prim a => Lens.Micro.Internal.Ixed (Data.Vector.Primitive.Vector a)
instance Lens.Micro.Internal.Ixed (Data.Vector.Vector a)
instance Lens.Micro.Internal.Snoc Data.Text.Internal.Lazy.Text Data.Text.Internal.Lazy.Text GHC.Types.Char GHC.Types.Char
instance Lens.Micro.Internal.Snoc Data.Text.Internal.Text Data.Text.Internal.Text GHC.Types.Char GHC.Types.Char
instance (Data.Vector.Unboxed.Base.Unbox a, Data.Vector.Unboxed.Base.Unbox b) => Lens.Micro.Internal.Snoc (Data.Vector.Unboxed.Base.Vector a) (Data.Vector.Unboxed.Base.Vector b) a b
instance (GHC.Internal.Foreign.Storable.Storable a, GHC.Internal.Foreign.Storable.Storable b) => Lens.Micro.Internal.Snoc (Data.Vector.Storable.Vector a) (Data.Vector.Storable.Vector b) a b
instance (Data.Primitive.Types.Prim a, Data.Primitive.Types.Prim b) => Lens.Micro.Internal.Snoc (Data.Vector.Primitive.Vector a) (Data.Vector.Primitive.Vector b) a b
instance Lens.Micro.Internal.Snoc (Data.Vector.Vector a) (Data.Vector.Vector b) a b
instance Lens.Micro.Internal.Strict Data.Text.Internal.Lazy.Text Data.Text.Internal.Text
