{-# LANGUAGE OverloadedStrings, CPP #-}
#if __GLASGOW_HASKELL__ >= 801
{-# OPTIONS_GHC -Wno-orphans #-}
#else
{-# OPTIONS_GHC -fno-warn-orphans #-}
#endif
module Text.LaTeX.Packages.Trees.Qtree (
module Text.LaTeX.Packages.Trees
, qtree
, tree
, rendertree
) where
import Text.LaTeX.Base
import Text.LaTeX.Base.Class
import Text.LaTeX.Packages.Trees
import Data.List (intersperse)
qtree :: PackageName
qtree :: PackageName
qtree = PackageName
"qtree"
tree_ :: LaTeXC l => (a -> l) -> Tree a -> l
tree_ :: forall l a. LaTeXC l => (a -> l) -> Tree a -> l
tree_ a -> l
f (Leaf a
x) = l -> l
forall l. LaTeXC l => l -> l
braces (l -> l) -> l -> l
forall a b. (a -> b) -> a -> b
$ a -> l
f a
x
tree_ a -> l
f (Node Maybe a
mx [Tree a]
ts) =
[l] -> l
forall a. Monoid a => [a] -> a
mconcat [ l
"["
, l -> (a -> l) -> Maybe a -> l
forall b a. b -> (a -> b) -> Maybe a -> b
maybe l
forall a. Monoid a => a
mempty ((l
"." l -> l -> l
forall a. Semigroup a => a -> a -> a
<>) (l -> l) -> (a -> l) -> a -> l
forall b c a. (b -> c) -> (a -> b) -> a -> c
. l -> l
forall l. LaTeXC l => l -> l
braces (l -> l) -> (a -> l) -> a -> l
forall b c a. (b -> c) -> (a -> b) -> a -> c
. a -> l
f) Maybe a
mx
, l
" "
, [l] -> l
forall a. Monoid a => [a] -> a
mconcat ([l] -> l) -> [l] -> l
forall a b. (a -> b) -> a -> b
$ l -> [l] -> [l]
forall a. a -> [a] -> [a]
intersperse l
" " ([l] -> [l]) -> [l] -> [l]
forall a b. (a -> b) -> a -> b
$ (Tree a -> l) -> [Tree a] -> [l]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap ((a -> l) -> Tree a -> l
forall l a. LaTeXC l => (a -> l) -> Tree a -> l
tree_ a -> l
f) [Tree a]
ts
, l
" ]"
]
tree :: LaTeXC l => (a -> l) -> Tree a -> l
tree :: forall l a. LaTeXC l => (a -> l) -> Tree a -> l
tree a -> l
f Tree a
t = PackageName -> l
forall l. LaTeXC l => PackageName -> l
commS PackageName
"Tree" l -> l -> l
forall a. Semigroup a => a -> a -> a
<> l
" " l -> l -> l
forall a. Semigroup a => a -> a -> a
<> (a -> l) -> Tree a -> l
forall l a. LaTeXC l => (a -> l) -> Tree a -> l
tree_ a -> l
f Tree a
t
instance Texy a => Texy (Tree a) where
texy :: forall l. LaTeXC l => Tree a -> l
texy = (a -> l) -> Tree a -> l
forall l a. LaTeXC l => (a -> l) -> Tree a -> l
tree a -> l
forall l. LaTeXC l => a -> l
forall t l. (Texy t, LaTeXC l) => t -> l
texy
rendertree :: (Render a, LaTeXC l) => Tree a -> l
rendertree :: forall a l. (Render a, LaTeXC l) => Tree a -> l
rendertree = (a -> l) -> Tree a -> l
forall l a. LaTeXC l => (a -> l) -> Tree a -> l
tree (Text -> l
forall l. LaTeXC l => Text -> l
raw (Text -> l) -> (a -> Text) -> a -> l
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Text -> Text
protectText (Text -> Text) -> (a -> Text) -> a -> Text
forall b c a. (b -> c) -> (a -> b) -> a -> c
. a -> Text
forall a. Render a => a -> Text
render)