diff --git a/README b/README --- a/README +++ b/README @@ -1,10 +1,9 @@ -$Id: README,v 1.25 2006/11/15 18:29:08 hxml Exp $ - The Haskell XML Toolbox is a collection of tools for processing XML with Haskell. The Haskell XML Toolbox is available from: http://www.fh-wedel.de/~si/HXmlToolbox/ +or from hackage.haskell.org Detailed information about the features, changes, requirements, installation and documentation is available from that web page. @@ -14,6 +13,8 @@ It requires the "hxt" package to be installed. For new projects we strongly recomend the library based on arrows (package "hxt"). + +Installation can be done with cabal in the usual way. Good luck, diff --git a/Version.mk b/Version.mk --- a/Version.mk +++ b/Version.mk @@ -2,6 +2,6 @@ # Version numbering for HXT filter package SOFTWARE = hxt-filter -VERSION = 8.2.0 -LASTVERSION = 8.1.0 +VERSION = 8.3.0 +LASTVERSION = 8.2.0 DIST_NAME = $(SOFTWARE)-$(VERSION) diff --git a/doc/hxt-filter/Control-Monad-MonadStateIO.html b/doc/hxt-filter/Control-Monad-MonadStateIO.html --- a/doc/hxt-filter/Control-Monad-MonadStateIO.html +++ b/doc/hxt-filter/Control-Monad-MonadStateIO.html @@ -19,7 +19,7 @@ > hxt-filter-8.2.0: A collection of tools for processing XML with Haskell (Filter variant).hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant).Source code + +Data.Tree.NTree.Filter
hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant).Source codeContentsIndex
Data.Tree.NTree.Filter
Portabilityportable
Stabilitystable
MaintainerUwe Schmidt (uwe\@fh-wedel.de)
Contents
Filter +
Monadic Filter +
Description

Filter for n-ary tree structure with filter combinators + copied and modified from HaXml (http://www.cs.york.ac.uk/fp/HaXml/) +

Similar but more flexible functions for tree processing are defined in the + arrow classes Control.Arrow.ArrowList, Control.Arrow.ArrowIf, Control.Arrow.ArrowTree and Control.Arrow.ArrowState. + For new applications, especially for XML processing, it's recommended to use the arrow interface + Text.XML.HXT.Arrow instead of this filter approach as part of the api Text.XML.HXT.Parser +

Synopsis
type TFilter node = NTree node -> NTrees node
type TSFilter node = NTrees node -> NTrees node
satisfies :: (a -> [b]) -> a -> Bool
none :: a -> [b]
this :: a -> [a]
isOf :: (a -> Bool) -> a -> [a]
isOfNode :: (node -> Bool) -> TFilter node
mkNTree :: NTree node -> TFilter node
replaceNode :: node -> TFilter node
replaceChildren :: NTrees node -> TFilter node
modifyNode :: (node -> Maybe node) -> TFilter node
modifyNode0 :: (node -> node) -> TFilter node
modifyChildren :: TSFilter node -> TFilter node
substChildren :: TFilter node -> TFilter node
processChildren :: TFilter node -> TFilter node
o :: (a -> [b]) -> (c -> [a]) -> c -> [b]
(.>) :: (a -> [b]) -> (b -> [c]) -> a -> [c]
seqF :: [a -> [a]] -> a -> [a]
(..>) :: (a -> [b]) -> (a -> b -> [d]) -> a -> [d]
(+++) :: (a -> [b]) -> (a -> [b]) -> a -> [b]
cat :: [a -> [b]] -> a -> [b]
orElse :: (a -> [b]) -> (a -> [b]) -> a -> [b]
iff :: (a -> [c]) -> (a -> [b]) -> (a -> [b]) -> a -> [b]
choice :: [IfThen (a -> [c]) (a -> [b])] -> a -> [b]
data IfThen a b = a :-> b
when :: (a -> [a]) -> (a -> [a]) -> a -> [a]
whenNot :: (a -> [a]) -> (a -> [a]) -> a -> [a]
guards :: (a -> [b]) -> (a -> [b]) -> a -> [b]
neg :: (a -> [c]) -> a -> [a]
containing :: (a -> [b]) -> (b -> [c]) -> a -> [b]
notContaining :: (a -> [b]) -> (b -> [c]) -> a -> [b]
(/>) :: TFilter node -> TFilter node -> TFilter node
(</) :: TFilter node -> TFilter node -> TFilter node
deep :: TFilter node -> TFilter node
deepest :: TFilter node -> TFilter node
multi :: TFilter node -> TFilter node
processBottomUp :: TFilter node -> TFilter node
processBottomUpIfNot :: TFilter node -> TFilter node -> TFilter node
processTopDown :: TFilter node -> TFilter node
processTopDownUntil :: TFilter node -> TFilter node
insertChildrenAt :: Int -> TFilter node -> TFilter node
insertChildrenAfter :: TFilter node -> TFilter node -> TFilter node
thisM :: Monad m => a -> m [a]
noneM :: Monad m => a -> m [b]
(.>>) :: Monad m => (a -> m [b]) -> (b -> m [c]) -> a -> m [c]
seqM :: Monad m => [a -> m [a]] -> a -> m [a]
(+++>>) :: Monad m => (a -> m [b]) -> (a -> m [b]) -> a -> m [b]
catM :: Monad m => [a -> m [b]] -> a -> m [b]
ifM :: Monad m => (a -> [b]) -> (a -> m [c]) -> (a -> m [c]) -> a -> m [c]
choiceM :: Monad m => [IfThen (a -> [c]) (a -> m [b])] -> a -> m [b]
whenM :: Monad m => (a -> m [a]) -> (a -> [b]) -> a -> m [a]
whenNotM :: Monad m => (a -> m [a]) -> (a -> [b]) -> a -> m [a]
guardsM :: Monad m => (a -> [b]) -> (a -> m [c]) -> a -> m [c]
containingM :: Monad m => (a -> m [b]) -> (b -> [c]) -> a -> m [b]
processChildrenM :: Monad m => (NTree node -> m [NTree node]) -> NTree node -> m [NTree node]
processTopDownM :: Monad m => (NTree node -> m [NTree node]) -> NTree node -> m [NTree node]
processBottomUpM :: Monad m => (NTree node -> m [NTree node]) -> NTree node -> m [NTree node]
liftMf :: Monad m => (a -> [b]) -> a -> m [b]
($$) :: (a -> [b]) -> [a] -> [b]
($$<) :: Monad m => (a -> m [b]) -> [a] -> m [b]
performAction :: Monad m => (a -> m b) -> a -> m [a]
Documentation
type TFilter node = NTree node -> NTrees nodeSource

tree filter type: a function mapping a tree onto a list of trees +

filter can be used in various ways, as predicates, selectors, transformers, ... +

type TSFilter node = NTrees node -> NTrees nodeSource
a filter for sequences +
satisfies :: (a -> [b]) -> a -> BoolSource

satisfies converts a result of a predicate filter into a boolean +

is a shortcut for not . null +

typical use in guards or ifs: if (satisfies f) t then ... else ... +

  • 1.parameter f : the predicate filter +
  • 2.parameter t : the tree to be tested +
  • returns : b = not (null (f t)) +
Filter +
none :: a -> [b]Source
the null filter, returns the empty list +
this :: a -> [a]Source
the unit filter, returns the single element list containing the argument +
isOf :: (a -> Bool) -> a -> [a]Source

conversion from predicate function to filter +

  • 1.parameter p : the predicate for testing the tree +
  • returns : this or none depending on the predicate +
isOfNode :: (node -> Bool) -> TFilter nodeSource

select filter, selects trees with node values with a specific property +

  • 1.parameter p : the predicate for testing the node value +
  • returns : [] or [t] depending on p t +

a special case of isOf filter +

mkNTree :: NTree node -> TFilter nodeSource

filter for substituting an arbitray tree by a constant +

  • 1.parameter t : the result tree, the input tree is ignored +
  • returns : the filter +
replaceNode :: node -> TFilter nodeSource

filter for replacing the node +

  • 1.parameter n : the new node +
  • returns : the editing filter +
replaceChildren :: NTrees node -> TFilter nodeSource

filter for replacing the children +

  • 1.parameter cs : cs the list of children +
  • returns : the filter +
modifyNode :: (node -> Maybe node) -> TFilter nodeSource
modifyNode0 :: (node -> node) -> TFilter nodeSource

filter for editing the node +

  • 1.parameter nf : the XNode editing funtion +
  • returns : the filter +
modifyChildren :: TSFilter node -> TFilter nodeSource

filter for editing the children +

all children are processed with a filter mapping lists to lists, + this enables not only elementwise editing by lifting a normal + filter to a list filter with (f $$) (see '($$)') but also manipulation + of the order of the elements, e.g. reverse is an appropriate childen + editing function. +

  • 1.parameter csf : the children editing function +
  • returns : the filter +

see also : processChildren +

substChildren :: TFilter node -> TFilter nodeSource
filter for substituting the children of a tree by + a new list of childen computed by applying a filter to the input tree. + modifyChildren can be expressed by substChildren: + modifyChildren f t is equal to substChildren (f . getChildren) +
processChildren :: TFilter node -> TFilter nodeSource

Filter for editing the children of a tree element wise +

  • 1.parameter cf : the filter applied to the children +
  • returns : the editing filter +

see also : modifyChildren +

o :: (a -> [b]) -> (c -> [a]) -> c -> [b]Source

sequential composition of filters, usually written in infix notation f2 o f1. +

for predicate filter the logical AND +

  • 1.parameter f2 : the 2. filter +
  • 2.parameter f1 : the 1. filter +
  • returns : the fiter applying first f1 to n and then f2 to the result (like function composition) +
(.>) :: (a -> [b]) -> (b -> [c]) -> a -> [c]Source

pronounced "followed by", defined as: f .> g = g `o` f. +

allows filter composition in a more readable way from left to right +

  • 1.parameter f1 : the 1. filter +
  • 2.parameter f2 : the 2. filter +
  • returns : the composition of f1 and f2 +

see also : o, '(..>)' +

seqF :: [a -> [a]] -> a -> [a]Source

apply a list of filters sequentially with '(.>)', for predicate filters the generalized AND +

see also : '(.>)' +

(..>) :: (a -> [b]) -> (a -> b -> [d]) -> a -> [d]Source

special sequential composition. +

filter f is applied to an argument t. + then filter g is applied to all elements of the result list, + but the argument t is also passed as extra parameter to g. +

This allows for step by step transformations of a tree + with access to the original tree in every + transformation step. +

see also : '(.>)', o +

(+++) :: (a -> [b]) -> (a -> [b]) -> a -> [b]Source

binary parallel composition, the logical OR for predicate filter +

  • 1.parameter f1 : the 1. filter +
  • 2.parameter f2 : the 2. filter +
  • returns : the filter for applying f1 and f2 both to an argument tree and concatenating the results +
cat :: [a -> [b]] -> a -> [b]Source

apply a list of filters, a "union" for lists, for predicate filters the generalized OR +

  • 1.parameter fs : the list of filters +
  • returns : the composing filter +
orElse :: (a -> [b]) -> (a -> [b]) -> a -> [b]Source

directional choice, usually written in infix notation as f orElse g +

  • 1.parameter f : the 1. filter +
  • 2.parameter g : the 2. filter +
  • 3.parameter t : the tree +
  • returns : the filter, that applies f to t, if the result is not the empty list, the result is found, else g t is the result +
iff :: (a -> [c]) -> (a -> [b]) -> (a -> [b]) -> a -> [b]Source

if then else lifted to filters +

  • 1.parameter p : the predicate filter +
  • 2.parameter t : the "then" filter +
  • 3.parameter e : the "else" filter +
  • returns : the resulting conditional filter +
choice :: [IfThen (a -> [c]) (a -> [b])] -> a -> [b]Source

multiway branch. The list of cases f :-> g is processed sequentially, + in the first case for that f holds g is applied, if no case matches, none is + applied. + This filter can be used like a case expression: choice [ p1 :-> f1, p2 :-> f2, ... , this :-> defaultFilter] +

see also : iff, choiceM +

data IfThen a b Source
auxiliary datatype for cases within choice filter +
Constructors
a :-> b
when :: (a -> [a]) -> (a -> [a]) -> a -> [a]Source

when the predicate p holds, f is applied, else the identity filter this +

  • 1.parameter f : the conditinally applied filter +
  • 2.parameter p : the predicate +
  • returns : the conditional filter +

see also : iff, whenNot, guards, whenM +

whenNot :: (a -> [a]) -> (a -> [a]) -> a -> [a]Source

the complementary filter of when +

shortcut for f when neg g +

see also : iff, when, whenNotM, neg +

guards :: (a -> [b]) -> (a -> [b]) -> a -> [b]Source

when the predicate p holds, f is applied, else the null filter none +

  • 1.parameter p : the predicate filter +
  • 2.parameter f : the conditionally applied filter +
  • returns : the conditional filter +

see also : iff, when, guardsM +

neg :: (a -> [c]) -> a -> [a]Source

negation lifted to filters +

  • 1.parameter f : the predicate filter +
  • returns : the filter, that succeeds, when f failed +
containing :: (a -> [b]) -> (b -> [c]) -> a -> [b]Source

pruning: keep only those results from f for which g holds, usually written in infix notation as f containing g +

  • 1.parameter f : the processing filter +
  • 2.parameter g : the predicate filter +
  • 3.parameter t : the tree +
  • returns : all trees r from f t, for which g r holds (is not the empty list) +

see also : notContaining +

notContaining :: (a -> [b]) -> (b -> [c]) -> a -> [b]Source

pruning: keep only those results from f for which g does not hold +

see also : containing +

(/>) :: TFilter node -> TFilter node -> TFilter nodeSource
pronounced "slash", meaning g inside f +
(</) :: TFilter node -> TFilter node -> TFilter nodeSource
pronounced "outside" meaning f containing g +
deep :: TFilter node -> TFilter nodeSource

top down search. +

search terminates, when filter f succeeds + can e.g. be used for finding all outermost tag node of a specific kind +

deepest :: TFilter node -> TFilter nodeSource

bottom up search. +

first the children are processed, + if this does not succeed, the node itself is processed + can e.g. be used for finding all innermost tag nodes of a specific kind +

multi :: TFilter node -> TFilter nodeSource

process all nodes of the whole tree. +

can e.g. be used for finding all nodes of a specific kind +

processBottomUp :: TFilter node -> TFilter nodeSource

bottom up transformation +

  • 1.parameter f : the simple transforming filter +
  • returns : the filter that applies f to all subtrees and the tree itself in a deepth first left to right manner +

see also : processTopDown, processBottomUpIfNot +

processBottomUpIfNot :: TFilter node -> TFilter node -> TFilter nodeSource

guarded bottom up transformation, stops at subtrees for which a predicate p holds +

  • 1.parameter f : the transforming filter +
  • 2.parameter p : the predicate filter for the guard +
  • returns : the filter for processing all (sub-)trees +

see also : processBottomUp +

processTopDown :: TFilter node -> TFilter nodeSource

top down transformation +

  • 1.parameter f : the simple transforming filter +
  • returns : the filter that applies f first to the tree and then recursively to all subtrees of the result +

see also : processBottomUp +

processTopDownUntil :: TFilter node -> TFilter nodeSource

top down transformation until a node to be transformed is found +

  • 1.parameter f : the simple transforming filter +
  • returns : the filter that applies f first to the tree and, if the filter does not succeed, + recursively to all children of the input tree. +

Example: +

processTopDownUntil none

is the identity filter (maybe a bit more inefficient). +

Example: +

processTopDownUntil (add1Attr "border" "2" `containing` isTag "table")

is a filter for adding an attribute border="2" in all top level table tags. + The content of table tags will remain unchanged. +

see also : processTopDown, processBottomUp +

insertChildrenAt :: Int -> TFilter node -> TFilter nodeSource

insertion of trees into the list of children at a given position +

useful for inserting something into the list of children at a given position + the list of children is split with the splitAt function + the nodes are inserted between these two sublists. +

examples: insertChildrenAt 0 ins t inserts all elements computed with ins t in front + of the childen of t, insertChildrenAt 1 ins t behind the first child +

see also: insertChildrenAfter +

insertChildrenAfter :: TFilter node -> TFilter node -> TFilter nodeSource

insertion of trees into the list of children after specific elements +

useful for inserting something into the list of children of a node + the list of children is split with the span function and the filter p as predicate + the nodes are inserted between these two sublists +

examples: insertChildrenAfter none ins t inserts all elements computed with ins t in front + of the childen of t, insertChildrenAfter this ins t appends the elements to the children +

see also: insertChildrenAt +

Monadic Filter +
thisM :: Monad m => a -> m [a]Source

the monadic version of the identity filter this. +

see also : this +

noneM :: Monad m => a -> m [b]Source

the monadic version of the null filter none. +

see also : none +

(.>>) :: Monad m => (a -> m [b]) -> (b -> m [c]) -> a -> m [c]Source

sequential composition of monadic filters, monadic version of ".>". +

  • 1.parameter f1 : the 1. monadic filter +
  • 2.parameter f2 : the 2. monadic filter +
  • returns : the monadic fiter applying first f1 to n and then f2 to the result (like function composition) +

see also : '(.>)' +

seqM :: Monad m => [a -> m [a]] -> a -> m [a]Source
generalized sequential composition of monadic filters +
(+++>>) :: Monad m => (a -> m [b]) -> (a -> m [b]) -> a -> m [b]Source

binary parallel composition, the logical OR for predicate filter +

  • 1.parameter f1 : the 1. filter +
  • 2.parameter f2 : the 2. filter +
  • returns : the filter for applying f1 and f2 both to an argument tree and concatenating the results + see also: cat, +++, catM +
catM :: Monad m => [a -> m [b]] -> a -> m [b]Source

apply a list of monadic filters +

  • 1.parameter fs : the list of filters +
  • returns : the composing filter + see also: cat, +++, +++>> +
ifM :: Monad m => (a -> [b]) -> (a -> m [c]) -> (a -> m [c]) -> a -> m [c]Source

monadic if-then-else. +

  • 1.parameter p : the predicate +
  • 2.parameter thenP : the then part: the monadic filter, that is applied if p holds for the input tree +
  • 3.parameter elseP : the else part +
  • returns : the monadic filter for the conditional +
choiceM :: Monad m => [IfThen (a -> [c]) (a -> m [b])] -> a -> m [b]Source

monadic version of multiway branch. The list of cases f :-> g is processed sequentially, + in the first case for that f holds g is applied, if no case matches, noneM is + applied. + This filter can be used like a case expression: choiceM [ p1 :-> f1, p2 :-> f2, ... , thisM :-> defaultFilter] +

see also : choice, ifM +

whenM :: Monad m => (a -> m [a]) -> (a -> [b]) -> a -> m [a]Source

when the predicate p holds, the monadic filter f is applied, else the identity filter. +

  • 1.parameter f : the conditinally applied monadic filter +
  • 2.parameter p : the simple predicate +
  • returns : the conditional filter +

see also : ifM, when, guardsM, whenNotM +

whenNotM :: Monad m => (a -> m [a]) -> (a -> [b]) -> a -> m [a]Source

the complementary filter of whenM. +

see also : ifM, whenM, whenNot +

guardsM :: Monad m => (a -> [b]) -> (a -> m [c]) -> a -> m [c]Source

when the predicate p holds, the monadic filter f is applied, else the null filter. +

  • 1.parameter p : the simple predicate filter +
  • 2.parameter f : the conditionally applied monadic filter +
  • returns : the conditional filter +

see also : ifM, guards, whenM +

containingM :: Monad m => (a -> m [b]) -> (b -> [c]) -> a -> m [b]Source

pruning: monadic version of containing, usually written in infix notation as f containingM g +

  • 1.parameter f : the monadic processing filter +
  • 2.parameter g : the predicate filter +
  • 3.parameter t : the tree +
  • returns : all trees r from f t, for which g r holds (is not the empty list) +

see also : notContaining +

processChildrenM :: Monad m => (NTree node -> m [NTree node]) -> NTree node -> m [NTree node]Source

Filter for editing the children of a tree with a monadic filter +

  • 1.parameter cf : the monadic filter applied to the children +
  • returns : the monadic editing filter +

see also : processChildren +

processTopDownM :: Monad m => (NTree node -> m [NTree node]) -> NTree node -> m [NTree node]Source
monadic variant of processTopDown +
processBottomUpM :: Monad m => (NTree node -> m [NTree node]) -> NTree node -> m [NTree node]Source
monadic variant of processBottomUp +
liftMf :: Monad m => (a -> [b]) -> a -> m [b]Source

lift a filter to a monadic filter +

  • 1.parameter f : the simple filter +
  • returns : the lifted monadic version +
($$) :: (a -> [b]) -> [a] -> [b]Source

infix operator for applying a filter to a list of trees +

  • 1.parameter f : the filter +
  • 2.parameter ts : the list of trees +
  • returns : the concatenated list of results +
($$<) :: Monad m => (a -> m [b]) -> [a] -> m [b]Source

infix operator for applying a monadic filter to a list of trees, + typically used in do-notation for processing of intermediate results. +

  • 1.parameter f : the monadic filter +
  • 2.parameter ts : the list of trees +
  • returns : the concatenated list of results +

see also : '($$)' +

performAction :: Monad m => (a -> m b) -> a -> m [a]Source

run an arbitray command on a tree t and return the tree, + used for inserting arbitray commands in a filter pipeline +

  • 1.parameter cmd : the command +
  • 2.parameter t : the argument tree +
  • returns : the unchanged tree as a single element list +
Produced by Haddock version 2.3.0
diff --git a/doc/hxt-filter/System-PipeOpen.html b/doc/hxt-filter/System-PipeOpen.html --- a/doc/hxt-filter/System-PipeOpen.html +++ b/doc/hxt-filter/System-PipeOpen.html @@ -19,7 +19,7 @@ > hxt-filter-8.2.0: A collection of tools for processing XML with Haskell (Filter variant).hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant).Source code hxt-filter-8.2.0: A collection of tools for processing XML with Haskell (Filter variant).hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant).Source codecanonicalizeTree :: XmlFilter -> XmlFilter :: XmlFilter -> XmlFiltercanonicalizeAllNodes :: XmlFilter :: XmlFiltercanonicalizeForXPath :: XmlFilter :: XmlFiltercollapseXText :: XmlFilter :: XmlFiltercollapseAllXText :: XmlFilter :: XmlFilterindentDoc :: XmlFilter :: XmlFilterremoveWhiteSpace :: XmlFilter :: XmlFilterremoveAllWhiteSpace :: XmlFilter :: XmlFilterremoveDocWhiteSpace :: XmlFilter :: XmlFilterremoveComment :: XmlFilter :: XmlFilterremoveAllComment :: XmlFilter :: XmlFiltertransfCdata :: XmlFilter :: XmlFiltertransfAllCdata :: XmlFilter :: XmlFiltertransfCdataEscaped :: XmlFilter :: XmlFiltertransfAllCdataEscaped :: XmlFilter :: XmlFiltertransfCharRef :: XmlFilter :: XmlFiltertransfAllCharRef :: XmlFilter :: XmlFilterescapeXmlDoc :: XmlFilter :: XmlFilterescapeXmlText :: XmlFilter :: XmlFilterescapeXmlAttrValue :: XmlFilter :: XmlFilterunparseXmlDoc :: XmlFilter :: XmlFilternumberLinesInXmlDoc :: XmlFilter :: XmlFiltertreeRepOfXmlDoc :: XmlFilter :: XmlFilterhaskellRepOfXmlDoc :: XmlFilter :: XmlFilteraddHeadlineToXmlDoc :: XmlFilter :: XmlFilteraddXmlPiToDoc :: XmlFilter :: XmlFiltercanonicalizeTree :: XmlFilter -> XmlFilter :: XmlFilter -> XmlFilterSourcecanonicalizeAllNodes :: XmlFilter :: XmlFilterSourcecanonicalizeForXPath :: XmlFilter :: XmlFilterSourcecollapseXText :: XmlFilter :: XmlFilterSourcecollapseAllXText :: XmlFilter :: XmlFilterSourceindentDoc :: XmlFilter :: XmlFilterSourceremoveWhiteSpace :: XmlFilter :: XmlFilterSourceremoveAllWhiteSpace :: XmlFilter :: XmlFilterSourceremoveDocWhiteSpace :: XmlFilter :: XmlFilterSourceremoveComment :: XmlFilter :: XmlFilterSourceremoveAllComment :: XmlFilter :: XmlFilterSourcetransfCdata :: XmlFilter :: XmlFilterSourcetransfAllCdata :: XmlFilter :: XmlFilterSourcetransfCdataEscaped :: XmlFilter :: XmlFilterSourcetransfAllCdataEscaped :: XmlFilter :: XmlFilterSourcetransfCharRef :: XmlFilter :: XmlFilterSourcetransfAllCharRef :: XmlFilter :: XmlFilterSourceescapeXmlDoc :: XmlFilter :: XmlFilterSourceescapeXmlText :: XmlFilter :: XmlFilterSourceescapeXmlAttrValue :: XmlFilter :: XmlFilterSourceunparseXmlDoc :: XmlFilter :: XmlFilterSourcenumberLinesInXmlDoc :: XmlFilter :: XmlFilterSourcetreeRepOfXmlDoc :: XmlFilter :: XmlFilterSourcehaskellRepOfXmlDoc :: XmlFilter :: XmlFilterSourceaddHeadlineToXmlDoc :: XmlFilter :: XmlFilterSourceaddXmlPiToDoc :: XmlFilter :: XmlFilterSource hxt-filter-8.2.0: A collection of tools for processing XML with Haskell (Filter variant).hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant).Source code hxt-filter-8.2.0: A collection of tools for processing XML with Haskell (Filter variant).hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant).Source codetype NamespaceTable = NsEnv = NsEnvpropagateNamespaces :: XmlFilter :: XmlFilterpropagateNamespaceEnv :: NamespaceTable -> XmlFilter -> XmlFiltervalidateNamespaces :: XmlFilter :: XmlFiltervalidate1Namespaces :: XmlFilter :: XmlFilterisNamespaceDecl :: XmlFilter :: XmlFilterNamespaceTable = NsEnv = NsEnvSourceType for the namespace association list, used when propagating namespaces by modifying the QNameQName values in a tree propagateNamespaces :: XmlFilter :: XmlFilterSourcepropagateNamespaceEnv :: NamespaceTable -> XmlFilter -> XmlFilterSourcevalidateNamespaces :: XmlFilter :: XmlFilterSource to all nodes. Predicates isWellformedQNameisWellformedQName, isWellformedQualifiedNameisWellformedQualifiedName, isDeclaredNamespaceisDeclaredNamespace and isWellformedNSDeclisWellformedNSDecl are applied to the appropriate tags and attributes. validate1Namespaces :: XmlFilter :: XmlFilterSourceisNamespaceDecl :: XmlFilter :: XmlFilterSource hxt-filter-8.2.0: A collection of tools for processing XML with Haskell (Filter variant).hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant).Source codetype SysStateAttrs = AssocList = AssocList String XmlTrees XmlTreestype XmlStateFilter state = XmlTree -> state = XmlTree -> XState state XmlTrees state XmlTreessetSysParamTree :: String -> XmlTrees -> -> XmlTrees -> XState state ()String -> XState state XmlTrees state XmlTreesliftF :: XmlFilter -> :: XmlFilter -> XmlStateFilter stateInt -> String -> XmlFilter -> XmlFilterstatusOk :: XmlFilter :: XmlFilterSysStateAttrs = AssocList = AssocList String XmlTrees XmlTreesSourceXmlStateFilter state = XmlTree -> state = XmlTree -> XState state XmlTrees state XmlTreesSourcesetSysParamTree :: String -> XmlTrees -> -> XmlTrees -> XState state ()String -> XState state XmlTrees state XmlTreesSourceliftF :: XmlFilter -> :: XmlFilter -> XmlStateFilter stateerror level translation c_warnc_warn (1) : warning, c_errc_err (2): error (e.g. parse error, validation error, ...), c_fatalc_fatal (3) : fatal error (document access error, internal error, ...) a_status in a document root. if it contains a value greater or equal to c_errc_err, an error with error message stored in attribute a_module is issued and the filter acts as the noneMnoneM filter else its the thisMthisM filter Int -> String -> XmlFilter -> XmlFilterSourceadd the error level and the module where the error occured to the attributes of a document root node and remove the children when level is greater or equal to c_errc_err statusOk :: XmlFilter :: XmlFilterSourcecheck whether tree is a document root and the status attribute has a value less than c_errc_err

