| Copyright | (C) 2012-15 Edward Kmett |
|---|---|
| License | BSD-style (see the file LICENSE) |
| Maintainer | Edward Kmett <ekmett@gmail.com> |
| Stability | provisional |
| Portability | Rank2Types |
| Safe Haskell | Safe |
| Language | Haskell98 |
Control.Lens.Tuple
Contents
Description
- class Field1 s t a b | s -> a, t -> b, s b -> t, t a -> s where
- class Field2 s t a b | s -> a, t -> b, s b -> t, t a -> s where
- class Field3 s t a b | s -> a, t -> b, s b -> t, t a -> s where
- class Field4 s t a b | s -> a, t -> b, s b -> t, t a -> s where
- class Field5 s t a b | s -> a, t -> b, s b -> t, t a -> s where
- class Field6 s t a b | s -> a, t -> b, s b -> t, t a -> s where
- class Field7 s t a b | s -> a, t -> b, s b -> t, t a -> s where
- class Field8 s t a b | s -> a, t -> b, s b -> t, t a -> s where
- class Field9 s t a b | s -> a, t -> b, s b -> t, t a -> s where
- _1' :: Field1 s t a b => Lens s t a b
- _2' :: Field2 s t a b => Lens s t a b
- _3' :: Field3 s t a b => Lens s t a b
- _4' :: Field4 s t a b => Lens s t a b
- _5' :: Field5 s t a b => Lens s t a b
- _6' :: Field6 s t a b => Lens s t a b
- _7' :: Field7 s t a b => Lens s t a b
- _8' :: Field8 s t a b => Lens s t a b
- _9' :: Field9 s t a b => Lens s t a b
Tuples
class Field1 s t a b | s -> a, t -> b, s b -> t, t a -> s where Source
Provides access to 1st field of a tuple.
Minimal complete definition
Nothing
Methods
Access the 1st field of a tuple (and possibly change its type).
>>>(1,2)^._11
>>>_1 .~ "hello" $ (1,2)("hello",2)
>>>(1,2) & _1 .~ "hello"("hello",2)
>>>_1 putStrLn ("hello","world")hello ((),"world")
This can also be used on larger tuples as well:
>>>(1,2,3,4,5) & _1 +~ 41(42,2,3,4,5)
_1::Lens(a,b) (a',b) a a'_1::Lens(a,b,c) (a',b,c) a a'_1::Lens(a,b,c,d) (a',b,c,d) a a' ..._1::Lens(a,b,c,d,e,f,g,h,i) (a',b,c,d,e,f,g,h,i) a a'
Instances
| Field1 (Identity a) (Identity b) a b Source | |
| Field1 (a, b) (a', b) a a' Source |
|
| Field1 (a, b, c) (a', b, c) a a' Source | |
| Field1 ((:*:) f g p) ((:*:) f' g p) (f p) (f' p) Source | |
| Field1 (Product f g a) (Product f' g a) (f a) (f' a) Source | |
| Field1 (a, b, c, d) (a', b, c, d) a a' Source | |
| Field1 (a, b, c, d, e) (a', b, c, d, e) a a' Source | |
| Field1 (a, b, c, d, e, f) (a', b, c, d, e, f) a a' Source | |
| Field1 (a, b, c, d, e, f, g) (a', b, c, d, e, f, g) a a' Source | |
| Field1 (a, b, c, d, e, f, g, h) (a', b, c, d, e, f, g, h) a a' Source | |
| Field1 (a, b, c, d, e, f, g, h, i) (a', b, c, d, e, f, g, h, i) a a' Source | |
class Field2 s t a b | s -> a, t -> b, s b -> t, t a -> s where Source
Provides access to the 2nd field of a tuple.
Minimal complete definition
Nothing
Methods
Access the 2nd field of a tuple.
>>>_2 .~ "hello" $ (1,(),3,4)(1,"hello",3,4)
>>>(1,2,3,4) & _2 *~ 3(1,6,3,4)
>>>_2 print (1,2)2 (1,())
anyOf_2:: (s ->Bool) -> (a, s) ->Booltraverse._2:: (Applicativef,Traversablet) => (a -> f b) -> t (s, a) -> f (t (s, b))foldMapOf(traverse._2) :: (Traversablet,Monoidm) => (s -> m) -> t (b, s) -> m
Instances
| Field2 (a, b) (a, b') b b' Source |
|
| Field2 (a, b, c) (a, b', c) b b' Source | |
| Field2 ((:*:) f g p) ((:*:) f g' p) (g p) (g' p) Source | |
| Field2 (Product f g a) (Product f g' a) (g a) (g' a) Source | |
| Field2 (a, b, c, d) (a, b', c, d) b b' Source | |
| Field2 (a, b, c, d, e) (a, b', c, d, e) b b' Source | |
| Field2 (a, b, c, d, e, f) (a, b', c, d, e, f) b b' Source | |
| Field2 (a, b, c, d, e, f, g) (a, b', c, d, e, f, g) b b' Source | |
| Field2 (a, b, c, d, e, f, g, h) (a, b', c, d, e, f, g, h) b b' Source | |
| Field2 (a, b, c, d, e, f, g, h, i) (a, b', c, d, e, f, g, h, i) b b' Source | |
class Field3 s t a b | s -> a, t -> b, s b -> t, t a -> s where Source
Provides access to the 3rd field of a tuple.
Minimal complete definition
Nothing
Instances
| Field3 (a, b, c) (a, b, c') c c' Source | |
| Field3 (a, b, c, d) (a, b, c', d) c c' Source | |
| Field3 (a, b, c, d, e) (a, b, c', d, e) c c' Source | |
| Field3 (a, b, c, d, e, f) (a, b, c', d, e, f) c c' Source | |
| Field3 (a, b, c, d, e, f, g) (a, b, c', d, e, f, g) c c' Source | |
| Field3 (a, b, c, d, e, f, g, h) (a, b, c', d, e, f, g, h) c c' Source | |
| Field3 (a, b, c, d, e, f, g, h, i) (a, b, c', d, e, f, g, h, i) c c' Source | |
class Field4 s t a b | s -> a, t -> b, s b -> t, t a -> s where Source
Provide access to the 4th field of a tuple.
Minimal complete definition
Nothing
Instances
| Field4 (a, b, c, d) (a, b, c, d') d d' Source | |
| Field4 (a, b, c, d, e) (a, b, c, d', e) d d' Source | |
| Field4 (a, b, c, d, e, f) (a, b, c, d', e, f) d d' Source | |
| Field4 (a, b, c, d, e, f, g) (a, b, c, d', e, f, g) d d' Source | |
| Field4 (a, b, c, d, e, f, g, h) (a, b, c, d', e, f, g, h) d d' Source | |
| Field4 (a, b, c, d, e, f, g, h, i) (a, b, c, d', e, f, g, h, i) d d' Source | |
class Field5 s t a b | s -> a, t -> b, s b -> t, t a -> s where Source
Provides access to the 5th field of a tuple.
Minimal complete definition
Nothing
Instances
| Field5 (a, b, c, d, e) (a, b, c, d, e') e e' Source | |
| Field5 (a, b, c, d, e, f) (a, b, c, d, e', f) e e' Source | |
| Field5 (a, b, c, d, e, f, g) (a, b, c, d, e', f, g) e e' Source | |
| Field5 (a, b, c, d, e, f, g, h) (a, b, c, d, e', f, g, h) e e' Source | |
| Field5 (a, b, c, d, e, f, g, h, i) (a, b, c, d, e', f, g, h, i) e e' Source | |
class Field6 s t a b | s -> a, t -> b, s b -> t, t a -> s where Source
Provides access to the 6th element of a tuple.
Minimal complete definition
Nothing
class Field7 s t a b | s -> a, t -> b, s b -> t, t a -> s where Source
Provide access to the 7th field of a tuple.
Minimal complete definition
Nothing
class Field8 s t a b | s -> a, t -> b, s b -> t, t a -> s where Source
Provide access to the 8th field of a tuple.
Minimal complete definition
Nothing
class Field9 s t a b | s -> a, t -> b, s b -> t, t a -> s where Source
Provides access to the 9th field of a tuple.
Minimal complete definition
Nothing