{-# LANGUAGE ExistentialQuantification, FlexibleInstances, StandaloneDeriving, GeneralizedNewtypeDeriving, TypeSynonymInstances #-}
{-# OPTIONS_HADDOCK not-home #-}
module Text.StringTemplate.Classes
(SElem(..), StringTemplateShows(..), ToSElem(..), SMap, STShow(..),
StFirst(..), Stringable(..), stShowsToSE
) where
import qualified Data.Map as M
import Data.List
import Data.Monoid
import qualified Blaze.ByteString.Builder as BB
import qualified Blaze.ByteString.Builder.Char.Utf8 as BB
import qualified Data.ByteString.Char8 as B
import qualified Data.ByteString.Lazy.Char8 as LB
import qualified Data.Semigroup as SG
import qualified Data.Text as T
import qualified Data.Text.Encoding as T
import qualified Data.Text.Lazy as LT
import qualified Data.Text.Lazy.Builder as TB
import qualified Data.Text.Lazy.Encoding as LT
import qualified Text.PrettyPrint.HughesPJ as PP
newtype StFirst a = StFirst { forall a. StFirst a -> Maybe a
stGetFirst :: Maybe a }
deriving (StFirst a -> StFirst a -> Bool
forall a. Eq a => StFirst a -> StFirst a -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: StFirst a -> StFirst a -> Bool
$c/= :: forall a. Eq a => StFirst a -> StFirst a -> Bool
== :: StFirst a -> StFirst a -> Bool
$c== :: forall a. Eq a => StFirst a -> StFirst a -> Bool
Eq, StFirst a -> StFirst a -> Bool
StFirst a -> StFirst a -> Ordering
StFirst a -> StFirst a -> StFirst a
forall a.
Eq a
-> (a -> a -> Ordering)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> a)
-> (a -> a -> a)
-> Ord a
forall {a}. Ord a => Eq (StFirst a)
forall a. Ord a => StFirst a -> StFirst a -> Bool
forall a. Ord a => StFirst a -> StFirst a -> Ordering
forall a. Ord a => StFirst a -> StFirst a -> StFirst a
min :: StFirst a -> StFirst a -> StFirst a
$cmin :: forall a. Ord a => StFirst a -> StFirst a -> StFirst a
max :: StFirst a -> StFirst a -> StFirst a
$cmax :: forall a. Ord a => StFirst a -> StFirst a -> StFirst a
>= :: StFirst a -> StFirst a -> Bool
$c>= :: forall a. Ord a => StFirst a -> StFirst a -> Bool
> :: StFirst a -> StFirst a -> Bool
$c> :: forall a. Ord a => StFirst a -> StFirst a -> Bool
<= :: StFirst a -> StFirst a -> Bool
$c<= :: forall a. Ord a => StFirst a -> StFirst a -> Bool
< :: StFirst a -> StFirst a -> Bool
$c< :: forall a. Ord a => StFirst a -> StFirst a -> Bool
compare :: StFirst a -> StFirst a -> Ordering
$ccompare :: forall a. Ord a => StFirst a -> StFirst a -> Ordering
Ord, ReadPrec [StFirst a]
ReadPrec (StFirst a)
ReadS [StFirst a]
forall a. Read a => ReadPrec [StFirst a]
forall a. Read a => ReadPrec (StFirst a)
forall a. Read a => Int -> ReadS (StFirst a)
forall a. Read a => ReadS [StFirst a]
forall a.
(Int -> ReadS a)
-> ReadS [a] -> ReadPrec a -> ReadPrec [a] -> Read a
readListPrec :: ReadPrec [StFirst a]
$creadListPrec :: forall a. Read a => ReadPrec [StFirst a]
readPrec :: ReadPrec (StFirst a)
$creadPrec :: forall a. Read a => ReadPrec (StFirst a)
readList :: ReadS [StFirst a]
$creadList :: forall a. Read a => ReadS [StFirst a]
readsPrec :: Int -> ReadS (StFirst a)
$creadsPrec :: forall a. Read a => Int -> ReadS (StFirst a)
Read, Int -> StFirst a -> ShowS
forall a. Show a => Int -> StFirst a -> ShowS
forall a. Show a => [StFirst a] -> ShowS
forall a. Show a => StFirst a -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [StFirst a] -> ShowS
$cshowList :: forall a. Show a => [StFirst a] -> ShowS
show :: StFirst a -> String
$cshow :: forall a. Show a => StFirst a -> String
showsPrec :: Int -> StFirst a -> ShowS
$cshowsPrec :: forall a. Show a => Int -> StFirst a -> ShowS
Show)
instance SG.Semigroup (StFirst a) where
r :: StFirst a
r@(StFirst (Just a
_)) <> :: StFirst a -> StFirst a -> StFirst a
<> StFirst a
_ = StFirst a
r
StFirst Maybe a
Nothing <> StFirst a
r = StFirst a
r
instance Monoid (StFirst a) where
mempty :: StFirst a
mempty = forall a. Maybe a -> StFirst a
StFirst forall a. Maybe a
Nothing
mappend :: StFirst a -> StFirst a -> StFirst a
mappend = forall a. Semigroup a => a -> a -> a
(SG.<>)
instance Functor StFirst where
fmap :: forall a b. (a -> b) -> StFirst a -> StFirst b
fmap a -> b
f = forall a. Maybe a -> StFirst a
StFirst forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap a -> b
f forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a. StFirst a -> Maybe a
stGetFirst
type SMap a = M.Map String (SElem a)
data SElem a = STR String
| BS LB.ByteString
| TXT LT.Text
| STSH STShow
| SM (SMap a)
| LI [SElem a]
| SBLE a
| SNAT a
| SNull
class ToSElem a where
toSElem :: Stringable b => a -> SElem b
toSElemList :: Stringable b => [a] -> SElem b
toSElemList = forall a. [SElem a] -> SElem a
LI forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a b. (a -> b) -> [a] -> [b]
map forall a b. (ToSElem a, Stringable b) => a -> SElem b
toSElem
class (Show a) => StringTemplateShows a where
stringTemplateShow :: a -> String
stringTemplateShow = forall a. Show a => a -> String
show
stringTemplateFormattedShow :: String -> a -> String
stringTemplateFormattedShow = forall a b c. (a -> b -> c) -> b -> a -> c
flip forall a b. (a -> b) -> a -> b
$ forall a b. a -> b -> a
const forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a. StringTemplateShows a => a -> String
stringTemplateShow
stShowsToSE :: (StringTemplateShows a, Stringable b) => a -> SElem b
stShowsToSE :: forall a b. (StringTemplateShows a, Stringable b) => a -> SElem b
stShowsToSE = forall a. STShow -> SElem a
STSH forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a. StringTemplateShows a => a -> STShow
STShow
data STShow = forall a.(StringTemplateShows a) => STShow a
class Monoid a => Stringable a where
stFromString :: String -> a
stFromByteString :: LB.ByteString -> a
stFromByteString = forall a. Stringable a => Text -> a
stFromText forall b c a. (b -> c) -> (a -> b) -> a -> c
. ByteString -> Text
LT.decodeUtf8
stFromText :: LT.Text -> a
stFromText = forall a. Stringable a => String -> a
stFromString forall b c a. (b -> c) -> (a -> b) -> a -> c
. Text -> String
LT.unpack
stToString :: a -> String
mconcatMap :: [b] -> (b -> a) -> a
mconcatMap [b]
m b -> a
k = forall (t :: * -> *) a b.
Foldable t =>
(a -> b -> b) -> b -> t a -> b
foldr (forall a. Monoid a => a -> a -> a
mappend forall b c a. (b -> c) -> (a -> b) -> a -> c
. b -> a
k) forall a. Monoid a => a
mempty [b]
m
mintercalate :: a -> [a] -> a
mintercalate = (forall a. Monoid a => [a] -> a
mconcat forall b c a. (b -> c) -> (a -> b) -> a -> c
.) forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a. a -> [a] -> [a]
intersperse
mlabel :: a -> a -> a
mlabel a
x a
y = forall a. Monoid a => [a] -> a
mconcat [a
x, forall a. Stringable a => String -> a
stFromString String
"[", a
y, forall a. Stringable a => String -> a
stFromString String
"]"]
instance Stringable String where
stFromString :: ShowS
stFromString = forall a. a -> a
id
stToString :: ShowS
stToString = forall a. a -> a
id
instance Stringable PP.Doc where
stFromString :: String -> Doc
stFromString = String -> Doc
PP.text
stToString :: Doc -> String
stToString = Doc -> String
PP.render
mconcatMap :: forall b. [b] -> (b -> Doc) -> Doc
mconcatMap [b]
m b -> Doc
k = [Doc] -> Doc
PP.fcat forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a b. (a -> b) -> [a] -> [b]
map b -> Doc
k forall a b. (a -> b) -> a -> b
$ [b]
m
mintercalate :: Doc -> [Doc] -> Doc
mintercalate = ([Doc] -> Doc
PP.fcat forall b c a. (b -> c) -> (a -> b) -> a -> c
.) forall b c a. (b -> c) -> (a -> b) -> a -> c
. Doc -> [Doc] -> [Doc]
PP.punctuate
mlabel :: Doc -> Doc -> Doc
mlabel Doc
x Doc
y = Doc
x Doc -> Doc -> Doc
PP.$$ Int -> Doc -> Doc
PP.nest Int
1 Doc
y
instance Stringable B.ByteString where
stFromString :: String -> ByteString
stFromString = String -> ByteString
B.pack
stFromByteString :: ByteString -> ByteString
stFromByteString = [ByteString] -> ByteString
B.concat forall b c a. (b -> c) -> (a -> b) -> a -> c
. ByteString -> [ByteString]
LB.toChunks
stToString :: ByteString -> String
stToString = ByteString -> String
B.unpack
instance Stringable LB.ByteString where
stFromString :: String -> ByteString
stFromString = String -> ByteString
LB.pack
stFromByteString :: ByteString -> ByteString
stFromByteString = forall a. a -> a
id
stToString :: ByteString -> String
stToString = ByteString -> String
LB.unpack
instance Stringable T.Text where
stFromString :: String -> Text
stFromString = String -> Text
T.pack
stFromByteString :: ByteString -> Text
stFromByteString = ByteString -> Text
T.decodeUtf8 forall b c a. (b -> c) -> (a -> b) -> a -> c
. [ByteString] -> ByteString
B.concat forall b c a. (b -> c) -> (a -> b) -> a -> c
. ByteString -> [ByteString]
LB.toChunks
stFromText :: Text -> Text
stFromText = Text -> Text
LT.toStrict
stToString :: Text -> String
stToString = Text -> String
T.unpack
instance Stringable LT.Text where
stFromString :: String -> Text
stFromString = String -> Text
LT.pack
stFromByteString :: ByteString -> Text
stFromByteString = ByteString -> Text
LT.decodeUtf8
stFromText :: Text -> Text
stFromText = forall a. a -> a
id
stToString :: Text -> String
stToString = Text -> String
LT.unpack
instance Stringable BB.Builder where
stFromString :: String -> Builder
stFromString = String -> Builder
BB.fromString
stFromByteString :: ByteString -> Builder
stFromByteString = ByteString -> Builder
BB.fromLazyByteString
stToString :: Builder -> String
stToString = ByteString -> String
LB.unpack forall b c a. (b -> c) -> (a -> b) -> a -> c
. Builder -> ByteString
BB.toLazyByteString
instance Stringable TB.Builder where
stFromString :: String -> Builder
stFromString = String -> Builder
TB.fromString
stFromText :: Text -> Builder
stFromText = Text -> Builder
TB.fromLazyText
stToString :: Builder -> String
stToString = Text -> String
LT.unpack forall b c a. (b -> c) -> (a -> b) -> a -> c
. Builder -> Text
TB.toLazyText
instance Stringable (Endo String) where
stFromString :: String -> Endo String
stFromString = forall a. (a -> a) -> Endo a
Endo forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a. [a] -> [a] -> [a]
(++)
stToString :: Endo String -> String
stToString = (forall a b. (a -> b) -> a -> b
$ []) forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a. Endo a -> a -> a
appEndo