monadic filter for processing the attribute list of a tag. for other trees this filter acts like noneMnoneM

hxt-filter-8.2.0: A collection of tools for processing XML with Haskell (Filter variant).hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant).Source codeDocumentationmodule Text.XML.HXT.DOM.XmlTreeTypes hxt-filter-8.2.0: A collection of tools for processing XML with Haskell (Filter variant).Source codeContentsIndex
Text.XML.HXT.DOM.XmlTreeFilter
Descriptionbasic XmlTree filter -Synopsis
isRoot :: XmlFilter
isTag :: String -> XmlFilter
isNsTag :: String -> String -> XmlFilter
hasLocalPart :: String -> XmlFilter
hasPrefix :: String -> XmlFilter
hasNamespace :: String -> XmlFilter
isOfTag :: (TagName -> Bool) -> XmlFilter
hasAttr :: String -> XmlFilter
hasNsAttr :: String -> String -> XmlFilter
hasValue :: String -> (String -> Bool) -> XmlFilter
isPi :: String -> XmlFilter
isXmlPi :: XmlFilter
isOfPi :: (TagName -> Bool) -> XmlFilter
isXCdata :: XmlFilter
isXCharRef :: XmlFilter
isXCmt :: XmlFilter
isXDTD :: XmlFilter
isXEntityRef :: XmlFilter
isXError :: XmlFilter
isXPi :: XmlFilter
isXTag :: XmlFilter
isXAttr :: XmlFilter
isAttr :: String -> XmlFilter
isNsAttr :: String -> String -> XmlFilter
isOfAttr :: (AttrName -> Bool) -> XmlFilter
isXText :: XmlFilter
isText :: String -> XmlFilter
isOfText :: (String -> Bool) -> XmlFilter
isWhiteSpace :: XmlFilter
isDoctype :: XmlFilter
isAttlist :: XmlFilter
isElement :: XmlFilter
isEntity :: XmlFilter
isPeRef :: XmlFilter
isDTDName :: XmlFilter
isCondSect :: XmlFilter
isParameterEntity :: XmlFilter
isNotation :: XmlFilter
isDefaultAttrKind :: XmlFilter
isEnumAttrType :: XmlFilter
isFixedAttrKind :: XmlFilter
isIdAttrType :: XmlFilter
isIdRefAttrType :: XmlFilter
isNotationAttrType :: XmlFilter
isRequiredAttrKind :: XmlFilter
isAttlistParameterEntity :: XmlFilter
isEmptyElement :: XmlFilter
isMixedContentElement :: XmlFilter
isElemWithContent :: XmlFilter
isAttlistOfElement :: String -> XmlFilter
isElemContentParamEntity :: XmlFilter
isUnparsedEntity :: XmlFilter
isExternalParameterEntity :: XmlFilter
isInternalParameterEntity :: XmlFilter
isWarning :: XmlFilter
isError :: XmlFilter
isFatalError :: XmlFilter
mkXTag :: String -> XmlFilter -> XmlFilter -> XmlFilter
mkQTag :: QName -> XmlFilter -> XmlFilter -> XmlFilter
mkXNsTag :: String -> String -> XmlFilter -> XmlFilter -> XmlFilter
mkXAttr :: String -> XmlFilter -> XmlFilter
mkQAttr :: QName -> XmlFilter -> XmlFilter
mkXNsAttr :: String -> String -> XmlFilter -> XmlFilter
mkXText :: String -> XmlFilter
mkXCharRef :: Int -> XmlFilter
mkXEntityRef :: String -> XmlFilter
mkXCmt :: XmlFilter -> XmlFilter
mkXDTD :: DTDElem -> Attributes -> XmlTrees -> XmlFilter
mkXCdata :: XmlFilter -> XmlFilter
mkXPi :: String -> XmlFilter -> XmlFilter
mkXError :: Int -> String -> XmlFilter
getName :: XmlFilter
getAttrl :: XmlFilter
getValue :: String -> XmlFilter
getNsValue :: String -> String -> XmlFilter
getDTDValue :: String -> XmlFilter
getXCmt :: XmlFilter
getXCdata :: XmlFilter
replaceQName :: String -> XmlFilter
modifyText :: (String -> String) -> XmlFilter
modifyQName :: (TagName -> TagName) -> XmlFilter
processAttrl :: XmlSFilter -> XmlFilter
processAttr :: XmlFilter -> XmlFilter
replaceAttrl :: XmlTrees -> XmlFilter
del1Attr :: String -> XmlFilter
add1Attr :: XmlTree -> XmlFilter
addAttrl :: XmlFilter -> XmlFilter
addAttr :: String -> String -> XmlFilter
addAttrInt :: String -> Int -> XmlFilter
modifyAttr :: String -> (String -> String) -> XmlFilter
addDTDAttr :: String -> String -> XmlFilter
(+=) :: XmlFilter -> XmlFilter -> XmlFilter
(++=) :: XmlFilter -> [XmlFilter] -> XmlFilter
valueOf :: String -> XmlTree -> String
intValueOf :: String -> XmlTree -> Int
tag :: String -> [XmlFilter] -> [XmlFilter] -> XmlFilter
stag :: String -> [XmlFilter] -> XmlFilter
atag :: String -> [XmlFilter] -> XmlFilter
etag :: String -> XmlFilter
qetag :: QName -> XmlFilter
qtag :: QName -> XmlFilter -> XmlFilter -> XmlFilter
rootTag :: [XmlFilter] -> [XmlFilter] -> XmlFilter
attr :: String -> XmlFilter -> XmlFilter
qattr :: QName -> XmlFilter -> XmlFilter
sattr :: String -> String -> XmlFilter
txt :: String -> XmlFilter
cmt :: String -> XmlFilter
spi :: String -> String -> XmlFilter
cdata :: String -> XmlFilter
dtd :: DTDElem -> [XmlFilter] -> [XmlFilter] -> XmlFilter
warn :: String -> XmlFilter
err :: String -> XmlFilter
fatal :: String -> XmlFilter
hasOption :: String -> XmlFilter
Documentation
isRoot :: XmlFilterSource
test whether the root of a tree contains a document root node. -
isTag :: String -> XmlFilterSource

test whether the root of a tree contains a tag node. -

see also: isNsTag -

isNsTag :: String -> String -> XmlFilterSource

namespace aware test whether the root of a tree contains a tag node. Parameters are the local part and namespace. - Only usable after namespace propagation. -

see also: isTag -

hasLocalPart :: String -> XmlFilterSource
test whether the root of a tree has a given local name - see also : hasNamespace, hasPrefix, isTag, isAttr -
hasPrefix :: String -> XmlFilterSource
test whether the root of a tree has a given prefix name - see also : hasNamespace, hasLocalPart, isTag, isAttr -
hasNamespace :: String -> XmlFilterSource
test whether the root of a tree belongs to a given namespace - see also : isTag, isAttr, hasLocalPart, hasPrefix -
isOfTag :: (TagName -> Bool) -> XmlFilterSource
test whether the root of a tree contains a tag node with a special name. -
hasAttr :: String -> XmlFilterSource

test whether the node of a tree is a XTag node or a XPi node with an attibute of a specific name -

see also: isAttr, hasNsAttr -

hasNsAttr :: String -> String -> XmlFilterSource

test whether the tree is a XTag node with an attibute of a specific local name and namespace uri -

see also: hasAttr, isNsAttr -

hasValue :: String -> (String -> Bool) -> XmlFilterSource

test whether the given node is a XTag node or a XPI node with an attribute with a value with a specific property. - In case of a match, the attribute value represented by a text node is returned as single element list, - else the empty list is the result. -

see also : getValue -

isPi :: String -> XmlFilterSource
test whether the tree is a processing instruction with a given name. -
isXmlPi :: XmlFilterSource
test whether the tree is a <?xml ... ?> declaration -
isOfPi :: (TagName -> Bool) -> XmlFilterSource
test whether the root of a tree contains a processing instruction of a special name. -
isXCdata :: XmlFilterSource
test whether the root of a tree contains a CDATA node. -
isXCharRef :: XmlFilterSource
test whether the root of a tree contains a character reference node. -
isXCmt :: XmlFilterSource
test whether the root of a tree contains a comment node. -
isXDTD :: XmlFilterSource
test whether the root of a tree contains a DTD part. -
isXEntityRef :: XmlFilterSource
test whether the root of a tree contains an entity reference node. -
isXError :: XmlFilterSource
test whether the root of a tree contains an error node. -
isXPi :: XmlFilterSource
test whether the root of a tree contains a processing instruction node. -
isXTag :: XmlFilterSource
test whether the root of a tree contains a tag node. -
isXAttr :: XmlFilterSource
test whether the root of a tree contains an attribute node. -
isAttr :: String -> XmlFilterSource
test whether the root of a tree is an attribute node for a given attribute name -
isNsAttr :: String -> String -> XmlFilterSource

namespace aware test whether the tree contains an attribute node. Parameters are the local part of the atribute name and the namespace. - Only usable after namespace propagation. -

see also: isNsTag, isAttr, hasNsAttr -

isOfAttr :: (AttrName -> Bool) -> XmlFilterSource
general test for an attribute name -
isXText :: XmlFilterSource
test whether the root of a tree contains a text node. -
isText :: String -> XmlFilterSource
test whether the root of a tree contains a special text. -
isOfText :: (String -> Bool) -> XmlFilterSource
test whether the root of a tree contains a text node with a special property -
isWhiteSpace :: XmlFilterSource
test whether the root of a tree contains a text node only with whitespace. -
isDoctype :: XmlFilterSource
test whether the root of a tree contains a DOCTYPE DTD part. -
isAttlist :: XmlFilterSource
test whether the root of a tree contains an ATTLIST DTD part. -
isElement :: XmlFilterSource
test whether the root of a tree contains an ELEMENT DTD part. -
isEntity :: XmlFilterSource
test whether the root of a tree contains an ENTITY DTD part. -
isPeRef :: XmlFilterSource
test whether the root of a tree contains a parameter ENTITY reference. -
isDTDName :: XmlFilterSource
test whether the root of a tree contains a DTD name part. -
isCondSect :: XmlFilterSource
test whether the root of a tree contains a conditional section DTD part. -
isParameterEntity :: XmlFilterSource
test whether the root of a tree contains a parameter entity declaration. -
isNotation :: XmlFilterSource
test whether the root of a tree contains a NOTATION DTD part. -
isDefaultAttrKind :: XmlFilterSource
isEnumAttrType :: XmlFilterSource
isFixedAttrKind :: XmlFilterSource
isIdAttrType :: XmlFilterSource
isIdRefAttrType :: XmlFilterSource
isNotationAttrType :: XmlFilterSource
isRequiredAttrKind :: XmlFilterSource
isAttlistParameterEntity :: XmlFilterSource
isEmptyElement :: XmlFilterSource
isMixedContentElement :: XmlFilterSource
isElemWithContent :: XmlFilterSource
isAttlistOfElement :: String -> XmlFilterSource
isElemContentParamEntity :: XmlFilterSource
isUnparsedEntity :: XmlFilterSource
isExternalParameterEntity :: XmlFilterSource
isInternalParameterEntity :: XmlFilterSource
isWarning :: XmlFilterSource
test whether the root of a tree contains an error node for a warning. -
isError :: XmlFilterSource
test whether the root of a tree contains an error node for an error. -
isFatalError :: XmlFilterSource
test whether the root of a tree contains an error node for a fatal error. -
mkXTag :: String -> XmlFilter -> XmlFilter -> XmlFilterSource

constructor filter for a tag node. - a new tree is constructed. - the attributes and the children are computed by applying the aproprate filter to the input tree -

mkQTag :: QName -> XmlFilter -> XmlFilter -> XmlFilterSource
Version with qualified names of mkXTag -
mkXNsTag :: String -> String -> XmlFilter -> XmlFilter -> XmlFilterSource

constructor filter for a tag node. - a new tree is constructed. - the attributes and the children are computed by applying the aproprate filter to the input tree -

mkXAttr :: String -> XmlFilter -> XmlFilterSource
filter for attribute construction. - a new tree with attribute name and a value computed by a filter - is build. -
mkQAttr :: QName -> XmlFilter -> XmlFilterSource
Qualified version mkXAttr -
mkXNsAttr :: String -> String -> XmlFilter -> XmlFilterSource
filter for attribute construction. - a new tree with attribute name and namespace and a value computed by a filter - is build. -
mkXText :: String -> XmlFilterSource
constructor filter for a text node. - a new tree is constructed. - the input tree is ignored. -
mkXCharRef :: Int -> XmlFilterSource
constructor filter for a character reference node. - a new tree is constructed. - the input tree is ignored. -
mkXEntityRef :: String -> XmlFilterSource
constructor filter for an entity reference node. - a new tree is constructed. - the input tree is ignored. -
mkXCmt :: XmlFilter -> XmlFilterSource
constructor filter for a comment node. - a new tree is constructed. - the xml string representation of the filter result - forms the comment -
mkXDTD :: DTDElem -> Attributes -> XmlTrees -> XmlFilterSource
constructor filter for a DTD part. - a new tree is constructed. - the input tree is ignored. -
mkXCdata :: XmlFilter -> XmlFilterSource
constructor filter for a CDATA section node. - a new tree is constructed. - the input tree is ignored. -
mkXPi :: String -> XmlFilter -> XmlFilterSource
constructor filter for a processing instruction - a new tree is constructed from the text representation - of the input tree -
mkXError :: Int -> String -> XmlFilterSource
constructor filter for an error message node. - a new tree is constructed. - the input tree is ignored. -
getName :: XmlFilterSource
filter for selecting the name of a tag node, an attribute node or a pi node. - Result of the filter is a single element list with a text node or the empty list -
getAttrl :: XmlFilterSource
filter for selecting the attibute list -
getValue :: String -> XmlFilterSource

filter for selecting the value of an attribute in a tag node. - Result of the filter is a single element list with a text node or the empty list -

see also : hasValue, getNsValue -

getNsValue :: String -> String -> XmlFilterSource

filter for selecting the value of an attribute with namespace in a tag node. - Result of the filter is a single element list with a text node or the empty list -

see also : getValue, isNsAttr -

getDTDValue :: String -> XmlFilterSource
filter for selecting an attribute of a DTD node. - Result of the filter is a single element list with a text node or the empty list -
getXCmt :: XmlFilterSource
filter for selecting content of a comment. - Result of the filter is a single element list with a text node or the empty list -
getXCdata :: XmlFilterSource
filter for selecting the CDATA content. - Result of the filter is a single element list with a text node or the empty list -
replaceQName :: String -> XmlFilterSource
edit filter for changing the name of a tag node, an attribute or a pi. - result of the filter is a single element list with a tag node or the empty list -
modifyText :: (String -> String) -> XmlFilterSource

edit filter for changing the text of a text node. - result of the filter is a single element list with a text node or the empty list -

example for editing all text nodes of a tree with an edit function f: -

processBottomUp (modifyText f `when` isXText)
modifyQName :: (TagName -> TagName) -> XmlFilterSource
edit filter for changing the name of a tag node. - result of the filter is a single element list with a text node or the empty list -
processAttrl :: XmlSFilter -> XmlFilterSource
process the attribute list of a tag node with a tree list filter. - for other trees this filter acts like none -
processAttr :: XmlFilter -> XmlFilterSource

elementwise processing of the attributes of a tag. - for other trees this filter acts like none -

see also : processAttrl -

replaceAttrl :: XmlTrees -> XmlFilterSource
replace an attribute list - to be renamed when replaceAttrl is eliminated -
del1Attr :: String -> XmlFilterSource
delete an attribute from the attribute list of a tag tree -
add1Attr :: XmlTree -> XmlFilterSource

add an attribute to the attribute list of a tag. - If the attribute already exists, it's substituted, -

