{-# LANGUAGE TypeOperators #-}
{-# LANGUAGE UndecidableInstances #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE TypeApplications #-}
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE GADTs #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE PolyKinds #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE RankNTypes #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE ConstraintKinds #-}
{-# LANGUAGE NoStarIsType #-}
{-# LANGUAGE EmptyDataDeriving #-}
module Predicate.Data.Regex (
Re
, Re'
, Rescan
, Rescan'
, RescanRanges
, RescanRanges'
, Resplit
, Resplit'
, ReplaceAll
, ReplaceAll'
, ReplaceOne
, ReplaceOne'
, ReplaceAllString
, ReplaceAllString'
, ReplaceOneString
, ReplaceOneString'
, ReplaceFn
, ReplaceFn1
, ReplaceFn2
, ReplaceFn3
) where
import Predicate.Core
import Predicate.Misc
import Predicate.Util
import Data.Proxy (Proxy(Proxy))
import qualified Text.Regex.PCRE.Heavy as RH
data Re' (rs :: [ROpt]) p q deriving Int -> Re' rs p q -> ShowS
[Re' rs p q] -> ShowS
Re' rs p q -> String
(Int -> Re' rs p q -> ShowS)
-> (Re' rs p q -> String)
-> ([Re' rs p q] -> ShowS)
-> Show (Re' rs p q)
forall (rs :: [ROpt]) k (p :: k) k (q :: k).
Int -> Re' rs p q -> ShowS
forall (rs :: [ROpt]) k (p :: k) k (q :: k). [Re' rs p q] -> ShowS
forall (rs :: [ROpt]) k (p :: k) k (q :: k). Re' rs p q -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [Re' rs p q] -> ShowS
$cshowList :: forall (rs :: [ROpt]) k (p :: k) k (q :: k). [Re' rs p q] -> ShowS
show :: Re' rs p q -> String
$cshow :: forall (rs :: [ROpt]) k (p :: k) k (q :: k). Re' rs p q -> String
showsPrec :: Int -> Re' rs p q -> ShowS
$cshowsPrec :: forall (rs :: [ROpt]) k (p :: k) k (q :: k).
Int -> Re' rs p q -> ShowS
Show
instance ( GetROpts rs
, PP p x ~ String
, PP q x ~ String
, P p x
, P q x
) => P (Re' rs p q) x where
type PP (Re' rs p q) x = Bool
eval :: proxy (Re' rs p q) -> POpts -> x -> m (TT (PP (Re' rs p q) x))
eval proxy (Re' rs p q)
_ POpts
opts x
x = do
let msg0 :: String
msg0 = String
"Re" String -> ShowS
forall a. Semigroup a => a -> a -> a
<> [PCREOption] -> ShowS
forall (t :: Type -> Type) m a.
(Foldable t, Monoid m) =>
t a -> m -> m
unlessNull [PCREOption]
rs (String
"' " String -> ShowS
forall a. Semigroup a => a -> a -> a
<> [String] -> String
displayROpts [String]
fs)
([String]
fs,[PCREOption]
rs) = GetROpts rs => ([String], [PCREOption])
forall (os :: [ROpt]). GetROpts os => ([String], [PCREOption])
getROpts @rs
Either (TT Bool) (String, String, TT String, TT String)
lr <- Inline
-> String
-> Proxy p
-> Proxy q
-> POpts
-> x
-> [Tree PE]
-> m (Either (TT Bool) (PP p x, PP q x, TT (PP p x), TT (PP q x)))
forall k1 k2 (p :: k1) a (q :: k2) (m :: Type -> Type)
(proxy1 :: k1 -> Type) (proxy2 :: k2 -> Type) x.
(P p a, P q a, MonadEval m) =>
Inline
-> String
-> proxy1 p
-> proxy2 q
-> POpts
-> a
-> [Tree PE]
-> m (Either (TT x) (PP p a, PP q a, TT (PP p a), TT (PP q a)))
runPQ Inline
NoInline String
msg0 (Proxy p
forall k (t :: k). Proxy t
Proxy @p) (Proxy q
forall k (t :: k). Proxy t
Proxy @q) POpts
opts x
x []
TT Bool -> m (TT Bool)
forall (f :: Type -> Type) a. Applicative f => a -> f a
pure (TT Bool -> m (TT Bool)) -> TT Bool -> m (TT Bool)
forall a b. (a -> b) -> a -> b
$ case Either (TT Bool) (String, String, TT String, TT String)
lr of
Left TT Bool
e -> TT Bool
e
Right (String
p,String
q,TT String
pp,TT String
qq) ->
let msg1 :: String
msg1 = String
msg0 String -> ShowS
forall a. Semigroup a => a -> a -> a
<> String
" (" String -> ShowS
forall a. Semigroup a => a -> a -> a
<> String
p String -> ShowS
forall a. Semigroup a => a -> a -> a
<> String
")"
hhs :: [Tree PE]
hhs = [TT String -> Tree PE
forall a. TT a -> Tree PE
hh TT String
pp, TT String -> Tree PE
forall a. TT a -> Tree PE
hh TT String
qq]
in case String -> String -> Either (String, String) Regex
forall (rs :: [ROpt]).
GetROpts rs =>
String -> String -> Either (String, String) Regex
compileRegex @rs String
msg1 String
p of
Left (String
e,String
e1) -> POpts -> Val Bool -> String -> [Tree PE] -> TT Bool
forall a. POpts -> Val a -> String -> [Tree PE] -> TT a
mkNode POpts
opts (String -> Val Bool
forall a. String -> Val a
Fail String
e) String
e1 [Tree PE]
hhs
Right Regex
regex ->
let b :: Bool
b = String
q String -> Regex -> Bool
forall a.
(ConvertibleStrings SBS a, ConvertibleStrings a SBS) =>
a -> Regex -> Bool
RH.=~ Regex
regex
in POpts -> Bool -> String -> [Tree PE] -> TT Bool
mkNodeB POpts
opts Bool
b (String
msg1 String -> ShowS
forall a. Semigroup a => a -> a -> a
<> POpts -> String -> ShowS
litVerbose POpts
opts String
" | " String
q) [Tree PE]
hhs
data Re p deriving Int -> Re p -> ShowS
[Re p] -> ShowS
Re p -> String
(Int -> Re p -> ShowS)
-> (Re p -> String) -> ([Re p] -> ShowS) -> Show (Re p)
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
forall k (p :: k). Int -> Re p -> ShowS
forall k (p :: k). [Re p] -> ShowS
forall k (p :: k). Re p -> String
showList :: [Re p] -> ShowS
$cshowList :: forall k (p :: k). [Re p] -> ShowS
show :: Re p -> String
$cshow :: forall k (p :: k). Re p -> String
showsPrec :: Int -> Re p -> ShowS
$cshowsPrec :: forall k (p :: k). Int -> Re p -> ShowS
Show
type ReT p = Re' '[] p Id
instance P (ReT p) x => P (Re p) x where
type PP (Re p) x = PP (ReT p) x
eval :: proxy (Re p) -> POpts -> x -> m (TT (PP (Re p) x))
eval proxy (Re p)
_ = Proxy (ReT p) -> POpts -> x -> m (TT (PP (ReT p) x))
forall k (m :: Type -> Type) (p :: k) a (proxy :: k -> Type).
(MonadEval m, P p a, PP p a ~ Bool) =>
proxy p -> POpts -> a -> m (TT (PP p a))
evalBool (Proxy (ReT p)
forall k (t :: k). Proxy t
Proxy @(ReT p))
data Rescan' (rs :: [ROpt]) p q deriving Int -> Rescan' rs p q -> ShowS
[Rescan' rs p q] -> ShowS
Rescan' rs p q -> String
(Int -> Rescan' rs p q -> ShowS)
-> (Rescan' rs p q -> String)
-> ([Rescan' rs p q] -> ShowS)
-> Show (Rescan' rs p q)
forall (rs :: [ROpt]) k (p :: k) k (q :: k).
Int -> Rescan' rs p q -> ShowS
forall (rs :: [ROpt]) k (p :: k) k (q :: k).
[Rescan' rs p q] -> ShowS
forall (rs :: [ROpt]) k (p :: k) k (q :: k).
Rescan' rs p q -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [Rescan' rs p q] -> ShowS
$cshowList :: forall (rs :: [ROpt]) k (p :: k) k (q :: k).
[Rescan' rs p q] -> ShowS
show :: Rescan' rs p q -> String
$cshow :: forall (rs :: [ROpt]) k (p :: k) k (q :: k).
Rescan' rs p q -> String
showsPrec :: Int -> Rescan' rs p q -> ShowS
$cshowsPrec :: forall (rs :: [ROpt]) k (p :: k) k (q :: k).
Int -> Rescan' rs p q -> ShowS
Show
instance ( GetROpts rs
, PP p x ~ String
, PP q x ~ String
, P p x
, P q x
) => P (Rescan' rs p q) x where
type PP (Rescan' rs p q) x = [(String, [String])]
eval :: proxy (Rescan' rs p q)
-> POpts -> x -> m (TT (PP (Rescan' rs p q) x))
eval proxy (Rescan' rs p q)
_ POpts
opts x
x = do
let msg0 :: String
msg0 = String
"Rescan" String -> ShowS
forall a. Semigroup a => a -> a -> a
<> [PCREOption] -> ShowS
forall (t :: Type -> Type) m a.
(Foldable t, Monoid m) =>
t a -> m -> m
unlessNull [PCREOption]
rs (String
"' " String -> ShowS
forall a. Semigroup a => a -> a -> a
<> [String] -> String
displayROpts [String]
fs)
([String]
fs,[PCREOption]
rs) = GetROpts rs => ([String], [PCREOption])
forall (os :: [ROpt]). GetROpts os => ([String], [PCREOption])
getROpts @rs
Either
(TT [(String, [String])]) (String, String, TT String, TT String)
lr <- Inline
-> String
-> Proxy p
-> Proxy q
-> POpts
-> x
-> [Tree PE]
-> m (Either
(TT [(String, [String])])
(PP p x, PP q x, TT (PP p x), TT (PP q x)))
forall k1 k2 (p :: k1) a (q :: k2) (m :: Type -> Type)
(proxy1 :: k1 -> Type) (proxy2 :: k2 -> Type) x.
(P p a, P q a, MonadEval m) =>
Inline
-> String
-> proxy1 p
-> proxy2 q
-> POpts
-> a
-> [Tree PE]
-> m (Either (TT x) (PP p a, PP q a, TT (PP p a), TT (PP q a)))
runPQ Inline
NoInline String
msg0 (Proxy p
forall k (t :: k). Proxy t
Proxy @p) (Proxy q
forall k (t :: k). Proxy t
Proxy @q) POpts
opts x
x []
TT [(String, [String])] -> m (TT [(String, [String])])
forall (f :: Type -> Type) a. Applicative f => a -> f a
pure (TT [(String, [String])] -> m (TT [(String, [String])]))
-> TT [(String, [String])] -> m (TT [(String, [String])])
forall a b. (a -> b) -> a -> b
$ case Either
(TT [(String, [String])]) (String, String, TT String, TT String)
lr of
Left TT [(String, [String])]
e -> TT [(String, [String])]
e
Right (String
p,String
q,TT String
pp,TT String
qq) ->
let msg1 :: String
msg1 = String
msg0 String -> ShowS
forall a. Semigroup a => a -> a -> a
<> String
" (" String -> ShowS
forall a. Semigroup a => a -> a -> a
<> String
p String -> ShowS
forall a. Semigroup a => a -> a -> a
<> String
")"
hhs :: [Tree PE]
hhs = [TT String -> Tree PE
forall a. TT a -> Tree PE
hh TT String
pp, TT String -> Tree PE
forall a. TT a -> Tree PE
hh TT String
qq]
in case String -> String -> Either (String, String) Regex
forall (rs :: [ROpt]).
GetROpts rs =>
String -> String -> Either (String, String) Regex
compileRegex @rs String
msg1 String
p of
Left (String
e,String
e1) -> POpts
-> Val [(String, [String])]
-> String
-> [Tree PE]
-> TT [(String, [String])]
forall a. POpts -> Val a -> String -> [Tree PE] -> TT a
mkNode POpts
opts (String -> Val [(String, [String])]
forall a. String -> Val a
Fail String
e) String
e1 [Tree PE]
hhs
Right Regex
regex ->
case Int
-> [(String, [String])]
-> ([(String, [String])], [(String, [String])])
forall a. Int -> [a] -> ([a], [a])
splitAt (POpts -> HKD Identity Int
forall (f :: Type -> Type). HOpts f -> HKD f Int
oRecursion POpts
opts) ([(String, [String])]
-> ([(String, [String])], [(String, [String])]))
-> [(String, [String])]
-> ([(String, [String])], [(String, [String])])
forall a b. (a -> b) -> a -> b
$ Regex -> String -> [(String, [String])]
forall a.
(ConvertibleStrings SBS a, ConvertibleStrings a SBS) =>
Regex -> a -> [(a, [a])]
RH.scan Regex
regex String
q of
([(String, [String])]
b, (String, [String])
_:[(String, [String])]
_) -> POpts
-> Val [(String, [String])]
-> String
-> [Tree PE]
-> TT [(String, [String])]
forall a. POpts -> Val a -> String -> [Tree PE] -> TT a
mkNode POpts
opts (String -> Val [(String, [String])]
forall a. String -> Val a
Fail (String
"Regex looping(" String -> ShowS
forall a. [a] -> [a] -> [a]
++ Int -> String
forall a. Show a => a -> String
show (POpts -> HKD Identity Int
forall (f :: Type -> Type). HOpts f -> HKD f Int
oRecursion POpts
opts) String -> ShowS
forall a. [a] -> [a] -> [a]
++ String
")")) (String
msg1 String -> ShowS
forall a. Semigroup a => a -> a -> a
<> String
" " String -> ShowS
forall a. Semigroup a => a -> a -> a
<> [(String, [String])] -> String
forall a. Show a => a -> String
show (Int -> [(String, [String])] -> [(String, [String])]
forall a. Int -> [a] -> [a]
take Int
10 [(String, [String])]
b) String -> ShowS
forall a. Semigroup a => a -> a -> a
<> String
"..." String -> ShowS
forall a. Semigroup a => a -> a -> a
<> POpts -> String -> ShowS
forall a. Show a => POpts -> String -> a -> String
showVerbose POpts
opts String
" | " String
q) [Tree PE]
hhs
([], [(String, [String])]
_) ->
POpts
-> Val [(String, [String])]
-> String
-> [Tree PE]
-> TT [(String, [String])]
forall a. POpts -> Val a -> String -> [Tree PE] -> TT a
mkNode POpts
opts (String -> Val [(String, [String])]
forall a. String -> Val a
Fail String
"Regex no results") (String
msg1 String -> ShowS
forall a. Semigroup a => a -> a -> a
<> POpts -> String -> ShowS
forall a. Show a => POpts -> String -> a -> String
showVerbose POpts
opts String
" | " String
q) [TT String -> Tree PE
forall a. TT a -> Tree PE
hh TT String
pp, TT String -> Tree PE
forall a. TT a -> Tree PE
hh TT String
qq]
([(String, [String])]
b, [(String, [String])]
_) -> POpts
-> Val [(String, [String])]
-> String
-> [Tree PE]
-> TT [(String, [String])]
forall a. POpts -> Val a -> String -> [Tree PE] -> TT a
mkNode POpts
opts ([(String, [String])] -> Val [(String, [String])]
forall a. a -> Val a
Val [(String, [String])]
b) (POpts -> String -> [(String, [String])] -> String -> ShowS
forall a1. Show a1 => POpts -> String -> a1 -> String -> ShowS
lit3 POpts
opts String
msg1 [(String, [String])]
b String
"" String
q) [TT String -> Tree PE
forall a. TT a -> Tree PE
hh TT String
pp, TT String -> Tree PE
forall a. TT a -> Tree PE
hh TT String
qq]
data Rescan p deriving Int -> Rescan p -> ShowS
[Rescan p] -> ShowS
Rescan p -> String
(Int -> Rescan p -> ShowS)
-> (Rescan p -> String) -> ([Rescan p] -> ShowS) -> Show (Rescan p)
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
forall k (p :: k). Int -> Rescan p -> ShowS
forall k (p :: k). [Rescan p] -> ShowS
forall k (p :: k). Rescan p -> String
showList :: [Rescan p] -> ShowS
$cshowList :: forall k (p :: k). [Rescan p] -> ShowS
show :: Rescan p -> String
$cshow :: forall k (p :: k). Rescan p -> String
showsPrec :: Int -> Rescan p -> ShowS
$cshowsPrec :: forall k (p :: k). Int -> Rescan p -> ShowS
Show
type RescanT p = Rescan' '[] p Id
instance P (RescanT p) x => P (Rescan p) x where
type PP (Rescan p) x = PP (RescanT p) x
eval :: proxy (Rescan p) -> POpts -> x -> m (TT (PP (Rescan p) x))
eval proxy (Rescan p)
_ = Proxy (RescanT p) -> POpts -> x -> m (TT (PP (RescanT p) x))
forall k (p :: k) a (m :: Type -> Type) (proxy :: k -> Type).
(P p a, MonadEval m) =>
proxy p -> POpts -> a -> m (TT (PP p a))
eval (Proxy (RescanT p)
forall k (t :: k). Proxy t
Proxy @(RescanT p))
data RescanRanges' (rs :: [ROpt]) p q deriving Int -> RescanRanges' rs p q -> ShowS
[RescanRanges' rs p q] -> ShowS
RescanRanges' rs p q -> String
(Int -> RescanRanges' rs p q -> ShowS)
-> (RescanRanges' rs p q -> String)
-> ([RescanRanges' rs p q] -> ShowS)
-> Show (RescanRanges' rs p q)
forall (rs :: [ROpt]) k (p :: k) k (q :: k).
Int -> RescanRanges' rs p q -> ShowS
forall (rs :: [ROpt]) k (p :: k) k (q :: k).
[RescanRanges' rs p q] -> ShowS
forall (rs :: [ROpt]) k (p :: k) k (q :: k).
RescanRanges' rs p q -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [RescanRanges' rs p q] -> ShowS
$cshowList :: forall (rs :: [ROpt]) k (p :: k) k (q :: k).
[RescanRanges' rs p q] -> ShowS
show :: RescanRanges' rs p q -> String
$cshow :: forall (rs :: [ROpt]) k (p :: k) k (q :: k).
RescanRanges' rs p q -> String
showsPrec :: Int -> RescanRanges' rs p q -> ShowS
$cshowsPrec :: forall (rs :: [ROpt]) k (p :: k) k (q :: k).
Int -> RescanRanges' rs p q -> ShowS
Show
instance ( GetROpts rs
, PP p x ~ String
, PP q x ~ String
, P p x
, P q x
) => P (RescanRanges' rs p q) x where
type PP (RescanRanges' rs p q) x = [((Int,Int), [(Int,Int)])]
eval :: proxy (RescanRanges' rs p q)
-> POpts -> x -> m (TT (PP (RescanRanges' rs p q) x))
eval proxy (RescanRanges' rs p q)
_ POpts
opts x
x = do
let msg0 :: String
msg0 = String
"RescanRanges" String -> ShowS
forall a. Semigroup a => a -> a -> a
<> [PCREOption] -> ShowS
forall (t :: Type -> Type) m a.
(Foldable t, Monoid m) =>
t a -> m -> m
unlessNull [PCREOption]
rs (String
"' " String -> ShowS
forall a. Semigroup a => a -> a -> a
<> [String] -> String
displayROpts [String]
fs)
([String]
fs,[PCREOption]
rs) = GetROpts rs => ([String], [PCREOption])
forall (os :: [ROpt]). GetROpts os => ([String], [PCREOption])
getROpts @rs
Either
(TT [((Int, Int), [(Int, Int)])])
(String, String, TT String, TT String)
lr <- Inline
-> String
-> Proxy p
-> Proxy q
-> POpts
-> x
-> [Tree PE]
-> m (Either
(TT [((Int, Int), [(Int, Int)])])
(PP p x, PP q x, TT (PP p x), TT (PP q x)))
forall k1 k2 (p :: k1) a (q :: k2) (m :: Type -> Type)
(proxy1 :: k1 -> Type) (proxy2 :: k2 -> Type) x.
(P p a, P q a, MonadEval m) =>
Inline
-> String
-> proxy1 p
-> proxy2 q
-> POpts
-> a
-> [Tree PE]
-> m (Either (TT x) (PP p a, PP q a, TT (PP p a), TT (PP q a)))
runPQ Inline
NoInline String
msg0 (Proxy p
forall k (t :: k). Proxy t
Proxy @p) (Proxy q
forall k (t :: k). Proxy t
Proxy @q) POpts
opts x
x []
TT [((Int, Int), [(Int, Int)])]
-> m (TT [((Int, Int), [(Int, Int)])])
forall (f :: Type -> Type) a. Applicative f => a -> f a
pure (TT [((Int, Int), [(Int, Int)])]
-> m (TT [((Int, Int), [(Int, Int)])]))
-> TT [((Int, Int), [(Int, Int)])]
-> m (TT [((Int, Int), [(Int, Int)])])
forall a b. (a -> b) -> a -> b
$ case Either
(TT [((Int, Int), [(Int, Int)])])
(String, String, TT String, TT String)
lr of
Left TT [((Int, Int), [(Int, Int)])]
e -> TT [((Int, Int), [(Int, Int)])]
e
Right (String
p,String
q,TT String
pp,TT String
qq) ->
let msg1 :: String
msg1 = String
msg0 String -> ShowS
forall a. Semigroup a => a -> a -> a
<> String
" (" String -> ShowS
forall a. Semigroup a => a -> a -> a
<> String
p String -> ShowS
forall a. Semigroup a => a -> a -> a
<> String
")"
hhs :: [Tree PE]
hhs = [TT String -> Tree PE
forall a. TT a -> Tree PE
hh TT String
pp, TT String -> Tree PE
forall a. TT a -> Tree PE
hh TT String
qq]
in case String -> String -> Either (String, String) Regex
forall (rs :: [ROpt]).
GetROpts rs =>
String -> String -> Either (String, String) Regex
compileRegex @rs String
msg1 String
p of
Left (String
e,String
e1) -> POpts
-> Val [((Int, Int), [(Int, Int)])]
-> String
-> [Tree PE]
-> TT [((Int, Int), [(Int, Int)])]
forall a. POpts -> Val a -> String -> [Tree PE] -> TT a
mkNode POpts
opts (String -> Val [((Int, Int), [(Int, Int)])]
forall a. String -> Val a
Fail String
e) String
e1 [Tree PE]
hhs
Right Regex
regex ->
case Int
-> [((Int, Int), [(Int, Int)])]
-> ([((Int, Int), [(Int, Int)])], [((Int, Int), [(Int, Int)])])
forall a. Int -> [a] -> ([a], [a])
splitAt (POpts -> HKD Identity Int
forall (f :: Type -> Type). HOpts f -> HKD f Int
oRecursion POpts
opts) ([((Int, Int), [(Int, Int)])]
-> ([((Int, Int), [(Int, Int)])], [((Int, Int), [(Int, Int)])]))
-> [((Int, Int), [(Int, Int)])]
-> ([((Int, Int), [(Int, Int)])], [((Int, Int), [(Int, Int)])])
forall a b. (a -> b) -> a -> b
$ Regex -> String -> [((Int, Int), [(Int, Int)])]
forall a.
(ConvertibleStrings SBS a, ConvertibleStrings a SBS) =>
Regex -> a -> [((Int, Int), [(Int, Int)])]
RH.scanRanges Regex
regex String
q of
([((Int, Int), [(Int, Int)])]
b, ((Int, Int), [(Int, Int)])
_:[((Int, Int), [(Int, Int)])]
_) -> POpts
-> Val [((Int, Int), [(Int, Int)])]
-> String
-> [Tree PE]
-> TT [((Int, Int), [(Int, Int)])]
forall a. POpts -> Val a -> String -> [Tree PE] -> TT a
mkNode POpts
opts (String -> Val [((Int, Int), [(Int, Int)])]
forall a. String -> Val a
Fail (String
"Regex looping(" String -> ShowS
forall a. [a] -> [a] -> [a]
++ Int -> String
forall a. Show a => a -> String
show (POpts -> HKD Identity Int
forall (f :: Type -> Type). HOpts f -> HKD f Int
oRecursion POpts
opts) String -> ShowS
forall a. [a] -> [a] -> [a]
++ String
")")) (String
msg1 String -> ShowS
forall a. Semigroup a => a -> a -> a
<> String
" " String -> ShowS
forall a. Semigroup a => a -> a -> a
<> [((Int, Int), [(Int, Int)])] -> String
forall a. Show a => a -> String
show (Int -> [((Int, Int), [(Int, Int)])] -> [((Int, Int), [(Int, Int)])]
forall a. Int -> [a] -> [a]
take Int
10 [((Int, Int), [(Int, Int)])]
b) String -> ShowS
forall a. Semigroup a => a -> a -> a
<> String
"..." String -> ShowS
forall a. Semigroup a => a -> a -> a
<> POpts -> String -> ShowS
forall a. Show a => POpts -> String -> a -> String
showVerbose POpts
opts String
" | " String
q) [Tree PE]
hhs
([], [((Int, Int), [(Int, Int)])]
_) ->
POpts
-> Val [((Int, Int), [(Int, Int)])]
-> String
-> [Tree PE]
-> TT [((Int, Int), [(Int, Int)])]
forall a. POpts -> Val a -> String -> [Tree PE] -> TT a
mkNode POpts
opts (String -> Val [((Int, Int), [(Int, Int)])]
forall a. String -> Val a
Fail String
"Regex no results") (String
msg1 String -> ShowS
forall a. Semigroup a => a -> a -> a
<> POpts -> String -> ShowS
forall a. Show a => POpts -> String -> a -> String
showVerbose POpts
opts String
" | " String
q) [Tree PE]
hhs
([((Int, Int), [(Int, Int)])]
b, [((Int, Int), [(Int, Int)])]
_) -> POpts
-> Val [((Int, Int), [(Int, Int)])]
-> String
-> [Tree PE]
-> TT [((Int, Int), [(Int, Int)])]
forall a. POpts -> Val a -> String -> [Tree PE] -> TT a
mkNode POpts
opts ([((Int, Int), [(Int, Int)])] -> Val [((Int, Int), [(Int, Int)])]
forall a. a -> Val a
Val [((Int, Int), [(Int, Int)])]
b) (POpts -> String -> [((Int, Int), [(Int, Int)])] -> String -> ShowS
forall a1. Show a1 => POpts -> String -> a1 -> String -> ShowS
lit3 POpts
opts String
msg1 [((Int, Int), [(Int, Int)])]
b String
"" String
q) [Tree PE]
hhs
data RescanRanges p q deriving Int -> RescanRanges p q -> ShowS
[RescanRanges p q] -> ShowS
RescanRanges p q -> String
(Int -> RescanRanges p q -> ShowS)
-> (RescanRanges p q -> String)
-> ([RescanRanges p q] -> ShowS)
-> Show (RescanRanges p q)
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
forall k (p :: k) k (q :: k). Int -> RescanRanges p q -> ShowS
forall k (p :: k) k (q :: k). [RescanRanges p q] -> ShowS
forall k (p :: k) k (q :: k). RescanRanges p q -> String
showList :: [RescanRanges p q] -> ShowS
$cshowList :: forall k (p :: k) k (q :: k). [RescanRanges p q] -> ShowS
show :: RescanRanges p q -> String
$cshow :: forall k (p :: k) k (q :: k). RescanRanges p q -> String
showsPrec :: Int -> RescanRanges p q -> ShowS
$cshowsPrec :: forall k (p :: k) k (q :: k). Int -> RescanRanges p q -> ShowS
Show
type RescanRangesT p q = RescanRanges' '[] p q
instance P (RescanRangesT p q) x => P (RescanRanges p q) x where
type PP (RescanRanges p q) x = PP (RescanRangesT p q) x
eval :: proxy (RescanRanges p q)
-> POpts -> x -> m (TT (PP (RescanRanges p q) x))
eval proxy (RescanRanges p q)
_ = Proxy (RescanRangesT p q)
-> POpts -> x -> m (TT (PP (RescanRangesT p q) x))
forall k (p :: k) a (m :: Type -> Type) (proxy :: k -> Type).
(P p a, MonadEval m) =>
proxy p -> POpts -> a -> m (TT (PP p a))
eval (Proxy (RescanRangesT p q)
forall k (t :: k). Proxy t
Proxy @(RescanRangesT p q))
data Resplit' (rs :: [ROpt]) p q deriving Int -> Resplit' rs p q -> ShowS
[Resplit' rs p q] -> ShowS
Resplit' rs p q -> String
(Int -> Resplit' rs p q -> ShowS)
-> (Resplit' rs p q -> String)
-> ([Resplit' rs p q] -> ShowS)
-> Show (Resplit' rs p q)
forall (rs :: [ROpt]) k (p :: k) k (q :: k).
Int -> Resplit' rs p q -> ShowS
forall (rs :: [ROpt]) k (p :: k) k (q :: k).
[Resplit' rs p q] -> ShowS
forall (rs :: [ROpt]) k (p :: k) k (q :: k).
Resplit' rs p q -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [Resplit' rs p q] -> ShowS
$cshowList :: forall (rs :: [ROpt]) k (p :: k) k (q :: k).
[Resplit' rs p q] -> ShowS
show :: Resplit' rs p q -> String
$cshow :: forall (rs :: [ROpt]) k (p :: k) k (q :: k).
Resplit' rs p q -> String
showsPrec :: Int -> Resplit' rs p q -> ShowS
$cshowsPrec :: forall (rs :: [ROpt]) k (p :: k) k (q :: k).
Int -> Resplit' rs p q -> ShowS
Show
instance ( GetROpts rs
, PP p x ~ String
, PP q x ~ String
, P p x
, P q x
) => P (Resplit' rs p q) x where
type PP (Resplit' rs p q) x = [String]
eval :: proxy (Resplit' rs p q)
-> POpts -> x -> m (TT (PP (Resplit' rs p q) x))
eval proxy (Resplit' rs p q)
_ POpts
opts x
x = do
let msg0 :: String
msg0 = String
"Resplit" String -> ShowS
forall a. Semigroup a => a -> a -> a
<> [PCREOption] -> ShowS
forall (t :: Type -> Type) m a.
(Foldable t, Monoid m) =>
t a -> m -> m
unlessNull [PCREOption]
rs (String
"' " String -> ShowS
forall a. Semigroup a => a -> a -> a
<> [String] -> String
displayROpts [String]
fs)
([String]
fs,[PCREOption]
rs) = GetROpts rs => ([String], [PCREOption])
forall (os :: [ROpt]). GetROpts os => ([String], [PCREOption])
getROpts @rs
Either (TT [String]) (String, String, TT String, TT String)
lr <- Inline
-> String
-> Proxy p
-> Proxy q
-> POpts
-> x
-> [Tree PE]
-> m (Either
(TT [String]) (PP p x, PP q x, TT (PP p x), TT (PP q x)))
forall k1 k2 (p :: k1) a (q :: k2) (m :: Type -> Type)
(proxy1 :: k1 -> Type) (proxy2 :: k2 -> Type) x.
(P p a, P q a, MonadEval m) =>
Inline
-> String
-> proxy1 p
-> proxy2 q
-> POpts
-> a
-> [Tree PE]
-> m (Either (TT x) (PP p a, PP q a, TT (PP p a), TT (PP q a)))
runPQ Inline
NoInline String
msg0 (Proxy p
forall k (t :: k). Proxy t
Proxy @p) (Proxy q
forall k (t :: k). Proxy t
Proxy @q) POpts
opts x
x []
TT [String] -> m (TT [String])
forall (f :: Type -> Type) a. Applicative f => a -> f a
pure (TT [String] -> m (TT [String])) -> TT [String] -> m (TT [String])
forall a b. (a -> b) -> a -> b
$ case Either (TT [String]) (String, String, TT String, TT String)
lr of
Left TT [String]
e -> TT [String]
e
Right (String
p,String
q,TT String
pp,TT String
qq) ->
let msg1 :: String
msg1 = String
msg0 String -> ShowS
forall a. Semigroup a => a -> a -> a
<> String
" (" String -> ShowS
forall a. Semigroup a => a -> a -> a
<> String
p String -> ShowS
forall a. Semigroup a => a -> a -> a
<> String
")"
hhs :: [Tree PE]
hhs = [TT String -> Tree PE
forall a. TT a -> Tree PE
hh TT String
pp, TT String -> Tree PE
forall a. TT a -> Tree PE
hh TT String
qq]
in case String -> String -> Either (String, String) Regex
forall (rs :: [ROpt]).
GetROpts rs =>
String -> String -> Either (String, String) Regex
compileRegex @rs String
msg1 String
p of
Left (String
e,String
e1) -> POpts -> Val [String] -> String -> [Tree PE] -> TT [String]
forall a. POpts -> Val a -> String -> [Tree PE] -> TT a
mkNode POpts
opts (String -> Val [String]
forall a. String -> Val a
Fail String
e) String
e1 [Tree PE]
hhs
Right Regex
regex ->
case Int -> [String] -> ([String], [String])
forall a. Int -> [a] -> ([a], [a])
splitAt (POpts -> HKD Identity Int
forall (f :: Type -> Type). HOpts f -> HKD f Int
oRecursion POpts
opts) ([String] -> ([String], [String]))
-> [String] -> ([String], [String])
forall a b. (a -> b) -> a -> b
$ Regex -> String -> [String]
forall a.
(ConvertibleStrings SBS a, ConvertibleStrings a SBS) =>
Regex -> a -> [a]
RH.split Regex
regex String
q of
([String]
b, String
_:[String]
_) -> POpts -> Val [String] -> String -> [Tree PE] -> TT [String]
forall a. POpts -> Val a -> String -> [Tree PE] -> TT a
mkNode POpts
opts (String -> Val [String]
forall a. String -> Val a
Fail (String
"Regex looping(" String -> ShowS
forall a. [a] -> [a] -> [a]
++ Int -> String
forall a. Show a => a -> String
show (POpts -> HKD Identity Int
forall (f :: Type -> Type). HOpts f -> HKD f Int
oRecursion POpts
opts) String -> ShowS
forall a. [a] -> [a] -> [a]
++ String
")")) (String
msg1 String -> ShowS
forall a. Semigroup a => a -> a -> a
<> String
" " String -> ShowS
forall a. Semigroup a => a -> a -> a
<> [String] -> String
forall a. Show a => a -> String
show (Int -> [String] -> [String]
forall a. Int -> [a] -> [a]
take Int
10 [String]
b) String -> ShowS
forall a. Semigroup a => a -> a -> a
<> String
"..." String -> ShowS
forall a. Semigroup a => a -> a -> a
<> POpts -> String -> ShowS
forall a. Show a => POpts -> String -> a -> String
showVerbose POpts
opts String
" | " String
q) [Tree PE]
hhs
([], [String]
_) ->
POpts -> Val [String] -> String -> [Tree PE] -> TT [String]
forall a. POpts -> Val a -> String -> [Tree PE] -> TT a
mkNode POpts
opts (String -> Val [String]
forall a. String -> Val a
Fail String
"Regex no results") (String
msg1 String -> ShowS
forall a. Semigroup a => a -> a -> a
<> POpts -> String -> ShowS
forall a. Show a => POpts -> String -> a -> String
showVerbose POpts
opts String
" | " String
q) [Tree PE]
hhs
([String]
b, [String]
_) -> POpts -> Val [String] -> String -> [Tree PE] -> TT [String]
forall a. POpts -> Val a -> String -> [Tree PE] -> TT a
mkNode POpts
opts ([String] -> Val [String]
forall a. a -> Val a
Val [String]
b) (POpts -> String -> [String] -> String -> ShowS
forall a1. Show a1 => POpts -> String -> a1 -> String -> ShowS
lit3 POpts
opts String
msg1 [String]
b String
"" String
q) [Tree PE]
hhs
data Resplit p deriving Int -> Resplit p -> ShowS
[Resplit p] -> ShowS
Resplit p -> String
(Int -> Resplit p -> ShowS)
-> (Resplit p -> String)
-> ([Resplit p] -> ShowS)
-> Show (Resplit p)
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
forall k (p :: k). Int -> Resplit p -> ShowS
forall k (p :: k). [Resplit p] -> ShowS
forall k (p :: k). Resplit p -> String
showList :: [Resplit p] -> ShowS
$cshowList :: forall k (p :: k). [Resplit p] -> ShowS
show :: Resplit p -> String
$cshow :: forall k (p :: k). Resplit p -> String
showsPrec :: Int -> Resplit p -> ShowS
$cshowsPrec :: forall k (p :: k). Int -> Resplit p -> ShowS
Show
type ResplitT p = Resplit' '[] p Id
instance P (ResplitT p) x => P (Resplit p) x where
type PP (Resplit p) x = PP (ResplitT p) x
eval :: proxy (Resplit p) -> POpts -> x -> m (TT (PP (Resplit p) x))
eval proxy (Resplit p)
_ = Proxy (ResplitT p) -> POpts -> x -> m (TT (PP (ResplitT p) x))
forall k (p :: k) a (m :: Type -> Type) (proxy :: k -> Type).
(P p a, MonadEval m) =>
proxy p -> POpts -> a -> m (TT (PP p a))
eval (Proxy (ResplitT p)
forall k (t :: k). Proxy t
Proxy @(ResplitT p))
data ReplaceImpl (alle :: Bool) (rs :: [ROpt]) p q r deriving Int -> ReplaceImpl alle rs p q r -> ShowS
[ReplaceImpl alle rs p q r] -> ShowS
ReplaceImpl alle rs p q r -> String
(Int -> ReplaceImpl alle rs p q r -> ShowS)
-> (ReplaceImpl alle rs p q r -> String)
-> ([ReplaceImpl alle rs p q r] -> ShowS)
-> Show (ReplaceImpl alle rs p q r)
forall (alle :: Bool) (rs :: [ROpt]) k (p :: k) k (q :: k) k
(r :: k).
Int -> ReplaceImpl alle rs p q r -> ShowS
forall (alle :: Bool) (rs :: [ROpt]) k (p :: k) k (q :: k) k
(r :: k).
[ReplaceImpl alle rs p q r] -> ShowS
forall (alle :: Bool) (rs :: [ROpt]) k (p :: k) k (q :: k) k
(r :: k).
ReplaceImpl alle rs p q r -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [ReplaceImpl alle rs p q r] -> ShowS
$cshowList :: forall (alle :: Bool) (rs :: [ROpt]) k (p :: k) k (q :: k) k
(r :: k).
[ReplaceImpl alle rs p q r] -> ShowS
show :: ReplaceImpl alle rs p q r -> String
$cshow :: forall (alle :: Bool) (rs :: [ROpt]) k (p :: k) k (q :: k) k
(r :: k).
ReplaceImpl alle rs p q r -> String
showsPrec :: Int -> ReplaceImpl alle rs p q r -> ShowS
$cshowsPrec :: forall (alle :: Bool) (rs :: [ROpt]) k (p :: k) k (q :: k) k
(r :: k).
Int -> ReplaceImpl alle rs p q r -> ShowS
Show
instance ( GetBool b
, GetROpts rs
, PP p x ~ String
, PP q x ~ RReplace
, PP r x ~ String
, P p x
, P q x
, P r x
) => P (ReplaceImpl b rs p q r) x where
type PP (ReplaceImpl b rs p q r) x = String
eval :: proxy (ReplaceImpl b rs p q r)
-> POpts -> x -> m (TT (PP (ReplaceImpl b rs p q r) x))
eval proxy (ReplaceImpl b rs p q r)
_ POpts
opts x
x = do
let msg0 :: String
msg0 = String
"Replace" String -> ShowS
forall a. Semigroup a => a -> a -> a
<> (if Bool
alle then String
"All" else String
"One") String -> ShowS
forall a. Semigroup a => a -> a -> a
<> [PCREOption] -> ShowS
forall (t :: Type -> Type) m a.
(Foldable t, Monoid m) =>
t a -> m -> m
unlessNull [PCREOption]
rs (String
"' " String -> ShowS
forall a. Semigroup a => a -> a -> a
<> [String] -> String
displayROpts [String]
fs)
([String]
fs,[PCREOption]
rs) = GetROpts rs => ([String], [PCREOption])
forall (os :: [ROpt]). GetROpts os => ([String], [PCREOption])
getROpts @rs
alle :: Bool
alle = GetBool b => Bool
forall (a :: Bool). GetBool a => Bool
getBool @b
Either (TT String) (String, RReplace, TT String, TT RReplace)
lr <- Inline
-> String
-> Proxy p
-> Proxy q
-> POpts
-> x
-> [Tree PE]
-> m (Either
(TT String) (PP p x, PP q x, TT (PP p x), TT (PP q x)))
forall k1 k2 (p :: k1) a (q :: k2) (m :: Type -> Type)
(proxy1 :: k1 -> Type) (proxy2 :: k2 -> Type) x.
(P p a, P q a, MonadEval m) =>
Inline
-> String
-> proxy1 p
-> proxy2 q
-> POpts
-> a
-> [Tree PE]
-> m (Either (TT x) (PP p a, PP q a, TT (PP p a), TT (PP q a)))
runPQ Inline
NoInline String
msg0 (Proxy p
forall k (t :: k). Proxy t
Proxy @p) (Proxy q
forall k (t :: k). Proxy t
Proxy @q) POpts
opts x
x []
case Either (TT String) (String, RReplace, TT String, TT RReplace)
lr of
Left TT String
e -> TT String -> m (TT String)
forall (f :: Type -> Type) a. Applicative f => a -> f a
pure TT String
e
Right (String
p,RReplace
q,TT String
pp,TT RReplace
qq) ->
let msg1 :: String
msg1 = String
msg0 String -> ShowS
forall a. Semigroup a => a -> a -> a
<> String
" (" String -> ShowS
forall a. Semigroup a => a -> a -> a
<> String
p String -> ShowS
forall a. Semigroup a => a -> a -> a
<> String
")"
hhs :: [Tree PE]
hhs = [TT String -> Tree PE
forall a. TT a -> Tree PE
hh TT String
pp, TT RReplace -> Tree PE
forall a. TT a -> Tree PE
hh TT RReplace
qq]
in case String -> String -> Either (String, String) Regex
forall (rs :: [ROpt]).
GetROpts rs =>
String -> String -> Either (String, String) Regex
compileRegex @rs String
msg1 String
p of
Left (String
e,String
e1) -> TT String -> m (TT String)
forall (f :: Type -> Type) a. Applicative f => a -> f a
pure (TT String -> m (TT String)) -> TT String -> m (TT String)
forall a b. (a -> b) -> a -> b
$ POpts -> Val String -> String -> [Tree PE] -> TT String
forall a. POpts -> Val a -> String -> [Tree PE] -> TT a
mkNode POpts
opts (String -> Val String
forall a. String -> Val a
Fail String
e) String
e1 [Tree PE]
hhs
Right Regex
regex -> do
TT String
rr <- Proxy r -> POpts -> x -> m (TT (PP r x))
forall k (p :: k) a (m :: Type -> Type) (proxy :: k -> Type).
(P p a, MonadEval m) =>
proxy p -> POpts -> a -> m (TT (PP p a))
eval (Proxy r
forall k (t :: k). Proxy t
Proxy @r) POpts
opts x
x
TT String -> m (TT String)
forall (f :: Type -> Type) a. Applicative f => a -> f a
pure (TT String -> m (TT String)) -> TT String -> m (TT String)
forall a b. (a -> b) -> a -> b
$ case Inline
-> POpts
-> String
-> TT String
-> [Tree PE]
-> Either (TT String) String
forall a x.
Inline -> POpts -> String -> TT a -> [Tree PE] -> Either (TT x) a
getValueLR Inline
NoInline POpts
opts String
msg0 TT String
rr [Tree PE]
hhs of
Left TT String
e -> TT String
e
Right String
r ->
let ret :: String
ret :: String
ret = case RReplace
q of
RReplace ReplaceFnSub
o String
s ->
let g :: ShowS -> String
g ShowS
fn = (if Bool
alle then Regex -> ShowS -> ShowS
forall a r.
(ConvertibleStrings SBS a, ConvertibleStrings a SBS,
RegexReplacement r) =>
Regex -> r -> a -> a
RH.gsub else Regex -> ShowS -> ShowS
forall a r.
(ConvertibleStrings SBS a, ConvertibleStrings a SBS,
RegexReplacement r) =>
Regex -> r -> a -> a
RH.sub) Regex
regex ShowS
fn String
r
in ShowS -> String
g (case ReplaceFnSub
o of
ReplaceFnSub
RPrepend -> (String
s String -> ShowS
forall a. Semigroup a => a -> a -> a
<>)
ReplaceFnSub
ROverWrite -> String -> ShowS
forall a b. a -> b -> a
const String
s
ReplaceFnSub
RAppend -> (String -> ShowS
forall a. Semigroup a => a -> a -> a
<> String
s))
RReplace1 String -> [String] -> String
s -> (if Bool
alle then Regex -> (String -> [String] -> String) -> ShowS
forall a r.
(ConvertibleStrings SBS a, ConvertibleStrings a SBS,
RegexReplacement r) =>
Regex -> r -> a -> a
RH.gsub else Regex -> (String -> [String] -> String) -> ShowS
forall a r.
(ConvertibleStrings SBS a, ConvertibleStrings a SBS,
RegexReplacement r) =>
Regex -> r -> a -> a
RH.sub) Regex
regex String -> [String] -> String
s String
r
RReplace2 ShowS
s -> (if Bool
alle then Regex -> ShowS -> ShowS
forall a r.
(ConvertibleStrings SBS a, ConvertibleStrings a SBS,
RegexReplacement r) =>
Regex -> r -> a -> a
RH.gsub else Regex -> ShowS -> ShowS
forall a r.
(ConvertibleStrings SBS a, ConvertibleStrings a SBS,
RegexReplacement r) =>
Regex -> r -> a -> a
RH.sub) Regex
regex ShowS
s String
r
RReplace3 [String] -> String
s -> (if Bool
alle then Regex -> ([String] -> String) -> ShowS
forall a r.
(ConvertibleStrings SBS a, ConvertibleStrings a SBS,
RegexReplacement r) =>
Regex -> r -> a -> a
RH.gsub else Regex -> ([String] -> String) -> ShowS
forall a r.
(ConvertibleStrings SBS a, ConvertibleStrings a SBS,
RegexReplacement r) =>
Regex -> r -> a -> a
RH.sub) Regex
regex [String] -> String
s String
r
in POpts -> Val String -> String -> [Tree PE] -> TT String
forall a. POpts -> Val a -> String -> [Tree PE] -> TT a
mkNode POpts
opts (String -> Val String
forall a. a -> Val a
Val String
ret) (String
msg1 String -> ShowS
forall a. Semigroup a => a -> a -> a
<> String
" " String -> ShowS
forall a. Semigroup a => a -> a -> a
<> POpts -> ShowS
litL POpts
opts String
r String -> ShowS
forall a. Semigroup a => a -> a -> a
<> POpts -> String -> ShowS
litVerbose POpts
opts String
" | " String
ret) ([Tree PE]
hhs [Tree PE] -> [Tree PE] -> [Tree PE]
forall a. Semigroup a => a -> a -> a
<> [TT String -> Tree PE
forall a. TT a -> Tree PE
hh TT String
rr])
data ReplaceAll' (rs :: [ROpt]) p q r deriving Int -> ReplaceAll' rs p q r -> ShowS
[ReplaceAll' rs p q r] -> ShowS
ReplaceAll' rs p q r -> String
(Int -> ReplaceAll' rs p q r -> ShowS)
-> (ReplaceAll' rs p q r -> String)
-> ([ReplaceAll' rs p q r] -> ShowS)
-> Show (ReplaceAll' rs p q r)
forall (rs :: [ROpt]) k (p :: k) k (q :: k) k (r :: k).
Int -> ReplaceAll' rs p q r -> ShowS
forall (rs :: [ROpt]) k (p :: k) k (q :: k) k (r :: k).
[ReplaceAll' rs p q r] -> ShowS
forall (rs :: [ROpt]) k (p :: k) k (q :: k) k (r :: k).
ReplaceAll' rs p q r -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [ReplaceAll' rs p q r] -> ShowS
$cshowList :: forall (rs :: [ROpt]) k (p :: k) k (q :: k) k (r :: k).
[ReplaceAll' rs p q r] -> ShowS
show :: ReplaceAll' rs p q r -> String
$cshow :: forall (rs :: [ROpt]) k (p :: k) k (q :: k) k (r :: k).
ReplaceAll' rs p q r -> String
showsPrec :: Int -> ReplaceAll' rs p q r -> ShowS
$cshowsPrec :: forall (rs :: [ROpt]) k (p :: k) k (q :: k) k (r :: k).
Int -> ReplaceAll' rs p q r -> ShowS
Show
type ReplaceAllT' (rs :: [ROpt]) p q r = ReplaceImpl 'True rs p q r
instance P (ReplaceAllT' rs p q r) x => P (ReplaceAll' rs p q r) x where
type PP (ReplaceAll' rs p q r) x = PP (ReplaceAllT' rs p q r) x
eval :: proxy (ReplaceAll' rs p q r)
-> POpts -> x -> m (TT (PP (ReplaceAll' rs p q r) x))
eval proxy (ReplaceAll' rs p q r)
_ = Proxy (ReplaceAllT' rs p q r)
-> POpts -> x -> m (TT (PP (ReplaceAllT' rs p q r) x))
forall k (p :: k) a (m :: Type -> Type) (proxy :: k -> Type).
(P p a, MonadEval m) =>
proxy p -> POpts -> a -> m (TT (PP p a))
eval (Proxy (ReplaceAllT' rs p q r)
forall k (t :: k). Proxy t
Proxy @(ReplaceAllT' rs p q r))
data ReplaceAll p q r deriving Int -> ReplaceAll p q r -> ShowS
[ReplaceAll p q r] -> ShowS
ReplaceAll p q r -> String
(Int -> ReplaceAll p q r -> ShowS)
-> (ReplaceAll p q r -> String)
-> ([ReplaceAll p q r] -> ShowS)
-> Show (ReplaceAll p q r)
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
forall k (p :: k) k (q :: k) k (r :: k).
Int -> ReplaceAll p q r -> ShowS
forall k (p :: k) k (q :: k) k (r :: k).
[ReplaceAll p q r] -> ShowS
forall k (p :: k) k (q :: k) k (r :: k). ReplaceAll p q r -> String
showList :: [ReplaceAll p q r] -> ShowS
$cshowList :: forall k (p :: k) k (q :: k) k (r :: k).
[ReplaceAll p q r] -> ShowS
show :: ReplaceAll p q r -> String
$cshow :: forall k (p :: k) k (q :: k) k (r :: k). ReplaceAll p q r -> String
showsPrec :: Int -> ReplaceAll p q r -> ShowS
$cshowsPrec :: forall k (p :: k) k (q :: k) k (r :: k).
Int -> ReplaceAll p q r -> ShowS
Show
type ReplaceAllT p q r = ReplaceAll' '[] p q r
instance P (ReplaceAllT p q r) x => P (ReplaceAll p q r) x where
type PP (ReplaceAll p q r) x = PP (ReplaceAllT p q r) x
eval :: proxy (ReplaceAll p q r)
-> POpts -> x -> m (TT (PP (ReplaceAll p q r) x))
eval proxy (ReplaceAll p q r)
_ = Proxy (ReplaceAllT p q r)
-> POpts -> x -> m (TT (PP (ReplaceAllT p q r) x))
forall k (p :: k) a (m :: Type -> Type) (proxy :: k -> Type).
(P p a, MonadEval m) =>
proxy p -> POpts -> a -> m (TT (PP p a))
eval (Proxy (ReplaceAllT p q r)
forall k (t :: k). Proxy t
Proxy @(ReplaceAllT p q r))
data ReplaceOne' (rs :: [ROpt]) p q r deriving Int -> ReplaceOne' rs p q r -> ShowS
[ReplaceOne' rs p q r] -> ShowS
ReplaceOne' rs p q r -> String
(Int -> ReplaceOne' rs p q r -> ShowS)
-> (ReplaceOne' rs p q r -> String)
-> ([ReplaceOne' rs p q r] -> ShowS)
-> Show (ReplaceOne' rs p q r)
forall (rs :: [ROpt]) k (p :: k) k (q :: k) k (r :: k).
Int -> ReplaceOne' rs p q r -> ShowS
forall (rs :: [ROpt]) k (p :: k) k (q :: k) k (r :: k).
[ReplaceOne' rs p q r] -> ShowS
forall (rs :: [ROpt]) k (p :: k) k (q :: k) k (r :: k).
ReplaceOne' rs p q r -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [ReplaceOne' rs p q r] -> ShowS
$cshowList :: forall (rs :: [ROpt]) k (p :: k) k (q :: k) k (r :: k).
[ReplaceOne' rs p q r] -> ShowS
show :: ReplaceOne' rs p q r -> String
$cshow :: forall (rs :: [ROpt]) k (p :: k) k (q :: k) k (r :: k).
ReplaceOne' rs p q r -> String
showsPrec :: Int -> ReplaceOne' rs p q r -> ShowS
$cshowsPrec :: forall (rs :: [ROpt]) k (p :: k) k (q :: k) k (r :: k).
Int -> ReplaceOne' rs p q r -> ShowS
Show
type ReplaceOneT' (rs :: [ROpt]) p q r = ReplaceImpl 'False rs p q r
instance P (ReplaceOneT' rs p q r) x => P (ReplaceOne' rs p q r) x where
type PP (ReplaceOne' rs p q r) x = PP (ReplaceOneT' rs p q r) x
eval :: proxy (ReplaceOne' rs p q r)
-> POpts -> x -> m (TT (PP (ReplaceOne' rs p q r) x))
eval proxy (ReplaceOne' rs p q r)
_ = Proxy (ReplaceOneT' rs p q r)
-> POpts -> x -> m (TT (PP (ReplaceOneT' rs p q r) x))
forall k (p :: k) a (m :: Type -> Type) (proxy :: k -> Type).
(P p a, MonadEval m) =>
proxy p -> POpts -> a -> m (TT (PP p a))
eval (Proxy (ReplaceOneT' rs p q r)
forall k (t :: k). Proxy t
Proxy @(ReplaceOneT' rs p q r))
data ReplaceOne p q r deriving Int -> ReplaceOne p q r -> ShowS
[ReplaceOne p q r] -> ShowS
ReplaceOne p q r -> String
(Int -> ReplaceOne p q r -> ShowS)
-> (ReplaceOne p q r -> String)
-> ([ReplaceOne p q r] -> ShowS)
-> Show (ReplaceOne p q r)
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
forall k (p :: k) k (q :: k) k (r :: k).
Int -> ReplaceOne p q r -> ShowS
forall k (p :: k) k (q :: k) k (r :: k).
[ReplaceOne p q r] -> ShowS
forall k (p :: k) k (q :: k) k (r :: k). ReplaceOne p q r -> String
showList :: [ReplaceOne p q r] -> ShowS
$cshowList :: forall k (p :: k) k (q :: k) k (r :: k).
[ReplaceOne p q r] -> ShowS
show :: ReplaceOne p q r -> String
$cshow :: forall k (p :: k) k (q :: k) k (r :: k). ReplaceOne p q r -> String
showsPrec :: Int -> ReplaceOne p q r -> ShowS
$cshowsPrec :: forall k (p :: k) k (q :: k) k (r :: k).
Int -> ReplaceOne p q r -> ShowS
Show
type ReplaceOneT p q r = ReplaceOne' '[] p q r
instance P (ReplaceOneT p q r) x => P (ReplaceOne p q r) x where
type PP (ReplaceOne p q r) x = PP (ReplaceOneT p q r) x
eval :: proxy (ReplaceOne p q r)
-> POpts -> x -> m (TT (PP (ReplaceOne p q r) x))
eval proxy (ReplaceOne p q r)
_ = Proxy (ReplaceOneT p q r)
-> POpts -> x -> m (TT (PP (ReplaceOneT p q r) x))
forall k (p :: k) a (m :: Type -> Type) (proxy :: k -> Type).
(P p a, MonadEval m) =>
proxy p -> POpts -> a -> m (TT (PP p a))
eval (Proxy (ReplaceOneT p q r)
forall k (t :: k). Proxy t
Proxy @(ReplaceOneT p q r))
data ReplaceAllString' (rs :: [ROpt]) (o :: ReplaceFnSub) p q r deriving Int -> ReplaceAllString' rs o p q r -> ShowS
[ReplaceAllString' rs o p q r] -> ShowS
ReplaceAllString' rs o p q r -> String
(Int -> ReplaceAllString' rs o p q r -> ShowS)
-> (ReplaceAllString' rs o p q r -> String)
-> ([ReplaceAllString' rs o p q r] -> ShowS)
-> Show (ReplaceAllString' rs o p q r)
forall (rs :: [ROpt]) (o :: ReplaceFnSub) k (p :: k) k (q :: k) k
(r :: k).
Int -> ReplaceAllString' rs o p q r -> ShowS
forall (rs :: [ROpt]) (o :: ReplaceFnSub) k (p :: k) k (q :: k) k
(r :: k).
[ReplaceAllString' rs o p q r] -> ShowS
forall (rs :: [ROpt]) (o :: ReplaceFnSub) k (p :: k) k (q :: k) k
(r :: k).
ReplaceAllString' rs o p q r -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [ReplaceAllString' rs o p q r] -> ShowS
$cshowList :: forall (rs :: [ROpt]) (o :: ReplaceFnSub) k (p :: k) k (q :: k) k
(r :: k).
[ReplaceAllString' rs o p q r] -> ShowS
show :: ReplaceAllString' rs o p q r -> String
$cshow :: forall (rs :: [ROpt]) (o :: ReplaceFnSub) k (p :: k) k (q :: k) k
(r :: k).
ReplaceAllString' rs o p q r -> String
showsPrec :: Int -> ReplaceAllString' rs o p q r -> ShowS
$cshowsPrec :: forall (rs :: [ROpt]) (o :: ReplaceFnSub) k (p :: k) k (q :: k) k
(r :: k).
Int -> ReplaceAllString' rs o p q r -> ShowS
Show
type ReplaceAllStringT' (rs :: [ROpt]) (o :: ReplaceFnSub) p q r = ReplaceAll' rs p (ReplaceFn o q) r
instance P (ReplaceAllStringT' rs o p q r) x => P (ReplaceAllString' rs o p q r) x where
type PP (ReplaceAllString' rs o p q r) x = PP (ReplaceAllStringT' rs o p q r) x
eval :: proxy (ReplaceAllString' rs o p q r)
-> POpts -> x -> m (TT (PP (ReplaceAllString' rs o p q r) x))
eval proxy (ReplaceAllString' rs o p q r)
_ = Proxy (ReplaceAllStringT' rs o p q r)
-> POpts -> x -> m (TT (PP (ReplaceAllStringT' rs o p q r) x))
forall k (p :: k) a (m :: Type -> Type) (proxy :: k -> Type).
(P p a, MonadEval m) =>
proxy p -> POpts -> a -> m (TT (PP p a))
eval (Proxy (ReplaceAllStringT' rs o p q r)
forall k (t :: k). Proxy t
Proxy @(ReplaceAllStringT' rs o p q r))
data ReplaceAllString o p q r deriving Int -> ReplaceAllString o p q r -> ShowS
[ReplaceAllString o p q r] -> ShowS
ReplaceAllString o p q r -> String
(Int -> ReplaceAllString o p q r -> ShowS)
-> (ReplaceAllString o p q r -> String)
-> ([ReplaceAllString o p q r] -> ShowS)
-> Show (ReplaceAllString o p q r)
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
forall k (o :: k) k (p :: k) k (q :: k) k (r :: k).
Int -> ReplaceAllString o p q r -> ShowS
forall k (o :: k) k (p :: k) k (q :: k) k (r :: k).
[ReplaceAllString o p q r] -> ShowS
forall k (o :: k) k (p :: k) k (q :: k) k (r :: k).
ReplaceAllString o p q r -> String
showList :: [ReplaceAllString o p q r] -> ShowS
$cshowList :: forall k (o :: k) k (p :: k) k (q :: k) k (r :: k).
[ReplaceAllString o p q r] -> ShowS
show :: ReplaceAllString o p q r -> String
$cshow :: forall k (o :: k) k (p :: k) k (q :: k) k (r :: k).
ReplaceAllString o p q r -> String
showsPrec :: Int -> ReplaceAllString o p q r -> ShowS
$cshowsPrec :: forall k (o :: k) k (p :: k) k (q :: k) k (r :: k).
Int -> ReplaceAllString o p q r -> ShowS
Show
type ReplaceAllStringT o p q r = ReplaceAllString' '[] o p q r
instance P (ReplaceAllStringT o p q r) x => P (ReplaceAllString o p q r) x where
type PP (ReplaceAllString o p q r) x = PP (ReplaceAllStringT o p q r) x
eval :: proxy (ReplaceAllString o p q r)
-> POpts -> x -> m (TT (PP (ReplaceAllString o p q r) x))
eval proxy (ReplaceAllString o p q r)
_ = Proxy (ReplaceAllStringT o p q r)
-> POpts -> x -> m (TT (PP (ReplaceAllStringT o p q r) x))
forall k (p :: k) a (m :: Type -> Type) (proxy :: k -> Type).
(P p a, MonadEval m) =>
proxy p -> POpts -> a -> m (TT (PP p a))
eval (Proxy (ReplaceAllStringT o p q r)
forall k (t :: k). Proxy t
Proxy @(ReplaceAllStringT o p q r))
data ReplaceOneString' (rs :: [ROpt]) (o :: ReplaceFnSub) p q r deriving Int -> ReplaceOneString' rs o p q r -> ShowS
[ReplaceOneString' rs o p q r] -> ShowS
ReplaceOneString' rs o p q r -> String
(Int -> ReplaceOneString' rs o p q r -> ShowS)
-> (ReplaceOneString' rs o p q r -> String)
-> ([ReplaceOneString' rs o p q r] -> ShowS)
-> Show (ReplaceOneString' rs o p q r)
forall (rs :: [ROpt]) (o :: ReplaceFnSub) k (p :: k) k (q :: k) k
(r :: k).
Int -> ReplaceOneString' rs o p q r -> ShowS
forall (rs :: [ROpt]) (o :: ReplaceFnSub) k (p :: k) k (q :: k) k
(r :: k).
[ReplaceOneString' rs o p q r] -> ShowS
forall (rs :: [ROpt]) (o :: ReplaceFnSub) k (p :: k) k (q :: k) k
(r :: k).
ReplaceOneString' rs o p q r -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [ReplaceOneString' rs o p q r] -> ShowS
$cshowList :: forall (rs :: [ROpt]) (o :: ReplaceFnSub) k (p :: k) k (q :: k) k
(r :: k).
[ReplaceOneString' rs o p q r] -> ShowS
show :: ReplaceOneString' rs o p q r -> String
$cshow :: forall (rs :: [ROpt]) (o :: ReplaceFnSub) k (p :: k) k (q :: k) k
(r :: k).
ReplaceOneString' rs o p q r -> String
showsPrec :: Int -> ReplaceOneString' rs o p q r -> ShowS
$cshowsPrec :: forall (rs :: [ROpt]) (o :: ReplaceFnSub) k (p :: k) k (q :: k) k
(r :: k).
Int -> ReplaceOneString' rs o p q r -> ShowS
Show
type ReplaceOneStringT' (rs :: [ROpt]) (o :: ReplaceFnSub) p q r = ReplaceOne' rs p (ReplaceFn o q) r
instance P (ReplaceOneStringT' rs o p q r) x => P (ReplaceOneString' rs o p q r) x where
type PP (ReplaceOneString' rs o p q r) x = PP (ReplaceOneStringT' rs o p q r) x
eval :: proxy (ReplaceOneString' rs o p q r)
-> POpts -> x -> m (TT (PP (ReplaceOneString' rs o p q r) x))
eval proxy (ReplaceOneString' rs o p q r)
_ = Proxy (ReplaceOneStringT' rs o p q r)
-> POpts -> x -> m (TT (PP (ReplaceOneStringT' rs o p q r) x))
forall k (p :: k) a (m :: Type -> Type) (proxy :: k -> Type).
(P p a, MonadEval m) =>
proxy p -> POpts -> a -> m (TT (PP p a))
eval (Proxy (ReplaceOneStringT' rs o p q r)
forall k (t :: k). Proxy t
Proxy @(ReplaceOneStringT' rs o p q r))
data ReplaceOneString (o :: ReplaceFnSub) p q r deriving Int -> ReplaceOneString o p q r -> ShowS
[ReplaceOneString o p q r] -> ShowS
ReplaceOneString o p q r -> String
(Int -> ReplaceOneString o p q r -> ShowS)
-> (ReplaceOneString o p q r -> String)
-> ([ReplaceOneString o p q r] -> ShowS)
-> Show (ReplaceOneString o p q r)
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
forall (o :: ReplaceFnSub) k (p :: k) k (q :: k) k (r :: k).
Int -> ReplaceOneString o p q r -> ShowS
forall (o :: ReplaceFnSub) k (p :: k) k (q :: k) k (r :: k).
[ReplaceOneString o p q r] -> ShowS
forall (o :: ReplaceFnSub) k (p :: k) k (q :: k) k (r :: k).
ReplaceOneString o p q r -> String
showList :: [ReplaceOneString o p q r] -> ShowS
$cshowList :: forall (o :: ReplaceFnSub) k (p :: k) k (q :: k) k (r :: k).
[ReplaceOneString o p q r] -> ShowS
show :: ReplaceOneString o p q r -> String
$cshow :: forall (o :: ReplaceFnSub) k (p :: k) k (q :: k) k (r :: k).
ReplaceOneString o p q r -> String
showsPrec :: Int -> ReplaceOneString o p q r -> ShowS
$cshowsPrec :: forall (o :: ReplaceFnSub) k (p :: k) k (q :: k) k (r :: k).
Int -> ReplaceOneString o p q r -> ShowS
Show
type ReplaceOneStringT (o :: ReplaceFnSub) p q r = ReplaceOneString' '[] o p q r
instance P (ReplaceOneStringT o p q r) x => P (ReplaceOneString o p q r) x where
type PP (ReplaceOneString o p q r) x = PP (ReplaceOneStringT o p q r) x
eval :: proxy (ReplaceOneString o p q r)
-> POpts -> x -> m (TT (PP (ReplaceOneString o p q r) x))
eval proxy (ReplaceOneString o p q r)
_ = Proxy (ReplaceOneStringT o p q r)
-> POpts -> x -> m (TT (PP (ReplaceOneStringT o p q r) x))
forall k (p :: k) a (m :: Type -> Type) (proxy :: k -> Type).
(P p a, MonadEval m) =>
proxy p -> POpts -> a -> m (TT (PP p a))
eval (Proxy (ReplaceOneStringT o p q r)
forall k (t :: k). Proxy t
Proxy @(ReplaceOneStringT o p q r))
data ReplaceFn (o :: ReplaceFnSub) p deriving Int -> ReplaceFn o p -> ShowS
[ReplaceFn o p] -> ShowS
ReplaceFn o p -> String
(Int -> ReplaceFn o p -> ShowS)
-> (ReplaceFn o p -> String)
-> ([ReplaceFn o p] -> ShowS)
-> Show (ReplaceFn o p)
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
forall (o :: ReplaceFnSub) k (p :: k).
Int -> ReplaceFn o p -> ShowS
forall (o :: ReplaceFnSub) k (p :: k). [ReplaceFn o p] -> ShowS
forall (o :: ReplaceFnSub) k (p :: k). ReplaceFn o p -> String
showList :: [ReplaceFn o p] -> ShowS
$cshowList :: forall (o :: ReplaceFnSub) k (p :: k). [ReplaceFn o p] -> ShowS
show :: ReplaceFn o p -> String
$cshow :: forall (o :: ReplaceFnSub) k (p :: k). ReplaceFn o p -> String
showsPrec :: Int -> ReplaceFn o p -> ShowS
$cshowsPrec :: forall (o :: ReplaceFnSub) k (p :: k).
Int -> ReplaceFn o p -> ShowS
Show
instance ( GetReplaceFnSub r
, PP p x ~ String
, P p x
) => P (ReplaceFn r p) x where
type PP (ReplaceFn r p) x = RReplace
eval :: proxy (ReplaceFn r p)
-> POpts -> x -> m (TT (PP (ReplaceFn r p) x))
eval proxy (ReplaceFn r p)
_ POpts
opts x
x = do
let msg0 :: String
msg0 = String
"ReplaceFn"
TT String
pp <- Proxy p -> POpts -> x -> m (TT (PP p x))
forall k (p :: k) a (m :: Type -> Type) (proxy :: k -> Type).
(P p a, MonadEval m) =>
proxy p -> POpts -> a -> m (TT (PP p a))
eval (Proxy p
forall k (t :: k). Proxy t
Proxy @p) POpts
opts x
x
TT RReplace -> m (TT RReplace)
forall (f :: Type -> Type) a. Applicative f => a -> f a
pure (TT RReplace -> m (TT RReplace)) -> TT RReplace -> m (TT RReplace)
forall a b. (a -> b) -> a -> b
$ case Inline
-> POpts
-> String
-> TT String
-> [Tree PE]
-> Either (TT RReplace) String
forall a x.
Inline -> POpts -> String -> TT a -> [Tree PE] -> Either (TT x) a
getValueLR Inline
NoInline POpts
opts String
msg0 TT String
pp [] of
Left TT RReplace
e -> TT RReplace
e
Right String
p ->
let b :: RReplace
b = ReplaceFnSub -> String -> RReplace
RReplace (GetReplaceFnSub r => ReplaceFnSub
forall (k :: ReplaceFnSub). GetReplaceFnSub k => ReplaceFnSub
getReplaceFnSub @r) String
p
in POpts -> Val RReplace -> String -> [Tree PE] -> TT RReplace
forall a. POpts -> Val a -> String -> [Tree PE] -> TT a
mkNode POpts
opts (RReplace -> Val RReplace
forall a. a -> Val a
Val RReplace
b) (String
msg0 String -> ShowS
forall a. Semigroup a => a -> a -> a
<> POpts -> String -> ShowS
forall a. Show a => POpts -> String -> a -> String
showVerbose POpts
opts String
" | " String
p) [TT String -> Tree PE
forall a. TT a -> Tree PE
hh TT String
pp]
data ReplaceFn1 p deriving Int -> ReplaceFn1 p -> ShowS
[ReplaceFn1 p] -> ShowS
ReplaceFn1 p -> String
(Int -> ReplaceFn1 p -> ShowS)
-> (ReplaceFn1 p -> String)
-> ([ReplaceFn1 p] -> ShowS)
-> Show (ReplaceFn1 p)
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
forall k (p :: k). Int -> ReplaceFn1 p -> ShowS
forall k (p :: k). [ReplaceFn1 p] -> ShowS
forall k (p :: k). ReplaceFn1 p -> String
showList :: [ReplaceFn1 p] -> ShowS
$cshowList :: forall k (p :: k). [ReplaceFn1 p] -> ShowS
show :: ReplaceFn1 p -> String
$cshow :: forall k (p :: k). ReplaceFn1 p -> String
showsPrec :: Int -> ReplaceFn1 p -> ShowS
$cshowsPrec :: forall k (p :: k). Int -> ReplaceFn1 p -> ShowS
Show
instance ( PP p x ~ (String -> [String] -> String)
, P p x
) => P (ReplaceFn1 p) x where
type PP (ReplaceFn1 p) x = RReplace
eval :: proxy (ReplaceFn1 p) -> POpts -> x -> m (TT (PP (ReplaceFn1 p) x))
eval proxy (ReplaceFn1 p)
_ POpts
opts x
x = do
let msg0 :: String
msg0 = String
"ReplaceFn1 (String -> [String] -> String)"
TT (String -> [String] -> String)
pp <- Proxy p -> POpts -> x -> m (TT (PP p x))
forall k (p :: k) a (m :: Type -> Type) (proxy :: k -> Type).
(P p a, MonadEval m) =>
proxy p -> POpts -> a -> m (TT (PP p a))
eval (Proxy p
forall k (t :: k). Proxy t
Proxy @p) POpts
opts x
x
TT RReplace -> m (TT RReplace)
forall (f :: Type -> Type) a. Applicative f => a -> f a
pure (TT RReplace -> m (TT RReplace)) -> TT RReplace -> m (TT RReplace)
forall a b. (a -> b) -> a -> b
$ case Inline
-> POpts
-> String
-> TT (String -> [String] -> String)
-> [Tree PE]
-> Either (TT RReplace) (String -> [String] -> String)
forall a x.
Inline -> POpts -> String -> TT a -> [Tree PE] -> Either (TT x) a
getValueLR Inline
NoInline POpts
opts String
msg0 TT (String -> [String] -> String)
pp [] of
Left TT RReplace
e -> TT RReplace
e
Right String -> [String] -> String
f -> POpts -> Val RReplace -> String -> [Tree PE] -> TT RReplace
forall a. POpts -> Val a -> String -> [Tree PE] -> TT a
mkNode POpts
opts (RReplace -> Val RReplace
forall a. a -> Val a
Val ((String -> [String] -> String) -> RReplace
RReplace1 String -> [String] -> String
f)) String
msg0 [TT (String -> [String] -> String) -> Tree PE
forall a. TT a -> Tree PE
hh TT (String -> [String] -> String)
pp]
data ReplaceFn2 p deriving Int -> ReplaceFn2 p -> ShowS
[ReplaceFn2 p] -> ShowS
ReplaceFn2 p -> String
(Int -> ReplaceFn2 p -> ShowS)
-> (ReplaceFn2 p -> String)
-> ([ReplaceFn2 p] -> ShowS)
-> Show (ReplaceFn2 p)
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
forall k (p :: k). Int -> ReplaceFn2 p -> ShowS
forall k (p :: k). [ReplaceFn2 p] -> ShowS
forall k (p :: k). ReplaceFn2 p -> String
showList :: [ReplaceFn2 p] -> ShowS
$cshowList :: forall k (p :: k). [ReplaceFn2 p] -> ShowS
show :: ReplaceFn2 p -> String
$cshow :: forall k (p :: k). ReplaceFn2 p -> String
showsPrec :: Int -> ReplaceFn2 p -> ShowS
$cshowsPrec :: forall k (p :: k). Int -> ReplaceFn2 p -> ShowS
Show
instance ( PP p x ~ (String -> String)
, P p x
) => P (ReplaceFn2 p) x where
type PP (ReplaceFn2 p) x = RReplace
eval :: proxy (ReplaceFn2 p) -> POpts -> x -> m (TT (PP (ReplaceFn2 p) x))
eval proxy (ReplaceFn2 p)
_ POpts
opts x
x = do
let msg0 :: String
msg0 = String
"ReplaceFn2 (String -> String)"
TT ShowS
pp <- Proxy p -> POpts -> x -> m (TT (PP p x))
forall k (p :: k) a (m :: Type -> Type) (proxy :: k -> Type).
(P p a, MonadEval m) =>
proxy p -> POpts -> a -> m (TT (PP p a))
eval (Proxy p
forall k (t :: k). Proxy t
Proxy @p) POpts
opts x
x
TT RReplace -> m (TT RReplace)
forall (f :: Type -> Type) a. Applicative f => a -> f a
pure (TT RReplace -> m (TT RReplace)) -> TT RReplace -> m (TT RReplace)
forall a b. (a -> b) -> a -> b
$ case Inline
-> POpts
-> String
-> TT ShowS
-> [Tree PE]
-> Either (TT RReplace) ShowS
forall a x.
Inline -> POpts -> String -> TT a -> [Tree PE] -> Either (TT x) a
getValueLR Inline
NoInline POpts
opts String
msg0 TT ShowS
pp [] of
Left TT RReplace
e -> TT RReplace
e
Right ShowS
f -> POpts -> Val RReplace -> String -> [Tree PE] -> TT RReplace
forall a. POpts -> Val a -> String -> [Tree PE] -> TT a
mkNode POpts
opts (RReplace -> Val RReplace
forall a. a -> Val a
Val (ShowS -> RReplace
RReplace2 ShowS
f)) String
msg0 [TT ShowS -> Tree PE
forall a. TT a -> Tree PE
hh TT ShowS
pp]
data ReplaceFn3 p deriving Int -> ReplaceFn3 p -> ShowS
[ReplaceFn3 p] -> ShowS
ReplaceFn3 p -> String
(Int -> ReplaceFn3 p -> ShowS)
-> (ReplaceFn3 p -> String)
-> ([ReplaceFn3 p] -> ShowS)
-> Show (ReplaceFn3 p)
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
forall k (p :: k). Int -> ReplaceFn3 p -> ShowS
forall k (p :: k). [ReplaceFn3 p] -> ShowS
forall k (p :: k). ReplaceFn3 p -> String
showList :: [ReplaceFn3 p] -> ShowS
$cshowList :: forall k (p :: k). [ReplaceFn3 p] -> ShowS
show :: ReplaceFn3 p -> String
$cshow :: forall k (p :: k). ReplaceFn3 p -> String
showsPrec :: Int -> ReplaceFn3 p -> ShowS
$cshowsPrec :: forall k (p :: k). Int -> ReplaceFn3 p -> ShowS
Show
instance ( PP p x ~ ([String] -> String)
, P p x
) => P (ReplaceFn3 p) x where
type PP (ReplaceFn3 p) x = RReplace
eval :: proxy (ReplaceFn3 p) -> POpts -> x -> m (TT (PP (ReplaceFn3 p) x))
eval proxy (ReplaceFn3 p)
_ POpts
opts x
x = do
let msg0 :: String
msg0 = String
"ReplaceFn3 ([String] -> String)"
TT ([String] -> String)
pp <- Proxy p -> POpts -> x -> m (TT (PP p x))
forall k (p :: k) a (m :: Type -> Type) (proxy :: k -> Type).
(P p a, MonadEval m) =>
proxy p -> POpts -> a -> m (TT (PP p a))
eval (Proxy p
forall k (t :: k). Proxy t
Proxy @p) POpts
opts x
x
TT RReplace -> m (TT RReplace)
forall (f :: Type -> Type) a. Applicative f => a -> f a
pure (TT RReplace -> m (TT RReplace)) -> TT RReplace -> m (TT RReplace)
forall a b. (a -> b) -> a -> b
$ case Inline
-> POpts
-> String
-> TT ([String] -> String)
-> [Tree PE]
-> Either (TT RReplace) ([String] -> String)
forall a x.
Inline -> POpts -> String -> TT a -> [Tree PE] -> Either (TT x) a
getValueLR Inline
NoInline POpts
opts String
msg0 TT ([String] -> String)
pp [] of
Left TT RReplace
e -> TT RReplace
e
Right [String] -> String
f -> POpts -> Val RReplace -> String -> [Tree PE] -> TT RReplace
forall a. POpts -> Val a -> String -> [Tree PE] -> TT a
mkNode POpts
opts (RReplace -> Val RReplace
forall a. a -> Val a
Val (([String] -> String) -> RReplace
RReplace3 [String] -> String
f)) String
msg0 [TT ([String] -> String) -> Tree PE
forall a. TT a -> Tree PE
hh TT ([String] -> String)
pp]