Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Synopsis
- hashTagSpec :: (Monad m, IsBlock il bl, IsInline il, HasHashTag il) => SyntaxSpec m il bl
- inlineTagsInPandoc :: Pandoc -> [Tag]
- getTagFromInline :: Inline -> Maybe Tag
- newtype Tag = Tag {}
- data TagPattern
- newtype TagNode = TagNode {}
- mkTagPattern :: Text -> TagPattern
- tagMatch :: TagPattern -> Tag -> Bool
- constructTag :: NonEmpty TagNode -> Tag
- deconstructTag :: HasCallStack => Tag -> NonEmpty TagNode
- tagTree :: (Eq a, Default a) => Map Tag a -> Forest (TagNode, a)
Documentation
hashTagSpec :: (Monad m, IsBlock il bl, IsInline il, HasHashTag il) => SyntaxSpec m il bl Source #
inlineTagsInPandoc :: Pandoc -> [Tag] Source #
A hierarchical tag
Tag nodes are separated by /
data TagPattern #
A glob-based pattern to match hierarchical tags
For example, the pattern
foo/**
matches both the following
foo/bar/baz foo/baz
Instances
An individual component of a hierarchical tag
The following hierarchical tag,
foo/bar/baz
has three tag nodes: foo
, bar
and baz
mkTagPattern :: Text -> TagPattern #
tagMatch :: TagPattern -> Tag -> Bool #
constructTag :: NonEmpty TagNode -> Tag #
deconstructTag :: HasCallStack => Tag -> NonEmpty TagNode #