see also: sattr, += -

addAttrl :: XmlFilter -> XmlFilterSource

adds an attribute list computed by a filter, uses add1Attr. -

see also: += -

addAttr :: String -> String -> XmlFilterSource
add or change an attribute with a given string as value for a XTag or XPi tree, - uses add1Attr. -
addAttrInt :: String -> Int -> XmlFilterSource
add or change an attribute with an Int value. - uses addAttr. -
modifyAttr :: String -> (String -> String) -> XmlFilterSource

edit filter for changing the value of an attribute in a tag node. - result of the filter is a single element list with the tag node or the empty list. -

addDTDAttr :: String -> String -> XmlFilterSource
add or change an attribute of a DTD tree -
(+=) :: XmlFilter -> XmlFilter -> XmlFilterSource

convenient function for tag node tree construction -

infixl 7 -

filter combinator for tag tree constrcution - take a 1. filter for computing a tag node tree (or a whole list of tag node trees) - then add all trees computed by the 2. filter to the attribute list when they represent attributes - else append them to the list of children. -

if the 1. filter computes a list of tag nodes, the results of the 2. filter are added to all trees -

example: etag "a" += sattr "href" "#42" += txt "the answer" - gives the tree <a href="#42">the answer</a> -

example: ( etag "a" +++ etag "b" ) += sattr "x" "42" - gives the tree <a x="42"/><b x="42"/> -

see also : etag, tag, add1Attr, modifyChildren, ++= -

(++=) :: XmlFilter -> [XmlFilter] -> XmlFilterSource

convenient filter function adding a whole list of trees, just for not writing to many ( ... ). -

infixl 7 -

 f ++= gl  == f += cat gl

see also : += -

valueOf :: String -> XmlTree -> StringSource
combination of getValue and conversion into a String -
intValueOf :: String -> XmlTree -> IntSource
combination of getValue and conversion to a Int -
tag :: String -> [XmlFilter] -> [XmlFilter] -> XmlFilterSource

variant of mkXTag with a list of filters for the attributes and a list of filters for the children. - this variant leads to a more readable source for a complicated construction filter - than the simple solution with a combination of mkXTag and cat. -

see also : mkXTag, stag, etag, cat, += -

stag :: String -> [XmlFilter] -> XmlFilterSource

variant of tag, useful for tags without attributes and with a list of filters for - constructing the children -

see also : mkXTag, tag, etag, cat, += -

atag :: String -> [XmlFilter] -> XmlFilterSource

variant of tag, useful for tags with attributes but without children -

see also : mkXTag, tag, stag, etag, cat -

etag :: String -> XmlFilterSource

Short cut for empty tags without attributes -

see also : tag, atag, stag, mkXTag and += -

qetag :: QName -> XmlFilterSource
Qualified version of etag -
qtag :: QName -> XmlFilter -> XmlFilter -> XmlFilterSource
Alias for mkQTag -
rootTag :: [XmlFilter] -> [XmlFilter] -> XmlFilterSource

filter for creating a document root node with a list of filters for the attributes and a list of filters for the document. -

see also : tag -

attr :: String -> XmlFilter -> XmlFilterSource
Alias for mkXAttr -
qattr :: QName -> XmlFilter -> XmlFilterSource
Alias for mkQAttr -
sattr :: String -> String -> XmlFilterSource

short cut for attribute construction with string constants -

set also : attr, mkXAttr and mkXText -

txt :: String -> XmlFilterSource
short cut for mkXText -
cmt :: String -> XmlFilterSource

short cut for simple comment - the input tree is ignored -

see also : mkXCmt -

spi :: String -> String -> XmlFilterSource

short cut for generating simple processing instructions (spi) - the input tree is ignored -

spi "xyz" "abc" is equal to mkXPi "xyz" (txt "abc") - (the name pi is already used in prelude) -

cdata :: String -> XmlFilterSource
short cut for generating simple cdata sections, - the input tree is ignored -
dtd :: DTDElem -> [XmlFilter] -> [XmlFilter] -> XmlFilterSource
DTD part generation with filter for attributes and children - see also: mkXDTDTree -
warn :: String -> XmlFilterSource

short cut for mkXError c_warn. -

see also : mkXError -

err :: String -> XmlFilterSource

short cut for mkXError c_fatal. -

see also : mkXError -

fatal :: String -> XmlFilterSource

short cut for mkXError c_fatal. -

see also : mkXError -

hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant).
hasOption :: String -> XmlFilterSource codeContentsIndex
Text.XML.HXT.DOM.XmlTreeFilter
Descriptionbasic XmlTree filter +Synopsis
isRoot :: XmlFilter
isTag :: String -> XmlFilter
isNsTag :: String -> String -> XmlFilter
hasLocalPart :: String -> XmlFilter
hasPrefix :: String -> XmlFilter
hasNamespace :: String -> XmlFilter
isOfTag :: (TagName -> Bool) -> XmlFilter
hasAttr :: String -> XmlFilter
hasNsAttr :: String -> String -> XmlFilter
hasValue :: String -> (String -> Bool) -> XmlFilter
isPi :: String -> XmlFilter
isXmlPi :: XmlFilter
isOfPi :: (TagName -> Bool) -> XmlFilter
isXCdata :: XmlFilter
isXCharRef :: XmlFilter
isXCmt :: XmlFilter
isXDTD :: XmlFilter
isXEntityRef :: XmlFilter
isXError :: XmlFilter
isXPi :: XmlFilter
isXTag :: XmlFilter
isXAttr :: XmlFilter
isAttr :: String -> XmlFilter
isNsAttr :: String -> String -> XmlFilter
isOfAttr :: (AttrName -> Bool) -> XmlFilter
isXText :: XmlFilter
isText :: String -> XmlFilter
isOfText :: (String -> Bool) -> XmlFilter
isWhiteSpace :: XmlFilter
isDoctype :: XmlFilter
isAttlist :: XmlFilter
isElement :: XmlFilter
isEntity :: XmlFilter
isPeRef :: XmlFilter
isDTDName :: XmlFilter
isCondSect :: XmlFilter
isParameterEntity :: XmlFilter
isNotation :: XmlFilter
isDefaultAttrKind :: XmlFilter
isEnumAttrType :: XmlFilter
isFixedAttrKind :: XmlFilter
isIdAttrType :: XmlFilter
isIdRefAttrType :: XmlFilter
isNotationAttrType :: XmlFilter
isRequiredAttrKind :: XmlFilter
isAttlistParameterEntity :: XmlFilter
isEmptyElement :: XmlFilter
isMixedContentElement :: XmlFilter
isElemWithContent :: XmlFilter
isAttlistOfElement :: String -> XmlFilter
isElemContentParamEntity :: XmlFilter
isUnparsedEntity :: XmlFilter
isExternalParameterEntity :: XmlFilter
isInternalParameterEntity :: XmlFilter
isWarning :: XmlFilter
isError :: XmlFilter
isFatalError :: XmlFilter
mkXTag :: String -> XmlFilter -> XmlFilter -> XmlFilter
mkQTag :: QName -> XmlFilter -> XmlFilter -> XmlFilter
mkXNsTag :: String -> String -> XmlFilter -> XmlFilter -> XmlFilter
mkXAttr :: String -> XmlFilter -> XmlFilter
mkQAttr :: QName -> XmlFilter -> XmlFilter
mkXNsAttr :: String -> String -> XmlFilter -> XmlFilter
mkXText :: String -> XmlFilter
mkXCharRef :: Int -> XmlFilter
mkXEntityRef :: String -> XmlFilter
mkXCmt :: XmlFilter -> XmlFilter
mkXDTD :: DTDElem -> Attributes -> XmlTrees -> XmlFilter
mkXCdata :: XmlFilter -> XmlFilter
mkXPi :: String -> XmlFilter -> XmlFilter
mkXError :: Int -> String -> XmlFilter
getName :: XmlFilter
getAttrl :: XmlFilter
getValue :: String -> XmlFilter
getNsValue :: String -> String -> XmlFilter
getDTDValue :: String -> XmlFilter
getXCmt :: XmlFilter
getXCdata :: XmlFilter
replaceQName :: String -> XmlFilter
modifyText :: (String -> String) -> XmlFilter
modifyQName :: (TagName -> TagName) -> XmlFilter
processAttrl :: XmlSFilter -> XmlFilter
processAttr :: XmlFilter -> XmlFilter
replaceAttrl :: XmlTrees -> XmlFilter
del1Attr :: String -> XmlFilter
add1Attr :: XmlTree -> XmlFilter
addAttrl :: XmlFilter -> XmlFilter
addAttr :: String -> String -> XmlFilter
addAttrInt :: String -> Int -> XmlFilter
modifyAttr :: String -> (String -> String) -> XmlFilter
addDTDAttr :: String -> String -> XmlFilter
(+=) :: XmlFilter -> XmlFilter -> XmlFilter
(++=) :: XmlFilter -> [XmlFilter] -> XmlFilter
valueOf :: String -> XmlTree -> String
intValueOf :: String -> XmlTree -> Int
tag :: String -> [XmlFilter] -> [XmlFilter] -> XmlFilter
stag :: String -> [XmlFilter] -> XmlFilter
atag :: String -> [XmlFilter] -> XmlFilter
etag :: String -> XmlFilter
qetag :: QName -> XmlFilter
qtag :: QName -> XmlFilter -> XmlFilter -> XmlFilter
rootTag :: [XmlFilter] -> [XmlFilter] -> XmlFilter
attr :: String -> XmlFilter -> XmlFilter
qattr :: QName -> XmlFilter -> XmlFilter
sattr :: String -> String -> XmlFilter
txt :: String -> XmlFilter
cmt :: String -> XmlFilter
spi :: String -> String -> XmlFilter
cdata :: String -> XmlFilter
dtd :: DTDElem -> [XmlFilter] -> [XmlFilter] -> XmlFilter
warn :: String -> XmlFilter
err :: String -> XmlFilter
fatal :: String -> XmlFilter
hasOption :: String -> XmlFilter
Documentation
isRoot :: XmlFilterSource
test whether the root of a tree contains a document root node. +
isTag :: String -> XmlFilterSource

test whether the root of a tree contains a tag node. +

see also: isNsTag +

isNsTag :: String -> String -> XmlFilterSource

namespace aware test whether the root of a tree contains a tag node. Parameters are the local part and namespace. + Only usable after namespace propagation. +

see also: isTag +

hasLocalPart :: String -> XmlFilterSource
test whether the root of a tree has a given local name + see also : hasNamespace, hasPrefix, isTag, isAttr +
hasPrefix :: String -> XmlFilterSource
test whether the root of a tree has a given prefix name + see also : hasNamespace, hasLocalPart, isTag, isAttr +
hasNamespace :: String -> XmlFilterSource
test whether the root of a tree belongs to a given namespace + see also : isTag, isAttr, hasLocalPart, hasPrefix +
isOfTag :: (TagName -> Bool) -> XmlFilterSource
test whether the root of a tree contains a tag node with a special name. +
hasAttr :: String -> XmlFilterSource

test whether the node of a tree is a XTag node or a XPi node with an attibute of a specific name +

see also: isAttr, hasNsAttr +

hasNsAttr :: String -> String -> XmlFilterSource

test whether the tree is a XTag node with an attibute of a specific local name and namespace uri +

see also: hasAttr, isNsAttr +

hasValue :: String -> (String -> Bool) -> XmlFilterSource

test whether the given node is a XTag node or a XPI node with an attribute with a value with a specific property. + In case of a match, the attribute value represented by a text node is returned as single element list, + else the empty list is the result. +

see also : getValue +

isPi :: String -> XmlFilterSource
test whether the tree is a processing instruction with a given name. +
isXmlPi :: XmlFilterSource
test whether the tree is a <?xml ... ?> declaration +
isOfPi :: (TagName -> Bool) -> XmlFilterSource
test whether the root of a tree contains a processing instruction of a special name. +
isXCdata :: XmlFilterSource
test whether the root of a tree contains a CDATA node. +
isXCharRef :: XmlFilterSource
test whether the root of a tree contains a character reference node. +
isXCmt :: XmlFilterSource
test whether the root of a tree contains a comment node. +
isXDTD :: XmlFilterSource
test whether the root of a tree contains a DTD part. +
isXEntityRef :: XmlFilterSource
test whether the root of a tree contains an entity reference node. +
isXError :: XmlFilterSource
test whether the root of a tree contains an error node. +
isXPi :: XmlFilterSource
test whether the root of a tree contains a processing instruction node. +
isXTag :: XmlFilterSource
test whether the root of a tree contains a tag node. +
isXAttr :: XmlFilterSource
test whether the root of a tree contains an attribute node. +
isAttr :: String -> XmlFilterSource
test whether the root of a tree is an attribute node for a given attribute name +
isNsAttr :: String -> String -> XmlFilterSource

namespace aware test whether the tree contains an attribute node. Parameters are the local part of the atribute name and the namespace. + Only usable after namespace propagation. +

see also: isNsTag, isAttr, hasNsAttr +

isOfAttr :: (AttrName -> Bool) -> XmlFilterSource
general test for an attribute name +
isXText :: XmlFilterSource
test whether the root of a tree contains a text node. +
isText :: String -> XmlFilterSource
test whether the root of a tree contains a special text. +
isOfText :: (String -> Bool) -> XmlFilterSource
test whether the root of a tree contains a text node with a special property +
isWhiteSpace :: XmlFilterSource
test whether the root of a tree contains a text node only with whitespace. +
isDoctype :: XmlFilterSource
test whether the root of a tree contains a DOCTYPE DTD part. +
isAttlist :: XmlFilterSource
test whether the root of a tree contains an ATTLIST DTD part. +
isElement :: XmlFilterSource
test whether the root of a tree contains an ELEMENT DTD part. +
isEntity :: XmlFilterSource
test whether the root of a tree contains an ENTITY DTD part. +
isPeRef :: XmlFilterSource
test whether the root of a tree contains a parameter ENTITY reference. +
isDTDName :: XmlFilterSource
test whether the root of a tree contains a DTD name part. +
isCondSect :: XmlFilterSource
test whether the root of a tree contains a conditional section DTD part. +
isParameterEntity :: XmlFilterSource
test whether the root of a tree contains a parameter entity declaration. +
isNotation :: XmlFilterSource
test whether the root of a tree contains a NOTATION DTD part. +
isDefaultAttrKind :: XmlFilterSource
isEnumAttrType :: XmlFilterSource
isFixedAttrKind :: XmlFilterSource
isIdAttrType :: XmlFilterSource
isIdRefAttrType :: XmlFilterSource
isNotationAttrType :: XmlFilterSource
isRequiredAttrKind :: XmlFilterSource
isAttlistParameterEntity :: XmlFilterSource
isEmptyElement :: XmlFilterSource
isMixedContentElement :: XmlFilterSource
isElemWithContent :: XmlFilterSource
isAttlistOfElement :: String -> XmlFilterSource
isElemContentParamEntity :: XmlFilterSource
isUnparsedEntity :: XmlFilterSource
isExternalParameterEntity :: XmlFilterSource
isInternalParameterEntity :: XmlFilterSource
isWarning :: XmlFilterSource
test whether the root of a tree contains an error node for a warning. +
isError :: XmlFilterSource
test whether the root of a tree contains an error node for an error. +
isFatalError :: XmlFilterSource
test whether the root of a tree contains an error node for a fatal error. +
mkXTag :: String -> XmlFilter -> XmlFilter -> XmlFilterSource

constructor filter for a tag node. + a new tree is constructed. + the attributes and the children are computed by applying the aproprate filter to the input tree +

mkQTag :: QName -> XmlFilter -> XmlFilter -> XmlFilterSource
Version with qualified names of mkXTag +
mkXNsTag :: String -> String -> XmlFilter -> XmlFilter -> XmlFilterSource

constructor filter for a tag node. + a new tree is constructed. + the attributes and the children are computed by applying the aproprate filter to the input tree +

mkXAttr :: String -> XmlFilter -> XmlFilterSource
filter for attribute construction. + a new tree with attribute name and a value computed by a filter + is build. +
mkQAttr :: QName -> XmlFilter -> XmlFilterSource
Qualified version mkXAttr +
mkXNsAttr :: String -> String -> XmlFilter -> XmlFilterSource
filter for attribute construction. + a new tree with attribute name and namespace and a value computed by a filter + is build. +
mkXText :: String -> XmlFilterSource
constructor filter for a text node. + a new tree is constructed. + the input tree is ignored. +
mkXCharRef :: Int -> XmlFilterSource
constructor filter for a character reference node. + a new tree is constructed. + the input tree is ignored. +
mkXEntityRef :: String -> XmlFilterSource
constructor filter for an entity reference node. + a new tree is constructed. + the input tree is ignored. +
mkXCmt :: XmlFilter -> XmlFilterSource
constructor filter for a comment node. + a new tree is constructed. + the xml string representation of the filter result + forms the comment +
mkXDTD :: DTDElem -> Attributes -> XmlTrees -> XmlFilterSource
constructor filter for a DTD part. + a new tree is constructed. + the input tree is ignored. +
mkXCdata :: XmlFilter -> XmlFilterSource
constructor filter for a CDATA section node. + a new tree is constructed. + the input tree is ignored. +
mkXPi :: String -> XmlFilter -> XmlFilterSource
constructor filter for a processing instruction + a new tree is constructed from the text representation + of the input tree +
mkXError :: Int -> String -> XmlFilterSource
constructor filter for an error message node. + a new tree is constructed. + the input tree is ignored. +
getName :: XmlFilterSource
filter for selecting the name of a tag node, an attribute node or a pi node. + Result of the filter is a single element list with a text node or the empty list +
getAttrl :: XmlFilterSource
filter for selecting the attibute list +
getValue :: String -> XmlFilterSource

filter for selecting the value of an attribute in a tag node. + Result of the filter is a single element list with a text node or the empty list +

see also : hasValue, getNsValue +

getNsValue :: String -> String -> XmlFilterSource

filter for selecting the value of an attribute with namespace in a tag node. + Result of the filter is a single element list with a text node or the empty list +

see also : getValue, isNsAttr +

getDTDValue :: String -> XmlFilterSource
filter for selecting an attribute of a DTD node. + Result of the filter is a single element list with a text node or the empty list +
getXCmt :: XmlFilterSource
filter for selecting content of a comment. + Result of the filter is a single element list with a text node or the empty list +
getXCdata :: XmlFilterSource
filter for selecting the CDATA content. + Result of the filter is a single element list with a text node or the empty list +
replaceQName :: String -> XmlFilterSource
edit filter for changing the name of a tag node, an attribute or a pi. + result of the filter is a single element list with a tag node or the empty list +
modifyText :: (String -> String) -> XmlFilterSource

edit filter for changing the text of a text node. + result of the filter is a single element list with a text node or the empty list +

example for editing all text nodes of a tree with an edit function f: +

processBottomUp (modifyText f `when` isXText)
modifyQName :: (TagName -> TagName) -> XmlFilterSource
edit filter for changing the name of a tag node. + result of the filter is a single element list with a text node or the empty list +
processAttrl :: XmlSFilter -> XmlFilterSource
process the attribute list of a tag node with a tree list filter. + for other trees this filter acts like none +
processAttr :: XmlFilter -> XmlFilterSource

elementwise processing of the attributes of a tag. + for other trees this filter acts like none +

see also : processAttrl +

replaceAttrl :: XmlTrees -> XmlFilterSource
replace an attribute list + to be renamed when replaceAttrl is eliminated +
del1Attr :: String -> XmlFilterSource
delete an attribute from the attribute list of a tag tree +
add1Attr :: XmlTree -> XmlFilterSource

add an attribute to the attribute list of a tag. + If the attribute already exists, it's substituted, +

see also: sattr, += +

addAttrl :: XmlFilter -> XmlFilterSource

adds an attribute list computed by a filter, uses add1Attr. +

see also: += +

addAttr :: String -> String -> XmlFilterSource
add or change an attribute with a given string as value for a XTag or XPi tree, + uses add1Attr. +
addAttrInt :: String -> Int -> XmlFilterSource
add or change an attribute with an Int value. + uses addAttr. +
modifyAttr :: String -> (String -> String) -> XmlFilterSource

edit filter for changing the value of an attribute in a tag node. + result of the filter is a single element list with the tag node or the empty list. +

addDTDAttr :: String -> String -> XmlFilterSource
add or change an attribute of a DTD tree +
(+=) :: XmlFilter -> XmlFilter -> XmlFilterSource

convenient function for tag node tree construction +

infixl 7 +

filter combinator for tag tree constrcution + take a 1. filter for computing a tag node tree (or a whole list of tag node trees) + then add all trees computed by the 2. filter to the attribute list when they represent attributes + else append them to the list of children. +

if the 1. filter computes a list of tag nodes, the results of the 2. filter are added to all trees +

example: etag "a" += sattr "href" "#42" += txt "the answer" + gives the tree <a href="#42">the answer</a> +

example: ( etag "a" +++ etag "b" ) += sattr "x" "42" + gives the tree <a x="42"/><b x="42"/> +

see also : etag, tag, add1Attr, modifyChildren, ++= +

(++=) :: XmlFilter -> [XmlFilter] -> XmlFilterSource

convenient filter function adding a whole list of trees, just for not writing to many ( ... ). +

infixl 7 +

 f ++= gl  == f += cat gl

see also : += +

valueOf :: String -> XmlTree -> StringSource
combination of getValue and conversion into a String +
intValueOf :: String -> XmlTree -> IntSource
combination of getValue and conversion to a Int +
tag :: String -> [XmlFilter] -> [XmlFilter] -> XmlFilterSource

variant of mkXTag with a list of filters for the attributes and a list of filters for the children. + this variant leads to a more readable source for a complicated construction filter + than the simple solution with a combination of mkXTag and cat. +

see also : mkXTag, stag, etag, cat, += +

stag :: String -> [XmlFilter] -> XmlFilterSource

variant of tag, useful for tags without attributes and with a list of filters for + constructing the children +

see also : mkXTag, tag, etag, cat, += +

atag :: String -> [XmlFilter] -> XmlFilterSource

variant of tag, useful for tags with attributes but without children +

see also : mkXTag, tag, stag, etag, cat +

etag :: String -> XmlFilterSource

