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


-- | Use this package instead of <a>microlens</a> if you don't mind
--   depending on all dependencies here – <tt>Lens.Micro.GHC</tt> reexports
--   everything from <tt>Lens.Micro</tt> and additionally provides orphan
--   instances of microlens classes for packages coming with GHC
--   (<a>array</a>, <a>bytestring</a>, <a>containers</a>,
--   <a>transformers</a>).
--   
--   The minor and major versions of microlens-ghc are incremented whenever
--   the minor and major versions of microlens are incremented, so you can
--   depend on the exact version of microlens-ghc without specifying the
--   version of microlens you need.
--   
--   This package is a part of the <a>microlens</a> family; see the readme
--   <a>on Github</a>.
@package microlens-ghc
@version 0.4.15.2


module Lens.Micro.GHC.Internal
class IsByteString t

-- | Treat a list of bytes as a strict or lazy <tt>ByteString</tt>.
packedBytes :: IsByteString t => Lens' [Word8] t

-- | Treat a strict or lazy <tt>ByteString</tt> as a list of bytes.
unpackedBytes :: IsByteString t => Lens' t [Word8]

-- | Treat a <a>String</a> as a strict or lazy <tt>ByteString</tt>. (Note
--   that it will garble characters above 0xFF, same as <a>pack</a> does.)
packedChars :: IsByteString t => Lens' String t

-- | Treat a strict or lazy <tt>ByteString</tt> as a <a>String</a>. (Just
--   as <a>packedChars</a>, it will garble characters above 0xFF.)
unpackedChars :: IsByteString t => Lens' t String

-- | Traverse characters in a strict or lazy <tt>ByteString</tt> (to
--   traverse bytes instead of characters, use <a>each</a>).
chars :: IsByteString t => Traversal' t Char
unpackStrict :: ByteString -> [Word8]
unpackStrict8 :: ByteString -> String
unpackLazy :: ByteString -> [Word8]
unpackLazy8 :: ByteString -> String
fromStrict :: ByteString -> ByteString
toStrict :: ByteString -> ByteString
traversedStrictTree :: Traversal' ByteString Word8
traversedStrictTree8 :: Traversal' ByteString Char
traversedLazy :: Traversal' ByteString Word8
traversedLazy8 :: Traversal' ByteString Char
instance Lens.Micro.GHC.Internal.IsByteString Data.ByteString.Lazy.Internal.ByteString
instance Lens.Micro.GHC.Internal.IsByteString Data.ByteString.Internal.Type.ByteString


