Re^2: XML-Twig: more efficient tree processing

So instead of using minimal memory with the already written XML::Twig , he should load the giant tree into memory and rewrite the program to use xpath1?

That don't make sense

Comment on Re^2: XML-Twig: more efficient tree processing

Replies are listed 'Best First'.
Re^3: XML-Twig: more efficient tree processing by locked_user sundialsvc4 (Abbot) on Aug 08, 2012 at 13:39 UTC
An algorithm that is already started with XML::Twig probably cannot be changed now. There are two purposes for using other strategies ... to keep large structures out of memory, and to avoid the necessity of procedural logic within the Perl program to traverse them.
Re^4: XML-Twig: more efficient tree processing by Anonymous Monk on Aug 08, 2012 at 13:42 UTC
An algorithm that is already started with XML::Twig probably cannot be changed now That is what I said	[reply]