Short cut for empty tags without attributes +

see also : tag, atag, stag, mkXTag and += +

qetag :: QName -> XmlFilterSource
Qualified version of etag +
qtag :: QName -> XmlFilter -> XmlFilter -> XmlFilterSource
Alias for mkQTag +
rootTag :: [XmlFilter] -> [XmlFilter] -> XmlFilterSource

filter for creating a document root node with a list of filters for the attributes and a list of filters for the document. +

see also : tag +

attr :: String -> XmlFilter -> XmlFilterSource
Alias for mkXAttr +
qattr :: QName -> XmlFilter -> XmlFilterSource
Alias for mkQAttr +
sattr :: String -> String -> XmlFilterSource

short cut for attribute construction with string constants +

set also : attr, mkXAttr and mkXText +

txt :: String -> XmlFilterSource
short cut for mkXText +
cmt :: String -> XmlFilterSource

short cut for simple comment + the input tree is ignored +

see also : mkXCmt +

spi :: String -> String -> XmlFilterSource

short cut for generating simple processing instructions (spi) + the input tree is ignored +

spi "xyz" "abc" is equal to mkXPi "xyz" (txt "abc") + (the name pi is already used in prelude) +

cdata :: String -> XmlFilterSource
short cut for generating simple cdata sections, + the input tree is ignored +
dtd :: DTDElem -> [XmlFilter] -> [XmlFilter] -> XmlFilterSource
DTD part generation with filter for attributes and children + see also: mkXDTDTree +
warn :: String -> XmlFilterSource

short cut for mkXError c_warn. +

see also : mkXError +

err :: String -> XmlFilterSource

short cut for mkXError c_fatal. +

see also : mkXError +

fatal :: String -> XmlFilterSource

short cut for mkXError c_fatal. +

see also : mkXError +

hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant).isTagNode :: String -> XNode -> -> XNode -> BoolisAttrNode :: String -> XNode -> -> XNode -> BoolisTextNode :: String -> XNode -> -> XNode -> BoolString -> Bool) -> XNode -> ) -> XNode -> BoolisPiNode :: String -> XNode -> -> XNode -> BoolisErrorNode :: Int -> XNode -> -> XNode -> BoolmkXTagTree :: String -> XmlTrees -> XmlTrees -> XmlTree -> XmlTrees -> XmlTrees -> XmlTree :: QName -> XmlTrees -> XmlTrees -> XmlTree -> XmlTrees -> XmlTrees -> XmlTree :: XmlTrees -> XmlTree :: XmlTree -> XmlTree :: Attributes -> XmlTree :: XmlTrees -> XmlTrees -> XmlTree -> XmlTree -> XmlTree -> XmlTree -> XmlTree :: DTDElem -> Attributes -> XmlTrees -> XmlTree -> XmlTrees -> XmlTree :: QName -> XmlTrees -> XmlTree -> XmlTrees -> XmlTree -> XmlTree -> XmlTree :: XmlTrees -> XmlTree -> XmlTree -> XmlTrees -> XmlTree -> XmlTrees :: XmlSFilter :: XmlTree -> AttributesString -> String -> XmlTree -> -> XmlTree -> Boolxcmt :: String -> XmlTrees -> XmlTrees -> XmlTrees -> XmlTrees -> XmlTrees -> XmlTrees -> XmlTrees -> XmlTrees -> XmlTreesXmlTrees :: XmlTrees -> AttributesXmlTrees -> XmlTrees :: Attributes -> XmlTrees
hasOption :: String -> XmlFilterSource hxt-filter-8.2.0: A collection of tools for processing XML with Haskell (Filter variant).Source codeisXCdataNode :: XNode -> :: XNode -> Bool
isXCharRefNode :: XNode -> :: XNode -> Bool
isXCmtNode :: XNode -> :: XNode -> Bool
isXDTDNode :: XNode -> :: XNode -> Bool
isXAttrNode :: XNode -> :: XNode -> Bool
isXEntityRefNode :: XNode -> :: XNode -> Bool
isXErrorNode :: XNode -> :: XNode -> Bool
isXPiNode :: XNode -> :: XNode -> Bool
isXTagNode :: XNode -> :: XNode -> Bool
isXTextNode :: XNode -> :: XNode -> Bool
isRootNode :: XNode -> :: XNode -> Bool
isOfTagNode :: (TagName -> :: (TagName -> Bool) -> XNode -> ) -> XNode -> Bool
isOfAttrNode :: (AttrName -> :: (AttrName -> Bool) -> XNode -> ) -> XNode -> Bool
isOfPiNode :: (TagName -> :: (TagName -> Bool) -> XNode -> ) -> XNode -> Bool
isDTDElemNode :: DTDElem -> XNode -> :: DTDElem -> XNode -> Bool
textOfXNode :: XNode -> :: XNode -> String
mkQTagTree :: QName -> XmlTrees -> XmlTrees -> XmlTree
String -> String -> XmlTrees -> XmlTrees -> XmlTree
newRoot :: XmlTrees -> XmlTree
emptyRoot :: XmlTree
newDocument :: String -> XmlTree
newDocument' :: Attributes -> XmlTree
mkRootTree :: XmlTrees -> XmlTrees -> XmlTree
mkXTextTree :: String -> XmlTree
mkXCharRefTree :: Int -> XmlTree
mkXEntityRefTree :: String -> XmlTree
mkXCmtTree :: String -> XmlTree
mkXDTDTree :: DTDElem -> Attributes -> XmlTrees -> XmlTree
mkXAttrTree :: String -> XmlTrees -> XmlTree
mkQAttrTree :: QName -> XmlTrees -> XmlTree
String -> String -> XmlTrees -> XmlTree
mkXPERefTree :: String -> XmlTree
String -> String -> XmlTree
mkXmlDeclTree :: XmlTrees -> XmlTree
mkXCdataTree :: String -> XmlTree
Int -> String -> XmlTrees -> XmlTree
Maybe String -> XmlTrees
showXText :: XmlTrees -> :: XmlTrees -> String
showXCharRef :: XmlTrees -> :: XmlTrees -> String
showXEntityRef :: XmlTrees -> :: XmlTrees -> String
showXErrors :: XmlTrees -> :: XmlTrees -> String
xmlTreesToString :: XmlTrees -> :: XmlTrees -> String
xmlTreesToText :: XmlSFilter
xmlContentModelToString :: XmlTree -> :: XmlTree -> String
nameOf :: XmlTree -> :: XmlTree -> String
localPartOf :: XmlTree -> :: XmlTree -> String
namespaceOf :: XmlTree -> :: XmlTree -> String
prefixOf :: XmlTree -> :: XmlTree -> String
universalNameOf :: XmlTree -> :: XmlTree -> String
attrlOfDTD :: XmlTree -> Attributes
valueOfDTD :: String -> XmlTree -> -> XmlTree -> String
xerr :: String -> XmlTrees
xwarn :: String -> XmlTrees
xtext :: String -> XmlTrees
xtag :: String -> XmlTrees -> XmlTrees -> XmlTrees
String -> String -> XmlTrees
toTreel :: XmlTrees -> AssocList :: XmlTrees -> AssocList String XmlTrees
toAttrl :: XmlTrees -> Attributes
fromTreel :: AssocList :: AssocList String XmlTrees -> XmlTrees
fromAttrl :: Attributes -> XmlTrees
isXCdataNode :: XNode -> :: XNode -> BoolisXCharRefNode :: XNode -> :: XNode -> BoolisXCmtNode :: XNode -> :: XNode -> BoolisXDTDNode :: XNode -> :: XNode -> BoolisXAttrNode :: XNode -> :: XNode -> BoolisXEntityRefNode :: XNode -> :: XNode -> BoolisXErrorNode :: XNode -> :: XNode -> BoolisXPiNode :: XNode -> :: XNode -> BoolisXTagNode :: XNode -> :: XNode -> BoolisXTextNode :: XNode -> :: XNode -> BoolisRootNode :: XNode -> :: XNode -> BoolisTagNode :: String -> XNode -> -> XNode -> BoolisOfTagNode :: (TagName -> :: (TagName -> Bool) -> XNode -> ) -> XNode -> BoolisAttrNode :: String -> XNode -> -> XNode -> BoolisOfAttrNode :: (AttrName -> :: (AttrName -> Bool) -> XNode -> ) -> XNode -> BoolisTextNode :: String -> XNode -> -> XNode -> BoolString -> Bool) -> XNode -> ) -> XNode -> BoolisPiNode :: String -> XNode -> -> XNode -> BoolisOfPiNode :: (TagName -> :: (TagName -> Bool) -> XNode -> ) -> XNode -> BoolisDTDElemNode :: DTDElem -> XNode -> :: DTDElem -> XNode -> BoolisErrorNode :: Int -> XNode -> -> XNode -> BooltextOfXNode :: XNode -> :: XNode -> StringmkXTagTree :: String -> XmlTrees -> XmlTrees -> XmlTree -> XmlTrees -> XmlTrees -> XmlTreeSourcemkQTagTree :: QName -> XmlTrees -> XmlTrees -> XmlTree :: QName -> XmlTrees -> XmlTrees -> XmlTreeSourceString -> String -> XmlTrees -> XmlTrees -> XmlTree -> XmlTrees -> XmlTrees -> XmlTreeSourcenewRoot :: XmlTrees -> XmlTree :: XmlTrees -> XmlTreeSourceemptyRoot :: XmlTree :: XmlTreeSourcenewDocument :: String -> XmlTree -> XmlTreeSourcenewDocument' :: Attributes -> XmlTree :: Attributes -> XmlTreeSourcemkRootTree :: XmlTrees -> XmlTrees -> XmlTree :: XmlTrees -> XmlTrees -> XmlTreeSourcemkXTextTree :: String -> XmlTree -> XmlTreeSourcemkXCharRefTree :: Int -> XmlTree -> XmlTreeSourcemkXEntityRefTree :: String -> XmlTree -> XmlTreeSourcemkXCmtTree :: String -> XmlTree -> XmlTreeSourcemkXDTDTree :: DTDElem -> Attributes -> XmlTrees -> XmlTree :: DTDElem -> Attributes -> XmlTrees -> XmlTreeSourcemkXAttrTree :: String -> XmlTrees -> XmlTree -> XmlTrees -> XmlTreeSourcemkQAttrTree :: QName -> XmlTrees -> XmlTree :: QName -> XmlTrees -> XmlTreeSourceString -> String -> XmlTrees -> XmlTree -> XmlTrees -> XmlTreeSourcemkXPERefTree :: String -> XmlTree -> XmlTreeSourceString -> String -> XmlTree -> XmlTreeSourcemkXmlDeclTree :: XmlTrees -> XmlTree :: XmlTrees -> XmlTreeSourcemkXCdataTree :: String -> XmlTree -> XmlTreeSourceInt -> String -> XmlTrees -> XmlTree -> XmlTrees -> XmlTreeSourceMaybe String -> XmlTrees -> XmlTreesSourceshowXText :: XmlTrees -> :: XmlTrees -> StringshowXCharRef :: XmlTrees -> :: XmlTrees -> StringshowXEntityRef :: XmlTrees -> :: XmlTrees -> StringshowXErrors :: XmlTrees -> :: XmlTrees -> StringxmlTreesToString :: XmlTrees -> :: XmlTrees -> Stringold name for xshowxshow (deprecated) xmlTreesToText :: XmlSFilter :: XmlSFilterSource

see also : xshowxshow

xmlContentModelToString :: XmlTree -> :: XmlTree -> StringnameOf :: XmlTree -> :: XmlTree -> StringlocalPartOf :: XmlTree -> :: XmlTree -> StringnamespaceOf :: XmlTree -> :: XmlTree -> StringprefixOf :: XmlTree -> :: XmlTree -> StringuniversalNameOf :: XmlTree -> :: XmlTree -> StringattrlOfDTD :: XmlTree -> Attributes :: XmlTree -> AttributesSourcevalueOfDTD :: String -> XmlTree -> -> XmlTree -> StringString -> String -> XmlTree -> -> XmlTree -> Boolxcmt :: String -> XmlTrees -> XmlTreesSourcexerr :: String -> XmlTrees -> XmlTreesSourcexwarn :: String -> XmlTrees -> XmlTreesSourcextext :: String -> XmlTrees -> XmlTreesSourcextag :: String -> XmlTrees -> XmlTrees -> XmlTrees -> XmlTrees -> XmlTrees -> XmlTreesSourceString -> String -> XmlTrees -> XmlTreesSourcetoTreel :: XmlTrees -> AssocList :: XmlTrees -> AssocList String XmlTrees XmlTreesSourcetoAttrl :: XmlTrees -> Attributes :: XmlTrees -> AttributesSourcefromTreel :: AssocList :: AssocList String XmlTrees -> XmlTrees XmlTrees -> XmlTreesSourcefromAttrl :: Attributes -> XmlTrees :: Attributes -> XmlTreesSource + +Text.XML.HXT.DOM.XmlTreeTypes
hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant).Source codeContentsIndex
Text.XML.HXT.DOM.XmlTreeTypes
Description

exports the core data types + and some additional types and functions + for compatibility with none arrow modules +

Version : $Id: XmlTreeTypes.hs,v 1.6 20060509 15:30:43 hxml Exp $ +

Synopsis
module Data.Tree.NTree.Filter
mkNode :: node -> NTrees node -> NTree node
formatNTree :: (node -> String) -> NTree node -> String
foldNTree :: (a -> [b] -> b) -> NTree a -> b
mapNTree :: (a -> b) -> NTree a -> NTree b
nTreeToList :: NTree a -> [a]
depthNTree :: NTree a -> Int
cardNTree :: NTree a -> Int
type XmlFilter = TFilter XNode
type XmlSFilter = TSFilter XNode
type TagName = QName
type AttrName = QName
tName :: QName -> String
aName :: QName -> String
Documentation
module Data.Tree.NTree.Filter
mkNode :: node -> NTrees node -> NTree nodeSource
formatNTree :: (node -> String) -> NTree node -> StringSource
foldNTree :: (a -> [b] -> b) -> NTree a -> bSource
mapNTree :: (a -> b) -> NTree a -> NTree bSource
nTreeToList :: NTree a -> [a]Source
depthNTree :: NTree a -> IntSource
cardNTree :: NTree a -> IntSource
type XmlFilter = TFilter XNodeSource
A functions that takes a node and returns a list of nodes +
type XmlSFilter = TSFilter XNodeSource
A function that takes a list of nodes and returns a list of nodes +
type TagName = QNameSource
Tag name +
type AttrName = QNameSource
Attribute name +
tName :: QName -> StringSource
shortcut for qualifiedName +
aName :: QName -> StringSource
shortcut for qualifiedName +
Produced by Haddock version 2.3.0
diff --git a/doc/hxt-filter/Text-XML-HXT-DOM.html b/doc/hxt-filter/Text-XML-HXT-DOM.html --- a/doc/hxt-filter/Text-XML-HXT-DOM.html +++ b/doc/hxt-filter/Text-XML-HXT-DOM.html @@ -19,7 +19,7 @@ > hxt-filter-8.2.0: A collection of tools for processing XML with Haskell (Filter variant).hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant).Source code hxt-filter-8.2.0: A collection of tools for processing XML with Haskell (Filter variant).hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant).Source code hxt-filter-8.2.0: A collection of tools for processing XML with Haskell (Filter variant).hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant).Source code hxt-filter-8.2.0: A collection of tools for processing XML with Haskell (Filter variant).hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant).Source codesubstHtmlEntities :: XmlTree -> XmlTrees :: XmlTree -> XmlTreessubstHtmlEntities :: XmlTree -> XmlTrees :: XmlTree -> XmlTreesSource hxt-filter-8.2.0: A collection of tools for processing XML with Haskell (Filter variant).hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant).Source codegetXmlDocument :: Attributes -> :: Attributes -> String -> IO (XmlTree, XmlTrees, (XmlTree, XmlTrees, Int)putXmlDocument :: Attributes -> :: Attributes -> String -> XmlTree -> -> XmlTree -> IO (XmlTrees, (XmlTrees, Int)parseDocument :: Attributes -> :: Attributes -> XmlStateFilter statewriteDocument :: Attributes -> :: Attributes -> XmlStateFilter stategetXmlDocument :: Attributes -> :: Attributes -> String -> IO (XmlTree, XmlTrees, (XmlTree, XmlTrees, Int)
  • the error level: one of c_okc_ok, c_warnc_warn, c_errc_err, c_fatalc_fatal
    • putXmlDocument :: Attributes -> :: Attributes -> String -> XmlTree -> -> XmlTree -> IO (XmlTrees, (XmlTrees, Int)parseDocument :: Attributes -> :: Attributes -> XmlStateFilter statewriteDocument :: Attributes -> :: Attributes -> XmlStateFilter state hxt-filter-8.2.0: A collection of tools for processing XML with Haskell (Filter variant).hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant).Source code hxt-filter-8.2.0: A collection of tools for processing XML with Haskell (Filter variant).hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant).Source code hxt-filter-8.2.0: A collection of tools for processing XML with Haskell (Filter variant).hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant).Source code hxt-filter-8.2.0: A collection of tools for processing XML with Haskell (Filter variant).hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant).Source code hxt-filter-8.2.0: A collection of tools for processing XML with Haskell (Filter variant).hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant).Source code hxt-filter-8.2.0: A collection of tools for processing XML with Haskell (Filter variant).hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant).Source codegetContentLength :: XmlFilter :: XmlFiltergetContentLength :: XmlFilter :: XmlFilterSource hxt-filter-8.2.0: A collection of tools for processing XML with Haskell (Filter variant).hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant).Source code hxt-filter-8.2.0: A collection of tools for processing XML with Haskell (Filter variant).hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant).Source codesubstXmlEntities :: XmlFilter :: XmlFiltersubstXmlEntities :: XmlFilter :: XmlFilterSource hxt-filter-8.2.0: A collection of tools for processing XML with Haskell (Filter variant).hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant).Source code hxt-filter-8.2.0: A collection of tools for processing XML with Haskell (Filter variant).hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant).Source codecheckAttributeValue :: XmlTrees -> XmlTree -> XmlFilter :: XmlTrees -> XmlTree -> XmlFilternormalizeAttributeValue :: Maybe XmlTree -> XmlTree -> String -> StringcheckAttributeValue :: XmlTrees -> XmlTree -> XmlFilter :: XmlTrees -> XmlTree -> XmlFilterSourcenormalizeAttributeValue :: Maybe XmlTree -> XmlTree -> String -> String hxt-filter-8.2.0: A collection of tools for processing XML with Haskell (Filter variant).hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant).Source coderemoveDoublicateDefs :: XmlFilter :: XmlFiltervalidateDTD :: XmlFilter :: XmlFilterremoveDoublicateDefs :: XmlFilter :: XmlFilterSourcevalidateDTD :: XmlFilter :: XmlFilterSource hxt-filter-8.2.0: A collection of tools for processing XML with Haskell (Filter variant).hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant).Source codetransform :: XmlTree -> XmlTree -> XmlTrees :: XmlTree -> XmlTree -> XmlTreestransform :: XmlTree -> XmlTree -> XmlTrees :: XmlTree -> XmlTree -> XmlTreesSource hxt-filter-8.2.0: A collection of tools for processing XML with Haskell (Filter variant).hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant).Source codevalidateDoc :: XmlTree -> XmlTree -> XmlTrees :: XmlTree -> XmlTree -> XmlTreesvalidateDoc :: XmlTree -> XmlTree -> XmlTrees :: XmlTree -> XmlTree -> XmlTreesSource hxt-filter-8.2.0: A collection of tools for processing XML with Haskell (Filter variant).hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant).Source codevalidateIds :: XmlTree -> XmlTree -> XmlTrees :: XmlTree -> XmlTree -> XmlTreesvalidateIds :: XmlTree -> XmlTree -> XmlTrees :: XmlTree -> XmlTree -> XmlTreesSource hxt-filter-8.2.0: A collection of tools for processing XML with Haskell (Filter variant).hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant).Source code hxt-filter-8.2.0: A collection of tools for processing XML with Haskell (Filter variant).hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant).Source code hxt-filter-8.2.0: A collection of tools for processing XML with Haskell (Filter variant).hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant).Source codegetDTDSubset :: XmlFilter :: XmlFiltervalidate :: XmlFilter :: XmlFiltervalidateDTD :: XmlFilter :: XmlFiltervalidateDoc :: XmlFilter :: XmlFilterremoveDoublicateDefs :: XmlFilter :: XmlFiltertransform :: XmlFilter :: XmlFiltergetDTDSubset :: XmlFilter :: XmlFilterSourcevalidate :: XmlFilter :: XmlFilterSourcevalidateDTD :: XmlFilter :: XmlFilterSourcevalidateDoc :: XmlFilter :: XmlFilterSourceremoveDoublicateDefs :: XmlFilter :: XmlFilterSourcetransform :: XmlFilter :: XmlFilterSource hxt-filter-8.2.0: A collection of tools for processing XML with Haskell (Filter variant).hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant).Source codeRE String -> XmlTrees -> -> XmlTrees -> RE StringRE String -> XmlTrees -> -> XmlTrees -> RE Stringhxt-filter-8.2.0: A collection of tools for processing XML with Haskell (Filter variant). (Index)hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant). (Index) hxt-filter-8.2.0: A collection of tools for processing XML with Haskell (Filter variant).hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant).Contents$$Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.Parser$$<Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.Parser+++Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.Parser+++>>Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.Parser..>Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.Parser.>Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.Parser.>>Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.Parser/>Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.Parser:->Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.Parser</Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParseraddEntriesText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParseraddEntryText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParseraNameText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserAssocListText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserATTLISTText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserAttributesText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserAttrNameText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserattrNodesText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.Parsera_no_empty_elementsText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.Parsera_no_xml_piText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.Parsera_strict_inputText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.Parsera_tagsoupText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserbuildUniversalNameText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsercardNTreeText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsercardTreeText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsercatText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsercatMText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserchangeChildrenText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserchangeNodeText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserChildNodesText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserchildNodesText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserchoiceText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserchoiceMText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserCONDSECTText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsercontainingText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsercontainingMText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserCONTENTText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.Parserc_errText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.Parserc_fatalText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.Parserc_okText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.Parserc_warnText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserdeepText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserdeepestText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserdelEntriesText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserdelEntryText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserdepthNTreeText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserdepthTreeText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserDOCTYPEText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserDTDElemText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserELEMENTText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserENTITYText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserequalQNameText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserequalQNameByText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserequivQNameText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserequivUriText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserfoldNTreeText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserfoldTreeText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserformatNTreeText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserformatNTreeFText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserformatTreeText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsergetChildrenText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsergetNodeText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserguardsText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserguardsMText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserhasEntryText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParseriffText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserifMText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserIfThenText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserinsertChildrenAfterText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserinsertChildrenAtText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserisDeclaredNamespaceText.XML.HXT.DOM.NamespaceFilter, Text.XML.HXT.DOM.Namespace, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserisInnerText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserisLeafText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserisNameSpaceNameText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserisNCNameText.XML.HXT.DOM.NamespaceFilter, Text.XML.HXT.DOM.Namespace, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserisNullXNameText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.Parseriso8859_1Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserisOfText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserisOfNodeText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserisWellformedNameSpaceNameText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserisWellformedNSDeclText.XML.HXT.DOM.NamespaceFilter, Text.XML.HXT.DOM.Namespace, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserisWellformedQNameText.XML.HXT.DOM.NamespaceFilter, Text.XML.HXT.DOM.Namespace, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserisWellformedQualifiedNameText.XML.HXT.DOM.NamespaceFilter, Text.XML.HXT.DOM.Namespace, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserliftMfText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserlocalPartText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserlocalPart'Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserlocalPartOflookup1Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserlookupDefText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsermapNTreeText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsermkLeafText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsermkNameText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsermkNodeText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsermkNsNameText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsermkNTreeText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsermkPrefixLocalPartText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsermkQNameText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsermkQName'Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsermkQTagmkSNsNameText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsermkTreeText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsermodifyChildrenText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsermodifyNodeText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsermodifyNode0Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsermultiText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserNAMEText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsernamePrefixText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsernamePrefix'Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsernamesText.XML.HXT.Parser.XmlParser, Text.XML.HXT.ParsernamespaceUriText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsernamespaceUri'Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsernameTText.XML.HXT.Parser.XmlParser, Text.XML.HXT.ParsernegText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsernewXNameText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsernmtokenText.XML.HXT.Parser.XmlParser, Text.XML.HXT.ParsernodesTreeText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsernoneText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsernoneMText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsernormalizeNsUriText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserNOTATIONText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsernotContainingText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserNsEnvText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.Parser1 (Type/Class)1 (Data Constructor)Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.Parser2 (Data Constructor)2 (Type/Class)Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserNTreesText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsernTreeToListText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsernullQNamenullXNameText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParseroText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserorElseText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserPENTITYText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserPEREFText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserperformActionText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserprocessBottomUpText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserprocessBottomUpIfNotText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserprocessBottomUpMText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserprocessChildrenText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserprocessChildrenMText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserprocessTopDownText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserprocessTopDownMText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserprocessTopDownUntilText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserQNameText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserqualifiedNameText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserreplaceChildrenText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserreplaceNodeText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsersatisfiesText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserseqFText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserseqMText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsersetChildrenText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsersetLocalPart'Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsersetNamePrefix'Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsersetNamespaceText.XML.HXT.DOM.NamespaceFilter, Text.XML.HXT.DOM.Namespace, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsersetNamespaceUri'Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsersetNodeText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsersubstChildrenText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserTagNameText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserTFilterText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserthisText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserthisMText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserthisNodeText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsertNameText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsertoNsEnvText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParsertoTreelTreeText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserTSFilterText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParseruniversalNameText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParseruniversalUriText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserwhenText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserwhenMText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserwhenNotText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserwhenNotMText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserData.Tree.NTree.Filter, Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserXAttrText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserXCdataText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserXCharRefText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserXCmtText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserXDTDText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserXEntityRefText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserXErrorText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserXmlFilterText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserxmlNamespaceXNameText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserXmlNodeSetText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserxmlnsNamespaceXNameText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserxmlnsQNText.XML.HXT.DOM.NamespaceFilter, Text.XML.HXT.DOM.Namespace, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserxmlnsXNameText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserXmlSFilterText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserXmlTreeText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserXmlTreesText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserxmlXNameText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserXNameText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserXNodeText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserXNSText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserXPiText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserXTagText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserXTextText.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.ParserText.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM, Text.XML.HXT.Parserhxt-filter-8.2.0: A collection of tools for processing XML with Haskell (Filter variant).hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant). hxt-filter-8.2.0: A collection of tools for processing XML with Haskell (Filter variant).hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant).Contentshxt-filter-8.2.0: A collection of tools for processing XML with Haskell (Filter variant).hxt-filter-8.3.0: A collection of tools for processing XML with Haskell (Filter variant).show/hideSystemData
    show/hideTree
    show/hideNTree
    Data.Tree.NTree.Filter
    show/hideSystem
    System.PipeOpen
    show/hideshow/hideText
    show/hideshow/hideXML
    show/hideshow/hideHXT
    show/hideshow/hideText.XML.HXT.DOM
    Text.XML.HXT.DOM.XmlTreeTypes
    show/hideshow/hideText.XML.HXT.Parser
    show/hideshow/hideValidator
    + + + +Haskell Code by HsColour + + + +
    -- ------------------------------------------------------------
