Data.Profunctor.Optic.View

Types

type View s a = forall p. (Strong p, forall x. Contravariant (p x)) => Optic' p s a

type AView s a = Optic' (Star (Const a)) s a

type Ixview i s a = forall p. (Strong p, forall x. Contravariant (p x)) => IndexedOptic' p i s a

type AIxview r i s a = IndexedOptic' (Star (Const (Maybe i, r))) i s a

type PrimView s t a b = forall p. (Profunctor p, forall x. Contravariant (p x)) => Optic p s t a b

type Review t b = forall p. (Costrong p, Bifunctor p) => Optic' p t b

type AReview t b = Optic' Tagged t b

type Cxview k t b = forall p. (Costrong p, Bifunctor p) => CoindexedOptic' p k t b

type ACxview k t b = CoindexedOptic' Tagged k t b

type PrimReview s t a b = forall p. (Profunctor p, Bifunctor p) => Optic p s t a b

Constructors

to :: (s -> a) -> PrimView s t a b

Obtain a View from an arbitrary function.

to f . to g ≡ to (g . f)
a ^. to f ≡ f a

>>> ("hello","world") ^. to snd
"world"

>>> 5 ^. to succ
6

>>> (0, -5) ^. t22 . to abs
5

to :: (s -> a) -> View s a

ixto :: (s -> (i, a)) -> Ixview i s a

TODO: Document

from :: (b -> t) -> PrimReview s t a b

Obtain a Review from an arbitrary function.

from ≡ re . to

>>> (from Prelude.length) #^ [1,2,3]
3

from :: (b -> t) -> Review t b

cxfrom :: ((k -> b) -> t) -> Cxview k t b

TODO: Document

cloneView :: AView s a -> PrimView s s a a

TODO: Document

cloneView ::             AView s a -> View s a
cloneView :: Monoid a => AView s a -> Fold s a

cloneReview :: AReview t b -> PrimReview t t b b

TODO: Document

Optics

like :: a -> PrimView s t a b

Obtain a constant-valued (index-preserving) View from an arbitrary value.

This can be useful as a second case failing a Fold e.g. foo failing like 0

like a . like b ≡ like b
a ^. like b ≡ b
a ^. like b ≡ a ^. to (const b)

like :: a -> View s a

ixlike :: i -> a -> Ixview i s a

TODO: Document

relike :: t -> PrimReview s t a b

Obtain a constant-valued (index-preserving) Review from an arbitrary value.

relike a . relike b ≡ relike a
relike a # b ≡ a
relike a # b ≡ from (const a) # b

cxlike :: t -> Cxview k t b

Obtain a constant-valued Cxview from an arbitrary value.

toProduct :: AView s a1 -> AView s a2 -> PrimView s t (a1, a2) b

Combine two Views into a View to a product.

toProduct :: View s a1 -> View s a2 -> View s (a1 , a2)

fromSum :: AReview t b1 -> AReview t b2 -> PrimReview s t a (b1 + b2)

Combine two Reviews into a Review from a sum.

fromSum :: Review t b1 -> Review t b2 -> Review t (b1 + b2)

Primitive operators

withPrimView :: APrimView r s t a b -> (a -> r) -> s -> r

TODO: Document

withPrimReview :: APrimReview s t a b -> (t -> r) -> b -> r

TODO: Document

Operators

(^.) :: s -> AView s a -> a infixl 8

An infix alias for view. Dual to #.

Fixity and semantics are such that subsequent field accesses can be performed with (.).

>>> ("hello","world") ^. t22
"world"

>>> import Data.Complex
>>> ((0, 1 :+ 2), 3) ^. t21 . t22 . to magnitude
2.23606797749979

(^.) ::             s -> View s a       -> a
(^.) :: Monoid m => s -> Fold s m       -> m
(^.) ::             s -> Iso' s a       -> a
(^.) ::             s -> Lens' s a      -> a
(^.) ::             s -> Coprism' s a   -> a
(^.) :: Monoid m => s -> Traversal' s m -> m

(^%) :: Monoid i => s -> AIxview a i s a -> (Maybe i, a) infixl 8

Bring the index and value of a indexed optic into the current environment as a pair.

This a flipped, infix variant of ixview and an indexed variant of ^..

The fixity and semantics are such that subsequent field accesses can be performed with (.).

The result probably doesn't have much meaning when applied to an Ixfold.

view :: MonadReader s m => AView s a -> m a

View the value pointed to by a View, Iso or Lens or the result of folding over all the results of a Fold or Traversal that points at a monoidal value.

view . to ≡ id

>>> view t22 (1, "hello")
"hello"

>>> view (to succ) 5
6

>>> view (t22 . t21) ("hello",("world","!!!"))
"world"

ixview :: MonadReader s m => Monoid i => AIxview a i s a -> m (Maybe i, a)

