We can use either a list (with names) to store the nodes or a hash table/associative array that uses names. There is a non-trivial performance difference.
xmlHashTree(nodes = list(), parents = character(), children = list(),
env = new.env(TRUE))
xmlFlatListTree(nodes = list(), parents = character(), children = list(), env = new.env(), n = 200)children and parents.nodes.nodes.xmlFlatListTree, this is used as the default size
to allocate for the list containing the nodesXMLFlatListTree by the xmlFlatListTree
function and
XMLHashTree by the xmlHasTree function.
Both are simply the environment.xmlTreeParse
xmlTree
xmlOutputBuffer
xmlOutputDOM