{-# LANGUAGE Trustworthy #-}
module Text.Gigaparsec.Registers (
    Reg,
    make,
    get, gets,
    put, puts,
    modify,
    local, localWith,
  ) where

import Text.Gigaparsec (Parsec, ($>))
import Text.Gigaparsec.Internal.RT (Reg, newReg, readReg, writeReg)
import Text.Gigaparsec.Internal qualified as Internal (Parsec(..))

_make :: Parsec a -> (forall r. Reg r a -> Parsec b) -> Parsec b
_make :: forall a b. Parsec a -> (forall r. Reg r a -> Parsec b) -> Parsec b
_make Parsec a
p forall r. Reg r a -> Parsec b
f = Parsec a
p forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
>>= \a
x -> forall a b. a -> (forall r. Reg r a -> Parsec b) -> Parsec b
make a
x forall r. Reg r a -> Parsec b
f

make :: a -> (forall r. Reg r a -> Parsec b) -> Parsec b
make :: forall a b. a -> (forall r. Reg r a -> Parsec b) -> Parsec b
make a
x forall r. Reg r a -> Parsec b
f = forall a.
(forall r.
 State -> (a -> State -> RT r) -> (State -> RT r) -> RT r)
-> Parsec a
Internal.Parsec forall a b. (a -> b) -> a -> b
$ \State
st b -> State -> RT r
good State -> RT r
bad ->
  forall a b. a -> (forall r. Reg r a -> RT b) -> RT b
newReg a
x forall a b. (a -> b) -> a -> b
$ \Reg r a
reg ->
    let Internal.Parsec forall r. State -> (b -> State -> RT r) -> (State -> RT r) -> RT r
p = forall r. Reg r a -> Parsec b
f Reg r a
reg
    in forall r. State -> (b -> State -> RT r) -> (State -> RT r) -> RT r
p State
st b -> State -> RT r
good State -> RT r
bad

get :: Reg r a -> Parsec a
get :: forall r a. Reg r a -> Parsec a
get Reg r a
reg = forall a.
(forall r.
 State -> (a -> State -> RT r) -> (State -> RT r) -> RT r)
-> Parsec a
Internal.Parsec forall a b. (a -> b) -> a -> b
$ \State
st a -> State -> RT r
good State -> RT r
_ ->
  do a
x <- forall r a. Reg r a -> RT a
readReg Reg r a
reg
     a -> State -> RT r
good a
x State
st

-- parsley provides multiple overloadings...
_gets :: Reg r a -> Parsec (a -> b) -> Parsec b
_gets :: forall r a b. Reg r a -> Parsec (a -> b) -> Parsec b
_gets Reg r a
reg Parsec (a -> b)
pf = Parsec (a -> b)
pf forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
<*> forall r a. Reg r a -> Parsec a
get Reg r a
reg

gets :: Reg r a -> (a -> b) -> Parsec b
gets :: forall r a b. Reg r a -> (a -> b) -> Parsec b
gets Reg r a
reg a -> b
f = a -> b
f forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> forall r a. Reg r a -> Parsec a
get Reg r a
reg

_put :: Reg r a -> Parsec a -> Parsec ()
_put :: forall r a. Reg r a -> Parsec a -> Parsec ()
_put Reg r a
reg Parsec a
px = Parsec a
px forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
>>= forall r a. Reg r a -> a -> Parsec ()
put Reg r a
reg

put :: Reg r a -> a -> Parsec ()
put :: forall r a. Reg r a -> a -> Parsec ()
put Reg r a
reg a
x = forall a.
(forall r.
 State -> (a -> State -> RT r) -> (State -> RT r) -> RT r)
-> Parsec a
Internal.Parsec forall a b. (a -> b) -> a -> b
$ \State
st () -> State -> RT r
good State -> RT r
_ ->
  do forall r a. Reg r a -> a -> RT ()
writeReg Reg r a
reg a
x
     () -> State -> RT r
good () State
st

puts :: Reg r b -> (a -> b) -> Parsec a -> Parsec ()
puts :: forall r b a. Reg r b -> (a -> b) -> Parsec a -> Parsec ()
puts Reg r b
reg a -> b
f Parsec a
px = forall r a. Reg r a -> Parsec a -> Parsec ()
_put Reg r b
reg (a -> b
f forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> Parsec a
px)

_modify :: Reg r a -> Parsec (a -> a) -> Parsec ()
_modify :: forall r a. Reg r a -> Parsec (a -> a) -> Parsec ()
_modify Reg r a
reg Parsec (a -> a)
pf = forall r a. Reg r a -> Parsec a -> Parsec ()
_put Reg r a
reg (forall r a b. Reg r a -> Parsec (a -> b) -> Parsec b
_gets Reg r a
reg Parsec (a -> a)
pf)

modify :: Reg r a -> (a -> a) -> Parsec ()
modify :: forall r a. Reg r a -> (a -> a) -> Parsec ()
modify Reg r a
reg a -> a
f = forall r a. Reg r a -> Parsec a -> Parsec ()
_put Reg r a
reg (forall r a b. Reg r a -> (a -> b) -> Parsec b
gets Reg r a
reg a -> a
f)

local :: Reg r a -> (a -> a) -> Parsec b -> Parsec b
local :: forall r a b. Reg r a -> (a -> a) -> Parsec b -> Parsec b
local Reg r a
reg a -> a
f Parsec b
p = do a
x <- forall r a. Reg r a -> Parsec a
get Reg r a
reg
                   forall r a. Reg r a -> a -> Parsec ()
put Reg r a
reg (a -> a
f a
x)
                   b
y <- Parsec b
p
                   forall r a. Reg r a -> a -> Parsec ()
put Reg r a
reg a
x forall a b. Parsec a -> b -> Parsec b
$> b
y

localWith :: Reg r a -> a -> Parsec b -> Parsec b
localWith :: forall r a b. Reg r a -> a -> Parsec b -> Parsec b
localWith Reg r a
reg a
x = forall r a b. Reg r a -> (a -> a) -> Parsec b -> Parsec b
local Reg r a
reg (forall a b. a -> b -> a
const a
x)

_localWith :: Reg r a -> Parsec a -> Parsec b -> Parsec b
_localWith :: forall r a b. Reg r a -> Parsec a -> Parsec b -> Parsec b
_localWith Reg r a
reg Parsec a
px Parsec b
q = Parsec a
px forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
>>= forall a b c. (a -> b -> c) -> b -> a -> c
flip (forall r a b. Reg r a -> a -> Parsec b -> Parsec b
localWith Reg r a
reg) Parsec b
q

-- TODO: for combinators