Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid
 
PerlMonks  

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

by Anonymous Monk
on Aug 08, 2012 at 03:06 UTC ( #986122=note: print w/ replies, xml ) Need Help??


in reply to Re: XML-Twig: more efficient tree processing
in thread 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
Re^3: XML-Twig: more efficient tree processing
by sundialsvc4 (Monsignor) 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.

      An algorithm that is already started with XML::Twig probably cannot be changed now

      That is what I said

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://986122]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (8)
As of 2014-08-29 11:05 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The best computer themed movie is:











    Results (280 votes), past polls