Bring the index and value of a indexed optic into the current environment as a pair.

>>> ixview ixfirst ("foo", 42)
(Just (),"foo")

>>> ixview (ixat 3 . ixfirst) [(0,'f'),(1,'o'),(2,'o'),(3,'b'),(4,'a'),(5,'r') :: (Int, Char)]
(Just 3,3)

In order to ixview a Choice optic (e.g. Ixtraversal0, Ixtraversal, Ixfold, etc), a must have a Monoid instance:

>>> ixview (ixat 0) ([] :: [Int])
(Nothing,0)
>>> ixview (ixat 0) ([1] :: [Int])
(Just 0,1)

Note when applied to a Ixtraversal or Ixfold, then ixview will return a monoidal summary of the indices tupled with a monoidal summary of the values:

>>> (ixview @_ @_ @Int @Int) ixtraversed [1,2,3,4]
(Just 6,10)

views :: MonadReader s m => Optic' (Star (Const r)) s a -> (a -> r) -> m r

Map each part of a structure viewed to a semantic edixtor combinator.

'views o f ≡ withFold o f'
foldMap = views folding'

>>> views both id (["foo"], ["bar", "baz"])
["foo","bar","baz"]

views ::                AView s a       -> (a -> r) -> s -> r
views ::                Iso' s a        -> (a -> r) -> s -> r
views ::                Lens' s a       -> (a -> r) -> s -> r
views ::                Coprism' s a    -> (a -> r) -> s -> r
views :: Monoid r    => Traversal' s a  -> (a -> r) -> s -> r
views :: Semigroup r => Traversal1' s a -> (a -> r) -> s -> r
views :: Monoid r    => Fold s a        -> (a -> r) -> s -> r
views :: Semigroup r => Fold1 s a       -> (a -> r) -> s -> r

ixviews :: MonadReader s m => Monoid i => IndexedOptic' (Star (Const r)) i s a -> (i -> a -> r) -> m r

Bring a function of the index and value of an indexed optic into the current environment.

ixviews ≡ iwithFold

>>> ixviews (ixat 2) (-) ([0,1,2] :: [Int])
0

In order to ixviews a Choice optic (e.g. Ixtraversal0, Ixtraversal, Ixfold, etc), a must have a Monoid instance (here from the rings package):

>>> ixviews (ixat 3) (flip const) ([1] :: [Int])
0

Use ixview if there is a need to disambiguate between mempty as a miss vs. as a return value.

use :: MonadState s m => AView s a -> m a

TODO: Document

ixuse :: MonadState s m => Monoid i => AIxview a i s a -> m (Maybe i, a)

Bring the index and value of an indexed optic into the current environment as a pair.

uses :: MonadState s m => Optic' (Star (Const r)) s a -> (a -> r) -> m r

Use the target of a Lens, Iso or View in the current state, or use a summary of a Fold or Traversal that points to a monoidal value.

>>> evalState (uses t21 length) ("hello","world!")
5

uses :: MonadState s m             => Iso' s a       -> (a -> r) -> m r
uses :: MonadState s m             => View s a     -> (a -> r) -> m r
uses :: MonadState s m             => Lens' s a      -> (a -> r) -> m r
uses :: MonadState s m             => Coprism' s a      -> (a -> r) -> m r
uses :: MonadState s m => Monoid r => Traversal' s a -> (a -> r) -> m r
uses :: MonadState s m => Monoid r => Fold s a       -> (a -> r) -> m r

uses :: MonadState s m => Getting r s t a b -> (a -> r) -> m r

ixuses :: MonadState s m => Monoid i => IndexedOptic' (Star (Const r)) i s a -> (i -> a -> r) -> m r

Bring a function of the index and value of an indexed optic into the current environment.

