1 {-# LANGUAGE FlexibleInstances #-}
2 {-# LANGUAGE OverloadedStrings #-}
3 {-# OPTIONS_GHC -fno-warn-orphans #-}
4 module Language.TCT.Write.Plain where
6 import Control.Applicative (liftA2)
7 import Control.Monad (Monad(..))
9 import Data.Char (Char)
10 import Data.Default.Class (Default(..))
11 import Data.Eq (Eq(..))
12 import Data.Foldable (Foldable(..))
13 import Data.Function (($))
14 import Data.Functor ((<$>))
16 import Data.Maybe (Maybe(..))
17 import Data.Monoid (Monoid(..))
18 import Data.Ord (Ord(..), Ordering(..))
19 import Data.Semigroup (Semigroup(..))
20 import Data.Sequence (ViewL(..))
21 import Data.String (String, IsString(..))
22 import Prelude (Num(..), error)
23 import Text.Show (Show(..))
24 import qualified Control.Monad.Trans.State as S
25 import qualified Data.List as List
26 import qualified Data.Text.Lazy as TL
27 import qualified Data.Text.Lazy.Builder as TLB
28 import qualified Data.Sequence as Seq
31 import Language.TCT.Utils
32 -- import Language.TCT.Debug
35 type Plain = S.State State TLB.Builder
36 -- NOTE: To get maximum performance when building lazy Text values using a builder,
37 -- associate mappend calls to the right.
38 -- NOTE: (Semigroup.<>) associates to the right.
39 instance IsString Plain where
41 instance Semigroup Plain where
43 instance Monoid Plain where
47 runPlain :: Plain -> State -> TL.Text
48 runPlain p s = TLB.toLazyText $ S.evalState p s
50 text :: Plainify a => State -> a -> TL.Text
51 text s a = runPlain (plainify a) s
53 document :: Roots -> TL.Text
54 document doc = text (setStart doc def) doc
59 { state_escape :: Bool -- FIXME: useful?
61 -- ^ current position,
62 -- always in sync annotated 'Pos' of the input,
63 -- not with the output (whose colmuns may be shifted left by 'state_unindent')
64 , state_indent :: TL.Text
65 -- ^ indentation, which contain horizontal spaces,
66 -- but also any repeated prefix introduced by 'HeaderBar' or 'HeaderGreat'
67 , state_unindent :: Int
68 -- ^ initial 'pos_column' set by 'setStart',
69 -- useful to shift everything to the left
71 instance Default State where
79 -- | Set the starting 'Pos' of given 'State'
80 -- by using the first 'cell_begin'.
81 setStart :: Roots -> State -> State
84 , state_unindent = pos_column pos
89 Tree Cell{cell_begin} _ :< _ -> cell_begin
92 class Plainify a where
93 plainify :: a -> Plain
94 instance Plainify () where
96 instance Plainify Char where
99 S.modify' $ \s@State{state_pos=Pos line _col, state_indent, state_unindent} ->
100 s{state_pos=Pos (line + 1) $ state_unindent + int (TL.length state_indent)}
102 return $ TLB.singleton '\n' <> TLB.fromLazyText state_indent
104 S.modify' $ \s@State{state_pos=Pos line col} ->
105 s{state_pos=Pos line (col + 1)}
106 return $ TLB.singleton c
107 instance Plainify String where
108 plainify = foldMap plainify
109 instance Plainify TL.Text where
113 let (h,ts) = TL.span (/='\n') t in
116 S.modify' $ \s@State{state_pos=Pos line col} ->
117 s{state_pos=Pos line $ col + int (TL.length h)}
118 return $ TLB.fromLazyText h
120 return (TLB.fromLazyText h) <>
121 -- NOTE: useless to increment the pos_column for h,
122 -- since the following '\n' will reset the pos_column.
125 instance Plainify Pos where
126 plainify new@(Pos lineNew colNew) = do
128 { state_pos=old@(Pos lineOld colOld)
132 S.modify' $ \s -> s{state_pos=new}
133 return $ TLB.fromLazyText $
134 case lineNew`compare`lineOld of
135 GT -> lines <> state_indent <> hspaces
137 lines = TL.replicate (int64 $ lineNew - lineOld) "\n"
138 hspaces = TL.replicate (int64 (colNew - state_unindent) - TL.length state_indent) " "
139 EQ | colNew >= colOld ->
140 TL.replicate (int64 $ colNew - colOld) " "
141 _ -> error $ "plainify: non-ascending Pos:"
142 <> "\n old: " <> show old
143 <> "\n new: " <> show new
144 instance Plainify Roots where
145 plainify = foldMap plainify
146 instance Plainify Root where
147 plainify (Tree (Cell bp _ep nod) ts) =
150 ----------------------
151 NodeLower n as -> "<" <> plainify n <> plainify as <> plainify ts
152 ----------------------
155 HeaderGreat{} -> plainHeaderRepeated
156 HeaderBar{} -> plainHeaderRepeated
157 _ -> plainify hdr <> plainify ts
159 plainHeaderRepeated = do
162 S.modify' $ \s -> s{state_indent =
164 TL.replicate (int64 (pos_column bp - state_unindent) - TL.length state_indent) " " <>
168 S.modify' $ \s -> s{state_indent}
170 ----------------------
173 S.modify' $ \s -> s{state_indent =
175 TL.replicate (int64 (pos_column bp - state_unindent) - TL.length state_indent) " "
178 S.modify' $ \s -> s{state_indent}
180 ----------------------
183 S.modify' $ \s -> s{state_indent =
185 TL.replicate (int64 (pos_column bp - state_unindent) - TL.length state_indent) " "
188 S.modify' $ \s -> s{state_indent}
190 ----------------------
191 NodeToken t -> plainify t <> plainify ts
192 ----------------------
194 plainify o <> plainify ts <> plainify c
195 where (o,c) = pairBorders p ts
196 instance Plainify Header where
199 HeaderColon n wh -> plainify n <> plainify wh <> ":"
200 HeaderGreat n wh -> plainify n <> plainify wh <> ">"
201 HeaderEqual n wh -> plainify n <> plainify wh <> "="
202 HeaderBar n wh -> plainify n <> plainify wh <> "|"
203 HeaderDot n -> plainify n <> "."
204 HeaderBrackets n -> "[" <> plainify n <> "]"
206 HeaderDashDash -> "-- "
207 HeaderSection lvl -> plainify (List.replicate lvl '#')
208 HeaderDotSlash n -> "./" <> plainify n
209 instance Plainify Token where
211 TokenText t -> plainify t
212 TokenTag t -> plainify '#' <> plainify t
213 TokenLink l -> plainify l
215 esc <- S.gets state_escape
217 then plainify ['\\', c]
219 instance Plainify ElemAttrs where
220 plainify = foldMap plainify
221 instance Plainify (White,ElemAttr) where
222 plainify (elemAttr_white,ElemAttr{..}) =
223 mconcat $ plainify <$>
232 -- * Class 'RackUpLeft'
233 class RackUpLeft a where
234 rackUpLeft :: a -> S.State (Maybe Pos) a
235 instance RackUpLeft Pos where
236 rackUpLeft pos@Pos{..} = do
238 Nothing -> return pos
241 { pos_line = pos_line - l0 + 1
242 , pos_column = pos_column - c0 + 1
244 instance RackUpLeft (Cell a) where
245 rackUpLeft (Cell bp ep a) = do
253 instance RackUpLeft a => RackUpLeft (Seq a) where
254 rackUpLeft = mapM rackUpLeft
255 instance RackUpLeft a => RackUpLeft (Tree a) where
256 rackUpLeft (Tree n ts) =