+
+{- |
+   Module     : Data.Tree.NTree.Filter
+   Copyright  : Copyright (C) 2005 Uwe Schmidt
+   License    : MIT
+
+   Maintainer : Uwe Schmidt (uwe\@fh-wedel.de)
+   Stability  : stable
+   Portability: portable
+
+   Filter for n-ary tree structure with filter combinators
+   copied and modified from HaXml (<http://www.cs.york.ac.uk/fp/HaXml/>)
+
+   Similar but more flexible functions for tree processing are defined in the
+   arrow classes "Control.Arrow.ArrowList", "Control.Arrow.ArrowIf", "Control.Arrow.ArrowTree" and "Control.Arrow.ArrowState".
+   For new applications, especially for XML processing, it's recommended to use the arrow interface
+   "Text.XML.HXT.Arrow" instead of this filter approach as part of the api "Text.XML.HXT.Parser"
+
+-}
+
+-- ------------------------------------------------------------
+
+module Data.Tree.NTree.Filter
+    ( module Data.Tree.NTree.TypeDefs
+    , TFilter
+    , TSFilter
+    , satisfies
+
+    -- * Filter
+    , none		-- simple filter
+    , this
+
+    , isOf
+    , isOfNode		-- predicate filter
+
+    , mkNTree		-- contructor filter
+
+    , replaceNode	-- simple editing
+    , replaceChildren
+
+    , modifyNode
+    , modifyNode0
+    , modifyChildren
+    , substChildren
+    , processChildren	-- filter combinators
+
+    , o
+    , (.>)
+    , seqF
+    , (..>)
+    , (+++)
+    , cat
+
+    , orElse		-- choices
+    , iff		-- if then else filter
+    , choice
+    , IfThen(..)
+    , when
+    , whenNot
+    , guards
+    , neg		-- negation
+    , containing	-- previous: with, but with is keyword in haskell extensions
+    , notContaining	-- previous: without
+
+    , (/>)		-- selectors
+    , (</)
+    , deep		-- recursive search
+    , deepest
+    , multi
+    , processBottomUp	-- recursive editing
+    , processBottomUpIfNot
+    , processTopDown
+    , processTopDownUntil
+    , insertChildrenAt
+    , insertChildrenAfter
+
+      -- * Monadic Filter
+    , thisM		-- monadic filter
+    , noneM
+    , (.>>)		-- monadic composition
+    , seqM		-- generalisation of .>>
+    , (+++>>)		-- monadic parallel combination, monadic +++
+    , catM		-- monadic form of cat
+    , ifM		-- monadic if then else
+    , choiceM		-- monadic choice
+    , whenM		-- special monadic ifs
+    , whenNotM
+    , guardsM
+    , containingM
+    , processChildrenM	-- monadic versions of recursive editing
+    , processTopDownM
+    , processBottomUpM
+    , liftMf		-- lift a normal filter to a monadic filter
+    , ($$)		-- apply a filter to a list
+    , ($$<)		-- apply a monad filter to a list
+    , performAction	-- run a command within a filter
+    )
+
+where
+
+
+import Data.Tree.NTree.TypeDefs
+
+infixl 6 `containing`, `notContaining`, `containingM`
+infixr 5 `o`, +++, +++>>
+infixl 5 />, </, `orElse`, .>, ..>, .>>
+infixr 4 `when`, `whenNot`, `guards`, `whenM`, `whenNotM`, `guardsM`
+infixr 3 :->
+infixr 0 $$, $$<
+
+-- |
+-- tree filter type: a function mapping a tree onto a list of trees
+--
+-- filter can be used in various ways, as predicates, selectors, transformers, ...
+
+type TFilter  node	= NTree  node -> NTrees node
+
+-- |
+-- a filter for sequences
+
+type TSFilter node	= NTrees node -> NTrees node
+
+-- ------------------------------------------------------------
+
+-- |
+-- satisfies converts a result of a predicate filter into a boolean
+--
+-- is a shortcut for not . null
+--
+-- typical use in guards or ifs: @if (satisfies f) t then ... else ... @
+--
+--    * 1.parameter f :  the predicate filter
+--
+--    - 2.parameter t :  the tree to be tested
+--
+--    - returns : @b = not (null (f t))@
+
+satisfies	:: (a -> [b]) -> a -> Bool
+satisfies f	= not . null . f
+
+-- ------------------------------------------------------------
+--
+-- simple filter
+
+-- |
+-- the null filter, returns the empty list
+
+none		:: a -> [b]
+none _		= []
+
+-- |
+-- the unit filter, returns the single element list containing the argument
+
+this		:: a -> [a]
+this n		= [n]
+
+-- ------------------------------------------------------------
+--
+-- selecting filter
+
+-- |
+-- conversion from predicate function to filter
+--
+--    * 1.parameter p :  the predicate for testing the tree
+--
+--    - returns : 'this' or 'none' depending on the predicate
+
+isOf		:: (a -> Bool) -> (a -> [a])
+isOf p t
+    = if p t then [t] else []
+
+-- |
+-- select filter, selects trees with node values with a specific property
+--
+--    * 1.parameter p :  the predicate for testing the node value
+--
+--    - returns : @[]@ or @[t]@ depending on @p t@
+--
+-- a special case of 'isOf' filter
+
+isOfNode	:: (node -> Bool) -> TFilter node
+isOfNode p	= isOf (p . getNode)
+
+-- ------------------------------------------------------------
+--
+-- simple editing filters
+
+-- |
+-- filter for substituting an arbitray tree by a constant
+--
+--    * 1.parameter t :  the result tree, the input tree is ignored
+--
+--    - returns : the filter
+
+mkNTree		:: NTree node -> TFilter node
+mkNTree t	= const [t]
+
+-- |
+-- filter for replacing the node
+--
+--    * 1.parameter n :  the new node
+--
+--    - returns : the editing filter
+
+replaceNode	:: node -> TFilter node
+replaceNode n (NTree _ cs)
+    = [NTree n cs]
+
+-- |
+-- filter for replacing the children
+--
+--    * 1.parameter cs :  cs the list of children
+--
+--    - returns : the filter
+
+replaceChildren	:: NTrees node -> TFilter node
+replaceChildren cs (NTree n _)
+    = [NTree n cs]
+
+modifyNode	:: (node -> Maybe node) -> TFilter node
+modifyNode tf (NTree n cs)
+    = maybe [] (\ n' -> [NTree n' cs]) (tf n)
+
+-- |
+-- filter for editing the node
+--
+--    * 1.parameter nf :  the XNode editing funtion
+--
+--    - returns : the filter
+
+modifyNode0	:: (node -> node) -> TFilter node
+modifyNode0 tf	= modifyNode (Just . tf)
+
+-- |
+-- filter for editing the children
+--
+-- all children are processed with a filter mapping lists to lists,
+-- this enables not only elementwise editing by lifting a normal
+-- filter to a list filter with @(f $$)@ (see '($$)') but also manipulation
+-- of the order of the elements, e.g. "reverse" is an appropriate childen
+-- editing function.
+--
+--    * 1.parameter csf :  the children editing function
+--
+--    - returns : the filter
+--
+-- see also : 'processChildren'
+
+modifyChildren	:: TSFilter node -> TFilter node
+modifyChildren f -- (NTree n cs)
+    -- = [NTree n (f cs)]
+    = substChildren (f . getChildren)
+
+-- |
+-- filter for substituting the children of a tree by
+-- a new list of childen computed by applying a filter to the input tree.
+-- 'modifyChildren' can be expressed by 'substChildren':
+-- @modifyChildren f t@ is equal to @substChildren (f . getChildren)@
+
+substChildren	:: TFilter node -> TFilter node
+substChildren f t@(NTree n _cs)
+    = [NTree n (f t)]
+
+-- ------------------------------------------------------------
+--
+-- combinators (copied from HaXml)
+--
+
+-- |
+-- sequential composition of filters, usually written in infix notation f2 `o` f1.
+--
+-- for predicate filter the logical AND
+--
+--    * 1.parameter f2 :  the 2. filter
+--
+--    - 2.parameter f1 :  the 1. filter
+--
+--    - returns : the fiter applying first f1 to n and then f2 to the result (like function composition)
+
+o		:: (a -> [b]) -> (c -> [a]) -> (c -> [b])
+f `o` g		= concatMap f . g
+
+-- |
+-- pronounced \"followed by\", defined as: @f .> g = g \`o\` f@.
+--
+-- allows filter composition in a more readable way from left to right
+--
+--    * 1.parameter f1 :  the 1. filter
+--
+--    - 2.parameter f2 :  the 2. filter
+--
+--    - returns : the composition of f1 and f2
+--
+-- see also : 'o', '(..>)'
+
+(.>)		:: (a -> [b]) -> (b -> [c]) -> (a -> [c])
+f .> g		= g `o` f
+
+-- |
+-- apply a list of filters sequentially with '(.>)', for predicate filters the generalized AND
+--
+-- see also : '(.>)'
+
+seqF		:: [a -> [a]] -> (a -> [a])
+seqF		= foldl (.>) this
+
+-- |
+-- binary parallel composition, the logical OR for predicate filter
+--
+--    * 1.parameter f1 :  the 1. filter
+--
+--    - 2.parameter f2 :  the 2. filter
+--
+--    - returns : the filter for applying f1 and f2 both to an argument tree and concatenating the results
+
+(+++)		:: (a -> [b]) -> (a -> [b]) -> (a -> [b])
+f +++ g		= \ t -> f t ++ g t
+
+-- |
+-- special sequential composition.
+--
+-- filter f is applied to an argument t.
+-- then filter g is applied to all elements of the result list,
+-- but the argument t is also passed as extra parameter to g.
+--
+-- This allows for step by step transformations of a tree
+-- with access to the original tree in every
+-- transformation step.
+--
+-- see also : '(.>)', 'o'
+
+(..>)		:: (a -> [b]) -> (a -> b -> [d]) -> (a -> [d])
+f ..> g		= \ t -> (g t `o` f) t
+
+-- |
+-- apply a list of filters, a \"union\" for lists, for predicate filters the generalized OR
+--
+--    * 1.parameter fs :  the list of filters
+--
+--    - returns : the composing filter
+
+cat		:: [a -> [b]] -> (a -> [b])
+cat fs  t
+    = concat [ f t | f <- fs ]
+
+-- |
+-- Filter for editing the children of a tree element wise
+--
+--    * 1.parameter cf :  the filter applied to the children
+--
+--    - returns : the editing filter
+--
+-- see also : 'modifyChildren'
+
+processChildren	:: TFilter node -> TFilter node
+processChildren ft (NTree n cs)
+    = [NTree n (ft $$ cs)]
+
+-- |
+-- infix operator for applying a filter to a list of trees
+--
+--    * 1.parameter f :  the filter
+--
+--    - 2.parameter ts :  the list of trees
+--
+--    - returns : the concatenated list of results
+
+($$)		:: (a -> [b]) -> [a] -> [b]
+f $$ l
+    = concatMap f l
+
+-- ------------------------------------------------------------
+--
+-- choices
+--
+
+-- |
+-- directional choice, usually written in infix notation as f `orElse` g
+--
+--    * 1.parameter f :  the 1. filter
+--
+--    - 2.parameter g :  the 2. filter
+--
+--    - 3.parameter t :  the tree
+--
+--    - returns : the filter, that applies f to t, if the result is not the empty list, the result is found, else g t is the result
+
+orElse		:: (a -> [b]) -> (a -> [b]) -> (a -> [b])
+f `orElse` g
+    = \ t-> let
+	    res = f t
+	    in
+	    if null res
+	    then g t
+	    else res
+
+-- |
+-- if then else lifted to filters
+--
+--    * 1.parameter p :  the predicate filter
+--
+--    - 2.parameter t :  the \"then\" filter
+--
+--    - 3.parameter e :  the \"else\" filter
+--
+--    - returns : the resulting conditional filter
+
+iff		:: (a -> [c]) -> (a -> [b]) -> (a -> [b]) -> (a -> [b])
+iff p f g	= \ c -> if (satisfies p) c then f c else g c
+
+-- |
+-- when the predicate p holds, f is applied, else the identity filter this
+--
+--    * 1.parameter f :  the conditinally applied filter
+--
+--    - 2.parameter p :  the predicate
+--
+--    - returns : the conditional filter
+--
+-- see also : 'iff', 'whenNot', 'guards', 'whenM'
+
+when		:: (a -> [a]) -> (a -> [a]) -> (a -> [a])
+f `when` g	= iff g f this
+
+-- |
+-- the complementary filter of when
+--
+-- shortcut for f `when` neg g
+--
+-- see also : 'iff', 'when', 'whenNotM', 'neg'
+
+whenNot		:: (a -> [a]) -> (a -> [a]) -> (a -> [a])
+f `whenNot` g	= iff g this f
+
+-- |
+-- when the predicate p holds, f is applied, else the null filter none
+--
+--    * 1.parameter p :  the predicate filter
+--
+--    - 2.parameter f :  the conditionally applied filter
+--
+--    - returns : the conditional filter
+--
+-- see also : 'iff', 'when', 'guardsM'
+
+guards		:: (a -> [b]) -> (a -> [b]) -> (a -> [b])
+g `guards` f	= iff g f none
+
+
+-- |
+-- negation lifted to filters
+--
+--    * 1.parameter f :  the predicate filter
+--
+--    - returns : the filter, that succeeds, when f failed
+
+neg		:: (a -> [c]) -> a -> [a]
+neg f		= iff f none this
+
+-- |
+-- auxiliary datatype for cases within choice filter
+
+data IfThen a b = a :-> b
+
+-- |
+-- multiway branch. The list of cases @f :-> g@ is processed sequentially,
+-- in the first case for that f holds g is applied, if no case matches, 'none' is
+-- applied.
+-- This filter can be used like a case expression: @choice [ p1 :-> f1, p2 :-> f2, ... , this :-> defaultFilter]@
+--
+-- see also : 'iff', 'choiceM'
+
+choice	:: [IfThen (a -> [c]) (a -> [b])] -> (a -> [b])
+choice []
+    = none
+
+choice ((g :-> f) : cs)
+    = iff g f (choice cs)
+
+-- |
+-- pruning: keep only those results from f for which g holds, usually written in infix notation as f `containing` g
+--
+--    * 1.parameter f :  the processing filter
+--
+--    - 2.parameter g :  the predicate filter
+--
+--    - 3.parameter t :  the tree
+--
+--    - returns : all trees r from f t, for which g r holds (is not the empty list)
+--
+-- see also : 'notContaining'
+
+containing		:: (a -> [b]) -> (b -> [c]) -> a -> [b]
+f `containing` g
+    = filter (satisfies g) . f
+
+-- |
+-- pruning: keep only those results from f for which g does not hold
+--
+-- see also : 'containing'
+
+notContaining		:: (a -> [b]) -> (b -> [c]) -> a -> [b]
+f `notContaining` g
+    = filter (null . g) . f
+
+-- |
+-- pruning: monadic version of containing, usually written in infix notation as f `containingM` g
+--
+--    * 1.parameter f :  the monadic processing filter
+--
+--    - 2.parameter g :  the predicate filter
+--
+--    - 3.parameter t :  the tree
+--
+--    - returns : all trees r from f t, for which g r holds (is not the empty list)
+--
+-- see also : 'notContaining'
+
+containingM		:: Monad m => (a -> m [b]) -> (b -> [c]) -> a -> m [b]
+f `containingM` g
+    = \ t -> do
+             res <- f t
+             return $ filter (satisfies g) res
+
+-- |
+-- pronounced \"slash\", meaning g inside f
+
+(/>)		:: TFilter node -> TFilter node -> TFilter node
+f /> g
+    = g `o` getChildren `o` f
+
+-- |
+-- pronounced \"outside\" meaning f containing g
+
+(</)		:: TFilter node -> TFilter node -> TFilter node
+f </ g
+    = f `containing` (g `o` getChildren)
+
+-- ------------------------------------------------------------
+--
+-- recursive search filters
+
+-- |
+-- top down search.
+--
+-- search terminates, when filter f succeeds
+-- can e.g. be used for finding all outermost tag node of a specific kind
+
+deep		:: TFilter node -> TFilter node
+deep f
+    = f `orElse` (deep f `o` getChildren)
+
+-- |
+-- bottom up search.
+--
+-- first the children are processed,
+-- if this does not succeed, the node itself is processed
+-- can e.g. be used for finding all innermost tag nodes of a specific kind
+
+deepest		:: TFilter node -> TFilter node
+deepest f
+    = (getChildren .> deepest f) `orElse` f
+
+-- |
+-- process all nodes of the whole tree.
+--
+-- can e.g. be used for finding all nodes of a specific kind
+
+multi		:: TFilter node -> TFilter node
+multi f
+    = f +++ (getChildren .> multi f)
+
+-- ------------------------------------------------------------
+--
+-- recursive transformation filters
+--
+
+-- |
+-- bottom up transformation
+--
+--    * 1.parameter f :  the /simple/ transforming filter
+--
+--    - returns : the filter that applies f to all subtrees and the tree itself in a deepth first left to right manner
+--
+-- see also : 'processTopDown', 'processBottomUpIfNot'
+
+processBottomUp	:: TFilter node -> TFilter node
+processBottomUp f
+    = processChildren (processBottomUp f) .> f
+
+-- |
+-- top down transformation
+--
+--    * 1.parameter f :  the /simple/ transforming filter
+--
+--    - returns : the filter that applies f first to the tree and then recursively to all subtrees of the result
+--
+-- see also : 'processBottomUp'
+
+processTopDown	:: TFilter node -> TFilter node
+processTopDown f
+    = f .> processChildren (processTopDown f)
+
+-- |
+-- guarded bottom up transformation, stops at subtrees for which a predicate p holds
+--
+--    * 1.parameter f :  the transforming filter
+--
+--    - 2.parameter p :  the predicate filter for the guard
+--
+--    - returns : the filter for processing all (sub-)trees
+--
+-- see also : 'processBottomUp'
+
+processBottomUpIfNot	:: TFilter node -> TFilter node -> TFilter node
+processBottomUpIfNot f p
+    = (processChildren (processBottomUpIfNot f p) .> f) `whenNot` p
+
+-- |
+-- top down transformation until a node to be transformed is found
+--
+--    * 1.parameter f :  the /simple/ transforming filter
+--
+--    - returns : the filter that applies f first to the tree and, if the filter does not succeed,
+--		  recursively to all children of the input tree.
+--
+-- Example:
+--
+-- @processTopDownUntil none@
+--
+-- is the identity filter (maybe a bit more inefficient).
+--
+-- Example:
+--
+-- @processTopDownUntil (add1Attr \"border\" \"2\" \`containing\` isTag \"table\")@
+--
+-- is a filter for adding an attribute border=\"2\" in all top level table tags.
+--		  The content of table tags will remain unchanged.
+--
+-- see also : 'processTopDown', 'processBottomUp'
+
+processTopDownUntil	:: TFilter node -> TFilter node
+processTopDownUntil f t
+    | null res
+	= processChildren (processTopDownUntil f) t
+    | otherwise
+	= res
+    where
+    res = f t
+
+-- ------------------------------------------------------------
+--
+
+-- |
+-- insertion of trees into the list of children at a given position
+--
+-- useful for inserting something into the list of children at a given position
+-- the list of children is split with the @splitAt@ function
+-- the nodes are inserted between these two sublists.
+--
+-- examples: @insertChildrenAt 0 ins t@ inserts all elements computed with @ins t@ in front
+-- of the childen of @t@, @insertChildrenAt 1 ins t@ behind the first child
+--
+-- see also: 'insertChildrenAfter'
+
+
+insertChildrenAt	:: Int -> TFilter node -> TFilter node
+insertChildrenAt i ins t
+    = replaceChildren (cl1 ++ ins t ++ cl2) t
+    where
+    (cl1, cl2) = splitAt i $ getChildren t
+
+-- |
+-- insertion of trees into the list of children after specific elements
+--
+-- useful for inserting something into the list of children of a node
+-- the list of children is split with the @span@ function and the filter p as predicate
+-- the nodes are inserted between these two sublists
+--
+-- examples: @insertChildrenAfter none ins t@ inserts all elements computed with @ins t@ in front
+-- of the childen of @t@, @insertChildrenAfter this ins t@ appends the elements to the children
+--
+-- see also: 'insertChildrenAt'
+
+insertChildrenAfter	:: TFilter node -> TFilter node -> TFilter node
+insertChildrenAfter p ins t
+    = replaceChildren (cl1 ++ ins t ++ cl2) t
+    where
+    (cl1, cl2) = span (not . null . p) $ getChildren t
+
+-- ------------------------------------------------------------
+--
+-- monadic filter
+
+-- |
+-- the monadic version of the identity filter this.
+--
+-- see also : 'this'
+
+thisM		:: Monad m => (a -> m [a])
+thisM		= liftMf this
+
+-- |
+-- the monadic version of the null filter none.
+--
+-- see also : 'none'
+
+noneM		:: Monad m => (a -> m [b])
+noneM		= liftMf none
+
+-- |
+-- sequential composition of monadic filters, monadic version of \".>\".
+--
+--    * 1.parameter f1 :  the 1. monadic filter
+--
+--    - 2.parameter f2 :  the 2. monadic filter
+--
+--    - returns : the monadic fiter applying first f1 to n and then f2 to the result (like function composition)
+--
+-- see also : '(.>)'
+
+(.>>)	:: Monad m => (a -> m[b]) -> (b -> m [c]) -> (a -> m[c])
+cmd1 .>> cmd2
+    = \ t ->
+      do
+      r1 <- cmd1 t
+      r2 <- mapM cmd2 r1
+      return (concat r2)
+
+-- |
+-- generalized sequential composition of monadic filters
+
+seqM	:: Monad m => [a -> m[a]] -> (a -> m[a])
+seqM
+    = foldr (.>>) thisM
+
+-- |
+-- binary parallel composition, the logical OR for predicate filter
+--
+--    * 1.parameter f1 :  the 1. filter
+--
+--    - 2.parameter f2 :  the 2. filter
+--
+--    - returns : the filter for applying f1 and f2 both to an argument tree and concatenating the results
+-- see also: 'cat', '+++', 'catM'
+
+(+++>>)		:: Monad m => (a -> m [b]) -> (a -> m [b]) -> (a -> m [b])
+f +++>> g	= \ t -> do
+			 r1 <- f t
+			 r2 <- g t
+			 return (r1 ++ r2)
+
+-- |
+-- apply a list of monadic filters
+--
+--    * 1.parameter fs :  the list of filters
+--
+--    - returns : the composing filter
+-- see also: 'cat', '+++', '+++>>'
+
+catM	:: Monad m => [a -> m [b]] -> (a -> m [b])
+catM fs  t
+    = do
+      res <- sequence (map ($ t) fs)
+      return $ concat res
+
+-- |
+-- monadic if-then-else.
+--
+--    * 1.parameter p :  the predicate
+--
+--    - 2.parameter thenP :  the then part: the monadic filter, that is applied if p holds for the input tree
+--
+--    - 3.parameter elseP :  the else part
+--
+--    - returns : the monadic filter for the conditional
+
+ifM		:: Monad m => (a -> [b]) -> (a -> m [c]) -> (a -> m [c]) -> (a -> m [c])
+ifM p thenPart elsePart
+    = \ t ->
+      if (satisfies p) t
+      then thenPart t
+      else elsePart t
+
+-- |
+-- monadic version of multiway branch. The list of cases @f :-> g@ is processed sequentially,
+-- in the first case for that f holds g is applied, if no case matches, 'noneM' is
+-- applied.
+-- This filter can be used like a case expression: @choiceM [ p1 :-> f1, p2 :-> f2, ... , thisM :-> defaultFilter]@
+--
+-- see also : 'choice', 'ifM'
+
+choiceM		:: Monad m => [IfThen (a -> [c]) (a -> m [b])] -> (a -> m [b])
+choiceM []
+    = noneM
+
+choiceM ((g :-> f) : cs)
+    = ifM g f (choiceM cs)
+
+
+-- |
+-- when the predicate p holds, the monadic filter f is applied, else the identity filter.
+--
+--    * 1.parameter f :  the conditinally applied monadic filter
+--
+--    - 2.parameter p :  the simple predicate
+--
+--    - returns : the conditional filter
+--
+-- see also : 'ifM', 'when', 'guardsM', 'whenNotM'
+
+whenM		:: Monad m => (a -> m [a]) -> (a -> [b]) -> (a -> m [a])
+f `whenM` g	= ifM g f thisM
+
+-- |
+-- the complementary filter of whenM.
+--
+-- see also : 'ifM', 'whenM', 'whenNot'
+
+whenNotM	:: Monad m => (a -> m [a]) -> (a -> [b]) -> (a -> m [a])
+f `whenNotM` g	= ifM g thisM f
+
+-- |
+-- when the predicate p holds, the monadic filter f is applied, else the null filter.
+--
+--    * 1.parameter p :  the simple predicate filter
+--
+--    - 2.parameter f :  the conditionally applied monadic filter
+--
+--    - returns : the conditional filter
+--
+-- see also : 'ifM', 'guards', 'whenM'
+
+guardsM		:: Monad m => (a -> [b]) -> (a -> m [c]) -> (a -> m [c])
+g `guardsM` f	= ifM g f noneM
+
+-- |
+-- Filter for editing the children of a tree with a monadic filter
+--
+--    * 1.parameter cf :  the monadic filter applied to the children
+--
+--    - returns : the monadic editing filter
+--
+-- see also : 'processChildren'
+
+processChildrenM	:: Monad m => (NTree node -> m [NTree node]) -> (NTree node -> m [NTree node])
+processChildrenM ft (NTree n cs)
+    = do
+      res <- ft $$< cs
+      return [NTree n res]
+
+-- |
+-- monadic variant of 'processTopDown'
+
+processTopDownM		:: Monad m => (NTree node -> m [NTree node]) -> (NTree node -> m [NTree node])
+processTopDownM f
+    = f .>> processChildrenM (processTopDownM f)
+
+-- |
+-- monadic variant of 'processBottomUp'
+
+processBottomUpM	:: Monad m => (NTree node -> m [NTree node]) -> (NTree node -> m [NTree node])
+processBottomUpM f
+    = processChildrenM (processBottomUpM f) .>> f
+
+-- |
+-- infix operator for applying a monadic filter to a list of trees,
+-- typically used in do-notation for processing of intermediate results.
+--
+--    * 1.parameter f :  the monadic filter
+--
+--    - 2.parameter ts :  the list of trees
+--
+--    - returns : the concatenated list of results
+--
+-- see also : '($$)'
+
+($$<)	:: Monad m => (a -> m [b]) -> [a] -> m [b]
+cmd $$< l
+    = do
+      r <- mapM cmd l
+      return (concat r)
+
+-- |
+-- lift a filter to a monadic filter
+--
+--    * 1.parameter f :  the /simple/ filter
+--
+--    - returns : the lifted monadic version
+
+liftMf	:: Monad m => (a -> [b]) -> a -> m [b]
+liftMf f t
+    = return (f t)
+
+-- |
+-- run an arbitray command on a tree t and return the tree,
+-- used for inserting arbitray commands in a filter pipeline
+--
+--    * 1.parameter cmd :  the command
+--
+--    - 2.parameter t :  the argument tree
+--
+--    - returns : the unchanged tree as a single element list
+
+performAction	:: Monad m => (a -> m b) -> a -> m [a]
+performAction cmd t
+    = do
+      cmd t
+      return [t]
+
+-- eof ------------------------------------------------------------
+
    + diff --git a/doc/hxt-filter/src/Text-XML-HXT-DOM-NamespaceFilter.html b/doc/hxt-filter/src/Text-XML-HXT-DOM-NamespaceFilter.html --- a/doc/hxt-filter/src/Text-XML-HXT-DOM-NamespaceFilter.html +++ b/doc/hxt-filter/src/Text-XML-HXT-DOM-NamespaceFilter.html @@ -24,211 +24,208 @@ module Text.XML.HXT.DOM.NamespaceFilter ( module Text.XML.HXT.DOM.NamespaceFilter - , module Text.XML.HXT.DOM.NamespacePredicates - ) -where - -import Text.XML.HXT.DOM.XmlTree - -import Text.XML.HXT.DOM.NamespacePredicates + ) +where + +import Text.XML.HXT.DOM.XmlTree + +import Text.XML.HXT.DOM.Util + ( doubles ) -import Text.XML.HXT.DOM.Util - ( doubles ) +-- ----------------------------------------------------------------------------- +-- --- ----------------------------------------------------------------------------- --- - --- | --- Type for the namespace association list, used when propagating namespaces by --- modifying the 'QName' values in a tree - -type NamespaceTable = NsEnv - --- ----------------------------------------------------------------------------- - --- | --- propagate all namespace declarations \"xmlns:ns=...\" to all --- tag and attribute nodes of a document. +-- | +-- Type for the namespace association list, used when propagating namespaces by +-- modifying the 'QName' values in a tree + +type NamespaceTable = NsEnv + +-- ----------------------------------------------------------------------------- + +-- | +-- propagate all namespace declarations \"xmlns:ns=...\" to all +-- tag and attribute nodes of a document. +-- +-- This filter does not check for illegal use of namespaces. +-- The real work is done by 'propagateNamespaceEnv'. -- --- This filter does not check for illegal use of namespaces. --- The real work is done by 'propagateNamespaceEnv'. --- --- The filter may be applied repeatedly if neccessary. +-- The filter may be applied repeatedly if neccessary. + +propagateNamespaces :: XmlFilter +propagateNamespaces = propagateNamespaceEnv $ toNsEnv [ (a_xml, xmlNamespace), (a_xmlns, xmlnsNamespace) ] -propagateNamespaces :: XmlFilter -propagateNamespaces = propagateNamespaceEnv [ (a_xml, xmlNamespace), (a_xmlns, xmlnsNamespace) ] - --- | --- attaches the namespace info given by the namespace table --- to a tag node and its attributes and children. - -propagateNamespaceEnv :: NamespaceTable -> XmlFilter -propagateNamespaceEnv env n - = ( ( processAttr (attachNamespaceUrisToAttr newEnv) - .> - processChildren (propagateNamespaceEnv newEnv) - .> - modifyQName (setNamespace newEnv) - ) - `when` - isXTag - ) - $ n - where - nsAttrs = getAttrl -- scan all attributes - .> - isOfAttr ( (\ (px, lp) - -> (px == a_xmlns -- check for prefix or whole name is "xmlns" - && - lp /= ":" -- check for none empty local part, "xmlns:" is not a legal name - ) - ) - . span (/= ':') -- break the name into a pair ("prefix", ":localPart") - . qualifiedName -- select attribute name - ) - $ n - nsDecl = zip (map (drop 1 -- drop the ":", empty local part represents default name space - . snd -- take the local part with leading ":" - . span (/= ':') -- break it like above - . nameOf -- select attribute name - ) nsAttrs) - (map (xshow - . - getChildren - ) nsAttrs) - newEnv = addEntries nsDecl env - - attachNamespaceUrisToAttr :: NamespaceTable -> XmlFilter - attachNamespaceUrisToAttr attrEnv - = ( isOfAttr ( (\ (px, lp) - -> ( (not . null . drop 1) lp -- prefix and local part must not be empty - && - (not . null) px - ) - ) - . span (/= ':') -- break the name into a pair ("prefix", ":localPart") - . qualifiedName -- select attribute name - ) - `guards` - modifyQName (setNamespace attrEnv) - ) - `orElse` - ( modifyQName (const xmlnsQN) -- "xmlns" ist the only attr name without prefix but with an associated namespace URI - `when` - isAttr a_xmlns - ) - --- ----------------------------------------------------------------------------- - --- | --- validate the namespace constraints in a whole tree. --- result is the list of errors concerning namespaces. --- Work is done by applying 'validate1Namespaces' to all nodes. --- Predicates 'isWellformedQName', 'isWellformedQualifiedName', 'isDeclaredNamespace' --- and 'isWellformedNSDecl' are applied to the appropriate tags and attributes. - -validateNamespaces :: XmlFilter -validateNamespaces - = choice [ isRoot - :-> getChildren .> validateNamespaces -- root is correct by definition - , this - :-> multi validate1Namespaces - ] +-- | +-- attaches the namespace info given by the namespace table +-- to a tag node and its attributes and children. + +propagateNamespaceEnv :: NamespaceTable -> XmlFilter +propagateNamespaceEnv env n + = ( ( processAttr (attachNamespaceUrisToAttr newEnv) + .> + processChildren (propagateNamespaceEnv newEnv) + .> + modifyQName (setNamespace newEnv) + ) + `when` + isXTag + ) + $ n + where + nsAttrs = getAttrl -- scan all attributes + .> + isOfAttr ( (\ (px, lp) + -> (px == a_xmlns -- check for prefix or whole name is "xmlns" + && + lp /= ":" -- check for none empty local part, "xmlns:" is not a legal name + ) + ) + . span (/= ':') -- break the name into a pair ("prefix", ":localPart") + . qualifiedName -- select attribute name + ) + $ n + nsDecl = zip (map (drop 1 -- drop the ":", empty local part represents default name space + . snd -- take the local part with leading ":" + . span (/= ':') -- break it like above + . nameOf -- select attribute name + ) nsAttrs) + (map (xshow + . + getChildren + ) nsAttrs) + newEnv = addEntries (toNsEnv nsDecl) env + + attachNamespaceUrisToAttr :: NamespaceTable -> XmlFilter + attachNamespaceUrisToAttr attrEnv + = ( isOfAttr ( (\ (px, lp) + -> ( (not . null . drop 1) lp -- prefix and local part must not be empty + && + (not . null) px + ) + ) + . span (/= ':') -- break the name into a pair ("prefix", ":localPart") + . qualifiedName -- select attribute name + ) + `guards` + modifyQName (setNamespace attrEnv) + ) + `orElse` + ( modifyQName (const xmlnsQN) -- "xmlns" ist the only attr name without prefix but with an associated namespace URI + `when` + isAttr a_xmlns + ) + +-- ----------------------------------------------------------------------------- + +-- | +-- validate the namespace constraints in a whole tree. +-- result is the list of errors concerning namespaces. +-- Work is done by applying 'validate1Namespaces' to all nodes. +-- Predicates 'isWellformedQName', 'isWellformedQualifiedName', 'isDeclaredNamespace' +-- and 'isWellformedNSDecl' are applied to the appropriate tags and attributes. + +validateNamespaces :: XmlFilter +validateNamespaces + = choice [ isRoot + :-> getChildren .> validateNamespaces -- root is correct by definition + , this + :-> multi validate1Namespaces + ] + +-- | +-- a single node for namespace constrains. --- | --- a single node for namespace constrains. - -validate1Namespaces :: XmlFilter -validate1Namespaces - = choice [ isXTag - :-> - cat [ isOfTag ( not . isWellformedQName ) - `guards` - (\ n -> err ("tag name " ++ show (nameOf n) ++ " is not a wellformed qualified name") n ) - - , isOfTag ( not . isDeclaredNamespace ) - `guards` - (\ n -> err ("namespace for prefix in tag name " ++ show (nameOf n) ++ " is undefined") n ) - - , (\ n -> ( let - dbls = doubles ((map universalNameOf . getAttrl) n) - in - if null dbls - then none - else err ( "multiple occurences of universal names for attributes of tag " - ++ show (nameOf n) - ++ " : " ++ foldr1 (\ x y -> x ++ ", " ++ y) (map show dbls) - ) - ) $ n - ) +validate1Namespaces :: XmlFilter +validate1Namespaces + = choice [ isXTag + :-> + cat [ isOfTag ( not . isWellformedQName ) + `guards` + (\ n -> err ("tag name " ++ show (nameOf n) ++ " is not a wellformed qualified name") n ) + + , isOfTag ( not . isDeclaredNamespace ) + `guards` + (\ n -> err ("namespace for prefix in tag name " ++ show (nameOf n) ++ " is undefined") n ) + + , (\ n -> ( let + dbls = doubles ((map universalNameOf . getAttrl) n) + in + if null dbls + then none + else err ( "multiple occurences of universal names for attributes of tag " + ++ show (nameOf n) + ++ " : " ++ foldr1 (\ x y -> x ++ ", " ++ y) (map show dbls) + ) + ) $ n + ) + + , getAttrl .> validate1Namespaces + ] - , getAttrl .> validate1Namespaces - ] - - , isXAttr - :-> - cat [ isOfAttr ( not . isWellformedQName ) - `guards` - (\ n -> err ("attribute name " ++ show (nameOf n) ++ " is not a wellformed qualified name") n ) - - , isOfAttr ( not . isDeclaredNamespace ) - `guards` - (\ n -> err ("namespace for prefix in attribute name " ++ show (nameOf n) ++ " is undefined") n ) - - , ( hasPrefix a_xmlns .> neg (xmlTreesToText . getChildren) ) - `guards` - (\ n -> err ("namespace value of namespace declaration for " ++ show (nameOf n) ++ " has no value") n ) - - , isOfAttr ( not . isWellformedNSDecl ) - `guards` - (\ n -> err ("illegal namespace declaration with reserved prefix " ++ show (localPartOf n) ++ " starting with \"xml\"") n ) - ] - - , isXDTD - :-> - cat [ ( ( isDoctype +++ isAttlist +++ isElement +++ isDTDName ) - .> - isOf ( not . isWellformedQualifiedName . valueOfDTD a_name ) - ) - `guards` - (\ n -> err ("a DTD part contains a not wellformed qualified Name: " ++ show (valueOfDTD a_name n)) n ) - - , ( isAttlist - .> - isOf ( not . isWellformedQualifiedName . valueOfDTD a_value ) - ) - `guards` - (\ n -> err ("an ATTLIST declaration contains as attribute name a not wellformed qualified Name: " ++ show (valueOfDTD a_value n)) n ) - - , ( ( isEntity +++ isParameterEntity +++ isNotation ) - .> - isOf ( not . isNCName . valueOfDTD a_name ) - ) - `guards` - (\ n -> err ("an entity or notation declaration contains a not wellformed NCName: " ++ show (valueOfDTD a_name n)) n ) - ] - , isXPi - :-> - ( isOf ( not . isNCName . nameOf ) - `guards` - (\ n -> err ("a PI contains a not wellformed NCName: " ++ show (nameOf n)) n ) - ) - ] - --- ----------------------------------------------------------------------------- - -isNamespaceDecl :: XmlFilter -isNamespaceDecl - = isOfAttr xmlnsName - where - xmlnsName :: AttrName -> Bool - xmlnsName a - = px == a_xmlns - && - ( null ln || head ln == ':') - where - (px, ln) = splitAt 5 . qualifiedName $ a - --- ----------------------------------------------------------------------------- + , isXAttr + :-> + cat [ isOfAttr ( not . isWellformedQName ) + `guards` + (\ n -> err ("attribute name " ++ show (nameOf n) ++ " is not a wellformed qualified name") n ) + + , isOfAttr ( not . isDeclaredNamespace ) + `guards` + (\ n -> err ("namespace for prefix in attribute name " ++ show (nameOf n) ++ " is undefined") n ) + + , ( hasPrefix a_xmlns .> neg (xmlTreesToText . getChildren) ) + `guards` + (\ n -> err ("namespace value of namespace declaration for " ++ show (nameOf n) ++ " has no value") n ) + + , isOfAttr ( not . isWellformedNSDecl ) + `guards` + (\ n -> err ("illegal namespace declaration with reserved prefix " ++ show (localPartOf n) ++ " starting with \"xml\"") n ) + ] + + , isXDTD + :-> + cat [ ( ( isDoctype +++ isAttlist +++ isElement +++ isDTDName ) + .> + isOf ( not . isWellformedQualifiedName . valueOfDTD a_name ) + ) + `guards` + (\ n -> err ("a DTD part contains a not wellformed qualified Name: " ++ show (valueOfDTD a_name n)) n ) + + , ( isAttlist + .> + isOf ( not . isWellformedQualifiedName . valueOfDTD a_value ) + ) + `guards` + (\ n -> err ("an ATTLIST declaration contains as attribute name a not wellformed qualified Name: " ++ show (valueOfDTD a_value n)) n ) + + , ( ( isEntity +++ isParameterEntity +++ isNotation ) + .> + isOf ( not . isNCName . valueOfDTD a_name ) + ) + `guards` + (\ n -> err ("an entity or notation declaration contains a not wellformed NCName: " ++ show (valueOfDTD a_name n)) n ) + ] + , isXPi + :-> + ( isOf ( not . isNCName . nameOf ) + `guards` + (\ n -> err ("a PI contains a not wellformed NCName: " ++ show (nameOf n)) n ) + ) + ] + +-- ----------------------------------------------------------------------------- + +isNamespaceDecl :: XmlFilter +isNamespaceDecl + = isOfAttr xmlnsName + where + xmlnsName :: AttrName -> Bool + xmlnsName a + = px == a_xmlns + && + ( null ln || head ln == ':') + where + (px, ln) = splitAt 5 . qualifiedName $ a + +-- ----------------------------------------------------------------------------- diff --git a/doc/hxt-filter/src/Text-XML-HXT-DOM-XmlTreeTypes.html b/doc/hxt-filter/src/Text-XML-HXT-DOM-XmlTreeTypes.html new file mode 100644 --- /dev/null +++ b/doc/hxt-filter/src/Text-XML-HXT-DOM-XmlTreeTypes.html @@ -0,0 +1,87 @@ + + + + +Haskell Code by HsColour + + + +
    -- |
