| 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:
atforMap,Set,IntMapandIntSetixforMap,Set,IntMapandIntSetArrayandUArraySeq- strict
ByteStringand lazyByteString Tree
eachfor the same as above, excludingSetandIntSet_head,_tail,_init,_lastforSeq- strict and lazy bytestrings
strictandlazyfor- bytestrings
StateT,WriterT,RWST
Synopsis
- 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
packedBytes :: IsByteString t => Lens' [Word8] t Source #
Treat a list of bytes as a strict or lazy ByteString.
unpackedBytes :: IsByteString t => Lens' t [Word8] Source #
Treat a strict or lazy ByteString as a list of bytes.
packedChars :: IsByteString t => Lens' String t Source #
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 Source #
Treat a strict or lazy ByteString as a String. (Just as packedChars, it will garble characters above 0xFF.)
chars :: IsByteString t => Traversal' t Char Source #
Traverse characters in a strict or lazy ByteString (to traverse bytes instead of characters, use each).
Orphan instances
| At IntSet Source # | |
Methods at :: Index IntSet -> Lens' IntSet (Maybe (IxValue IntSet)) | |
| Ixed ByteString Source # | |
Methods ix :: Index ByteString -> Traversal' ByteString (IxValue ByteString) | |
| Ixed ByteString Source # | |
Methods ix :: Index ByteString -> Traversal' ByteString (IxValue ByteString) | |
| Ixed IntSet Source # | |
Methods ix :: Index IntSet -> Traversal' IntSet (IxValue IntSet) | |
| Strict ByteString ByteString Source # | |
| Cons ByteString ByteString Word8 Word8 Source # | |
Methods _Cons :: Traversal ByteString ByteString (Word8, ByteString) (Word8, ByteString) | |
| Cons ByteString ByteString Word8 Word8 Source # | |
Methods _Cons :: Traversal ByteString ByteString (Word8, ByteString) (Word8, ByteString) | |
| (a ~ Word8, b ~ Word8) => Each ByteString ByteString a b Source # | |
Methods each :: Traversal ByteString ByteString a b | |
| (a ~ Word8, b ~ Word8) => Each ByteString ByteString a b Source # | |
Methods each :: Traversal ByteString ByteString a b | |
| Snoc ByteString ByteString Word8 Word8 Source # | |
Methods _Snoc :: Traversal ByteString ByteString (ByteString, Word8) (ByteString, Word8) | |
| Snoc ByteString ByteString Word8 Word8 Source # | |
Methods _Snoc :: Traversal ByteString ByteString (ByteString, Word8) (ByteString, Word8) | |
| At (IntMap a) Source # | |
Methods at :: Index (IntMap a) -> Lens' (IntMap a) (Maybe (IxValue (IntMap a))) | |
| Ord k => At (Set k) Source # | |
Methods at :: Index (Set k) -> Lens' (Set k) (Maybe (IxValue (Set k))) | |
| Ixed (IntMap a) Source # | |
Methods ix :: Index (IntMap a) -> Traversal' (IntMap a) (IxValue (IntMap a)) | |
| Ixed (Seq a) Source # | |
Methods ix :: Index (Seq a) -> Traversal' (Seq a) (IxValue (Seq a)) | |
| Ord k => Ixed (Set k) Source # | |
Methods ix :: Index (Set k) -> Traversal' (Set k) (IxValue (Set k)) | |
| Ixed (Tree a) Source # | |
Methods ix :: Index (Tree a) -> Traversal' (Tree a) (IxValue (Tree a)) | |
| Cons (Seq a) (Seq b) a b Source # | |
Methods _Cons :: Traversal (Seq a) (Seq b) (a, Seq a) (b, Seq b) | |
| Each (IntMap a) (IntMap b) a b Source # | |
Methods each :: Traversal (IntMap a) (IntMap b) a b | |
| Each (Seq a) (Seq b) a b Source # | |
Methods each :: Traversal (Seq a) (Seq b) a b | |
| Each (Tree a) (Tree b) a b Source # | |
Methods each :: Traversal (Tree a) (Tree b) a b | |
| Snoc (Seq a) (Seq b) a b Source # | |
Methods _Snoc :: Traversal (Seq a) (Seq b) (Seq a, a) (Seq b, b) | |
| Ord k => At (Map k a) Source # | |
Methods at :: Index (Map k a) -> Lens' (Map k a) (Maybe (IxValue (Map k a))) | |
| (IArray UArray e, Ix i) => Ixed (UArray i e) Source # | |
Methods ix :: Index (UArray i e) -> Traversal' (UArray i e) (IxValue (UArray i e)) | |
| Ix i => Ixed (Array i e) Source # | |
Methods ix :: Index (Array i e) -> Traversal' (Array i e) (IxValue (Array i e)) | |
| Ord k => Ixed (Map k a) Source # | |
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 Source # | |
Methods each :: Traversal (UArray i a) (UArray j b) a b | |
| (Ix i, i ~ j) => Each (Array i a) (Array j b) a b Source # | |
Methods each :: Traversal (Array i a) (Array j b) a b | |
| c ~ d => Each (Map c a) (Map d b) a b Source # | |
Methods each :: Traversal (Map c a) (Map d b) a b | |
| Strict (StateT s m a) (StateT s m a) Source # | |
| Strict (WriterT w m a) (WriterT w m a) Source # | |
| Strict (RWST r w s m a) (RWST r w s m a) Source # | |