module Parsley.Register (
Reg, newRegister, get, put,
newRegister_,
put_,
gets, gets_,
modify, modify_,
move, swap,
local, local_,
localModify, localModify_,
bind, rollback,
for
) where
import Prelude hiding (pure, (<*>), (*>), (<*))
import Parsley.Alternative (empty, (<|>))
import Parsley.Applicative (pure, (<*>), (*>), (<*))
import Parsley.Internal (Parser, Reg)
import Parsley.ParserOps (ParserOps)
import Parsley.Selective (when, while)
import qualified Parsley.Internal as Internal (newRegister, get, put)
newRegister :: Parser a
-> (forall r. Reg r a -> Parser b)
-> Parser b
newRegister :: forall a b. Parser a -> (forall r. Reg r a -> Parser b) -> Parser b
newRegister = forall a b. Parser a -> (forall r. Reg r a -> Parser b) -> Parser b
Internal.newRegister
get :: Reg r a -> Parser a
get :: forall r a. Reg r a -> Parser a
get = forall r a. Reg r a -> Parser a
Internal.get
put :: Reg r a -> Parser a -> Parser ()
put :: forall r a. Reg r a -> Parser a -> Parser ()
put = forall r a. Reg r a -> Parser a -> Parser ()
Internal.put
newRegister_ :: ParserOps rep => rep a -> (forall r. Reg r a -> Parser b) -> Parser b
newRegister_ :: forall (rep :: Type -> Type) a b.
ParserOps rep =>
rep a -> (forall r. Reg r a -> Parser b) -> Parser b
newRegister_ rep a
x = forall a b. Parser a -> (forall r. Reg r a -> Parser b) -> Parser b
newRegister (forall (rep :: Type -> Type) a. ParserOps rep => rep a -> Parser a
pure rep a
x)
put_ :: ParserOps rep => Reg r a -> rep a -> Parser ()
put_ :: forall (rep :: Type -> Type) r a.
ParserOps rep =>
Reg r a -> rep a -> Parser ()
put_ Reg r a
r = forall r a. Reg r a -> Parser a -> Parser ()
put Reg r a
r forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (rep :: Type -> Type) a. ParserOps rep => rep a -> Parser a
pure
gets :: Reg r a -> Parser (a -> b) -> Parser b
gets :: forall r a b. Reg r a -> Parser (a -> b) -> Parser b
gets Reg r a
r Parser (a -> b)
p = Parser (a -> b)
p forall a b. Parser (a -> b) -> Parser a -> Parser b
<*> forall r a. Reg r a -> Parser a
get Reg r a
r
gets_ :: ParserOps rep => Reg r a -> rep (a -> b) -> Parser b
gets_ :: forall (rep :: Type -> Type) r a b.
ParserOps rep =>
Reg r a -> rep (a -> b) -> Parser b
gets_ Reg r a
r = forall r a b. Reg r a -> Parser (a -> b) -> Parser b
gets Reg r a
r forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (rep :: Type -> Type) a. ParserOps rep => rep a -> Parser a
pure
modify :: Reg r a -> Parser (a -> a) -> Parser ()
modify :: forall r a. Reg r a -> Parser (a -> a) -> Parser ()
modify Reg r a
r Parser (a -> a)
p = forall r a. Reg r a -> Parser a -> Parser ()
put Reg r a
r (forall r a b. Reg r a -> Parser (a -> b) -> Parser b
gets Reg r a
r Parser (a -> a)
p)
modify_ :: ParserOps rep => Reg r a -> rep (a -> a) -> Parser ()
modify_ :: forall (rep :: Type -> Type) r a.
ParserOps rep =>
Reg r a -> rep (a -> a) -> Parser ()
modify_ Reg r a
r = forall r a. Reg r a -> Parser (a -> a) -> Parser ()
modify Reg r a
r forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (rep :: Type -> Type) a. ParserOps rep => rep a -> Parser a
pure
move :: Reg r1 a -> Reg r2 a -> Parser ()
move :: forall r1 a r2. Reg r1 a -> Reg r2 a -> Parser ()
move Reg r1 a
dst Reg r2 a
src = forall r a. Reg r a -> Parser a -> Parser ()
put Reg r1 a
dst (forall r a. Reg r a -> Parser a
get Reg r2 a
src)
bind :: Parser a -> (Parser a -> Parser b) -> Parser b
bind :: forall a b. Parser a -> (Parser a -> Parser b) -> Parser b
bind Parser a
p Parser a -> Parser b
f = forall a b. Parser a -> (forall r. Reg r a -> Parser b) -> Parser b
newRegister Parser a
p (Parser a -> Parser b
f forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall r a. Reg r a -> Parser a
get)
local :: Reg r a -> Parser a -> Parser b -> Parser b
local :: forall r a b. Reg r a -> Parser a -> Parser b -> Parser b
local Reg r a
r Parser a
p Parser b
q = forall a b. Parser a -> (Parser a -> Parser b) -> Parser b
bind (forall r a. Reg r a -> Parser a
get Reg r a
r) forall a b. (a -> b) -> a -> b
$ \Parser a
x -> forall r a. Reg r a -> Parser a -> Parser ()
put Reg r a
r Parser a
p
forall a b. Parser a -> Parser b -> Parser b
*> Parser b
q
forall a b. Parser a -> Parser b -> Parser a
<* forall r a. Reg r a -> Parser a -> Parser ()
put Reg r a
r Parser a
x
local_ :: ParserOps rep => Reg r a -> rep a -> Parser b -> Parser b
local_ :: forall (rep :: Type -> Type) r a b.
ParserOps rep =>
Reg r a -> rep a -> Parser b -> Parser b
local_ Reg r a
r = forall r a b. Reg r a -> Parser a -> Parser b -> Parser b
local Reg r a
r forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (rep :: Type -> Type) a. ParserOps rep => rep a -> Parser a
pure
localModify :: Reg r a -> Parser (a -> a) -> Parser b -> Parser b
localModify :: forall r a b. Reg r a -> Parser (a -> a) -> Parser b -> Parser b
localModify Reg r a
r Parser (a -> a)
p Parser b
q = forall a b. Parser a -> (Parser a -> Parser b) -> Parser b
bind (forall r a. Reg r a -> Parser a
get Reg r a
r) forall a b. (a -> b) -> a -> b
$ \Parser a
x -> forall r a. Reg r a -> Parser (a -> a) -> Parser ()
modify Reg r a
r Parser (a -> a)
p
forall a b. Parser a -> Parser b -> Parser b
*> Parser b
q
forall a b. Parser a -> Parser b -> Parser a
<* forall r a. Reg r a -> Parser a -> Parser ()
put Reg r a
r Parser a
x
localModify_ :: ParserOps rep => Reg r a -> rep (a -> a) -> Parser b -> Parser b
localModify_ :: forall (rep :: Type -> Type) r a b.
ParserOps rep =>
Reg r a -> rep (a -> a) -> Parser b -> Parser b
localModify_ Reg r a
r = forall r a b. Reg r a -> Parser (a -> a) -> Parser b -> Parser b
localModify Reg r a
r forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (rep :: Type -> Type) a. ParserOps rep => rep a -> Parser a
pure
swap :: Reg r1 a -> Reg r2 a -> Parser ()
swap :: forall r1 a r2. Reg r1 a -> Reg r2 a -> Parser ()
swap Reg r1 a
r1 Reg r2 a
r2 = forall a b. Parser a -> (Parser a -> Parser b) -> Parser b
bind (forall r a. Reg r a -> Parser a
get Reg r1 a
r1) forall a b. (a -> b) -> a -> b
$ \Parser a
x -> forall r1 a r2. Reg r1 a -> Reg r2 a -> Parser ()
move Reg r1 a
r1 Reg r2 a
r2
forall a b. Parser a -> Parser b -> Parser b
*> forall r a. Reg r a -> Parser a -> Parser ()
put Reg r2 a
r2 Parser a
x
rollback :: Reg r a -> Parser b -> Parser b
rollback :: forall r a b. Reg r a -> Parser b -> Parser b
rollback Reg r a
r Parser b
p = forall a b. Parser a -> (Parser a -> Parser b) -> Parser b
bind (forall r a. Reg r a -> Parser a
get Reg r a
r) forall a b. (a -> b) -> a -> b
$ \Parser a
x -> Parser b
p forall a. Parser a -> Parser a -> Parser a
<|> forall r a. Reg r a -> Parser a -> Parser ()
put Reg r a
r Parser a
x forall a b. Parser a -> Parser b -> Parser b
*> forall a. Parser a
empty
for :: Parser a -> Parser (a -> Bool) -> Parser (a -> a) -> Parser () -> Parser ()
for :: forall a.
Parser a
-> Parser (a -> Bool) -> Parser (a -> a) -> Parser () -> Parser ()
for Parser a
init Parser (a -> Bool)
cond Parser (a -> a)
step Parser ()
body =
forall a b. Parser a -> (forall r. Reg r a -> Parser b) -> Parser b
newRegister Parser a
init forall a b. (a -> b) -> a -> b
$ \Reg r a
i ->
let cond' :: Parser Bool
cond' :: Parser Bool
cond' = forall r a b. Reg r a -> Parser (a -> b) -> Parser b
gets Reg r a
i Parser (a -> Bool)
cond
in Parser Bool -> Parser () -> Parser ()
when Parser Bool
cond' (Parser Bool -> Parser ()
while (Parser ()
body forall a b. Parser a -> Parser b -> Parser b
*> forall r a. Reg r a -> Parser (a -> a) -> Parser ()
modify Reg r a
i Parser (a -> a)
step forall a b. Parser a -> Parser b -> Parser b
*> Parser Bool
cond'))