(#^) :: AReview t b -> b -> t infixr 8

An infix variant of review. Dual to ^..

from f #^ x ≡ f x
o #^ x ≡ x ^. re o

This is commonly used when using a Prism as a smart constructor.

>>> left #^ 4
Left 4

(#^) :: Iso'      s a -> a -> s
(#^) :: Prism'    s a -> a -> s
(#^) :: Colens'   s a -> a -> s
(#^) :: Review    s a -> a -> s
(#^) :: Equality' s a -> a -> s

review :: MonadReader b m => AReview t b -> m t

Turn an optic around and look through the other end.

review ≡ view . re
review . from ≡ id

>>> review (from succ) 5
6

review :: Iso' s a   -> a -> s
review :: Prism' s a -> a -> s
review :: Colens' s a -> a -> s

cxview :: MonadReader b m => ACxview k t b -> m (k -> t)

Bring a function of the index of a co-indexed optic into the current environment.

reviews :: MonadReader b m => AReview t b -> (t -> r) -> m r

Turn an optic around and look through the other end, applying a function.

reviews ≡ views . re
reviews (from f) g ≡ g . f

>>> reviews left isRight "mustard"
False

>>> reviews (from succ) (*2) 3
8

reviews :: Iso' t b -> (t -> r) -> b -> r
reviews :: Prism' t b -> (t -> r) -> b -> r
reviews :: Colens' t b -> (t -> r) -> b -> r

cxviews :: MonadReader b m => ACxview k t b -> ((k -> t) -> r) -> m r

Bring a continuation of the index of a co-indexed optic into the current environment.

cxviews :: ACxview k t b -> ((k -> t) -> r) -> b -> r

reuse :: MonadState b m => AReview t b -> m t

Turn an optic around and use a value (or the current environment) through it the other way.

reuse ≡ use . re
reuse . from ≡ gets

>>> evalState (reuse left) 5
Left 5

>>> evalState (reuse (from succ)) 5
6

reuse :: MonadState a m => Iso' s a   -> m s
reuse :: MonadState a m => Prism' s a -> m s
reuse :: MonadState a m => Colens' s a -> m s

reuses :: MonadState b m => AReview t b -> (t -> r) -> m r

Turn an optic around and use the current state through it the other way, applying a function.

reuses ≡ uses . re
reuses (from f) g ≡ gets (g . f)

>>> evalState (reuses left isLeft) (5 :: Int)
True

reuses :: MonadState a m => Iso' s a   -> (s -> r) -> m r
reuses :: MonadState a m => Prism' s a -> (s -> r) -> m r
reuses :: MonadState a m => Prism' s a -> (s -> r) -> m r

cxuse :: MonadState b m => ACxview k t b -> m (k -> t)

TODO: Document

cxuses :: MonadState b m => ACxview k t b -> ((k -> t) -> r) -> m r

TODO: Document

MonadIO

throws :: MonadIO m => Exception e => AReview e b -> b -> m r

Throw an exception described by an optic.

throws o e `seq` x  ≡ throws o e

throws_ :: MonadIO m => Exception e => AReview e () -> m r

Variant of throws for error constructors with no arguments.

throwsTo :: MonadIO m => Exception e => ThreadId -> AReview e b -> b -> m ()

Raise an Exception specified by an optic in the target thread.

throwsTo thread o ≡ throwTo thread . review o

Carriers

newtype Star (f :: Type -> Type) d c

Lift a Functor into a Profunctor (forwards).

Constructors

Star

Fields

• runStar :: d -> f c

Instances

Functor f => Representable (Star f)

Defined in Data.Profunctor.Rep

Associated Types

type Rep (Star f) :: Type -> Type

Methods

tabulate :: (d -> Rep (Star f) c) -> Star f d c

Applicative f => Choice (Star f)

Defined in Data.Profunctor.Choice

Methods

left' :: Star f a b -> Star f (Either a c) (Either b c)

right' :: Star f a b -> Star f (Either c a) (Either c b)

Traversable f => Cochoice (Star f)

Defined in Data.Profunctor.Choice

Methods

unleft :: Star f (Either a d) (Either b d) -> Star f a b

unright :: Star f (Either d a) (Either d b) -> Star f a b

Distributive f => Closed (Star f)

Defined in Data.Profunctor.Closed

Methods

closed :: Star f a b -> Star f (x -> a) (x -> b)

Functor m => Strong (Star m)

Defined in Data.Profunctor.Strong

Methods

first' :: Star m a b -> Star m (a, c) (b, c)

second' :: Star m a b -> Star m (c, a) (c, b)

Functor f => Profunctor (Star f)

Defined in Data.Profunctor.Types

Methods

dimap :: (a -> b) -> (c -> d) -> Star f b c -> Star f a d

lmap :: (a -> b) -> Star f b c -> Star f a c

rmap :: (b -> c) -> Star f a b -> Star f a c

(#.) :: Coercible c b => q b c -> Star f a b -> Star f a c

(.#) :: Coercible b a => Star f b c -> q a b -> Star f a c

Functor f => Sieve (Star f) f

Defined in Data.Profunctor.Sieve

Methods

sieve :: Star f a b -> a -> f b

Monad f => Category (Star f :: Type -> Type -> Type)

Defined in Data.Profunctor.Types

Methods

id :: Star f a a

(.) :: Star f b c -> Star f a b -> Star f a c

Monad f => Monad (Star f a)

Defined in Data.Profunctor.Types

Methods

(>>=) :: Star f a a0 -> (a0 -> Star f a b) -> Star f a b

(>>) :: Star f a a0 -> Star f a b -> Star f a b

return :: a0 -> Star f a a0

fail :: String -> Star f a a0

Functor f => Functor (Star f a)

Defined in Data.Profunctor.Types

Methods

fmap :: (a0 -> b) -> Star f a a0 -> Star f a b

(<$) :: a0 -> Star f a b -> Star f a a0

Applicative f => Applicative (Star f a)

Defined in Data.Profunctor.Types

Methods

pure :: a0 -> Star f a a0

(<*>) :: Star f a (a0 -> b) -> Star f a a0 -> Star f a b

liftA2 :: (a0 -> b -> c) -> Star f a a0 -> Star f a b -> Star f a c

(*>) :: Star f a a0 -> Star f a b -> Star f a b

(<*) :: Star f a a0 -> Star f a b -> Star f a a0

Contravariant f => Contravariant (Star f a)

Defined in Data.Profunctor.Optic.Type

Methods

contramap :: (a0 -> b) -> Star f a b -> Star f a a0

(>$) :: b -> Star f a b -> Star f a a0

Alternative f => Alternative (Star f a)

Defined in Data.Profunctor.Types

Methods

empty :: Star f a a0

(<|>) :: Star f a a0 -> Star f a a0 -> Star f a a0

some :: Star f a a0 -> Star f a [a0]

many :: Star f a a0 -> Star f a [a0]

MonadPlus f => MonadPlus (Star f a)

Defined in Data.Profunctor.Types

Methods

mzero :: Star f a a0

mplus :: Star f a a0 -> Star f a a0 -> Star f a a0

Distributive f => Distributive (Star f a)

Defined in Data.Profunctor.Types

Methods

distribute :: Functor f0 => f0 (Star f a a0) -> Star f a (f0 a0)

collect :: Functor f0 => (a0 -> Star f a b) -> f0 a0 -> Star f a (f0 b)

distributeM :: Monad m => m (Star f a a0) -> Star f a (m a0)

collectM :: Monad m => (a0 -> Star f a b) -> m a0 -> Star f a (m b)

Apply f => Apply (Star f a)

Defined in Data.Profunctor.Optic.Type

Methods

(<.>) :: Star f a (a0 -> b) -> Star f a a0 -> Star f a b

(.>) :: Star f a a0 -> Star f a b -> Star f a b

(<.) :: Star f a a0 -> Star f a b -> Star f a a0

liftF2 :: (a0 -> b -> c) -> Star f a a0 -> Star f a b -> Star f a c

type Rep (Star f)

Defined in Data.Profunctor.Rep

type Rep (Star f) = f

newtype Tagged (s :: k) b :: forall k. k -> Type -> Type

A Tagged s b value is a value b with an attached phantom type s. This can be used in place of the more traditional but less safe idiom of passing in an undefined value with the type, because unlike an (s -> b), a Tagged s b can't try to use the argument s as a real value.

Moreover, you don't have to rely on the compiler to inline away the extra argument, because the newtype is "free"

Tagged has kind k -> * -> * if the compiler supports PolyKinds, therefore there is an extra k showing in the instance haddocks that may cause confusion.

Constructors

Tagged

Fields

• unTagged :: b

Instances

Bitraversable (Tagged :: Type -> Type -> Type)

Defined in Data.Tagged

Methods

bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> Tagged a b -> f (Tagged c d)

Bifoldable (Tagged :: Type -> Type -> Type)

Defined in Data.Tagged

Methods

bifold :: Monoid m => Tagged m m -> m

bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> Tagged a b -> m

bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> Tagged a b -> c

bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> Tagged a b -> c

Bifunctor (Tagged :: Type -> Type -> Type)

Defined in Data.Tagged

Methods

bimap :: (a -> b) -> (c -> d) -> Tagged a c -> Tagged b d

first :: (a -> b) -> Tagged a c -> Tagged b c

second :: (b -> c) -> Tagged a b -> Tagged a c

Eq2 (Tagged :: Type -> Type -> Type)

Defined in Data.Tagged

Methods

liftEq2 :: (a -> b -> Bool) -> (c -> d -> Bool) -> Tagged a c -> Tagged b d -> Bool

Ord2 (Tagged :: Type -> Type -> Type)

Defined in Data.Tagged

Methods

liftCompare2 :: (a -> b -> Ordering) -> (c -> d -> Ordering) -> Tagged a c -> Tagged b d -> Ordering

Read2 (Tagged :: Type -> Type -> Type)

Defined in Data.Tagged

Methods

liftReadsPrec2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> Int -> ReadS (Tagged a b)

liftReadList2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> ReadS [Tagged a b]

liftReadPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec (Tagged a b)

liftReadListPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec [Tagged a b]

Show2 (Tagged :: Type -> Type -> Type)

Defined in Data.Tagged

Methods

liftShowsPrec2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> Int -> Tagged a b -> ShowS

liftShowList2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> [Tagged a b] -> ShowS

Corepresentable (Tagged :: Type -> Type -> Type)

Defined in Data.Profunctor.Rep

Associated Types

type Corep Tagged :: Type -> Type

Methods

cotabulate :: (Corep Tagged d -> c) -> Tagged d c

Choice (Tagged :: Type -> Type -> Type)

Defined in Data.Profunctor.Choice

Methods

left' :: Tagged a b -> Tagged (Either a c) (Either b c)

right' :: Tagged a b -> Tagged (Either c a) (Either c b)

Closed (Tagged :: Type -> Type -> Type)

Defined in Data.Profunctor.Closed

Methods

closed :: Tagged a b -> Tagged (x -> a) (x -> b)

Costrong (Tagged :: Type -> Type -> Type)

Defined in Data.Profunctor.Strong

Methods

unfirst :: Tagged (a, d) (b, d) -> Tagged a b

unsecond :: Tagged (d, a) (d, b) -> Tagged a b

Profunctor (Tagged :: Type -> Type -> Type)

Defined in Data.Profunctor.Unsafe

Methods

dimap :: (a -> b) -> (c -> d) -> Tagged b c -> Tagged a d

lmap :: (a -> b) -> Tagged b c -> Tagged a c

rmap :: (b -> c) -> Tagged a b -> Tagged a c

(#.) :: Coercible c b => q b c -> Tagged a b -> Tagged a c

(.#) :: Coercible b a => Tagged b c -> q a b -> Tagged a c

Bitraversable1 (Tagged :: Type -> Type -> Type)

Defined in Data.Semigroup.Traversable.Class

Methods

bitraverse1 :: Apply f => (a -> f b) -> (c -> f d) -> Tagged a c -> f (Tagged b d)

bisequence1 :: Apply f => Tagged (f a) (f b) -> f (Tagged a b)

Bifoldable1 (Tagged :: Type -> Type -> Type)

Defined in Data.Semigroup.Foldable.Class

Methods

bifold1 :: Semigroup m => Tagged m m -> m

bifoldMap1 :: Semigroup m => (a -> m) -> (b -> m) -> Tagged a b -> m

Biapply (Tagged :: Type -> Type -> Type)

Defined in Data.Functor.Bind.Class

Methods

(<<.>>) :: Tagged (a -> b) (c -> d) -> Tagged a c -> Tagged b d

(.>>) :: Tagged a b -> Tagged c d -> Tagged c d

(<<.) :: Tagged a b -> Tagged c d -> Tagged a b

Cosieve (Tagged :: Type -> Type -> Type) (Proxy :: Type -> Type)

Defined in Data.Profunctor.Sieve

Methods

cosieve :: Tagged a b -> Proxy a -> b

Generic1 (Tagged s :: Type -> Type)

Defined in Data.Tagged

Associated Types

type Rep1 (Tagged s) :: k -> Type

Methods

from1 :: Tagged s a -> Rep1 (Tagged s) a

to1 :: Rep1 (Tagged s) a -> Tagged s a

Monad (Tagged s)

Defined in Data.Tagged

Methods

(>>=) :: Tagged s a -> (a -> Tagged s b) -> Tagged s b

(>>) :: Tagged s a -> Tagged s b -> Tagged s b

return :: a -> Tagged s a

fail :: String -> Tagged s a

Functor (Tagged s)

Defined in Data.Tagged

Methods

fmap :: (a -> b) -> Tagged s a -> Tagged s b

(<$) :: a -> Tagged s b -> Tagged s a

Applicative (Tagged s)

Defined in Data.Tagged

Methods

pure :: a -> Tagged s a

(<*>) :: Tagged s (a -> b) -> Tagged s a -> Tagged s b

liftA2 :: (a -> b -> c) -> Tagged s a -> Tagged s b -> Tagged s c

(*>) :: Tagged s a -> Tagged s b -> Tagged s b

(<*) :: Tagged s a -> Tagged s b -> Tagged s a

Foldable (Tagged s)

Defined in Data.Tagged

Methods

fold :: Monoid m => Tagged s m -> m

foldMap :: Monoid m => (a -> m) -> Tagged s a -> m

foldr :: (a -> b -> b) -> b -> Tagged s a -> b

foldr' :: (a -> b -> b) -> b -> Tagged s a -> b

foldl :: (b -> a -> b) -> b -> Tagged s a -> b

foldl' :: (b -> a -> b) -> b -> Tagged s a -> b

foldr1 :: (a -> a -> a) -> Tagged s a -> a

foldl1 :: (a -> a -> a) -> Tagged s a -> a

toList :: Tagged s a -> [a]

null :: Tagged s a -> Bool

length :: Tagged s a -> Int

elem :: Eq a => a -> Tagged s a -> Bool

maximum :: Ord a => Tagged s a -> a

minimum :: Ord a => Tagged s a -> a

sum :: Num a => Tagged s a -> a

product :: Num a => Tagged s a -> a

Traversable (Tagged s)

Defined in Data.Tagged

Methods

traverse :: Applicative f => (a -> f b) -> Tagged s a -> f (Tagged s b)

sequenceA :: Applicative f => Tagged s (f a) -> f (Tagged s a)

mapM :: Monad m => (a -> m b) -> Tagged s a -> m (Tagged s b)

sequence :: Monad m => Tagged s (m a) -> m (Tagged s a)

Eq1 (Tagged s)

Defined in Data.Tagged

Methods

liftEq :: (a -> b -> Bool) -> Tagged s a -> Tagged s b -> Bool

Ord1 (Tagged s)

Defined in Data.Tagged

Methods

liftCompare :: (a -> b -> Ordering) -> Tagged s a -> Tagged s b -> Ordering

Read1 (Tagged s)

Defined in Data.Tagged

Methods

liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Tagged s a)

liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Tagged s a]

liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Tagged s a)

liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Tagged s a]

Show1 (Tagged s)

Defined in Data.Tagged

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Tagged s a -> ShowS

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Tagged s a] -> ShowS

Comonad (Tagged s)

Defined in Control.Comonad

Methods

extract :: Tagged s a -> a

duplicate :: Tagged s a -> Tagged s (Tagged s a)

extend :: (Tagged s a -> b) -> Tagged s a -> Tagged s b

Distributive (Tagged t)

Defined in Data.Distributive

Methods

distribute :: Functor f => f (Tagged t a) -> Tagged t (f a)

collect :: Functor f => (a -> Tagged t b) -> f a -> Tagged t (f b)

distributeM :: Monad m => m (Tagged t a) -> Tagged t (m a)

collectM :: Monad m => (a -> Tagged t b) -> m a -> Tagged t (m b)

Traversable1 (Tagged a)

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f => (a0 -> f b) -> Tagged a a0 -> f (Tagged a b)

sequence1 :: Apply f => Tagged a (f b) -> f (Tagged a b)

Foldable1 (Tagged a)

Defined in Data.Semigroup.Foldable.Class

Methods

fold1 :: Semigroup m => Tagged a m -> m

foldMap1 :: Semigroup m => (a0 -> m) -> Tagged a a0 -> m

toNonEmpty :: Tagged a a0 -> NonEmpty a0

Apply (Tagged a)

Defined in Data.Functor.Bind.Class

Methods

(<.>) :: Tagged a (a0 -> b) -> Tagged a a0 -> Tagged a b

(.>) :: Tagged a a0 -> Tagged a b -> Tagged a b

(<.) :: Tagged a a0 -> Tagged a b -> Tagged a a0

liftF2 :: (a0 -> b -> c) -> Tagged a a0 -> Tagged a b -> Tagged a c

Bind (Tagged a)

Defined in Data.Functor.Bind.Class

Methods

(>>-) :: Tagged a a0 -> (a0 -> Tagged a b) -> Tagged a b

join :: Tagged a (Tagged a a0) -> Tagged a a0

Bounded b => Bounded (Tagged s b)

Defined in Data.Tagged

Methods

minBound :: Tagged s b

maxBound :: Tagged s b

Enum a => Enum (Tagged s a)

Defined in Data.Tagged

Methods

succ :: Tagged s a -> Tagged s a

pred :: Tagged s a -> Tagged s a

toEnum :: Int -> Tagged s a

fromEnum :: Tagged s a -> Int

enumFrom :: Tagged s a -> [Tagged s a]

enumFromThen :: Tagged s a -> Tagged s a -> [Tagged s a]

enumFromTo :: Tagged s a -> Tagged s a -> [Tagged s a]

enumFromThenTo :: Tagged s a -> Tagged s a -> Tagged s a -> [Tagged s a]

Eq b => Eq (Tagged s b)

Defined in Data.Tagged

Methods

(==) :: Tagged s b -> Tagged s b -> Bool

(/=) :: Tagged s b -> Tagged s b -> Bool

Floating a => Floating (Tagged s a)

Defined in Data.Tagged

Methods

pi :: Tagged s a

exp :: Tagged s a -> Tagged s a

log :: Tagged s a -> Tagged s a

sqrt :: Tagged s a -> Tagged s a

(**) :: Tagged s a -> Tagged s a -> Tagged s a

logBase :: Tagged s a -> Tagged s a -> Tagged s a

sin :: Tagged s a -> Tagged s a

cos :: Tagged s a -> Tagged s a

tan :: Tagged s a -> Tagged s a

asin :: Tagged s a -> Tagged s a

acos :: Tagged s a -> Tagged s a

atan :: Tagged s a -> Tagged s a

sinh :: Tagged s a -> Tagged s a

cosh :: Tagged s a -> Tagged s a

tanh :: Tagged s a -> Tagged s a

asinh :: Tagged s a -> Tagged s a

acosh :: Tagged s a -> Tagged s a

atanh :: Tagged s a -> Tagged s a

log1p :: Tagged s a -> Tagged s a

expm1 :: Tagged s a -> Tagged s a

log1pexp :: Tagged s a -> Tagged s a

log1mexp :: Tagged s a -> Tagged s a

Fractional a => Fractional (Tagged s a)

Defined in Data.Tagged

Methods

(/) :: Tagged s a -> Tagged s a -> Tagged s a

recip :: Tagged s a -> Tagged s a

fromRational :: Rational -> Tagged s a

Integral a => Integral (Tagged s a)

Defined in Data.Tagged

Methods

quot :: Tagged s a -> Tagged s a -> Tagged s a

rem :: Tagged s a -> Tagged s a -> Tagged s a

div :: Tagged s a -> Tagged s a -> Tagged s a

mod :: Tagged s a -> Tagged s a -> Tagged s a

quotRem :: Tagged s a -> Tagged s a -> (Tagged s a, Tagged s a)

divMod :: Tagged s a -> Tagged s a -> (Tagged s a, Tagged s a)

toInteger :: Tagged s a -> Integer

(Data s, Data b) => Data (Tagged s b)

Defined in Data.Tagged

Methods

gfoldl :: (forall d b0. Data d => c (d -> b0) -> d -> c b0) -> (forall g. g -> c g) -> Tagged s b -> c (Tagged s b)

gunfold :: (forall b0 r. Data b0 => c (b0 -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Tagged s b)

toConstr :: Tagged s b -> Constr

dataTypeOf :: Tagged s b -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Tagged s b))

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Tagged s b))

gmapT :: (forall b0. Data b0 => b0 -> b0) -> Tagged s b -> Tagged s b

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Tagged s b -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Tagged s b -> r

gmapQ :: (forall d. Data d => d -> u) -> Tagged s b -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Tagged s b -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Tagged s b -> m (Tagged s b)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Tagged s b -> m (Tagged s b)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Tagged s b -> m (Tagged s b)

Num a => Num (Tagged s a)

Defined in Data.Tagged

Methods

(+) :: Tagged s a -> Tagged s a -> Tagged s a

(-) :: Tagged s a -> Tagged s a -> Tagged s a

(*) :: Tagged s a -> Tagged s a -> Tagged s a

negate :: Tagged s a -> Tagged s a

abs :: Tagged s a -> Tagged s a

signum :: Tagged s a -> Tagged s a

fromInteger :: Integer -> Tagged s a

Ord b => Ord (Tagged s b)

Defined in Data.Tagged

Methods

compare :: Tagged s b -> Tagged s b -> Ordering

(<) :: Tagged s b -> Tagged s b -> Bool

(<=) :: Tagged s b -> Tagged s b -> Bool

(>) :: Tagged s b -> Tagged s b -> Bool

(>=) :: Tagged s b -> Tagged s b -> Bool

max :: Tagged s b -> Tagged s b -> Tagged s b

min :: Tagged s b -> Tagged s b -> Tagged s b

Read b => Read (Tagged s b)

Defined in Data.Tagged

Methods

readsPrec :: Int -> ReadS (Tagged s b)

readList :: ReadS [Tagged s b]

readPrec :: ReadPrec (Tagged s b)

readListPrec :: ReadPrec [Tagged s b]

Real a => Real (Tagged s a)

Defined in Data.Tagged

Methods

toRational :: Tagged s a -> Rational

RealFloat a => RealFloat (Tagged s a)

Defined in Data.Tagged

Methods

floatRadix :: Tagged s a -> Integer

floatDigits :: Tagged s a -> Int

floatRange :: Tagged s a -> (Int, Int)

decodeFloat :: Tagged s a -> (Integer, Int)

encodeFloat :: Integer -> Int -> Tagged s a

exponent :: Tagged s a -> Int

significand :: Tagged s a -> Tagged s a

scaleFloat :: Int -> Tagged s a -> Tagged s a

isNaN :: Tagged s a -> Bool

isInfinite :: Tagged s a -> Bool

isDenormalized :: Tagged s a -> Bool

isNegativeZero :: Tagged s a -> Bool

isIEEE :: Tagged s a -> Bool

atan2 :: Tagged s a -> Tagged s a -> Tagged s a

RealFrac a => RealFrac (Tagged s a)

Defined in Data.Tagged

Methods

properFraction :: Integral b => Tagged s a -> (b, Tagged s a)

truncate :: Integral b => Tagged s a -> b

round :: Integral b => Tagged s a -> b

ceiling :: Integral b => Tagged s a -> b

floor :: Integral b => Tagged s a -> b

Show b => Show (Tagged s b)

Defined in Data.Tagged

Methods

showsPrec :: Int -> Tagged s b -> ShowS

show :: Tagged s b -> String

showList :: [Tagged s b] -> ShowS

Ix b => Ix (Tagged s b)

Defined in Data.Tagged

Methods

range :: (Tagged s b, Tagged s b) -> [Tagged s b]

index :: (Tagged s b, Tagged s b) -> Tagged s b -> Int

unsafeIndex :: (Tagged s b, Tagged s b) -> Tagged s b -> Int

inRange :: (Tagged s b, Tagged s b) -> Tagged s b -> Bool

rangeSize :: (Tagged s b, Tagged s b) -> Int

unsafeRangeSize :: (Tagged s b, Tagged s b) -> Int

IsString a => IsString (Tagged s a)

Defined in Data.Tagged

Methods

fromString :: String -> Tagged s a

Generic (Tagged s b)

Defined in Data.Tagged

Associated Types

type Rep (Tagged s b) :: Type -> Type

Methods

from :: Tagged s b -> Rep (Tagged s b) x

to :: Rep (Tagged s b) x -> Tagged s b

Semigroup a => Semigroup (Tagged s a)

Defined in Data.Tagged

Methods

(<>) :: Tagged s a -> Tagged s a -> Tagged s a

sconcat :: NonEmpty (Tagged s a) -> Tagged s a

stimes :: Integral b => b -> Tagged s a -> Tagged s a

(Semigroup a, Monoid a) => Monoid (Tagged s a)

Defined in Data.Tagged

Methods

mempty :: Tagged s a

mappend :: Tagged s a -> Tagged s a -> Tagged s a

mconcat :: [Tagged s a] -> Tagged s a

Storable a => Storable (Tagged s a)

Defined in Data.Tagged

Methods

sizeOf :: Tagged s a -> Int

alignment :: Tagged s a -> Int

peekElemOff :: Ptr (Tagged s a) -> Int -> IO (Tagged s a)

pokeElemOff :: Ptr (Tagged s a) -> Int -> Tagged s a -> IO ()

peekByteOff :: Ptr b -> Int -> IO (Tagged s a)

pokeByteOff :: Ptr b -> Int -> Tagged s a -> IO ()

peek :: Ptr (Tagged s a) -> IO (Tagged s a)

poke :: Ptr (Tagged s a) -> Tagged s a -> IO ()

Bits a => Bits (Tagged s a)

Defined in Data.Tagged

Methods

(.&.) :: Tagged s a -> Tagged s a -> Tagged s a

(.|.) :: Tagged s a -> Tagged s a -> Tagged s a

xor :: Tagged s a -> Tagged s a -> Tagged s a

complement :: Tagged s a -> Tagged s a

shift :: Tagged s a -> Int -> Tagged s a

rotate :: Tagged s a -> Int -> Tagged s a

zeroBits :: Tagged s a

bit :: Int -> Tagged s a

setBit :: Tagged s a -> Int -> Tagged s a

clearBit :: Tagged s a -> Int -> Tagged s a

complementBit :: Tagged s a -> Int -> Tagged s a

testBit :: Tagged s a -> Int -> Bool

bitSizeMaybe :: Tagged s a -> Maybe Int

bitSize :: Tagged s a -> Int

isSigned :: Tagged s a -> Bool

shiftL :: Tagged s a -> Int -> Tagged s a

unsafeShiftL :: Tagged s a -> Int -> Tagged s a

shiftR :: Tagged s a -> Int -> Tagged s a

unsafeShiftR :: Tagged s a -> Int -> Tagged s a

rotateL :: Tagged s a -> Int -> Tagged s a

rotateR :: Tagged s a -> Int -> Tagged s a

popCount :: Tagged s a -> Int

FiniteBits a => FiniteBits (Tagged s a)

Defined in Data.Tagged

Methods

finiteBitSize :: Tagged s a -> Int

countLeadingZeros :: Tagged s a -> Int

countTrailingZeros :: Tagged s a -> Int

NFData b => NFData (Tagged s b)

Defined in Data.Tagged

Methods

rnf :: Tagged s b -> ()

type Corep (Tagged :: Type -> Type -> Type)

Defined in Data.Profunctor.Rep

type Corep (Tagged :: Type -> Type -> Type) = (Proxy :: Type -> Type)

type Rep1 (Tagged s :: Type -> Type)

Defined in Data.Tagged

type Rep1 (Tagged s :: Type -> Type) = D1 (MetaData "Tagged" "Data.Tagged" "tagged-0.8.6-CAGIOj1cv5J42b7wUKOeE3" True) (C1 (MetaCons "Tagged" PrefixI True) (S1 (MetaSel (Just "unTagged") NoSourceUnpackedness NoSourceStrictness DecidedLazy) Par1))

type Rep (Tagged s b)

Defined in Data.Tagged

type Rep (Tagged s b) = D1 (MetaData "Tagged" "Data.Tagged" "tagged-0.8.6-CAGIOj1cv5J42b7wUKOeE3" True) (C1 (MetaCons "Tagged" PrefixI True) (S1 (MetaSel (Just "unTagged") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 b)))