{-# LANGUAGE CPP #-}
{-# LANGUAGE Rank2Types #-}
#ifdef TRUSTWORTHY
{-# LANGUAGE Trustworthy #-}
#endif
#include "lens-common.h"
module Control.Lens.Prism
(
Prism, Prism'
, APrism, APrism'
, prism
, prism'
, withPrism
, clonePrism
, outside
, aside
, without
, below
, isn't
, matching
, matching'
, _Left
, _Right
, _Just
, _Nothing
, _Void
, _Show
, only
, nearly
, Prefixed(..)
, Suffixed(..)
, Choice(..)
) where
import Prelude ()
import Control.Applicative
import qualified Control.Lens.Internal.List as List
import Control.Lens.Internal.Prism
import Control.Lens.Internal.Prelude
import Control.Lens.Lens
import Control.Lens.Review
import Control.Lens.Type
import Control.Monad
import qualified Data.ByteString as BS
import qualified Data.ByteString.Lazy as BL
import qualified Data.List as List
import Data.Profunctor.Rep
import qualified Data.Text as TS
import qualified Data.Text.Lazy as TL
type APrism s t a b = Market a b a (Identity b) -> Market a b s (Identity t)
type APrism' s a = APrism s s a a
withPrism :: APrism s t a b -> ((b -> t) -> (s -> Either t a) -> r) -> r
withPrism :: APrism s t a b -> ((b -> t) -> (s -> Either t a) -> r) -> r
withPrism APrism s t a b
k (b -> t) -> (s -> Either t a) -> r
f = case Market a b s (Identity t) -> Market a b s t
coerce (APrism s t a b
k ((b -> Identity b)
-> (a -> Either (Identity b) a) -> Market a b a (Identity b)
forall a b s t. (b -> t) -> (s -> Either t a) -> Market a b s t
Market b -> Identity b
forall a. a -> Identity a
Identity a -> Either (Identity b) a
forall a b. b -> Either a b
Right)) of
Market b -> t
bt s -> Either t a
seta -> (b -> t) -> (s -> Either t a) -> r
f b -> t
bt s -> Either t a
seta
{-# INLINE withPrism #-}
clonePrism :: APrism s t a b -> Prism s t a b
clonePrism :: APrism s t a b -> Prism s t a b
clonePrism APrism s t a b
k = APrism s t a b
-> ((b -> t) -> (s -> Either t a) -> p a (f b) -> p s (f t))
-> p a (f b)
-> p s (f t)
forall s t a b r.
APrism s t a b -> ((b -> t) -> (s -> Either t a) -> r) -> r
withPrism APrism s t a b
k (((b -> t) -> (s -> Either t a) -> p a (f b) -> p s (f t))
-> p a (f b) -> p s (f t))
-> ((b -> t) -> (s -> Either t a) -> p a (f b) -> p s (f t))
-> p a (f b)
-> p s (f t)
forall a b. (a -> b) -> a -> b
$ \b -> t
bt s -> Either t a
sta -> (b -> t) -> (s -> Either t a) -> Prism s t a b
forall b t s a. (b -> t) -> (s -> Either t a) -> Prism s t a b
prism b -> t
bt s -> Either t a
sta
{-# INLINE clonePrism #-}
prism :: (b -> t) -> (s -> Either t a) -> Prism s t a b
prism :: (b -> t) -> (s -> Either t a) -> Prism s t a b
prism b -> t
bt s -> Either t a
seta = (s -> Either t a)
-> (Either t (f b) -> f t)
-> p (Either t a) (Either t (f b))
-> p s (f t)
forall (p :: * -> * -> *) a b c d.
Profunctor p =>
(a -> b) -> (c -> d) -> p b c -> p a d
dimap s -> Either t a
seta ((t -> f t) -> (f b -> f t) -> Either t (f b) -> f t
forall a c b. (a -> c) -> (b -> c) -> Either a b -> c
either t -> f t
forall (f :: * -> *) a. Applicative f => a -> f a
pure ((b -> t) -> f b -> f t
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap b -> t
bt)) (p (Either t a) (Either t (f b)) -> p s (f t))
-> (p a (f b) -> p (Either t a) (Either t (f b)))
-> p a (f b)
-> p s (f t)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. p a (f b) -> p (Either t a) (Either t (f b))
forall (p :: * -> * -> *) a b c.
Choice p =>
p a b -> p (Either c a) (Either c b)
right'
{-# INLINE prism #-}
prism' :: (b -> s) -> (s -> Maybe a) -> Prism s s a b
prism' :: (b -> s) -> (s -> Maybe a) -> Prism s s a b
prism' b -> s
bs s -> Maybe a
sma = (b -> s) -> (s -> Either s a) -> Prism s s a b
forall b t s a. (b -> t) -> (s -> Either t a) -> Prism s t a b
prism b -> s
bs (\s
s -> Either s a -> (a -> Either s a) -> Maybe a -> Either s a
forall b a. b -> (a -> b) -> Maybe a -> b
maybe (s -> Either s a
forall a b. a -> Either a b
Left s
s) a -> Either s a
forall a b. b -> Either a b
Right (s -> Maybe a
sma s
s))
{-# INLINE prism' #-}
outside :: Representable p => APrism s t a b -> Lens (p t r) (p s r) (p b r) (p a r)
outside :: APrism s t a b -> Lens (p t r) (p s r) (p b r) (p a r)
outside APrism s t a b
k = APrism s t a b
-> ((b -> t)
-> (s -> Either t a) -> (p b r -> f (p a r)) -> p t r -> f (p s r))
-> (p b r -> f (p a r))
-> p t r
-> f (p s r)
forall s t a b r.
APrism s t a b -> ((b -> t) -> (s -> Either t a) -> r) -> r
withPrism APrism s t a b
k (((b -> t)
-> (s -> Either t a) -> (p b r -> f (p a r)) -> p t r -> f (p s r))
-> (p b r -> f (p a r)) -> p t r -> f (p s r))
-> ((b -> t)
-> (s -> Either t a) -> (p b r -> f (p a r)) -> p t r -> f (p s r))
-> (p b r -> f (p a r))
-> p t r
-> f (p s r)
forall a b. (a -> b) -> a -> b
$ \b -> t
bt s -> Either t a
seta p b r -> f (p a r)
f p t r
ft ->
p b r -> f (p a r)
f ((b -> t) -> p t r -> p b r
forall (p :: * -> * -> *) a b c.
Profunctor p =>
(a -> b) -> p b c -> p a c
lmap b -> t
bt p t r
ft) f (p a r) -> (p a r -> p s r) -> f (p s r)
forall (f :: * -> *) a b. Functor f => f a -> (a -> b) -> f b
<&> \p a r
fa -> (s -> Rep p r) -> p s r
forall (p :: * -> * -> *) d c.
Representable p =>
(d -> Rep p c) -> p d c
tabulate ((s -> Rep p r) -> p s r) -> (s -> Rep p r) -> p s r
forall a b. (a -> b) -> a -> b
$ (t -> Rep p r) -> (a -> Rep p r) -> Either t a -> Rep p r
forall a c b. (a -> c) -> (b -> c) -> Either a b -> c
either (p t r -> t -> Rep p r
forall (p :: * -> * -> *) (f :: * -> *) a b.
Sieve p f =>
p a b -> a -> f b
sieve p t r
ft) (p a r -> a -> Rep p r
forall (p :: * -> * -> *) (f :: * -> *) a b.
Sieve p f =>
p a b -> a -> f b
sieve p a r
fa) (Either t a -> Rep p r) -> (s -> Either t a) -> s -> Rep p r
forall b c a. (b -> c) -> (a -> b) -> a -> c
. s -> Either t a
seta
{-# INLINE outside #-}
without :: APrism s t a b
-> APrism u v c d
-> Prism (Either s u) (Either t v) (Either a c) (Either b d)
without :: APrism s t a b
-> APrism u v c d
-> Prism (Either s u) (Either t v) (Either a c) (Either b d)
without APrism s t a b
k APrism u v c d
k' =
APrism s t a b
-> ((b -> t)
-> (s -> Either t a)
-> p (Either a c) (f (Either b d))
-> p (Either s u) (f (Either t v)))
-> p (Either a c) (f (Either b d))
-> p (Either s u) (f (Either t v))
forall s t a b r.
APrism s t a b -> ((b -> t) -> (s -> Either t a) -> r) -> r
withPrism APrism s t a b
k (((b -> t)
-> (s -> Either t a)
-> p (Either a c) (f (Either b d))
-> p (Either s u) (f (Either t v)))
-> p (Either a c) (f (Either b d))
-> p (Either s u) (f (Either t v)))
-> ((b -> t)
-> (s -> Either t a)
-> p (Either a c) (f (Either b d))
-> p (Either s u) (f (Either t v)))
-> p (Either a c) (f (Either b d))
-> p (Either s u) (f (Either t v))
forall a b. (a -> b) -> a -> b
$ \b -> t
bt s -> Either t a
seta ->
APrism u v c d
-> ((d -> v)
-> (u -> Either v c)
-> p (Either a c) (f (Either b d))
-> p (Either s u) (f (Either t v)))
-> p (Either a c) (f (Either b d))
-> p (Either s u) (f (Either t v))
forall s t a b r.
APrism s t a b -> ((b -> t) -> (s -> Either t a) -> r) -> r
withPrism APrism u v c d
k' (((d -> v)
-> (u -> Either v c)
-> p (Either a c) (f (Either b d))
-> p (Either s u) (f (Either t v)))
-> p (Either a c) (f (Either b d))
-> p (Either s u) (f (Either t v)))
-> ((d -> v)
-> (u -> Either v c)
-> p (Either a c) (f (Either b d))
-> p (Either s u) (f (Either t v)))
-> p (Either a c) (f (Either b d))
-> p (Either s u) (f (Either t v))
forall a b. (a -> b) -> a -> b
$ \d -> v
dv u -> Either v c
uevc ->
(Either b d -> Either t v)
-> (Either s u -> Either (Either t v) (Either a c))
-> Prism (Either s u) (Either t v) (Either a c) (Either b d)
forall b t s a. (b -> t) -> (s -> Either t a) -> Prism s t a b
prism ((b -> t) -> (d -> v) -> Either b d -> Either t v
forall (p :: * -> * -> *) a b c d.
Bifunctor p =>
(a -> b) -> (c -> d) -> p a c -> p b d
bimap b -> t
bt d -> v
dv) ((Either s u -> Either (Either t v) (Either a c))
-> Prism (Either s u) (Either t v) (Either a c) (Either b d))
-> (Either s u -> Either (Either t v) (Either a c))
-> Prism (Either s u) (Either t v) (Either a c) (Either b d)
forall a b. (a -> b) -> a -> b
$ \Either s u
su ->
case Either s u
su of
Left s
s -> (t -> Either t v)
-> (a -> Either a c)
-> Either t a
-> Either (Either t v) (Either a c)
forall (p :: * -> * -> *) a b c d.
Bifunctor p =>
(a -> b) -> (c -> d) -> p a c -> p b d
bimap t -> Either t v
forall a b. a -> Either a b
Left a -> Either a c
forall a b. a -> Either a b
Left (s -> Either t a
seta s
s)
Right u
u -> (v -> Either t v)
-> (c -> Either a c)
-> Either v c
-> Either (Either t v) (Either a c)
forall (p :: * -> * -> *) a b c d.
Bifunctor p =>
(a -> b) -> (c -> d) -> p a c -> p b d
bimap v -> Either t v
forall a b. b -> Either a b
Right c -> Either a c
forall a b. b -> Either a b
Right (u -> Either v c
uevc u
u)
{-# INLINE without #-}
aside :: APrism s t a b -> Prism (e, s) (e, t) (e, a) (e, b)
aside :: APrism s t a b -> Prism (e, s) (e, t) (e, a) (e, b)
aside APrism s t a b
k =
APrism s t a b
-> ((b -> t)
-> (s -> Either t a) -> p (e, a) (f (e, b)) -> p (e, s) (f (e, t)))
-> p (e, a) (f (e, b))
-> p (e, s) (f (e, t))
forall s t a b r.
APrism s t a b -> ((b -> t) -> (s -> Either t a) -> r) -> r
withPrism APrism s t a b
k (((b -> t)
-> (s -> Either t a) -> p (e, a) (f (e, b)) -> p (e, s) (f (e, t)))
-> p (e, a) (f (e, b)) -> p (e, s) (f (e, t)))
-> ((b -> t)
-> (s -> Either t a) -> p (e, a) (f (e, b)) -> p (e, s) (f (e, t)))
-> p (e, a) (f (e, b))
-> p (e, s) (f (e, t))
forall a b. (a -> b) -> a -> b
$ \b -> t
bt s -> Either t a
seta ->
((e, b) -> (e, t))
-> ((e, s) -> Either (e, t) (e, a))
-> Prism (e, s) (e, t) (e, a) (e, b)
forall b t s a. (b -> t) -> (s -> Either t a) -> Prism s t a b
prism ((b -> t) -> (e, b) -> (e, t)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap b -> t
bt) (((e, s) -> Either (e, t) (e, a))
-> Prism (e, s) (e, t) (e, a) (e, b))
-> ((e, s) -> Either (e, t) (e, a))
-> Prism (e, s) (e, t) (e, a) (e, b)
forall a b. (a -> b) -> a -> b
$ \(e
e,s
s) ->
case s -> Either t a
seta s
s of
Left t
t -> (e, t) -> Either (e, t) (e, a)
forall a b. a -> Either a b
Left (e
e,t
t)
Right a
a -> (e, a) -> Either (e, t) (e, a)
forall a b. b -> Either a b
Right (e
e,a
a)
{-# INLINE aside #-}
below :: Traversable f => APrism' s a -> Prism' (f s) (f a)
below :: APrism' s a -> Prism' (f s) (f a)
below APrism' s a
k =
APrism' s a
-> ((a -> s)
-> (s -> Either s a) -> p (f a) (f (f a)) -> p (f s) (f (f s)))
-> p (f a) (f (f a))
-> p (f s) (f (f s))
forall s t a b r.
APrism s t a b -> ((b -> t) -> (s -> Either t a) -> r) -> r
withPrism APrism' s a
k (((a -> s)
-> (s -> Either s a) -> p (f a) (f (f a)) -> p (f s) (f (f s)))
-> p (f a) (f (f a)) -> p (f s) (f (f s)))
-> ((a -> s)
-> (s -> Either s a) -> p (f a) (f (f a)) -> p (f s) (f (f s)))
-> p (f a) (f (f a))
-> p (f s) (f (f s))
forall a b. (a -> b) -> a -> b
$ \a -> s
bt s -> Either s a
seta ->
(f a -> f s) -> (f s -> Either (f s) (f a)) -> Prism' (f s) (f a)
forall b t s a. (b -> t) -> (s -> Either t a) -> Prism s t a b
prism ((a -> s) -> f a -> f s
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap a -> s
bt) ((f s -> Either (f s) (f a)) -> Prism' (f s) (f a))
-> (f s -> Either (f s) (f a)) -> Prism' (f s) (f a)
forall a b. (a -> b) -> a -> b
$ \f s
s ->
case (s -> Either s a) -> f s -> Either s (f a)
forall (t :: * -> *) (f :: * -> *) a b.
(Traversable t, Applicative f) =>
(a -> f b) -> t a -> f (t b)
traverse s -> Either s a
seta f s
s of
Left s
_ -> f s -> Either (f s) (f a)
forall a b. a -> Either a b
Left f s
s
Right f a
t -> f a -> Either (f s) (f a)
forall a b. b -> Either a b
Right f a
t
{-# INLINE below #-}
isn't :: APrism s t a b -> s -> Bool
isn't :: APrism s t a b -> s -> Bool
isn't APrism s t a b
k s
s =
case APrism s t a b -> s -> Either t a
forall s t a b. APrism s t a b -> s -> Either t a
matching APrism s t a b
k s
s of
Left t
_ -> Bool
True
Right a
_ -> Bool
False
{-# INLINE isn't #-}
matching :: APrism s t a b -> s -> Either t a
matching :: APrism s t a b -> s -> Either t a
matching APrism s t a b
k = APrism s t a b
-> ((b -> t) -> (s -> Either t a) -> s -> Either t a)
-> s
-> Either t a
forall s t a b r.
APrism s t a b -> ((b -> t) -> (s -> Either t a) -> r) -> r
withPrism APrism s t a b
k (((b -> t) -> (s -> Either t a) -> s -> Either t a)
-> s -> Either t a)
-> ((b -> t) -> (s -> Either t a) -> s -> Either t a)
-> s
-> Either t a
forall a b. (a -> b) -> a -> b
$ \b -> t
_ s -> Either t a
seta -> s -> Either t a
seta
{-# INLINE matching #-}
matching' :: LensLike (Either a) s t a b -> s -> Either t a
matching' :: LensLike (Either a) s t a b -> s -> Either t a
matching' LensLike (Either a) s t a b
k = (a -> Either t a) -> (t -> Either t a) -> Either a t -> Either t a
forall a c b. (a -> c) -> (b -> c) -> Either a b -> c
either a -> Either t a
forall a b. b -> Either a b
Right t -> Either t a
forall a b. a -> Either a b
Left (Either a t -> Either t a) -> (s -> Either a t) -> s -> Either t a
forall b c a. (b -> c) -> (a -> b) -> a -> c
. LensLike (Either a) s t a b
k a -> Either a b
forall a b. a -> Either a b
Left
{-# INLINE matching' #-}
_Left :: Prism (Either a c) (Either b c) a b
_Left :: p a (f b) -> p (Either a c) (f (Either b c))
_Left = (b -> Either b c)
-> (Either a c -> Either (Either b c) a)
-> Prism (Either a c) (Either b c) a b
forall b t s a. (b -> t) -> (s -> Either t a) -> Prism s t a b
prism b -> Either b c
forall a b. a -> Either a b
Left ((Either a c -> Either (Either b c) a)
-> Prism (Either a c) (Either b c) a b)
-> (Either a c -> Either (Either b c) a)
-> Prism (Either a c) (Either b c) a b
forall a b. (a -> b) -> a -> b
$ (a -> Either (Either b c) a)
-> (c -> Either (Either b c) a)
-> Either a c
-> Either (Either b c) a
forall a c b. (a -> c) -> (b -> c) -> Either a b -> c
either a -> Either (Either b c) a
forall a b. b -> Either a b
Right (Either b c -> Either (Either b c) a
forall a b. a -> Either a b
Left (Either b c -> Either (Either b c) a)
-> (c -> Either b c) -> c -> Either (Either b c) a
forall b c a. (b -> c) -> (a -> b) -> a -> c
. c -> Either b c
forall a b. b -> Either a b
Right)
{-# INLINE _Left #-}
_Right :: Prism (Either c a) (Either c b) a b
_Right :: p a (f b) -> p (Either c a) (f (Either c b))
_Right = (b -> Either c b)
-> (Either c a -> Either (Either c b) a)
-> Prism (Either c a) (Either c b) a b
forall b t s a. (b -> t) -> (s -> Either t a) -> Prism s t a b
prism b -> Either c b
forall a b. b -> Either a b
Right ((Either c a -> Either (Either c b) a)
-> Prism (Either c a) (Either c b) a b)
-> (Either c a -> Either (Either c b) a)
-> Prism (Either c a) (Either c b) a b
forall a b. (a -> b) -> a -> b
$ (c -> Either (Either c b) a)
-> (a -> Either (Either c b) a)
-> Either c a
-> Either (Either c b) a
forall a c b. (a -> c) -> (b -> c) -> Either a b -> c
either (Either c b -> Either (Either c b) a
forall a b. a -> Either a b
Left (Either c b -> Either (Either c b) a)
-> (c -> Either c b) -> c -> Either (Either c b) a
forall b c a. (b -> c) -> (a -> b) -> a -> c
. c -> Either c b
forall a b. a -> Either a b
Left) a -> Either (Either c b) a
forall a b. b -> Either a b
Right
{-# INLINE _Right #-}
_Just :: Prism (Maybe a) (Maybe b) a b
_Just :: p a (f b) -> p (Maybe a) (f (Maybe b))
_Just = (b -> Maybe b)
-> (Maybe a -> Either (Maybe b) a) -> Prism (Maybe a) (Maybe b) a b
forall b t s a. (b -> t) -> (s -> Either t a) -> Prism s t a b
prism b -> Maybe b
forall a. a -> Maybe a
Just ((Maybe a -> Either (Maybe b) a) -> Prism (Maybe a) (Maybe b) a b)
-> (Maybe a -> Either (Maybe b) a) -> Prism (Maybe a) (Maybe b) a b
forall a b. (a -> b) -> a -> b
$ Either (Maybe b) a
-> (a -> Either (Maybe b) a) -> Maybe a -> Either (Maybe b) a
forall b a. b -> (a -> b) -> Maybe a -> b
maybe (Maybe b -> Either (Maybe b) a
forall a b. a -> Either a b
Left Maybe b
forall a. Maybe a
Nothing) a -> Either (Maybe b) a
forall a b. b -> Either a b
Right
{-# INLINE _Just #-}
_Nothing :: Prism' (Maybe a) ()
_Nothing :: p () (f ()) -> p (Maybe a) (f (Maybe a))
_Nothing = (() -> Maybe a)
-> (Maybe a -> Maybe ()) -> Prism (Maybe a) (Maybe a) () ()
forall b s a. (b -> s) -> (s -> Maybe a) -> Prism s s a b
prism' (Maybe a -> () -> Maybe a
forall a b. a -> b -> a
const Maybe a
forall a. Maybe a
Nothing) ((Maybe a -> Maybe ()) -> Prism (Maybe a) (Maybe a) () ())
-> (Maybe a -> Maybe ()) -> Prism (Maybe a) (Maybe a) () ()
forall a b. (a -> b) -> a -> b
$ Maybe () -> (a -> Maybe ()) -> Maybe a -> Maybe ()
forall b a. b -> (a -> b) -> Maybe a -> b
maybe (() -> Maybe ()
forall a. a -> Maybe a
Just ()) (Maybe () -> a -> Maybe ()
forall a b. a -> b -> a
const Maybe ()
forall a. Maybe a
Nothing)
{-# INLINE _Nothing #-}
_Void :: Prism s s a Void
_Void :: p a (f Void) -> p s (f s)
_Void = (Void -> s) -> (s -> Either s a) -> Prism s s a Void
forall b t s a. (b -> t) -> (s -> Either t a) -> Prism s t a b
prism Void -> s
forall a. Void -> a
absurd s -> Either s a
forall a b. a -> Either a b
Left
{-# INLINE _Void #-}
only :: Eq a => a -> Prism' a ()
only :: a -> Prism' a ()
only a
a = (() -> a) -> (a -> Maybe ()) -> Prism' a ()
forall b s a. (b -> s) -> (s -> Maybe a) -> Prism s s a b
prism' (\() -> a
a) ((a -> Maybe ()) -> Prism' a ()) -> (a -> Maybe ()) -> Prism' a ()
forall a b. (a -> b) -> a -> b
$ Bool -> Maybe ()
forall (f :: * -> *). Alternative f => Bool -> f ()
guard (Bool -> Maybe ()) -> (a -> Bool) -> a -> Maybe ()
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (a
a a -> a -> Bool
forall a. Eq a => a -> a -> Bool
==)
{-# INLINE only #-}
nearly :: a -> (a -> Bool) -> Prism' a ()
nearly :: a -> (a -> Bool) -> Prism' a ()
nearly a
a a -> Bool
p = (() -> a) -> (a -> Maybe ()) -> Prism' a ()
forall b s a. (b -> s) -> (s -> Maybe a) -> Prism s s a b
prism' (\() -> a
a) ((a -> Maybe ()) -> Prism' a ()) -> (a -> Maybe ()) -> Prism' a ()
forall a b. (a -> b) -> a -> b
$ Bool -> Maybe ()
forall (f :: * -> *). Alternative f => Bool -> f ()
guard (Bool -> Maybe ()) -> (a -> Bool) -> a -> Maybe ()
forall b c a. (b -> c) -> (a -> b) -> a -> c
. a -> Bool
p
{-# INLINE nearly #-}
_Show :: (Read a, Show a) => Prism' String a
_Show :: Prism' String a
_Show = (a -> String) -> (String -> Either String a) -> Prism' String a
forall b t s a. (b -> t) -> (s -> Either t a) -> Prism s t a b
prism a -> String
forall a. Show a => a -> String
show ((String -> Either String a) -> Prism' String a)
-> (String -> Either String a) -> Prism' String a
forall a b. (a -> b) -> a -> b
$ \String
s -> case ReadS a
forall a. Read a => ReadS a
reads String
s of
[(a
a,String
"")] -> a -> Either String a
forall a b. b -> Either a b
Right a
a
[(a, String)]
_ -> String -> Either String a
forall a b. a -> Either a b
Left String
s
{-# INLINE _Show #-}
class Prefixed t where
prefixed :: t -> Prism' t t
instance Eq a => Prefixed [a] where
prefixed :: [a] -> Prism' [a] [a]
prefixed [a]
ps = ([a] -> [a]) -> ([a] -> Maybe [a]) -> Prism' [a] [a]
forall b s a. (b -> s) -> (s -> Maybe a) -> Prism s s a b
prism' ([a]
ps [a] -> [a] -> [a]
forall a. [a] -> [a] -> [a]
++) ([a] -> [a] -> Maybe [a]
forall a. Eq a => [a] -> [a] -> Maybe [a]
List.stripPrefix [a]
ps)
{-# INLINE prefixed #-}
instance Prefixed TS.Text where
prefixed :: Text -> Prism' Text Text
prefixed Text
p = (Text -> Text) -> (Text -> Maybe Text) -> Prism' Text Text
forall b s a. (b -> s) -> (s -> Maybe a) -> Prism s s a b
prism' (Text
p Text -> Text -> Text
forall a. Semigroup a => a -> a -> a
<>) (Text -> Text -> Maybe Text
TS.stripPrefix Text
p)
{-# INLINE prefixed #-}
instance Prefixed TL.Text where
prefixed :: Text -> Prism' Text Text
prefixed Text
p = (Text -> Text) -> (Text -> Maybe Text) -> Prism' Text Text
forall b s a. (b -> s) -> (s -> Maybe a) -> Prism s s a b
prism' (Text
p Text -> Text -> Text
forall a. Semigroup a => a -> a -> a
<>) (Text -> Text -> Maybe Text
TL.stripPrefix Text
p)
{-# INLINE prefixed #-}
instance Prefixed BS.ByteString where
prefixed :: ByteString -> Prism' ByteString ByteString
prefixed ByteString
p = (ByteString -> ByteString)
-> (ByteString -> Maybe ByteString) -> Prism' ByteString ByteString
forall b s a. (b -> s) -> (s -> Maybe a) -> Prism s s a b
prism' (ByteString
p ByteString -> ByteString -> ByteString
forall a. Semigroup a => a -> a -> a
<>) (ByteString -> ByteString -> Maybe ByteString
BS.stripPrefix ByteString
p)
{-# INLINE prefixed #-}
instance Prefixed BL.ByteString where
prefixed :: ByteString -> Prism' ByteString ByteString
prefixed ByteString
p = (ByteString -> ByteString)
-> (ByteString -> Maybe ByteString) -> Prism' ByteString ByteString
forall b s a. (b -> s) -> (s -> Maybe a) -> Prism s s a b
prism' (ByteString
p ByteString -> ByteString -> ByteString
forall a. Semigroup a => a -> a -> a
<>) (ByteString -> ByteString -> Maybe ByteString
BL.stripPrefix ByteString
p)
{-# INLINE prefixed #-}
class Suffixed t where
suffixed :: t -> Prism' t t
instance Eq a => Suffixed [a] where
suffixed :: [a] -> Prism' [a] [a]
suffixed [a]
qs = ([a] -> [a]) -> ([a] -> Maybe [a]) -> Prism' [a] [a]
forall b s a. (b -> s) -> (s -> Maybe a) -> Prism s s a b
prism' ([a] -> [a] -> [a]
forall a. [a] -> [a] -> [a]
++ [a]
qs) ([a] -> [a] -> Maybe [a]
forall a. Eq a => [a] -> [a] -> Maybe [a]
List.stripSuffix [a]
qs)
{-# INLINE suffixed #-}
instance Suffixed TS.Text where
suffixed :: Text -> Prism' Text Text
suffixed Text
qs = (Text -> Text) -> (Text -> Maybe Text) -> Prism' Text Text
forall b s a. (b -> s) -> (s -> Maybe a) -> Prism s s a b
prism' (Text -> Text -> Text
forall a. Semigroup a => a -> a -> a
<> Text
qs) (Text -> Text -> Maybe Text
TS.stripSuffix Text
qs)
{-# INLINE suffixed #-}
instance Suffixed TL.Text where
suffixed :: Text -> Prism' Text Text
suffixed Text
qs = (Text -> Text) -> (Text -> Maybe Text) -> Prism' Text Text
forall b s a. (b -> s) -> (s -> Maybe a) -> Prism s s a b
prism' (Text -> Text -> Text
forall a. Semigroup a => a -> a -> a
<> Text
qs) (Text -> Text -> Maybe Text
TL.stripSuffix Text
qs)
{-# INLINE suffixed #-}
instance Suffixed BS.ByteString where
suffixed :: ByteString -> Prism' ByteString ByteString
suffixed ByteString
qs = (ByteString -> ByteString)
-> (ByteString -> Maybe ByteString) -> Prism' ByteString ByteString
forall b s a. (b -> s) -> (s -> Maybe a) -> Prism s s a b
prism' (ByteString -> ByteString -> ByteString
forall a. Semigroup a => a -> a -> a
<> ByteString
qs) (ByteString -> ByteString -> Maybe ByteString
BS.stripSuffix ByteString
qs)
{-# INLINE suffixed #-}
instance Suffixed BL.ByteString where
suffixed :: ByteString -> Prism' ByteString ByteString
suffixed ByteString
qs = (ByteString -> ByteString)
-> (ByteString -> Maybe ByteString) -> Prism' ByteString ByteString
forall b s a. (b -> s) -> (s -> Maybe a) -> Prism s s a b
prism' (ByteString -> ByteString -> ByteString
forall a. Semigroup a => a -> a -> a
<> ByteString
qs) (ByteString -> ByteString -> Maybe ByteString
BL.stripSuffix ByteString
qs)
{-# INLINE suffixed #-}