{-# LANGUAGE TemplateHaskell #-}
module Text.Pandoc.CrossRef.References.Types where
import qualified Data.Map as M
import Text.Pandoc.Definition
import Control.Monad.State
import Data.Default
import Data.Accessor.Template
import Data.Text (Text)
type Index = [(Int, Maybe Text)]
data RefRec = RefRec { RefRec -> Index
refIndex :: Index
, RefRec -> [Inline]
refTitle :: [Inline]
, RefRec -> Maybe Index
refSubfigure :: Maybe Index
} deriving (Int -> RefRec -> ShowS
[RefRec] -> ShowS
RefRec -> String
(Int -> RefRec -> ShowS)
-> (RefRec -> String) -> ([RefRec] -> ShowS) -> Show RefRec
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [RefRec] -> ShowS
$cshowList :: [RefRec] -> ShowS
show :: RefRec -> String
$cshow :: RefRec -> String
showsPrec :: Int -> RefRec -> ShowS
$cshowsPrec :: Int -> RefRec -> ShowS
Show, RefRec -> RefRec -> Bool
(RefRec -> RefRec -> Bool)
-> (RefRec -> RefRec -> Bool) -> Eq RefRec
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: RefRec -> RefRec -> Bool
$c/= :: RefRec -> RefRec -> Bool
== :: RefRec -> RefRec -> Bool
$c== :: RefRec -> RefRec -> Bool
Eq)
type RefMap = M.Map Text RefRec
data References = References { References -> RefMap
imgRefs_ :: RefMap
, References -> RefMap
eqnRefs_ :: RefMap
, References -> RefMap
tblRefs_ :: RefMap
, References -> RefMap
lstRefs_ :: RefMap
, References -> RefMap
secRefs_ :: RefMap
, References -> Index
curChap_ :: Index
} deriving (Int -> References -> ShowS
[References] -> ShowS
References -> String
(Int -> References -> ShowS)
-> (References -> String)
-> ([References] -> ShowS)
-> Show References
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [References] -> ShowS
$cshowList :: [References] -> ShowS
show :: References -> String
$cshow :: References -> String
showsPrec :: Int -> References -> ShowS
$cshowsPrec :: Int -> References -> ShowS
Show, References -> References -> Bool
(References -> References -> Bool)
-> (References -> References -> Bool) -> Eq References
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: References -> References -> Bool
$c/= :: References -> References -> Bool
== :: References -> References -> Bool
$c== :: References -> References -> Bool
Eq)
type WS a = State References a
instance Default References where
def :: References
def = RefMap
-> RefMap -> RefMap -> RefMap -> RefMap -> Index -> References
References RefMap
forall k a. Map k a
n RefMap
forall k a. Map k a
n RefMap
forall k a. Map k a
n RefMap
forall k a. Map k a
n RefMap
forall k a. Map k a
n []
where n :: Map k a
n = Map k a
forall k a. Map k a
M.empty
deriveAccessors ''References