-- | By importing this module you get all functions and types from
--   <a>microlens</a>, as well as the following instances:
--   
--   <ul>
--   <li><a>at</a> for <a>Map</a>, <a>Set</a>, <a>IntMap</a> and
--   <a>IntSet</a></li>
--   <li><a>ix</a> for<ul><li><a>Map</a>, <a>Set</a>, <a>IntMap</a> and
--   <a>IntSet</a></li><li><a>Array</a> and
--   <a>UArray</a></li><li><a>Seq</a></li><li>strict <a>ByteString</a> and
--   lazy <a>ByteString</a></li><li><a>Tree</a></li></ul></li>
--   <li><a>each</a> for the same as above, excluding <a>Set</a> and
--   <a>IntSet</a></li>
--   <li><a>_head</a>, <a>_tail</a>, <a>_init</a>, <a>_last</a>
--   for<ul><li><a>Seq</a></li><li>strict and lazy
--   bytestrings</li></ul></li>
--   <li><a>strict</a> and <a>lazy</a>
--   for<ul><li>bytestrings</li><li><tt>StateT</tt>, <tt>WriterT</tt>,
--   <tt>RWST</tt></li></ul></li>
--   </ul>
module Lens.Micro.GHC
(&) :: a -> (a -> b) -> b
(<&>) :: Functor f => f a -> (a -> b) -> f b
(%~) :: 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
(.~) :: ASetter s t a b -> b -> s -> t
(<%~) :: LensLike ((,) b) s t a b -> (a -> b) -> s -> (b, t)
(<<%~) :: LensLike ((,) a) s t a b -> (a -> b) -> s -> (a, t)
(<<.~) :: LensLike ((,) a) s t a b -> b -> s -> (a, t)
(<>~) :: Monoid a => ASetter s t a a -> a -> s -> t
(?~) :: ASetter s t a (Maybe b) -> b -> s -> t
(^.) :: s -> Getting a s a -> a
(^..) :: s -> Getting (Endo [a]) s a -> [a]
(^?) :: s -> Getting (First a) s a -> Maybe a
(^?!) :: HasCallStack => s -> Getting (Endo a) s a -> a
_Just :: forall a a' f. Applicative f => (a -> f a') -> Maybe a -> f (Maybe a')
_Left :: forall a b a' f. Applicative f => (a -> f a') -> Either a b -> f (Either a' b)
_Nothing :: forall a f. Applicative f => (() -> f ()) -> Maybe a -> f (Maybe a)
_Right :: forall a b b' f. Applicative f => (b -> f b') -> Either a b -> f (Either a b')
_Show :: (Show a, Read a) => Traversal' String a
_head :: Cons s s a a => Traversal' s a
_init :: Snoc s s a a => Traversal' s s
_last :: Snoc s s a a => Traversal' s a
_tail :: Cons s s a a => Traversal' s s
allOf :: Getting All s a -> (a -> Bool) -> s -> Bool
anyOf :: Getting Any s a -> (a -> Bool) -> s -> Bool
both :: forall a b f. Applicative f => (a -> f b) -> (a, a) -> f (b, b)
cosmosOf :: Traversal a t a t -> Traversal a t a b'
failing :: Traversal s t a b -> Traversal s t a b -> Traversal s t a b
filtered :: (a -> Bool) -> Traversal' a a
folding :: Foldable f => (s -> f a) -> SimpleFold s a
forOf :: LensLike f s t a b -> s -> (a -> f b) -> f t
forOf_ :: Functor f => Getting (Traversed r f) s a -> s -> (a -> f r) -> f ()
has :: Getting Any s a -> s -> Bool
lens :: (s -> a) -> (s -> b -> t) -> Lens s t a b
lined :: Traversal' String String
mapAccumLOf :: LensLike (State acc) s t a b -> (acc -> a -> (acc, b)) -> acc -> s -> (acc, t)
mapMOf :: LensLike (WrappedMonad m) s t a b -> (a -> m b) -> s -> m t
mapped :: Functor f => ASetter (f a) (f b) a b
non :: Eq a => a -> Lens' (Maybe a) a
noneOf :: Getting Any s a -> (a -> Bool) -> s -> Bool
over :: ASetter s t a b -> (a -> b) -> s -> t
rewriteMOf :: Monad m => LensLike (WrappedMonad m) a b a b -> (b -> m (Maybe a)) -> a -> m b
rewriteOf :: ASetter a b a b -> (b -> Maybe a) -> a -> b
set :: ASetter s t a b -> b -> s -> t
singular :: HasCallStack => Traversal s t a a -> Lens s t a a
to :: (s -> a) -> SimpleGetter s a
toListOf :: Getting (Endo [a]) s a -> s -> [a]
transformMOf :: Monad m => LensLike (WrappedMonad m) a b a b -> (b -> m b) -> a -> m b
transformOf :: ASetter a b a b -> (b -> b) -> a -> b
traverseOf :: LensLike f s t a b -> (a -> f b) -> s -> f t
traverseOf_ :: Functor f => Getting (Traversed r f) s a -> (a -> f r) -> s -> f ()
worded :: Traversal' String String
foldMapOf :: Getting r s a -> (a -> r) -> s -> r
folded :: forall (f :: Type -> Type) a. Foldable f => SimpleFold (f a) a
sets :: ((a -> b) -> s -> t) -> ASetter s t a b
traversed :: forall (f :: Type -> Type) a b. Traversable f => Traversal (f a) (f b) a b
class Field1 s t a b | s -> a, t -> b, s b -> t, t a -> s
_1 :: Field1 s t a b => Lens s t a b
class Field2 s t a b | s -> a, t -> b, s b -> t, t a -> s
_2 :: Field2 s t a b => Lens s t a b
class Field3 s t a b | s -> a, t -> b, s b -> t, t a -> s
_3 :: Field3 s t a b => Lens s t a b
class Field4 s t a b | s -> a, t -> b, s b -> t, t a -> s
_4 :: Field4 s t a b => Lens s t a b
class Field5 s t a b | s -> a, t -> b, s b -> t, t a -> s
_5 :: Field5 s t a b => Lens s t a b
class Field6 s t a b | s -> a, t -> b, s b -> t, t a -> s
_6 :: Field6 s t a b => Lens s t a b
class Field7 s t a b | s -> a, t -> b, s b -> t, t a -> s
_7 :: Field7 s t a b => Lens s t a b
class Field8 s t a b | s -> a, t -> b, s b -> t, t a -> s
_8 :: Field8 s t a b => Lens s t a b
class Field9 s t a b | s -> a, t -> b, s b -> t, t a -> s
_9 :: Field9 s t a b => Lens s t a b
at :: At m => Index m -> Lens' m (Maybe (IxValue m))
each :: Each s t a b => Traversal s t a b
ix :: Ixed m => Index m -> Traversal' m (IxValue m)
lazy :: Strict lazy strict => Lens' strict lazy
strict :: Strict lazy strict => Lens' lazy strict
type ASetter s t a b = a -> Identity b -> s -> Identity t
type ASetter' s a = ASetter s s a a
type Getting r s a = a -> Const r a -> s -> Const r s
type Lens s t a b = forall (f :: Type -> Type). Functor f => a -> f b -> s -> f t
type Lens' s a = Lens s s a a
type LensLike (f :: Type -> Type) s t a b = a -> f b -> s -> f t
type LensLike' (f :: Type -> Type) s a = LensLike f s s a a
type SimpleFold s a = forall r. Monoid r => Getting r s a
type SimpleGetter s a = forall r. () => Getting r s a
type Traversal s t a b = forall (f :: Type -> Type). Applicative f => a -> f b -> s -> f t
type Traversal' s a = Traversal s s a a

-- | Treat a list of bytes as a strict or lazy <tt>ByteString</tt>.
packedBytes :: IsByteString t => Lens' [Word8] t

-- | Treat a strict or lazy <tt>ByteString</tt> as a list of bytes.
unpackedBytes :: IsByteString t => Lens' t [Word8]

-- | Treat a <a>String</a> as a strict or lazy <tt>ByteString</tt>. (Note
--   that it will garble characters above 0xFF, same as <a>pack</a> does.)
packedChars :: IsByteString t => Lens' String t

-- | Treat a strict or lazy <tt>ByteString</tt> as a <a>String</a>. (Just
--   as <a>packedChars</a>, it will garble characters above 0xFF.)
unpackedChars :: IsByteString t => Lens' t String

-- | Traverse characters in a strict or lazy <tt>ByteString</tt> (to
--   traverse bytes instead of characters, use <a>each</a>).
chars :: IsByteString t => Traversal' t Char
instance Lens.Micro.Internal.At (Data.IntMap.Internal.IntMap a)
instance Lens.Micro.Internal.At Data.IntSet.Internal.IntSet
instance GHC.Classes.Ord k => Lens.Micro.Internal.At (Data.Map.Internal.Map k a)
instance GHC.Classes.Ord k => Lens.Micro.Internal.At (Data.Set.Internal.Set k)
instance Lens.Micro.Internal.Cons Data.ByteString.Lazy.Internal.ByteString Data.ByteString.Lazy.Internal.ByteString GHC.Internal.Word.Word8 GHC.Internal.Word.Word8
instance Lens.Micro.Internal.Cons Data.ByteString.Internal.Type.ByteString Data.ByteString.Internal.Type.ByteString GHC.Internal.Word.Word8 GHC.Internal.Word.Word8
instance Lens.Micro.Internal.Cons (Data.Sequence.Internal.Seq a) (Data.Sequence.Internal.Seq b) a b
instance (GHC.Internal.Ix.Ix i, i GHC.Types.~ j) => Lens.Micro.Internal.Each (GHC.Internal.Arr.Array i a) (GHC.Internal.Arr.Array j b) a b
instance (a GHC.Types.~ GHC.Internal.Word.Word8, b GHC.Types.~ GHC.Internal.Word.Word8) => Lens.Micro.Internal.Each Data.ByteString.Lazy.Internal.ByteString Data.ByteString.Lazy.Internal.ByteString a b
instance (a GHC.Types.~ GHC.Internal.Word.Word8, b GHC.Types.~ GHC.Internal.Word.Word8) => Lens.Micro.Internal.Each Data.ByteString.Internal.Type.ByteString Data.ByteString.Internal.Type.ByteString a b
instance Lens.Micro.Internal.Each (Data.IntMap.Internal.IntMap a) (Data.IntMap.Internal.IntMap b) a b
instance (c GHC.Types.~ d) => Lens.Micro.Internal.Each (Data.Map.Internal.Map c a) (Data.Map.Internal.Map d b) a b
instance Lens.Micro.Internal.Each (Data.Sequence.Internal.Seq a) (Data.Sequence.Internal.Seq b) a b
instance Lens.Micro.Internal.Each (Data.Tree.Tree a) (Data.Tree.Tree b) a b
instance (GHC.Internal.Ix.Ix i, Data.Array.Base.IArray Data.Array.Base.UArray a, Data.Array.Base.IArray Data.Array.Base.UArray b, i GHC.Types.~ j) => Lens.Micro.Internal.Each (Data.Array.Base.UArray i a) (Data.Array.Base.UArray j b) a b
instance GHC.Internal.Ix.Ix i => Lens.Micro.Internal.Ixed (GHC.Internal.Arr.Array i e)
instance Lens.Micro.Internal.Ixed Data.ByteString.Lazy.Internal.ByteString
instance Lens.Micro.Internal.Ixed Data.ByteString.Internal.Type.ByteString
instance Lens.Micro.Internal.Ixed (Data.IntMap.Internal.IntMap a)
instance Lens.Micro.Internal.Ixed Data.IntSet.Internal.IntSet
instance GHC.Classes.Ord k => Lens.Micro.Internal.Ixed (Data.Map.Internal.Map k a)
instance Lens.Micro.Internal.Ixed (Data.Sequence.Internal.Seq a)
instance GHC.Classes.Ord k => Lens.Micro.Internal.Ixed (Data.Set.Internal.Set k)
instance Lens.Micro.Internal.Ixed (Data.Tree.Tree a)
instance (Data.Array.Base.IArray Data.Array.Base.UArray e, GHC.Internal.Ix.Ix i) => Lens.Micro.Internal.Ixed (Data.Array.Base.UArray i e)
instance Lens.Micro.Internal.Snoc Data.ByteString.Lazy.Internal.ByteString Data.ByteString.Lazy.Internal.ByteString GHC.Internal.Word.Word8 GHC.Internal.Word.Word8
instance Lens.Micro.Internal.Snoc Data.ByteString.Internal.Type.ByteString Data.ByteString.Internal.Type.ByteString GHC.Internal.Word.Word8 GHC.Internal.Word.Word8
instance Lens.Micro.Internal.Snoc (Data.Sequence.Internal.Seq a) (Data.Sequence.Internal.Seq b) a b
instance Lens.Micro.Internal.Strict Data.ByteString.Lazy.Internal.ByteString Data.ByteString.Internal.Type.ByteString
instance Lens.Micro.Internal.Strict (Control.Monad.Trans.RWS.Lazy.RWST r w s m a) (Control.Monad.Trans.RWS.Strict.RWST r w s m a)
instance Lens.Micro.Internal.Strict (Control.Monad.Trans.State.Lazy.StateT s m a) (Control.Monad.Trans.State.Strict.StateT s m a)
instance Lens.Micro.Internal.Strict (Control.Monad.Trans.Writer.Lazy.WriterT w m a) (Control.Monad.Trans.Writer.Strict.WriterT w m a)
