{-# LANGUAGE RecordWildCards #-}
module Heist.Extra.Splices.Pandoc.Ctx (
RenderCtx (..),
mkRenderCtx,
emptyRenderCtx,
rewriteClass,
ctxSansCustomSplicing,
concatSpliceFunc,
) where
import Data.Map.Strict qualified as Map
import Data.Text qualified as T
import Heist qualified as H
import Heist.Extra.Splices.Pandoc.Attr (concatAttr)
import Heist.Interpreted qualified as HI
import Text.Pandoc.Builder qualified as B
import Text.XmlHtml qualified as X
data RenderCtx = RenderCtx
{
RenderCtx -> Maybe Node
rootNode :: Maybe X.Node
,
RenderCtx -> Block -> Attr
bAttr :: B.Block -> B.Attr
, RenderCtx -> Inline -> Attr
iAttr :: B.Inline -> B.Attr
,
RenderCtx -> Map Text Text
classMap :: Map Text Text
,
RenderCtx -> Block -> Maybe (Splice Identity)
blockSplice :: B.Block -> Maybe (HI.Splice Identity)
, RenderCtx -> Inline -> Maybe (Splice Identity)
inlineSplice :: B.Inline -> Maybe (HI.Splice Identity)
}
mkRenderCtx ::
(Monad m) =>
Map Text Text ->
(RenderCtx -> B.Block -> Maybe (HI.Splice Identity)) ->
(RenderCtx -> B.Inline -> Maybe (HI.Splice Identity)) ->
H.HeistT Identity m RenderCtx
mkRenderCtx :: forall (m :: Type -> Type).
Monad m =>
Map Text Text
-> (RenderCtx -> Block -> Maybe (Splice Identity))
-> (RenderCtx -> Inline -> Maybe (Splice Identity))
-> HeistT Identity m RenderCtx
mkRenderCtx Map Text Text
classMap RenderCtx -> Block -> Maybe (Splice Identity)
bS RenderCtx -> Inline -> Maybe (Splice Identity)
iS = do
Node
node <- forall (m :: Type -> Type) (n :: Type -> Type).
Monad m =>
HeistT n m Node
H.getParamNode
forall (f :: Type -> Type) a. Applicative f => a -> f a
pure forall a b. (a -> b) -> a -> b
$
Node
-> Map Text Text
-> (RenderCtx -> Block -> Maybe (Splice Identity))
-> (RenderCtx -> Inline -> Maybe (Splice Identity))
-> RenderCtx
mkRenderCtxWith
Node
node
Map Text Text
classMap
RenderCtx -> Block -> Maybe (Splice Identity)
bS
RenderCtx -> Inline -> Maybe (Splice Identity)
iS
mkRenderCtxWith ::
X.Node ->
Map Text Text ->
(RenderCtx -> B.Block -> Maybe (HI.Splice Identity)) ->
(RenderCtx -> B.Inline -> Maybe (HI.Splice Identity)) ->
RenderCtx
mkRenderCtxWith :: Node
-> Map Text Text
-> (RenderCtx -> Block -> Maybe (Splice Identity))
-> (RenderCtx -> Inline -> Maybe (Splice Identity))
-> RenderCtx
mkRenderCtxWith Node
node Map Text Text
classMap RenderCtx -> Block -> Maybe (Splice Identity)
bS RenderCtx -> Inline -> Maybe (Splice Identity)
iS = do
let ctx :: RenderCtx
ctx =
Maybe Node
-> (Block -> Attr)
-> (Inline -> Attr)
-> Map Text Text
-> (Block -> Maybe (Splice Identity))
-> (Inline -> Maybe (Splice Identity))
-> RenderCtx
RenderCtx
(forall a. a -> Maybe a
Just Node
node)
(Node -> Block -> Attr
blockLookupAttr Node
node)
(Node -> Inline -> Attr
inlineLookupAttr Node
node)
Map Text Text
classMap
(RenderCtx -> Block -> Maybe (Splice Identity)
bS RenderCtx
ctx)
(RenderCtx -> Inline -> Maybe (Splice Identity)
iS RenderCtx
ctx)
in RenderCtx
ctx
emptyRenderCtx :: RenderCtx
emptyRenderCtx :: RenderCtx
emptyRenderCtx =
Maybe Node
-> (Block -> Attr)
-> (Inline -> Attr)
-> Map Text Text
-> (Block -> Maybe (Splice Identity))
-> (Inline -> Maybe (Splice Identity))
-> RenderCtx
RenderCtx forall a. Maybe a
Nothing (forall a b. a -> b -> a
const Attr
B.nullAttr) (forall a b. a -> b -> a
const Attr
B.nullAttr) forall a. Monoid a => a
mempty (forall a b. a -> b -> a
const forall a. Maybe a
Nothing) (forall a b. a -> b -> a
const forall a. Maybe a
Nothing)
ctxSansCustomSplicing :: RenderCtx -> RenderCtx
ctxSansCustomSplicing :: RenderCtx -> RenderCtx
ctxSansCustomSplicing RenderCtx
ctx =
RenderCtx
ctx
{ blockSplice :: Block -> Maybe (Splice Identity)
blockSplice = forall a b. a -> b -> a
const forall a. Maybe a
Nothing
, inlineSplice :: Inline -> Maybe (Splice Identity)
inlineSplice = forall a b. a -> b -> a
const forall a. Maybe a
Nothing
}
concatSpliceFunc :: Alternative f => (t -> f a) -> (t -> f a) -> t -> f a
concatSpliceFunc :: forall (f :: Type -> Type) t a.
Alternative f =>
(t -> f a) -> (t -> f a) -> t -> f a
concatSpliceFunc t -> f a
f t -> f a
g t
x =
forall (t :: Type -> Type) (f :: Type -> Type) a.
(Foldable t, Alternative f) =>
t (f a) -> f a
asum
[ t -> f a
f t
x
, t -> f a
g t
x
]
rewriteClass :: RenderCtx -> B.Attr -> B.Attr
rewriteClass :: RenderCtx -> Attr -> Attr
rewriteClass RenderCtx {Maybe Node
Map Text Text
Block -> Maybe (Splice Identity)
Block -> Attr
Inline -> Maybe (Splice Identity)
Inline -> Attr
inlineSplice :: Inline -> Maybe (Splice Identity)
blockSplice :: Block -> Maybe (Splice Identity)
classMap :: Map Text Text
iAttr :: Inline -> Attr
bAttr :: Block -> Attr
rootNode :: Maybe Node
inlineSplice :: RenderCtx -> Inline -> Maybe (Splice Identity)
blockSplice :: RenderCtx -> Block -> Maybe (Splice Identity)
classMap :: RenderCtx -> Map Text Text
iAttr :: RenderCtx -> Inline -> Attr
bAttr :: RenderCtx -> Block -> Attr
rootNode :: RenderCtx -> Maybe Node
..} (Text
id', [Text]
classes, [(Text, Text)]
attr) =
(Text
id', forall a. Ord a => Map a a -> a -> a
rewrite Map Text Text
classMap forall (f :: Type -> Type) a b. Functor f => (a -> b) -> f a -> f b
<$> [Text]
classes, [(Text, Text)]
attr)
where
rewrite :: Ord a => Map a a -> a -> a
rewrite :: forall a. Ord a => Map a a -> a -> a
rewrite Map a a
rules a
x =
forall a. a -> Maybe a -> a
fromMaybe a
x forall a b. (a -> b) -> a -> b
$ forall k a. Ord k => k -> Map k a -> Maybe a
Map.lookup a
x Map a a
rules
blockLookupAttr :: X.Node -> B.Block -> B.Attr
blockLookupAttr :: Node -> Block -> Attr
blockLookupAttr Node
node = \case
B.Para {} -> Node -> Text -> Attr
childTagAttr Node
node Text
"Para"
B.BulletList {} -> Node -> Text -> Attr
childTagAttr Node
node Text
"BulletList"
B.OrderedList {} -> Node -> Text -> Attr
childTagAttr Node
node Text
"OrderedList"
B.CodeBlock {} -> Node -> Text -> Attr
childTagAttr Node
node Text
"CodeBlock"
B.BlockQuote {} -> Node -> Text -> Attr
childTagAttr Node
node Text
"BlockQuote"
B.Header Int
level Attr
_ [Inline]
_ ->
forall a. a -> Maybe a -> a
fromMaybe Attr
B.nullAttr forall a b. (a -> b) -> a -> b
$ do
Node
header <- Text -> Node -> Maybe Node
X.childElementTag Text
"Header" Node
node
forall (f :: Type -> Type) a. Applicative f => a -> f a
pure forall a b. (a -> b) -> a -> b
$ Node -> Text -> Attr
childTagAttr Node
header (Text
"h" forall a. Semigroup a => a -> a -> a
<> forall b a. (Show a, IsString b) => a -> b
show Int
level)
Block
_ -> Attr
B.nullAttr
inlineLookupAttr :: X.Node -> B.Inline -> B.Attr
inlineLookupAttr :: Node -> Inline -> Attr
inlineLookupAttr Node
node = \case
B.Code {} -> Node -> Text -> Attr
childTagAttr Node
node Text
"Code"
B.Note [Block]
_ ->
Node -> Text -> Attr
childTagAttr Node
node Text
"Note"
B.Link Attr
_ [Inline]
_ (Text
url, Text
_) ->
forall a. a -> Maybe a -> a
fromMaybe Attr
B.nullAttr forall a b. (a -> b) -> a -> b
$ do
Node
link <- Text -> Node -> Maybe Node
X.childElementTag Text
"PandocLink" Node
node
let innerTag :: Text
innerTag = if Text
"://" Text -> Text -> Bool
`T.isInfixOf` Text
url then Text
"External" else Text
"Internal"
forall (f :: Type -> Type) a. Applicative f => a -> f a
pure forall a b. (a -> b) -> a -> b
$ Node -> Attr
attrFromNode Node
link Attr -> Attr -> Attr
`concatAttr` Node -> Text -> Attr
childTagAttr Node
link Text
innerTag
Inline
_ -> Attr
B.nullAttr
childTagAttr :: X.Node -> Text -> B.Attr
childTagAttr :: Node -> Text -> Attr
childTagAttr Node
x Text
name =
forall b a. b -> (a -> b) -> Maybe a -> b
maybe Attr
B.nullAttr Node -> Attr
attrFromNode forall a b. (a -> b) -> a -> b
$ Text -> Node -> Maybe Node
X.childElementTag Text
name Node
x
attrFromNode :: X.Node -> B.Attr
attrFromNode :: Node -> Attr
attrFromNode Node
node =
let mClass :: [Text]
mClass = forall b a. b -> (a -> b) -> Maybe a -> b
maybe forall a. Monoid a => a
mempty forall t. IsText t "words" => t -> [t]
words forall a b. (a -> b) -> a -> b
$ Text -> Node -> Maybe Text
X.getAttribute Text
"class" Node
node
id' :: Text
id' = forall a. a -> Maybe a -> a
fromMaybe Text
"" forall a b. (a -> b) -> a -> b
$ Text -> Node -> Maybe Text
X.getAttribute Text
"id" Node
node
attrs :: [(Text, Text)]
attrs = forall a. (a -> Bool) -> [a] -> [a]
filter ((forall a. Eq a => a -> a -> Bool
/= Text
"class") forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a b. (a, b) -> a
fst) forall a b. (a -> b) -> a -> b
$ Node -> [(Text, Text)]
X.elementAttrs Node
node
in (Text
id', [Text]
mClass, [(Text, Text)]
attrs)