This is a wrapper to HaXML and HXT (Haskell XML Toolbox).
It's my work-around for the unfortunate situation that both toolboxes
have different functionality,
none is the superset of the other.
Both of them rely on data structures, which seem unnatural to me.
Additionally they provide combinator functions that are really weakly typed,
they are all of type (a -> [a]).
HXT is even weaker than HaXML.
I don't want to write another XML toolbox with parsers, HTML support and so on.

I decided to do some wrapping in order to use as much as possible functionality
from HaXML and HXT.
I provide my own XML tree data structure with according operations.
Conversions between HaXML or HXT trees and my own ones are implemented.
So I can use the parser and pretty printer of both HaXML and HXT
while processing trees the way I find more natural.

I have an XML string structure.
(Text.XML.WraXML.String)
XML strings consists of ASCII characters and XML entities.
My XML tree is build on top of a very general tree structure,
which distinguishs between leafs and inner branches.
(Data.Tree.BranchLeafTag)
Each element of a tree is tagged with some information.
Branches are then used for tags, leafs for XML strings,
and the tags for pointers to positions in the source file.
(Text.XML.WraXML.Tree)