+-- exports the core data types
+-- and some additional types and functions
+-- for compatibility with none arrow modules
+--
+-- Version : $Id: XmlTreeTypes.hs,v 1.6 2006/05/09 15:30:43 hxml Exp $
+
+module Text.XML.HXT.DOM.XmlTreeTypes
+    ( module Data.Tree.NTree.Filter
+    , module Text.XML.HXT.DOM.TypeDefs
+    , module Text.XML.HXT.DOM.XmlTreeTypes
+    )
+
+where
+
+import Data.Tree.NTree.Filter
+import Text.XML.HXT.DOM.TypeDefs
+
+-- aliases for compatiblility reasons
+
+mkNode		:: node -> NTrees node -> NTree node
+mkNode		= mkTree
+
+formatNTree	:: (node -> String) -> NTree node -> String
+formatNTree	= formatTree
+
+foldNTree	:: (a -> [b] -> b) -> NTree a -> b
+foldNTree 	= foldTree
+
+mapNTree	:: (a -> b) -> NTree a -> NTree b
+mapNTree 	= fmap
+
+nTreeToList	:: NTree a -> [a]
+nTreeToList	= nodesTree
+
+depthNTree	:: NTree a -> Int
+depthNTree	= depthTree
+
+cardNTree	:: NTree a -> Int
+cardNTree	= cardNTree
+
+-- -----------------------------------------------------------------------------
+--
+-- Basic types for filters
+
+-- | A functions that takes a node and returns a list of nodes
+
+type XmlFilter	= TFilter  XNode
+
+-- | A function that takes a list of nodes and returns a list of nodes
+
+type XmlSFilter	= TSFilter XNode
+
+
+-- -----------------------------------------------------------------------------
+--
+
+-- | Tag name
+type TagName	= QName
+
+-- | Attribute name
+type AttrName	= QName
+
+-- -----------------------------------------------------------------------------
+
+-- | shortcut for 'qualifiedName'
+
+tName	:: QName -> String
+tName	= qualifiedName
+
+-- | shortcut for 'qualifiedName'
+
+aName	:: QName -> String
+aName	= qualifiedName
+
+-- -----------------------------------------------------------------------------
+
+
    + diff --git a/doc/hxt-filter/src/Text-XML-HXT-Parser-ProtocolHandlerHttpNative.html b/doc/hxt-filter/src/Text-XML-HXT-Parser-ProtocolHandlerHttpNative.html --- a/doc/hxt-filter/src/Text-XML-HXT-Parser-ProtocolHandlerHttpNative.html +++ b/doc/hxt-filter/src/Text-XML-HXT-Parser-ProtocolHandlerHttpNative.html @@ -51,109 +51,111 @@ -- -- the native http protocol handler --- ------------------------------------------------------------ --- --- the http protocol handler, haskell implementation - -getHttpContentsWithHttp :: URI -> XmlStateFilter a -getHttpContentsWithHttp uri n - = do - traceLevel <- getTraceLevel - trace 2 ("getHttpContent: reading from URL " ++ show uri) - proxy <- getSysParam a_proxy - res <- io $ try (getHttp traceLevel uri proxy) - case res of - Left e - -> readErr ( "http error when requesting URI " - ++ show uri - ++ ": " - ++ ioeGetErrorString e - ++ " (perhaps server does not understand HTTP/1.1) " - ) - Right response - -> let - al = convertResponseHeaders response - cs = xtext (rspBody response) - st = convertResponseStatus (rspCode response) - in - if st >= 200 && st < 300 - then - return $ (addAttrl (const al) .> replaceChildren cs) n - else - readErr ( "http error when accessing URI " - ++ show (show uri) - ++ ": " - ++ show st - ++ " " - ++ rspReason response - ) - where - readErr msg = addFatal msg n - - getHttp :: Int -> URI -> String -> IO Response - getHttp trc' uri' proxy' - = withSocketsDo $ - browse ( do - setOutHandler (trcFct) - setErrHandler (trcFct) - - setProxy' proxy' - (_ruri, rsp) <- request rq - return rsp - ) - where - trcFct s - | trc' >= 5 - = hPutStrLn stderr ("-- (" ++ show trc' ++ ") http: " ++ s) - | otherwise - = return () - - rq = defaultGETRequest uri' - - setProxy' "" = return () - setProxy' p = setProxy (Proxy p Nothing) - - convertResponseStatus :: (Int, Int, Int) -> Int - convertResponseStatus (a, b, c) - = 100 * a + 10 * b + c - - convertResponseHeaders :: Response -> XmlTrees - convertResponseHeaders r' - = cvResponseCode (rspCode r') - ++ - cvResponseReason (rspReason r') - ++ - cvResponseHeaders (rspHeaders r') - where - cvResponseCode :: (Int, Int, Int) -> XmlTrees - cvResponseCode st' - = xattr transferStatus (show (convertResponseStatus st')) - ++ - xattr transferVersion httpVersion - - cvResponseReason :: String -> XmlTrees - cvResponseReason r'' - = xattr transferMessage (stringTrim r'') - - cvResponseHeaders :: [Header] -> XmlTrees - cvResponseHeaders - = concatMap cvResponseHeader - - cvResponseHeader :: Header -> XmlTrees - cvResponseHeader (Header name value) - | name == HdrContentType - = ( case (parse parseContentType (show HdrContentType) value) of - Right res -> concatMap (uncurry xattr) res - Left _ -> [] - ) - ++ - addHttpAttr - | otherwise - = addHttpAttr - where - addHttpAttr = xattr (httpPrefix ++ (show name)) value - - --- ------------------------------------------------------------ +type ResponseString = Response String + +-- ------------------------------------------------------------ +-- +-- the http protocol handler, haskell implementation + +getHttpContentsWithHttp :: URI -> XmlStateFilter a +getHttpContentsWithHttp uri n + = do + traceLevel <- getTraceLevel + trace 2 ("getHttpContent: reading from URL " ++ show uri) + proxy <- getSysParam a_proxy + res <- io $ try (getHttp traceLevel uri proxy) + case res of + Left e + -> readErr ( "http error when requesting URI " + ++ show uri + ++ ": " + ++ ioeGetErrorString e + ++ " (perhaps server does not understand HTTP/1.1) " + ) + Right response + -> let + al = convertResponseHeaders response + cs = xtext (rspBody response) + st = convertResponseStatus (rspCode response) + in + if st >= 200 && st < 300 + then + return $ (addAttrl (const al) .> replaceChildren cs) n + else + readErr ( "http error when accessing URI " + ++ show (show uri) + ++ ": " + ++ show st + ++ " " + ++ rspReason response + ) + where + readErr msg = addFatal msg n + + getHttp :: Int -> URI -> String -> IO ResponseString + getHttp trc' uri' proxy' + = withSocketsDo $ + browse ( do + setOutHandler (trcFct) + setErrHandler (trcFct) + + setProxy' proxy' + (_ruri, rsp) <- request rq + return rsp + ) + where + trcFct s + | trc' >= 5 + = hPutStrLn stderr ("-- (" ++ show trc' ++ ") http: " ++ s) + | otherwise + = return () + + rq = defaultGETRequest uri' + + setProxy' "" = return () + setProxy' p = setProxy (Proxy p Nothing) + + convertResponseStatus :: (Int, Int, Int) -> Int + convertResponseStatus (a, b, c) + = 100 * a + 10 * b + c + + convertResponseHeaders :: ResponseString -> XmlTrees + convertResponseHeaders r' + = cvResponseCode (rspCode r') + ++ + cvResponseReason (rspReason r') + ++ + cvResponseHeaders (rspHeaders r') + where + cvResponseCode :: (Int, Int, Int) -> XmlTrees + cvResponseCode st' + = xattr transferStatus (show (convertResponseStatus st')) + ++ + xattr transferVersion httpVersion + + cvResponseReason :: String -> XmlTrees + cvResponseReason r'' + = xattr transferMessage (stringTrim r'') + + cvResponseHeaders :: [Header] -> XmlTrees + cvResponseHeaders + = concatMap cvResponseHeader + + cvResponseHeader :: Header -> XmlTrees + cvResponseHeader (Header name value) + | name == HdrContentType + = ( case (parse parseContentType (show HdrContentType) value) of + Right res -> concatMap (uncurry xattr) res + Left _ -> [] + ) + ++ + addHttpAttr + | otherwise + = addHttpAttr + where + addHttpAttr = xattr (httpPrefix ++ (show name)) value + + +-- ------------------------------------------------------------ diff --git a/hxt-filter.cabal b/hxt-filter.cabal --- a/hxt-filter.cabal +++ b/hxt-filter.cabal @@ -1,6 +1,6 @@ -- arch-tag: Haskell XML Toolbox main description file name: hxt-filter -version: 8.2.0 +version: 8.3.0 license: OtherLicense license-file: LICENCE maintainer: Uwe Schmidt @@ -9,13 +9,14 @@ synopsis: A collection of tools for processing XML with Haskell (Filter variant). description: The Haskell XML Toolbox bases on the ideas of HaXml and HXML. This package is a compatibitlity package for old software working with the filter approach like in HaXml. For new projects it's recomended to use the arrow based library (hxt). homepage: http://www.fh-wedel.de/~si/HXmlToolbox/index.html -copyright: Copyright (c) 2005-8 Uwe Schmidt +copyright: Copyright (c) 2005-2009 Uwe Schmidt build-type: Simple cabal-version: >=1.6 library exposed-modules: Control.Monad.MonadStateIO, + Data.Tree.NTree.Filter, System.PipeOpen, Text.XML.HXT.DOM, Text.XML.HXT.DOM.EditFilters, @@ -25,6 +26,7 @@ Text.XML.HXT.DOM.XmlTree, Text.XML.HXT.DOM.XmlTreeFilter, Text.XML.HXT.DOM.XmlTreeFunctions, + Text.XML.HXT.DOM.XmlTreeTypes, Text.XML.HXT.Parser, Text.XML.HXT.Parser.DTDProcessing, Text.XML.HXT.Parser.DefaultURI, @@ -59,7 +61,7 @@ parsec >= 2.1 && < 3, HUnit >= 1.2, network >= 2.1, - HTTP >= 3001.1, + HTTP >= 4000.0.4 && < 5000, process >= 1.0.1, - hxt >= 8.2 + hxt >= 8.3 diff --git a/src/Data/Tree/NTree/Filter.hs b/src/Data/Tree/NTree/Filter.hs new file mode 100644 --- /dev/null +++ b/src/Data/Tree/NTree/Filter.hs @@ -0,0 +1,912 @@ +-- ------------------------------------------------------------ + +{- | + Module : Data.Tree.NTree.Filter + Copyright : Copyright (C) 2005 Uwe Schmidt + License : MIT + + Maintainer : Uwe Schmidt (uwe\@fh-wedel.de) + Stability : stable + Portability: portable + + Filter for n-ary tree structure with filter combinators + copied and modified from HaXml () + + Similar but more flexible functions for tree processing are defined in the + arrow classes "Control.Arrow.ArrowList", "Control.Arrow.ArrowIf", "Control.Arrow.ArrowTree" and "Control.Arrow.ArrowState". + For new applications, especially for XML processing, it's recommended to use the arrow interface + "Text.XML.HXT.Arrow" instead of this filter approach as part of the api "Text.XML.HXT.Parser" + +-} + +-- ------------------------------------------------------------ + +module Data.Tree.NTree.Filter + ( module Data.Tree.NTree.TypeDefs + , TFilter + , TSFilter + , satisfies + + -- * Filter + , none -- simple filter + , this + + , isOf + , isOfNode -- predicate filter + + , mkNTree -- contructor filter + + , replaceNode -- simple editing + , replaceChildren + + , modifyNode + , modifyNode0 + , modifyChildren + , substChildren + , processChildren -- filter combinators + + , o + , (.>) + , seqF + , (..>) + , (+++) + , cat + + , orElse -- choices + , iff -- if then else filter + , choice + , IfThen(..) + , when + , whenNot + , guards + , neg -- negation + , containing -- previous: with, but with is keyword in haskell extensions + , notContaining -- previous: without + + , (/>) -- selectors + , (>) -- monadic composition + , seqM -- generalisation of .>> + , (+++>>) -- monadic parallel combination, monadic +++ + , catM -- monadic form of cat + , ifM -- monadic if then else + , choiceM -- monadic choice + , whenM -- special monadic ifs + , whenNotM + , guardsM + , containingM + , processChildrenM -- monadic versions of recursive editing + , processTopDownM + , processBottomUpM + , liftMf -- lift a normal filter to a monadic filter + , ($$) -- apply a filter to a list + , ($$<) -- apply a monad filter to a list + , performAction -- run a command within a filter + ) + +where + + +import Data.Tree.NTree.TypeDefs + +infixl 6 `containing`, `notContaining`, `containingM` +infixr 5 `o`, +++, +++>> +infixl 5 />, , ..>, .>> +infixr 4 `when`, `whenNot`, `guards`, `whenM`, `whenNotM`, `guardsM` +infixr 3 :-> +infixr 0 $$, $$< + +-- | +-- tree filter type: a function mapping a tree onto a list of trees +-- +-- filter can be used in various ways, as predicates, selectors, transformers, ... + +type TFilter node = NTree node -> NTrees node + +-- | +-- a filter for sequences + +type TSFilter node = NTrees node -> NTrees node + +-- ------------------------------------------------------------ + +-- | +-- satisfies converts a result of a predicate filter into a boolean +-- +-- is a shortcut for not . null +-- +-- typical use in guards or ifs: @if (satisfies f) t then ... else ... @ +-- +-- * 1.parameter f : the predicate filter +-- +-- - 2.parameter t : the tree to be tested +-- +-- - returns : @b = not (null (f t))@ + +satisfies :: (a -> [b]) -> a -> Bool +satisfies f = not . null . f + +-- ------------------------------------------------------------ +-- +-- simple filter + +-- | +-- the null filter, returns the empty list + +none :: a -> [b] +none _ = [] + +-- | +-- the unit filter, returns the single element list containing the argument + +this :: a -> [a] +this n = [n] + +-- ------------------------------------------------------------ +-- +-- selecting filter + +-- | +-- conversion from predicate function to filter +-- +-- * 1.parameter p : the predicate for testing the tree +-- +-- - returns : 'this' or 'none' depending on the predicate + +isOf :: (a -> Bool) -> (a -> [a]) +isOf p t + = if p t then [t] else [] + +-- | +-- select filter, selects trees with node values with a specific property +-- +-- * 1.parameter p : the predicate for testing the node value +-- +-- - returns : @[]@ or @[t]@ depending on @p t@ +-- +-- a special case of 'isOf' filter + +isOfNode :: (node -> Bool) -> TFilter node +isOfNode p = isOf (p . getNode) + +-- ------------------------------------------------------------ +-- +-- simple editing filters + +-- | +-- filter for substituting an arbitray tree by a constant +-- +-- * 1.parameter t : the result tree, the input tree is ignored +-- +-- - returns : the filter + +mkNTree :: NTree node -> TFilter node +mkNTree t = const [t] + +-- | +-- filter for replacing the node +-- +-- * 1.parameter n : the new node +-- +-- - returns : the editing filter + +replaceNode :: node -> TFilter node +replaceNode n (NTree _ cs) + = [NTree n cs] + +-- | +-- filter for replacing the children +-- +-- * 1.parameter cs : cs the list of children +-- +-- - returns : the filter + +replaceChildren :: NTrees node -> TFilter node +replaceChildren cs (NTree n _) + = [NTree n cs] + +modifyNode :: (node -> Maybe node) -> TFilter node +modifyNode tf (NTree n cs) + = maybe [] (\ n' -> [NTree n' cs]) (tf n) + +-- | +-- filter for editing the node +-- +-- * 1.parameter nf : the XNode editing funtion +-- +-- - returns : the filter + +modifyNode0 :: (node -> node) -> TFilter node +modifyNode0 tf = modifyNode (Just . tf) + +-- | +-- filter for editing the children +-- +-- all children are processed with a filter mapping lists to lists, +-- this enables not only elementwise editing by lifting a normal +-- filter to a list filter with @(f $$)@ (see '($$)') but also manipulation +-- of the order of the elements, e.g. "reverse" is an appropriate childen +-- editing function. +-- +-- * 1.parameter csf : the children editing function +-- +-- - returns : the filter +-- +-- see also : 'processChildren' + +modifyChildren :: TSFilter node -> TFilter node +modifyChildren f -- (NTree n cs) + -- = [NTree n (f cs)] + = substChildren (f . getChildren) + +-- | +-- filter for substituting the children of a tree by +-- a new list of childen computed by applying a filter to the input tree. +-- 'modifyChildren' can be expressed by 'substChildren': +-- @modifyChildren f t@ is equal to @substChildren (f . getChildren)@ + +substChildren :: TFilter node -> TFilter node +substChildren f t@(NTree n _cs) + = [NTree n (f t)] + +-- ------------------------------------------------------------ +-- +-- combinators (copied from HaXml) +-- + +-- | +-- sequential composition of filters, usually written in infix notation f2 `o` f1. +-- +-- for predicate filter the logical AND +-- +-- * 1.parameter f2 : the 2. filter +-- +-- - 2.parameter f1 : the 1. filter +-- +-- - returns : the fiter applying first f1 to n and then f2 to the result (like function composition) + +o :: (a -> [b]) -> (c -> [a]) -> (c -> [b]) +f `o` g = concatMap f . g + +-- | +-- pronounced \"followed by\", defined as: @f .> g = g \`o\` f@. +-- +-- allows filter composition in a more readable way from left to right +-- +-- * 1.parameter f1 : the 1. filter +-- +-- - 2.parameter f2 : the 2. filter +-- +-- - returns : the composition of f1 and f2 +-- +-- see also : 'o', '(..>)' + +(.>) :: (a -> [b]) -> (b -> [c]) -> (a -> [c]) +f .> g = g `o` f + +-- | +-- apply a list of filters sequentially with '(.>)', for predicate filters the generalized AND +-- +-- see also : '(.>)' + +seqF :: [a -> [a]] -> (a -> [a]) +seqF = foldl (.>) this + +-- | +-- binary parallel composition, the logical OR for predicate filter +-- +-- * 1.parameter f1 : the 1. filter +-- +-- - 2.parameter f2 : the 2. filter +-- +-- - returns : the filter for applying f1 and f2 both to an argument tree and concatenating the results + +(+++) :: (a -> [b]) -> (a -> [b]) -> (a -> [b]) +f +++ g = \ t -> f t ++ g t + +-- | +-- special sequential composition. +-- +-- filter f is applied to an argument t. +-- then filter g is applied to all elements of the result list, +-- but the argument t is also passed as extra parameter to g. +-- +-- This allows for step by step transformations of a tree +-- with access to the original tree in every +-- transformation step. +-- +-- see also : '(.>)', 'o' + +(..>) :: (a -> [b]) -> (a -> b -> [d]) -> (a -> [d]) +f ..> g = \ t -> (g t `o` f) t + +-- | +-- apply a list of filters, a \"union\" for lists, for predicate filters the generalized OR +-- +-- * 1.parameter fs : the list of filters +-- +-- - returns : the composing filter + +cat :: [a -> [b]] -> (a -> [b]) +cat fs t + = concat [ f t | f <- fs ] + +-- | +-- Filter for editing the children of a tree element wise +-- +-- * 1.parameter cf : the filter applied to the children +-- +-- - returns : the editing filter +-- +-- see also : 'modifyChildren' + +processChildren :: TFilter node -> TFilter node +processChildren ft (NTree n cs) + = [NTree n (ft $$ cs)] + +-- | +-- infix operator for applying a filter to a list of trees +-- +-- * 1.parameter f : the filter +-- +-- - 2.parameter ts : the list of trees +-- +-- - returns : the concatenated list of results + +($$) :: (a -> [b]) -> [a] -> [b] +f $$ l + = concatMap f l + +-- ------------------------------------------------------------ +-- +-- choices +-- + +-- | +-- directional choice, usually written in infix notation as f `orElse` g +-- +-- * 1.parameter f : the 1. filter +-- +-- - 2.parameter g : the 2. filter +-- +-- - 3.parameter t : the tree +-- +-- - returns : the filter, that applies f to t, if the result is not the empty list, the result is found, else g t is the result + +orElse :: (a -> [b]) -> (a -> [b]) -> (a -> [b]) +f `orElse` g + = \ t-> let + res = f t + in + if null res + then g t + else res + +-- | +-- if then else lifted to filters +-- +-- * 1.parameter p : the predicate filter +-- +-- - 2.parameter t : the \"then\" filter +-- +-- - 3.parameter e : the \"else\" filter +-- +-- - returns : the resulting conditional filter + +iff :: (a -> [c]) -> (a -> [b]) -> (a -> [b]) -> (a -> [b]) +iff p f g = \ c -> if (satisfies p) c then f c else g c + +-- | +-- when the predicate p holds, f is applied, else the identity filter this +-- +-- * 1.parameter f : the conditinally applied filter +-- +-- - 2.parameter p : the predicate +-- +-- - returns : the conditional filter +-- +-- see also : 'iff', 'whenNot', 'guards', 'whenM' + +when :: (a -> [a]) -> (a -> [a]) -> (a -> [a]) +f `when` g = iff g f this + +-- | +-- the complementary filter of when +-- +-- shortcut for f `when` neg g +-- +-- see also : 'iff', 'when', 'whenNotM', 'neg' + +whenNot :: (a -> [a]) -> (a -> [a]) -> (a -> [a]) +f `whenNot` g = iff g this f + +-- | +-- when the predicate p holds, f is applied, else the null filter none +-- +-- * 1.parameter p : the predicate filter +-- +-- - 2.parameter f : the conditionally applied filter +-- +-- - returns : the conditional filter +-- +-- see also : 'iff', 'when', 'guardsM' + +guards :: (a -> [b]) -> (a -> [b]) -> (a -> [b]) +g `guards` f = iff g f none + + +-- | +-- negation lifted to filters +-- +-- * 1.parameter f : the predicate filter +-- +-- - returns : the filter, that succeeds, when f failed + +neg :: (a -> [c]) -> a -> [a] +neg f = iff f none this + +-- | +-- auxiliary datatype for cases within choice filter + +data IfThen a b = a :-> b + +-- | +-- multiway branch. The list of cases @f :-> g@ is processed sequentially, +-- in the first case for that f holds g is applied, if no case matches, 'none' is +-- applied. +-- This filter can be used like a case expression: @choice [ p1 :-> f1, p2 :-> f2, ... , this :-> defaultFilter]@ +-- +-- see also : 'iff', 'choiceM' + +choice :: [IfThen (a -> [c]) (a -> [b])] -> (a -> [b]) +choice [] + = none + +choice ((g :-> f) : cs) + = iff g f (choice cs) + +-- | +-- pruning: keep only those results from f for which g holds, usually written in infix notation as f `containing` g +-- +-- * 1.parameter f : the processing filter +-- +-- - 2.parameter g : the predicate filter +-- +-- - 3.parameter t : the tree +-- +-- - returns : all trees r from f t, for which g r holds (is not the empty list) +-- +-- see also : 'notContaining' + +containing :: (a -> [b]) -> (b -> [c]) -> a -> [b] +f `containing` g + = filter (satisfies g) . f + +-- | +-- pruning: keep only those results from f for which g does not hold +-- +-- see also : 'containing' + +notContaining :: (a -> [b]) -> (b -> [c]) -> a -> [b] +f `notContaining` g + = filter (null . g) . f + +-- | +-- pruning: monadic version of containing, usually written in infix notation as f `containingM` g +-- +-- * 1.parameter f : the monadic processing filter +-- +-- - 2.parameter g : the predicate filter +-- +-- - 3.parameter t : the tree +-- +-- - returns : all trees r from f t, for which g r holds (is not the empty list) +-- +-- see also : 'notContaining' + +containingM :: Monad m => (a -> m [b]) -> (b -> [c]) -> a -> m [b] +f `containingM` g + = \ t -> do + res <- f t + return $ filter (satisfies g) res + +-- | +-- pronounced \"slash\", meaning g inside f + +(/>) :: TFilter node -> TFilter node -> TFilter node +f /> g + = g `o` getChildren `o` f + +-- | +-- pronounced \"outside\" meaning f containing g + +( TFilter node -> TFilter node +f TFilter node +deep f + = f `orElse` (deep f `o` getChildren) + +-- | +-- bottom up search. +-- +-- first the children are processed, +-- if this does not succeed, the node itself is processed +-- can e.g. be used for finding all innermost tag nodes of a specific kind + +deepest :: TFilter node -> TFilter node +deepest f + = (getChildren .> deepest f) `orElse` f + +-- | +-- process all nodes of the whole tree. +-- +-- can e.g. be used for finding all nodes of a specific kind + +multi :: TFilter node -> TFilter node +multi f + = f +++ (getChildren .> multi f) + +-- ------------------------------------------------------------ +-- +-- recursive transformation filters +-- + +-- | +-- bottom up transformation +-- +-- * 1.parameter f : the /simple/ transforming filter +-- +-- - returns : the filter that applies f to all subtrees and the tree itself in a deepth first left to right manner +-- +-- see also : 'processTopDown', 'processBottomUpIfNot' + +processBottomUp :: TFilter node -> TFilter node +processBottomUp f + = processChildren (processBottomUp f) .> f + +-- | +-- top down transformation +-- +-- * 1.parameter f : the /simple/ transforming filter +-- +-- - returns : the filter that applies f first to the tree and then recursively to all subtrees of the result +-- +-- see also : 'processBottomUp' + +processTopDown :: TFilter node -> TFilter node +processTopDown f + = f .> processChildren (processTopDown f) + +-- | +-- guarded bottom up transformation, stops at subtrees for which a predicate p holds +-- +-- * 1.parameter f : the transforming filter +-- +-- - 2.parameter p : the predicate filter for the guard +-- +-- - returns : the filter for processing all (sub-)trees +-- +-- see also : 'processBottomUp' + +processBottomUpIfNot :: TFilter node -> TFilter node -> TFilter node +processBottomUpIfNot f p + = (processChildren (processBottomUpIfNot f p) .> f) `whenNot` p + +-- | +-- top down transformation until a node to be transformed is found +-- +-- * 1.parameter f : the /simple/ transforming filter +-- +-- - returns : the filter that applies f first to the tree and, if the filter does not succeed, +-- recursively to all children of the input tree. +-- +-- Example: +-- +-- @processTopDownUntil none@ +-- +-- is the identity filter (maybe a bit more inefficient). +-- +-- Example: +-- +-- @processTopDownUntil (add1Attr \"border\" \"2\" \`containing\` isTag \"table\")@ +-- +-- is a filter for adding an attribute border=\"2\" in all top level table tags. +-- The content of table tags will remain unchanged. +-- +-- see also : 'processTopDown', 'processBottomUp' + +processTopDownUntil :: TFilter node -> TFilter node +processTopDownUntil f t + | null res + = processChildren (processTopDownUntil f) t + | otherwise + = res + where + res = f t + +-- ------------------------------------------------------------ +-- + +-- | +-- insertion of trees into the list of children at a given position +-- +-- useful for inserting something into the list of children at a given position +-- the list of children is split with the @splitAt@ function +-- the nodes are inserted between these two sublists. +-- +-- examples: @insertChildrenAt 0 ins t@ inserts all elements computed with @ins t@ in front +-- of the childen of @t@, @insertChildrenAt 1 ins t@ behind the first child +-- +-- see also: 'insertChildrenAfter' + + +insertChildrenAt :: Int -> TFilter node -> TFilter node +insertChildrenAt i ins t + = replaceChildren (cl1 ++ ins t ++ cl2) t + where + (cl1, cl2) = splitAt i $ getChildren t + +-- | +-- insertion of trees into the list of children after specific elements +-- +-- useful for inserting something into the list of children of a node +-- the list of children is split with the @span@ function and the filter p as predicate +-- the nodes are inserted between these two sublists +-- +-- examples: @insertChildrenAfter none ins t@ inserts all elements computed with @ins t@ in front +-- of the childen of @t@, @insertChildrenAfter this ins t@ appends the elements to the children +-- +-- see also: 'insertChildrenAt' + +insertChildrenAfter :: TFilter node -> TFilter node -> TFilter node +insertChildrenAfter p ins t + = replaceChildren (cl1 ++ ins t ++ cl2) t + where + (cl1, cl2) = span (not . null . p) $ getChildren t + +-- ------------------------------------------------------------ +-- +-- monadic filter + +-- | +-- the monadic version of the identity filter this. +-- +-- see also : 'this' + +thisM :: Monad m => (a -> m [a]) +thisM = liftMf this + +-- | +-- the monadic version of the null filter none. +-- +-- see also : 'none' + +noneM :: Monad m => (a -> m [b]) +noneM = liftMf none + +-- | +-- sequential composition of monadic filters, monadic version of \".>\". +-- +-- * 1.parameter f1 : the 1. monadic filter +-- +-- - 2.parameter f2 : the 2. monadic filter +-- +-- - returns : the monadic fiter applying first f1 to n and then f2 to the result (like function composition) +-- +-- see also : '(.>)' + +(.>>) :: Monad m => (a -> m[b]) -> (b -> m [c]) -> (a -> m[c]) +cmd1 .>> cmd2 + = \ t -> + do + r1 <- cmd1 t + r2 <- mapM cmd2 r1 + return (concat r2) + +-- | +-- generalized sequential composition of monadic filters + +seqM :: Monad m => [a -> m[a]] -> (a -> m[a]) +seqM + = foldr (.>>) thisM + +-- | +-- binary parallel composition, the logical OR for predicate filter +-- +-- * 1.parameter f1 : the 1. filter +-- +-- - 2.parameter f2 : the 2. filter +-- +-- - returns : the filter for applying f1 and f2 both to an argument tree and concatenating the results +-- see also: 'cat', '+++', 'catM' + +(+++>>) :: Monad m => (a -> m [b]) -> (a -> m [b]) -> (a -> m [b]) +f +++>> g = \ t -> do + r1 <- f t + r2 <- g t + return (r1 ++ r2) + +-- | +-- apply a list of monadic filters +-- +-- * 1.parameter fs : the list of filters +-- +-- - returns : the composing filter +-- see also: 'cat', '+++', '+++>>' + +catM :: Monad m => [a -> m [b]] -> (a -> m [b]) +catM fs t + = do + res <- sequence (map ($ t) fs) + return $ concat res + +-- | +-- monadic if-then-else. +-- +-- * 1.parameter p : the predicate +-- +-- - 2.parameter thenP : the then part: the monadic filter, that is applied if p holds for the input tree +-- +-- - 3.parameter elseP : the else part +-- +-- - returns : the monadic filter for the conditional + +ifM :: Monad m => (a -> [b]) -> (a -> m [c]) -> (a -> m [c]) -> (a -> m [c]) +ifM p thenPart elsePart + = \ t -> + if (satisfies p) t + then thenPart t + else elsePart t + +-- | +-- monadic version of multiway branch. The list of cases @f :-> g@ is processed sequentially, +-- in the first case for that f holds g is applied, if no case matches, 'noneM' is +-- applied. +-- This filter can be used like a case expression: @choiceM [ p1 :-> f1, p2 :-> f2, ... , thisM :-> defaultFilter]@ +-- +-- see also : 'choice', 'ifM' + +choiceM :: Monad m => [IfThen (a -> [c]) (a -> m [b])] -> (a -> m [b]) +choiceM [] + = noneM + +choiceM ((g :-> f) : cs) + = ifM g f (choiceM cs) + + +-- | +-- when the predicate p holds, the monadic filter f is applied, else the identity filter. +-- +-- * 1.parameter f : the conditinally applied monadic filter +-- +-- - 2.parameter p : the simple predicate +-- +-- - returns : the conditional filter +-- +-- see also : 'ifM', 'when', 'guardsM', 'whenNotM' + +whenM :: Monad m => (a -> m [a]) -> (a -> [b]) -> (a -> m [a]) +f `whenM` g = ifM g f thisM + +-- | +-- the complementary filter of whenM. +-- +-- see also : 'ifM', 'whenM', 'whenNot' + +whenNotM :: Monad m => (a -> m [a]) -> (a -> [b]) -> (a -> m [a]) +f `whenNotM` g = ifM g thisM f + +-- | +-- when the predicate p holds, the monadic filter f is applied, else the null filter. +-- +-- * 1.parameter p : the simple predicate filter +-- +-- - 2.parameter f : the conditionally applied monadic filter +-- +-- - returns : the conditional filter +-- +-- see also : 'ifM', 'guards', 'whenM' + +guardsM :: Monad m => (a -> [b]) -> (a -> m [c]) -> (a -> m [c]) +g `guardsM` f = ifM g f noneM + +-- | +-- Filter for editing the children of a tree with a monadic filter +-- +-- * 1.parameter cf : the monadic filter applied to the children +-- +-- - returns : the monadic editing filter +-- +-- see also : 'processChildren' + +processChildrenM :: Monad m => (NTree node -> m [NTree node]) -> (NTree node -> m [NTree node]) +processChildrenM ft (NTree n cs) + = do + res <- ft $$< cs + return [NTree n res] + +-- | +-- monadic variant of 'processTopDown' + +processTopDownM :: Monad m => (NTree node -> m [NTree node]) -> (NTree node -> m [NTree node]) +processTopDownM f + = f .>> processChildrenM (processTopDownM f) + +-- | +-- monadic variant of 'processBottomUp' + +processBottomUpM :: Monad m => (NTree node -> m [NTree node]) -> (NTree node -> m [NTree node]) +processBottomUpM f + = processChildrenM (processBottomUpM f) .>> f + +-- | +-- infix operator for applying a monadic filter to a list of trees, +-- typically used in do-notation for processing of intermediate results. +-- +-- * 1.parameter f : the monadic filter +-- +-- - 2.parameter ts : the list of trees +-- +-- - returns : the concatenated list of results +-- +-- see also : '($$)' + +($$<) :: Monad m => (a -> m [b]) -> [a] -> m [b] +cmd $$< l + = do + r <- mapM cmd l + return (concat r) + +-- | +-- lift a filter to a monadic filter +-- +-- * 1.parameter f : the /simple/ filter +-- +-- - returns : the lifted monadic version + +liftMf :: Monad m => (a -> [b]) -> a -> m [b] +liftMf f t + = return (f t) + +-- | +-- run an arbitray command on a tree t and return the tree, +-- used for inserting arbitray commands in a filter pipeline +-- +-- * 1.parameter cmd : the command +-- +-- - 2.parameter t : the argument tree +-- +-- - returns : the unchanged tree as a single element list + +performAction :: Monad m => (a -> m b) -> a -> m [a] +performAction cmd t + = do + cmd t + return [t] + +-- eof ------------------------------------------------------------ diff --git a/src/Makefile b/src/Makefile --- a/src/Makefile +++ b/src/Makefile @@ -40,6 +40,7 @@ HXT_SRC = \ $(wildcard Control/Monad/*.hs) \ + $(wildcard Data/Tree/NTree/*.hs) \ $(wildcard System/*.hs) \ $(wildcard Text/XML/HXT/*.hs) \ $(wildcard Text/XML/HXT/DOM/*.hs) \ @@ -53,7 +54,7 @@ HXT_LIBA = libHS$(HXT_PACKAGE).a HXT_LIBO = HS$(HXT_PACKAGE).o HXT_LIB = $(HXT_LIBA) $(HXT_LIBO) -HXT_REQ_PKG = -package parsec -package HTTP -package hxt +HXT_REQ_PKG = -package parsec -package HTTP -package hxt-8.3.0 $(HXT_LIBA) : $(HXT_SRC) $(GHC) -package-name $(HXT_PACKAGE_NAME) $(HXT_REQ_PKG) --make $(HXT_DRIVER:.o=.hs) diff --git a/src/Text/XML/HXT/DOM/NamespaceFilter.hs b/src/Text/XML/HXT/DOM/NamespaceFilter.hs --- a/src/Text/XML/HXT/DOM/NamespaceFilter.hs +++ b/src/Text/XML/HXT/DOM/NamespaceFilter.hs @@ -16,14 +16,11 @@ module Text.XML.HXT.DOM.NamespaceFilter ( module Text.XML.HXT.DOM.NamespaceFilter - , module Text.XML.HXT.DOM.NamespacePredicates ) where import Text.XML.HXT.DOM.XmlTree -import Text.XML.HXT.DOM.NamespacePredicates - import Text.XML.HXT.DOM.Util ( doubles ) @@ -48,7 +45,7 @@ -- The filter may be applied repeatedly if neccessary. propagateNamespaces :: XmlFilter -propagateNamespaces = propagateNamespaceEnv [ (a_xml, xmlNamespace), (a_xmlns, xmlnsNamespace) ] +propagateNamespaces = propagateNamespaceEnv $ toNsEnv [ (a_xml, xmlNamespace), (a_xmlns, xmlnsNamespace) ] -- | -- attaches the namespace info given by the namespace table @@ -88,7 +85,7 @@ . getChildren ) nsAttrs) - newEnv = addEntries nsDecl env + newEnv = addEntries (toNsEnv nsDecl) env attachNamespaceUrisToAttr :: NamespaceTable -> XmlFilter attachNamespaceUrisToAttr attrEnv diff --git a/src/Text/XML/HXT/DOM/XmlTreeTypes.hs b/src/Text/XML/HXT/DOM/XmlTreeTypes.hs new file mode 100644 --- /dev/null +++ b/src/Text/XML/HXT/DOM/XmlTreeTypes.hs @@ -0,0 +1,77 @@ +-- | +-- exports the core data types +-- and some additional types and functions +-- for compatibility with none arrow modules +-- +-- Version : $Id: XmlTreeTypes.hs,v 1.6 2006/05/09 15:30:43 hxml Exp $ + +module Text.XML.HXT.DOM.XmlTreeTypes + ( module Data.Tree.NTree.Filter + , module Text.XML.HXT.DOM.TypeDefs + , module Text.XML.HXT.DOM.XmlTreeTypes + ) + +where + +import Data.Tree.NTree.Filter +import Text.XML.HXT.DOM.TypeDefs + +-- aliases for compatiblility reasons + +mkNode :: node -> NTrees node -> NTree node +mkNode = mkTree + +formatNTree :: (node -> String) -> NTree node -> String +formatNTree = formatTree + +foldNTree :: (a -> [b] -> b) -> NTree a -> b +foldNTree = foldTree + +mapNTree :: (a -> b) -> NTree a -> NTree b +mapNTree = fmap + +nTreeToList :: NTree a -> [a] +nTreeToList = nodesTree + +depthNTree :: NTree a -> Int +depthNTree = depthTree + +cardNTree :: NTree a -> Int +cardNTree = cardNTree + +-- ----------------------------------------------------------------------------- +-- +-- Basic types for filters + +-- | A functions that takes a node and returns a list of nodes + +type XmlFilter = TFilter XNode + +-- | A function that takes a list of nodes and returns a list of nodes + +type XmlSFilter = TSFilter XNode + + +-- ----------------------------------------------------------------------------- +-- + +-- | Tag name +type TagName = QName + +-- | Attribute name +type AttrName = QName + +-- ----------------------------------------------------------------------------- + +-- | shortcut for 'qualifiedName' + +tName :: QName -> String +tName = qualifiedName + +-- | shortcut for 'qualifiedName' + +aName :: QName -> String +aName = qualifiedName + +-- ----------------------------------------------------------------------------- + diff --git a/src/Text/XML/HXT/Parser/ProtocolHandlerHttpNative.hs b/src/Text/XML/HXT/Parser/ProtocolHandlerHttpNative.hs --- a/src/Text/XML/HXT/Parser/ProtocolHandlerHttpNative.hs +++ b/src/Text/XML/HXT/Parser/ProtocolHandlerHttpNative.hs @@ -43,6 +43,8 @@ -- -- the native http protocol handler +type ResponseString = Response String + -- ------------------------------------------------------------ -- -- the http protocol handler, haskell implementation @@ -82,7 +84,7 @@ where readErr msg = addFatal msg n - getHttp :: Int -> URI -> String -> IO Response + getHttp :: Int -> URI -> String -> IO ResponseString getHttp trc' uri' proxy' = withSocketsDo $ browse ( do @@ -109,7 +111,7 @@ convertResponseStatus (a, b, c) = 100 * a + 10 * b + c - convertResponseHeaders :: Response -> XmlTrees + convertResponseHeaders :: ResponseString -> XmlTrees convertResponseHeaders r' = cvResponseCode (rspCode r') ++ diff --git a/src/hxt-filter-package.hs b/src/hxt-filter-package.hs --- a/src/hxt-filter-package.hs +++ b/src/hxt-filter-package.hs @@ -26,7 +26,7 @@ " This package is a compatibitlity package for old software working with the filter approach like in HaXml." ++ " For new projects it's recomended to use the arrow based library (hxt)." , "homepage: http://www.fh-wedel.de/~si/HXmlToolbox/index.html" - , "copyright: Copyright (c) 2005-8 Uwe Schmidt" + , "copyright: Copyright (c) 2005-2009 Uwe Schmidt" ] part3a :: [String] @@ -61,7 +61,7 @@ , " containers-0.2.0.0," , " directory-1.0.0.2," , " process-1.0.1.0," - , " hxt-8.2.0" + , " hxt-8.3.0" ] part4b :: [String] @@ -78,9 +78,9 @@ , " parsec >= 2.1 && < 3," , " HUnit >= 1.2," , " network >= 2.1," - , " HTTP >= 3001.1," + , " HTTP >= 4000.0.4 && < 5000," , " process >= 1.0.1," - , " hxt >= 8.2" + , " hxt >= 8.3" ] main :: IO()