Safe Haskell	None
Language	Haskell2010

Text.LaTeX.FunctionTable

Documentation

makeTable :: Pre => String -> M LaTeXLI () -> FunctionTable LaTeXLI Source #

data LaTeXLI Source #

Constructors

LaTeXLI SrcLoc String

Instances

Instances details

Render LaTeXLI Source #
Instance details Defined in Text.LaTeX.Internal.FunctionTable Methods render :: LaTeXLI -> Text # renderBuilder :: LaTeXLI -> Builder #
Show LaTeXLI Source #
Instance details Defined in Text.LaTeX.Internal.FunctionTable Methods showsPrec :: Int -> LaTeXLI -> ShowS # show :: LaTeXLI -> String # showList :: [LaTeXLI] -> ShowS #
Eq LaTeXLI Source #
Instance details Defined in Text.LaTeX.Internal.FunctionTable Methods (==) :: LaTeXLI -> LaTeXLI -> Bool # (/=) :: LaTeXLI -> LaTeXLI -> Bool #

type FunctionTable a = FunctionTable' a a Source #

data FunctionTable' a b Source #

Constructors

Table b (TableCells' a b)

Instances

Instances details

Bifoldable FunctionTable' Source #
Instance details Defined in Text.LaTeX.Internal.FunctionTable Methods bifold :: Monoid m => FunctionTable' m m -> m # bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> FunctionTable' a b -> m # bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> FunctionTable' a b -> c # bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> FunctionTable' a b -> c #
Bifunctor FunctionTable' Source #
Instance details Defined in Text.LaTeX.Internal.FunctionTable Methods bimap :: (a -> b) -> (c -> d) -> FunctionTable' a c -> FunctionTable' b d # first :: (a -> b) -> FunctionTable' a c -> FunctionTable' b c # second :: (b -> c) -> FunctionTable' a b -> FunctionTable' a c #
Bitraversable FunctionTable' Source #
Instance details Defined in Text.LaTeX.Internal.FunctionTable Methods bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> FunctionTable' a b -> f (FunctionTable' c d) #
Foldable (FunctionTable' a) Source #
Instance details Defined in Text.LaTeX.Internal.FunctionTable Methods fold :: Monoid m => FunctionTable' a m -> m # foldMap :: Monoid m => (a0 -> m) -> FunctionTable' a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> FunctionTable' a a0 -> m # foldr :: (a0 -> b -> b) -> b -> FunctionTable' a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> FunctionTable' a a0 -> b # foldl :: (b -> a0 -> b) -> b -> FunctionTable' a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> FunctionTable' a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> FunctionTable' a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> FunctionTable' a a0 -> a0 # toList :: FunctionTable' a a0 -> [a0] # null :: FunctionTable' a a0 -> Bool # length :: FunctionTable' a a0 -> Int # elem :: Eq a0 => a0 -> FunctionTable' a a0 -> Bool # maximum :: Ord a0 => FunctionTable' a a0 -> a0 # minimum :: Ord a0 => FunctionTable' a a0 -> a0 # sum :: Num a0 => FunctionTable' a a0 -> a0 # product :: Num a0 => FunctionTable' a a0 -> a0 #
Traversable (FunctionTable' a) Source #
Instance details Defined in Text.LaTeX.Internal.FunctionTable Methods traverse :: Applicative f => (a0 -> f b) -> FunctionTable' a a0 -> f (FunctionTable' a b) # sequenceA :: Applicative f => FunctionTable' a (f a0) -> f (FunctionTable' a a0) # mapM :: Monad m => (a0 -> m b) -> FunctionTable' a a0 -> m (FunctionTable' a b) # sequence :: Monad m => FunctionTable' a (m a0) -> m (FunctionTable' a a0) #
Functor (FunctionTable' a) Source #
Instance details Defined in Text.LaTeX.Internal.FunctionTable Methods fmap :: (a0 -> b) -> FunctionTable' a a0 -> FunctionTable' a b # (<$) :: a0 -> FunctionTable' a b -> FunctionTable' a a0 #
(Render a, Render b) => Render (FunctionTable' a b) Source #
Instance details Defined in Text.LaTeX.Internal.FunctionTable Methods render :: FunctionTable' a b -> Text # renderBuilder :: FunctionTable' a b -> Builder #
(Show b, Show a) => Show (FunctionTable' a b) Source #
Instance details Defined in Text.LaTeX.Internal.FunctionTable Methods showsPrec :: Int -> FunctionTable' a b -> ShowS # show :: FunctionTable' a b -> String # showList :: [FunctionTable' a b] -> ShowS #
(Eq b, Eq a) => Eq (FunctionTable' a b) Source #
Instance details Defined in Text.LaTeX.Internal.FunctionTable Methods (==) :: FunctionTable' a b -> FunctionTable' a b -> Bool # (/=) :: FunctionTable' a b -> FunctionTable' a b -> Bool #

type TableCells a = TableCells' a a Source #

data TableCells' a b Source #

Constructors

Cell b
Condition Cols (NonEmpty (a, TableCells' a b))

Instances

Instances details

Bifoldable TableCells' Source #
Instance details Defined in Text.LaTeX.Internal.FunctionTable Methods bifold :: Monoid m => TableCells' m m -> m # bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> TableCells' a b -> m # bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> TableCells' a b -> c # bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> TableCells' a b -> c #
Bifunctor TableCells' Source #
Instance details Defined in Text.LaTeX.Internal.FunctionTable Methods bimap :: (a -> b) -> (c -> d) -> TableCells' a c -> TableCells' b d # first :: (a -> b) -> TableCells' a c -> TableCells' b c # second :: (b -> c) -> TableCells' a b -> TableCells' a c #
Bitraversable TableCells' Source #
Instance details Defined in Text.LaTeX.Internal.FunctionTable Methods bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> TableCells' a b -> f (TableCells' c d) #
Foldable (TableCells' a) Source #
Instance details Defined in Text.LaTeX.Internal.FunctionTable Methods fold :: Monoid m => TableCells' a m -> m # foldMap :: Monoid m => (a0 -> m) -> TableCells' a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> TableCells' a a0 -> m # foldr :: (a0 -> b -> b) -> b -> TableCells' a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> TableCells' a a0 -> b # foldl :: (b -> a0 -> b) -> b -> TableCells' a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> TableCells' a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> TableCells' a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> TableCells' a a0 -> a0 # toList :: TableCells' a a0 -> [a0] # null :: TableCells' a a0 -> Bool # length :: TableCells' a a0 -> Int # elem :: Eq a0 => a0 -> TableCells' a a0 -> Bool # maximum :: Ord a0 => TableCells' a a0 -> a0 # minimum :: Ord a0 => TableCells' a a0 -> a0 # sum :: Num a0 => TableCells' a a0 -> a0 # product :: Num a0 => TableCells' a a0 -> a0 #
Traversable (TableCells' a) Source #
Instance details Defined in Text.LaTeX.Internal.FunctionTable Methods traverse :: Applicative f => (a0 -> f b) -> TableCells' a a0 -> f (TableCells' a b) # sequenceA :: Applicative f => TableCells' a (f a0) -> f (TableCells' a a0) # mapM :: Monad m => (a0 -> m b) -> TableCells' a a0 -> m (TableCells' a b) # sequence :: Monad m => TableCells' a (m a0) -> m (TableCells' a a0) #
Functor (TableCells' a) Source #
Instance details Defined in Text.LaTeX.Internal.FunctionTable Methods fmap :: (a0 -> b) -> TableCells' a a0 -> TableCells' a b # (<$) :: a0 -> TableCells' a b -> TableCells' a a0 #
(Show b, Show a) => Show (TableCells' a b) Source #
Instance details Defined in Text.LaTeX.Internal.FunctionTable Methods showsPrec :: Int -> TableCells' a b -> ShowS # show :: TableCells' a b -> String # showList :: [TableCells' a b] -> ShowS #
(Eq b, Eq a) => Eq (TableCells' a b) Source #
Instance details Defined in Text.LaTeX.Internal.FunctionTable Methods (==) :: TableCells' a b -> TableCells' a b -> Bool # (/=) :: TableCells' a b -> TableCells' a b -> Bool #

branch :: Pre => String -> M LaTeXLI () -> M LaTeXLI () Source #

cell :: Pre => String -> String -> M LaTeXLI () Source #

subtables :: forall a b f. Applicative f => ((a, TableCells' a b) -> f (a, TableCells' a b)) -> TableCells' a b -> f (TableCells' a b) Source #

isubtables :: forall a b p f. (Indexable Int p, Applicative f) => p (a, TableCells' a b) (f (a, TableCells' a b)) -> TableCells' a b -> f (TableCells' a b) Source #