Copyright | (C) 2013-2016 Edward Kmett 2015-2016 Artyom Kazak 2018 Monadfix |
---|---|
License | BSD-style (see the file LICENSE) |
Safe Haskell | Trustworthy |
Language | Haskell2010 |
Lens.Micro.GHC
Contents
Description
By importing this module you get all functions and types from microlens, as well as the following instances:
Synopsis
- module Lens.Micro
- 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
Documentation
module Lens.Micro
packedBytes :: IsByteString t => Lens' [Word8] t #
Treat a list of bytes as a strict or lazy ByteString
.
unpackedBytes :: IsByteString t => Lens' t [Word8] #
Treat a strict or lazy ByteString
as a list of bytes.
packedChars :: IsByteString t => Lens' String t #
Treat a String
as a strict or lazy ByteString
. (Note that it will garble characters above 0xFF, same as pack
does.)
unpackedChars :: IsByteString t => Lens' t String #
Treat a strict or lazy ByteString
as a String
. (Just as packedChars
, it will garble characters above 0xFF.)
chars :: IsByteString t => Traversal' t Char #
Traverse characters in a strict or lazy ByteString
(to traverse bytes instead of characters, use each
).
Orphan instances
At IntSet # | |
Ixed ByteString # | |
Methods ix :: Index ByteString -> Traversal' ByteString (IxValue ByteString) # | |
Ixed ByteString # | |
Methods ix :: Index ByteString -> Traversal' ByteString (IxValue ByteString) # | |
Ixed IntSet # | |
Methods ix :: Index IntSet -> Traversal' IntSet (IxValue IntSet) # | |
Strict ByteString ByteString # | |
Cons ByteString ByteString Word8 Word8 # | |
Cons ByteString ByteString Word8 Word8 # | |
(a ~ Word8, b ~ Word8) => Each ByteString ByteString a b # | |
(a ~ Word8, b ~ Word8) => Each ByteString ByteString a b # | |
Snoc ByteString ByteString Word8 Word8 # | |
Snoc ByteString ByteString Word8 Word8 # | |
At (IntMap a) # | |
Ord k => At (Set k) # | |
Ixed (IntMap a) # | |
Methods ix :: Index (IntMap a) -> Traversal' (IntMap a) (IxValue (IntMap a)) # | |
Ixed (Seq a) # | |
Methods ix :: Index (Seq a) -> Traversal' (Seq a) (IxValue (Seq a)) # | |
Ord k => Ixed (Set k) # | |
Methods ix :: Index (Set k) -> Traversal' (Set k) (IxValue (Set k)) # | |
Ixed (Tree a) # | |
Methods ix :: Index (Tree a) -> Traversal' (Tree a) (IxValue (Tree a)) # | |
Cons (Seq a) (Seq b) a b # | |
Each (IntMap a) (IntMap b) a b # | |
Each (Seq a) (Seq b) a b # | |
Each (Tree a) (Tree b) a b # | |
Snoc (Seq a) (Seq b) a b # | |
Ord k => At (Map k a) # | |
(IArray UArray e, Ix i) => Ixed (UArray i e) # | |
Methods ix :: Index (UArray i e) -> Traversal' (UArray i e) (IxValue (UArray i e)) # | |
Ix i => Ixed (Array i e) # | |
Methods ix :: Index (Array i e) -> Traversal' (Array i e) (IxValue (Array i e)) # | |
Ord k => Ixed (Map k a) # | |
Methods ix :: Index (Map k a) -> Traversal' (Map k a) (IxValue (Map k a)) # | |
(Ix i, IArray UArray a, IArray UArray b, i ~ j) => Each (UArray i a) (UArray j b) a b # | |
(Ix i, i ~ j) => Each (Array i a) (Array j b) a b # | |
c ~ d => Each (Map c a) (Map d b) a b # | |
Strict (StateT s m a) (StateT s m a) # | |
Strict (WriterT w m a) (WriterT w m a) # | |
Strict (RWST r w s m a) (RWST r w s m a) # | |