document updated 18 years ago, on Aug 26, 2006
Something LIKE XPath, but not necessarily the same thing.
Looks like they use a very similar interface (one search string as main input, returns matching nodes):
* Data::Path (bingo! though it looks very simplistic... "*" (and multiple returns) aren't supported, "//" isn't supported, * ...)
* Data::DPath (only partially implemented)
* Data::Hierarchy (close, I guess, though uses regular expressions which is a tad weird)
Somewhat different
* Data::Match (seems too complicated)
Has a search function, though it works on altogether different data:
* Tree::XPathEngine (meant to be wholly independent (!!) )
- one issue is that perl nodes don't explicitely have the concept of "parent", so that has
to be remembered
* B::XPath