Safe Haskell	Trustworthy
Language	Haskell2010

Lens.Micro.GHC

Contents

Orphan instances

Description

By importing this module you get all functions and types from microlens, as well as the following instances:

at for Map and IntMap
each and ix for
- Map and IntMap
- Array and UArray
- Seq
- strict ByteString and lazy ByteString
- Tree
_head, _tail, _init, _last for
- Seq
- strict and lazy bytestrings

Documentation

module Lens.Micro

Orphan instances

Ixed ByteString Source #
Methods ix :: Index ByteString -> Traversal' ByteString (IxValue ByteString) #
Ixed ByteString Source #
Methods ix :: Index ByteString -> Traversal' ByteString (IxValue 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 #
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) #
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) #
Ixed (IntMap a) Source #
Methods ix :: Index (IntMap a) -> Traversal' (IntMap a) (IxValue (IntMap a)) #
Ixed (Tree a) Source #
Methods ix :: Index (Tree a) -> Traversal' (Tree a) (IxValue (Tree a)) #
Ixed (Seq a) Source #
Methods ix :: Index (Seq a) -> Traversal' (Seq a) (IxValue (Seq a)) #
At (IntMap a) Source #
Methods at :: Index (IntMap a) -> Lens' (IntMap a) (Maybe (IxValue (IntMap a))) #
Each (IntMap a) (IntMap b) a b Source #
Methods each :: Traversal (IntMap a) (IntMap b) a b #
Each (Tree a) (Tree b) a b Source #
Methods each :: Traversal (Tree a) (Tree b) a b #
Each (Seq a) (Seq b) a b Source #
Methods each :: Traversal (Seq a) (Seq b) a b #
Cons (Seq a) (Seq b) a b Source #
Methods _Cons :: Traversal (Seq a) (Seq b) (a, Seq a) (b, Seq b) #
Snoc (Seq a) (Seq b) a b Source #
Methods _Snoc :: Traversal (Seq a) (Seq b) (Seq a, a) (Seq b, b) #
(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)) #
Ord k => At (Map k a) Source #
Methods at :: Index (Map k a) -> Lens' (Map k a) (Maybe (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 #