{-# LANGUAGE DerivingVia #-}
{-# LANGUAGE GeneralizedNewtypeDeriving #-}

module Calligraphy.Util.Printer where

import Control.Monad.RWS
import Control.Monad.State
import Data.Foldable
import Data.Text (Text)
import qualified Data.Text.Lazy as TL
import Data.Text.Lazy.Builder (Builder)
import qualified Data.Text.Lazy.Builder as TB

newtype Printer a = Printer {forall a. Printer a -> RWS Int () Builder a
unPrinter :: RWS Int () Builder a}
  deriving newtype (forall a b. a -> Printer b -> Printer a
forall a b. (a -> b) -> Printer a -> Printer b
forall (f :: * -> *).
(forall a b. (a -> b) -> f a -> f b)
-> (forall a b. a -> f b -> f a) -> Functor f
<$ :: forall a b. a -> Printer b -> Printer a
$c<$ :: forall a b. a -> Printer b -> Printer a
fmap :: forall a b. (a -> b) -> Printer a -> Printer b
$cfmap :: forall a b. (a -> b) -> Printer a -> Printer b
Functor, Functor Printer
forall a. a -> Printer a
forall a b. Printer a -> Printer b -> Printer a
forall a b. Printer a -> Printer b -> Printer b
forall a b. Printer (a -> b) -> Printer a -> Printer b
forall a b c. (a -> b -> c) -> Printer a -> Printer b -> Printer c
forall (f :: * -> *).
Functor f
-> (forall a. a -> f a)
-> (forall a b. f (a -> b) -> f a -> f b)
-> (forall a b c. (a -> b -> c) -> f a -> f b -> f c)
-> (forall a b. f a -> f b -> f b)
-> (forall a b. f a -> f b -> f a)
-> Applicative f
<* :: forall a b. Printer a -> Printer b -> Printer a
$c<* :: forall a b. Printer a -> Printer b -> Printer a
*> :: forall a b. Printer a -> Printer b -> Printer b
$c*> :: forall a b. Printer a -> Printer b -> Printer b
liftA2 :: forall a b c. (a -> b -> c) -> Printer a -> Printer b -> Printer c
$cliftA2 :: forall a b c. (a -> b -> c) -> Printer a -> Printer b -> Printer c
<*> :: forall a b. Printer (a -> b) -> Printer a -> Printer b
$c<*> :: forall a b. Printer (a -> b) -> Printer a -> Printer b
pure :: forall a. a -> Printer a
$cpure :: forall a. a -> Printer a
Applicative, Applicative Printer
forall a. a -> Printer a
forall a b. Printer a -> Printer b -> Printer b
forall a b. Printer a -> (a -> Printer b) -> Printer b
forall (m :: * -> *).
Applicative m
-> (forall a b. m a -> (a -> m b) -> m b)
-> (forall a b. m a -> m b -> m b)
-> (forall a. a -> m a)
-> Monad m
return :: forall a. a -> Printer a
$creturn :: forall a. a -> Printer a
>> :: forall a b. Printer a -> Printer b -> Printer b
$c>> :: forall a b. Printer a -> Printer b -> Printer b
>>= :: forall a b. Printer a -> (a -> Printer b) -> Printer b
$c>>= :: forall a b. Printer a -> (a -> Printer b) -> Printer b
Monad)
  deriving (NonEmpty (Printer a) -> Printer a
Printer a -> Printer a -> Printer a
forall b. Integral b => b -> Printer a -> Printer a
forall a. Semigroup a => NonEmpty (Printer a) -> Printer a
forall a. Semigroup a => Printer a -> Printer a -> Printer a
forall a b.
(Semigroup a, Integral b) =>
b -> Printer a -> Printer a
forall a.
(a -> a -> a)
-> (NonEmpty a -> a)
-> (forall b. Integral b => b -> a -> a)
-> Semigroup a
stimes :: forall b. Integral b => b -> Printer a -> Printer a
$cstimes :: forall a b.
(Semigroup a, Integral b) =>
b -> Printer a -> Printer a
sconcat :: NonEmpty (Printer a) -> Printer a
$csconcat :: forall a. Semigroup a => NonEmpty (Printer a) -> Printer a
<> :: Printer a -> Printer a -> Printer a
$c<> :: forall a. Semigroup a => Printer a -> Printer a -> Printer a
Semigroup, Printer a
[Printer a] -> Printer a
Printer a -> Printer a -> Printer a
forall a.
Semigroup a -> a -> (a -> a -> a) -> ([a] -> a) -> Monoid a
forall {a}. Monoid a => Semigroup (Printer a)
forall a. Monoid a => Printer a
forall a. Monoid a => [Printer a] -> Printer a
forall a. Monoid a => Printer a -> Printer a -> Printer a
mconcat :: [Printer a] -> Printer a
$cmconcat :: forall a. Monoid a => [Printer a] -> Printer a
mappend :: Printer a -> Printer a -> Printer a
$cmappend :: forall a. Monoid a => Printer a -> Printer a -> Printer a
mempty :: Printer a
$cmempty :: forall a. Monoid a => Printer a
Monoid) via (Ap Printer a)

type Prints a = a -> Printer ()

runPrinter :: Printer () -> Text
runPrinter :: Printer () -> Text
runPrinter (Printer RWS Int () Builder ()
p) = Text -> Text
TL.toStrict forall b c a. (b -> c) -> (a -> b) -> a -> c
. Builder -> Text
TB.toLazyText forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a b. (a, b) -> a
fst forall a b. (a -> b) -> a -> b
$ forall r w s a. RWS r w s a -> r -> s -> (s, w)
execRWS RWS Int () Builder ()
p Int
0 forall a. Monoid a => a
mempty

class Monad m => MonadPrint m where
  line :: Builder -> m ()
  indent :: m a -> m a

instance MonadPrint Printer where
  {-# INLINE indent #-}
  indent :: forall a. Printer a -> Printer a
indent (Printer RWS Int () Builder a
p) = forall a. RWS Int () Builder a -> Printer a
Printer forall a b. (a -> b) -> a -> b
$ forall r (m :: * -> *) a. MonadReader r m => (r -> r) -> m a -> m a
local (forall a. Num a => a -> a -> a
+ Int
4) RWS Int () Builder a
p

  {-# INLINE line #-}
  line :: Builder -> Printer ()
line Builder
t = forall a. RWS Int () Builder a -> Printer a
Printer forall a b. (a -> b) -> a -> b
$ do
    Int
n <- forall r (m :: * -> *). MonadReader r m => m r
ask
    forall s (m :: * -> *). MonadState s m => (s -> s) -> m ()
modify forall a b. (a -> b) -> a -> b
$
      forall a b c. (a -> b -> c) -> b -> a -> c
flip forall a. Monoid a => a -> a -> a
mappend forall a b. (a -> b) -> a -> b
$ forall (t :: * -> *) m. (Foldable t, Monoid m) => t m -> m
fold (forall a. Int -> a -> [a]
replicate Int
n (Char -> Builder
TB.singleton Char
' ')) forall a. Semigroup a => a -> a -> a
<> Builder
t forall a. Semigroup a => a -> a -> a
<> Char -> Builder
TB.singleton Char
'\n'

instance MonadPrint m => MonadPrint (StateT s m) where
  line :: Builder -> StateT s m ()
line = forall (t :: (* -> *) -> * -> *) (m :: * -> *) a.
(MonadTrans t, Monad m) =>
m a -> t m a
lift forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (m :: * -> *). MonadPrint m => Builder -> m ()
line
  indent :: forall a. StateT s m a -> StateT s m a
indent (StateT s -> m (a, s)
m) = forall s (m :: * -> *) a. (s -> m (a, s)) -> StateT s m a
StateT forall a b. (a -> b) -> a -> b
$ forall (m :: * -> *) a. MonadPrint m => m a -> m a
indent forall b c a. (b -> c) -> (a -> b) -> a -> c
. s -> m (a, s)
m

{-# INLINE brack #-}
brack :: MonadPrint m => String -> String -> m a -> m a
brack :: forall (m :: * -> *) a.
MonadPrint m =>
String -> String -> m a -> m a
brack String
pre String
post m a
inner = forall (m :: * -> *). MonadPrint m => String -> m ()
strLn String
pre forall (f :: * -> *) a b. Applicative f => f a -> f b -> f b
*> forall (m :: * -> *) a. MonadPrint m => m a -> m a
indent m a
inner forall (f :: * -> *) a b. Applicative f => f a -> f b -> f a
<* forall (m :: * -> *). MonadPrint m => String -> m ()
strLn String
post

{-# INLINE strLn #-}
strLn :: MonadPrint m => String -> m ()
strLn :: forall (m :: * -> *). MonadPrint m => String -> m ()
strLn = forall (m :: * -> *). MonadPrint m => Builder -> m ()
line forall b c a. (b -> c) -> (a -> b) -> a -> c
. String -> Builder
TB.fromString

{-# INLINE textLn #-}
textLn :: MonadPrint m => Text -> m ()
textLn :: forall (m :: * -> *). MonadPrint m => Text -> m ()
textLn = forall (m :: * -> *). MonadPrint m => Builder -> m ()
line forall b c a. (b -> c) -> (a -> b) -> a -> c
. Text -> Builder
TB.fromText

{-# INLINE showLn #-}
showLn :: (MonadPrint m, Show a) => a -> m ()
showLn :: forall (m :: * -> *) a. (MonadPrint m, Show a) => a -> m ()
showLn = forall (m :: * -> *). MonadPrint m => String -> m ()
strLn forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a. Show a => a -> String
show