|
Text.XML.HXT.Arrow.XmlRegex | Portability | portable | Stability | experimental | Maintainer | Uwe Schmidt (uwe@fh-wedel.de) |
|
|
|
Description |
Regular Expression Matcher working on lists of XmlTrees
It's intendet to import this module with an explicit
import declaration for not spoiling the namespace
with these somewhat special arrows
|
|
Synopsis |
|
|
|
Documentation |
|
|
Instances | |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
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
|
|
|
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
|
|
|
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)
|
|
|
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
|
|
|
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.
|
|
Produced by Haddock version 2.3.0 |