Hi again

I've written a bit more code to test it out and it is very slow doing the findnodes when I'm already at a position in the tree.

I've written this test script:

my $parser = XML::LibXML->new();
my $doc    = $parser->parse_file($filename);
my @devinfo = $doc->findnodes('//Device/Dev_Info');

foreach my $devinfo (@devinfo) {
    my($dev) = $devinfo->findnodes('./dev_name');
    print $dev->to_literal, "\n";
}

[download]

The first findnodes runs very quickly (< 1 sec) but the one in the loop is a lot slower. But I don't know why. Doesn't it just have to examine the nodes "under" the current devinfo tag?

Am I doing something wrong with the findnodes call here?

Thanks, ~ Michael

In reply to Re^2: Any help available for a newbie to XML::LibXML? by wardy3
in thread Any help available for a newbie to XML::LibXML? by wardy3

Title:
Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post, it's "PerlMonks-approved HTML":


  • Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
  • Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
  • Read Where should I post X? if you're not absolutely sure you're posting in the right place.
  • Please read these before you post! —
  • Posts may use any of the Perl Monks Approved HTML tags:
    a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
  • You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
            For:     Use:
    & &amp;
    < &lt;
    > &gt;
    [ &#91;
    ] &#93;
  • Link using PerlMonks shortcuts! What shortcuts can I use for linking?
  • See Writeup Formatting Tips and other pages linked from there for more info.