in reply to Re: Traversing arbitrarily deep and baggy structures
in thread Traversing arbitrarily deep and baggy structures

Although this has plenty of bells and whistles, in my opinion it doesn't add enough crucial stuff to justify the slow performance. Larry Wall's XML::Parser already creates a perfectly good tree. The chosen task is to traverse that tree.

One world, one people

  • Comment on Re^2: Traversing arbitrarily deep and baggy structures

Replies are listed 'Best First'.
Re^3: Traversing arbitrarily deep and baggy structures
by ikegami (Patriarch) on Feb 16, 2011 at 22:10 UTC

    Slow? XML::Parser is a turtle in comparison! XML::LibXML is 20x faster than XML::Parser via XML::Simple. (XML::Parser alone doesn't create a tree.)

    Either way, there is a generic XPath module that can be adapted to any tree structure.

[reply]

In Section Seekers of Perl Wisdom