Modulehxt-9.3.1.22Haskell2010

Text.XML.HXT.Arrow.XmlRegex

Regular Expression Matcher working on lists of XmlTrees

It's intended to import this module with an explicit import declaration for not spoiling the namespace with these somewhat special arrows

1 type
25 values

Packagehxt-9.3.1.22
Exports26
LanguageHaskell2010
LicenceMIT
SourceXmlRegex.hs

datadata XmlRegex

Instances1Show

Show XmlRegexDefined in hxt-9.3.1.22 · Text.XML.HXT.Arrow.XmlRegex

valuemkZero :: String -> XmlRegex

valuemkUnit :: XmlRegex

valuemkPrim :: (XmlTree -> Bool) -> XmlRegex

valuemkPrim' :: (XmlTree -> Bool) -> String -> XmlRegex

valuemkPrimA :: LA XmlTree XmlTree -> XmlRegex

valuemkDot :: XmlRegex

valuemkStar :: XmlRegex -> XmlRegex

valuemkAlt :: XmlRegex -> XmlRegex -> XmlRegex

valuemkAlts :: [XmlRegex] -> XmlRegex

valuemkSeq :: XmlRegex -> XmlRegex -> XmlRegex

valuemkSeqs :: [XmlRegex] -> XmlRegex

valuemkRep :: Int -> XmlRegex -> XmlRegex

valuemkRng :: Int -> Int -> XmlRegex -> XmlRegex

valuemkOpt :: XmlRegex -> XmlRegex

valuemkPerm :: XmlRegex -> XmlRegex -> XmlRegex

valuemkPerms :: [XmlRegex] -> XmlRegex

valuemkMerge :: XmlRegex -> XmlRegex -> XmlRegex

valuenullable :: XmlRegex -> Bool

valuedelta :: XmlRegex -> XmlTree -> XmlRegex

valuematchXmlRegex :: XmlRegex -> XmlTrees -> Maybe String

match a sequence of XML trees with a regular expression over trees

If the input matches, the result is Nothing, else Just an error message is returned

valuesplitXmlRegex :: XmlRegex -> XmlTrees -> Maybe (XmlTrees, XmlTrees)

split a sequence of XML trees into a pair of a a matching prefix and a rest

If there is no matching prefix, Nothing is returned

valuescanXmlRegex :: XmlRegex -> XmlTrees -> Maybe [XmlTrees]

scan a sequence of XML trees and split it into parts matching the given regex

If the parts cannot be split because of a missing match, or because of the empty sequence as match, Nothing is returned

valuematchRegexA :: XmlRegex -> LA XmlTree XmlTree -> LA XmlTree XmlTrees

check whether a sequence of XmlTrees match an Xml regular expression

The arrow for matchXmlRegex.

The expession is build up from simple arrows acting as predicate (mkPrimA) for an XmlTree and of the usual cobinators for sequence (mkSeq), repetition (mkStar, mkRep', mkRng) and choice (mkAlt, mkOpt)

valuesplitRegexA

split the sequence of trees computed by the filter a into

The arrow for splitXmlRegex.

a first part matching the regex and a rest, if a prefix of the input sequence does not match the regex, the arrow fails else the pair containing the result lists is returned

valuescanRegexA :: XmlRegex -> LA XmlTree XmlTree -> LA XmlTree XmlTrees

scan the input sequence with a regex and give the result as a list of lists of trees back the regex must at least match one input tree, so the empty sequence should not match the regex

The arrow for scanXmlRegex.