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 look unnatural to me.
Additionally they provide combinator functions that are actually weakly typed,
they are all of type (a -> [a]),
instead of being differentiated into (a -> Bool), (a -> a) and (a -> [a]).
HXT is even weaker in type safety than HaXML
since it allows complete XML trees even in attribute values.
I didn't want to write another XML toolbox with parsers, HTML support and so on,
however in the meantime I came close to it.
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.
TagSoups can also be converted to XML trees.
All conversions are lazy.
I have a special XML string structure.
(Text.XML.WraXML.String)
XML strings consist of ASCII characters and XML references.
My XML tree is built on top of a very general tree structure,
which distinguishs between leafs and inner branches.
(Data.Tree.BranchLeafLabel)
Each element of a tree is labeled with some information.
Branches are then used for tags,
leafs for XML strings and special tags,
and the labels for pointers to positions in the source file.
(Text.XML.WraXML.Tree)
