CompactTree(3pm)
๐ธ NAME ๐ธ
okay so bestie, welcome to XML::CompactTree โ she's a builder of compact tree structures from XML documents ๐ (and yes, this is a User Contributed Perl Documentation page, the CompactTree(3pm) one, we're all here together ๐ซถ)
โจ VERSION โจ
Version 0.03 โ she's been around a minute, and she still serves ๐
๐ฆ SYNOPSIS ๐ฆ
use XML::CompactTree;
use XML::LibXML::Reader;
my $reader = XML::LibXML::Reader->new(location => $url);
...
my $tree = XML::CompactTree::readSubtreeToPerl($reader);
...
like, that's the whole vibe. reader in, tree out, no cap โจ
๐ DESCRIPTION ๐
This module gives you functions that use XML::LibXML::Reader to parse an XML document into a parse tree formed of nested arrays (and hashes). ๐ชบ
Her whole goal is to be fast at that, and to preserve all relevant information from the XML โ including namespaces, document order, mixed content, etc. She sacrifices user friendliness for speed, which is honestly such a mood. ๐ญ
IMPORTANT: there is an even more efficient XS implementation of this module called XML::CompactTree::XS with 100% equivalent functionality. ๐
๐ PURPOSE ๐
I wrote this module because I noticed that repeated calls to methods implemented in C (XS) were very expensive in Perl. ๐
Therefore traversing a large DOM tree using XML::LibXML or iterating over an XML stream using XML::LibXML::Reader was much slower than traversing similarly large and structured native Perl data structures.
This module allows the user to build a document parse tree consisting of native Perl data structures (arrays and optionally hashes) using XML::LibXML::Reader with a minimal number of XS calls. ๐ง
(Note that there XML::CompactTree::XS is 100% equivalent of this module that manages the same with just one XS call.)
It does not provide full DOM navigation but attempts to provide the maximum amount of information. Its memory footprint should be somewhat smaller than that of a corresponding XML::LibXML DOM tree. ๐
๐ EXPORT ๐
By default, the following constants are exported (the ":flags" export tag) to be used as flags for the tree builder:
XCT_IGNORE_WS
XCT_IGNORE_SIGNIFICANT_WS
XCT_IGNORE_PROCESSING_INSTRUCTIONS
XCT_IGNORE_COMMENTS
XCT_USE_QNAMES /* not yet implemented */
XCT_KEEP_NS_DECLS
XCT_TEXT_AS_STRING /* not yet implemented */
XCT_ATTRIBUTE_ARRAY
XCT_PRESERVE_PARENT /* not yet implemented */
XCT_MERGE_TEXT_NODES /* not yet implemented */
XCT_DOCUMENT_ROOT
๐ FUNCTIONS ๐
readSubtreeToPerl( $reader, $flags, \my %ns )
Uses a given XML::LibXML::Reader parser object to parse a subtree at the current reader position and build a tree formed of nested arrays (see "OUTPUT FORMAT" below, bestie, it's important ๐).
readerโ anXML::LibXML::Readerobject to use as the reader. While building the tree, the reader moves to the next node on the current or higher level. ๐ฆflagsโ an integer consisting of 1 bit flags (see the constants up in the EXPORT section). Use binary or (|) to combine individual flags. ๐๏ธ
The following flags are NOT implemented yet:
XCT_USE_QNAMES, XCT_TEXT_AS_STRING, XCT_PRESERVE_PARENT, XCT_MERGE_TEXT_NODES
nsโ you may pass an empty hash reference that will be populated by anamespace_uritonamespace_indexmap, that can be used to decode namespace indexes in the resulting data structure (see "OUTPUT FORMAT"). ๐บ๏ธ
readLevelToPerl( $reader, $flags, $ns )
Like "readSubtreeToPerl", but reads the subtree at the current reader position and all its following siblings. It returns an array reference of representations of these subtrees, in the format described in "OUTPUT FORMAT". ๐
๐ OUTPUT FORMAT ๐
The result of parsing a subtree is a Perl array reference $node that contains a node type followed by node data, whose interpretation on further positions in $node depends on the node type, as described below: ๐
Any Node
$node->[0]is an integer representing the node type. UseXML::LibXML::Readernode-tye constants, e.g.XML_READER_TYPE_ELEMENTfor an element node,XML_READER_TYPE_TEXTfor text node, etc. ๐ข
Document or Document Fragment Nodes
$node->[1]contains the document encoding ๐$node->[2]is an array reference containing a similar representation of all the child nodes of the document (fragment). ๐ณ
Note:XML::LibXML::Readerdoes not document node by default, which means that callingreadSubtreeToPerlon a reader object in its initial state only parses the first node in the document (which can be the root element, but also a comment or a processing instruction). UseXCT_DOCUMENT_ROOTflag to force creating a document node in such a case. ๐
Element nodes
$node->[1]is the local name (UTF-8 encoded character string) โจ$node->[2]is the namespace index (see NAMESPACES below) ๐๏ธ$node->[3]isundefif the element has no attributes. Otherwise, ifXCT_ATTRIBUTE_ARRAYflag was used,$node->[3]is an array reference of the form"[ name1, value1, name2, value2, ....]"of attribute names and corresponding values. IfXCT_ATTRIBUTE_ARRAYflag was not used, then$node->[3]is a hash reference mapping attribute names to the corresponding attribute values"{ name1="value1, name2=>value2...}>"๐
The flag XCT_KEEP_NS_DECLS controls whether namespace declarations (xmlns=... or xmlns:prefix=...) are included along with normal attributes or not. ๐งท
Note: there is no support for namespaced attributes yet, but the attribute names are stored as QNames, so one can always use XCT_KEEP_NS_DECLS to keep track of namespace prefix declarations and do the resolving manually. Support for namespaced attributes is planned. ๐ฎ
- If
XTC_LINE_NUMBERSflag was used,$node->[4]contains the line number of the element and$node->[5]contains an array reference containing similar representations of the child nodes of the current node. ๐ - If
XTC_LINE_NUMBERSflag was NOT used,$node->[4]contains an array reference of similar representations of the child nodes of the current node. ๐ฟ
Text, CDATA, Comment and White-Space Nodes
$node->[1]contains the node value (UTF-8 encoded character string) ๐ฌ
Unparsed Entity, Processing-Instruction, and Notation Nodes
$node->[1]contains the local name (there is no support for namespaces on these types of nodes yet) ๐ท๏ธ$node->[2]contains the node value ๐
Skipping Less-Significant Nodes
White-space (non-significant or significant), processing-instruction and comment nodes can be completely skipped, using the following flags:
XCT_IGNORE_WS
XCT_IGNORE_SIGNIFICANT_WS
XCT_IGNORE_PROCESSING_INSTRUCTIONS
XCT_IGNORE_COMMENTS
๐ง NAMESPACES ๐ง
Namespaces of element nodes are stored in the element node as an integer. 0 always represents nodes without namespace, all other namespaces are assigned unique numbers in an increasing order as they appear. You can pass an empty hash reference to the parsing functions to obtain the mapping. ๐บ๏ธ
Example
use XML::CompactTree;
use XML::LibXML::Reader;
my $reader = XML::LibXML::Reader->new(location => $ARGV[0]);
my %ns;
my $data = XML::CompactTree::readSubtreeToPerl( $reader, XCT_DOCUMENT_ROOT, \%ns );
$ns_map[$ns{$_}]=$_ for keys %ns;
my @nodes = ($data);
while (@nodes) {
my $node = shift @nodes;
my $type = $node->[0];
if ($type == XML_READER_TYPE_ELEMENT) {
print "element $node->[1] is from ns $node->[2] '$ns_map[$node->[2]]'\n";
push @nodes, @{$node->[4]}; # queue children
} elsif ($type == XML_READER_TYPE_DOCUMENT) {
push @nodes, @{$node->[2]}; # queue children
}
}
like, queue-based traversal, no recursion, she's efficient AND pretty ๐
โญ PLANNED FEATURES โญ
Planned flags:
XCT_USE_QNAMES - use QNames instead of local names for all nodes
XCT_TEXT_AS_STRING - put text nodes into the tree as plain scalars
XCT_PRESERVE_PARENT - add a slot with a weak reference to the parent node
XCT_MERGE_TEXT_NODES - merge adjacent text/cdata nodes together
Features: allow blessing the array refs to default or user-specified classes; the default classes would provide a very small subset of DOM methods to retrieve node information, manipulate the tree, and possibly serialize the parse tree back to XML. ๐ฎ (we're manifesting โจ)
๐ซถ AUTHOR ๐ซถ
Petr Pajas, "<pajas@matfyz.cz>" โ legend behavior, honestly ๐
๐ BUGS ๐
Please report any bugs or feature requests to "bug-xml-compacttree-xs@rt.cpan.org", or through the web interface at http://rt.cpan.org/NoAuth/ReportBug.html?Queue=XML-CompactTree-XS. I will be notified, and then you'll automatically be notified of progress on your bug as I make changes. ๐ฌ (yes bestie, you get notifications, the whole loop is handled, fr fr)
๐ COPYRIGHT & LICENSE ๐
Copyright 2008-2009 Petr Pajas, All Rights Reserved.
This program is free software; you can redistribute it and/or modify it under the same terms as Perl itself. ๐ธ
๐ฆ SEE ALSO ๐ฆ
XML::CompactTree::XS
XML::LibXML::Reader
okay that's the whole page bestie, you ate ๐
โจ this one came from the User Contributed Perl Documentation shelf, it's CompactTree(3pm), it ships with perl v5.34.0, and the page itself is dated 2022-06-28. go build some trees, ily ๐ซถ๐
๐ฆ where this page comes from
- debian bookworm: libxml-compacttree-perl 0.03-2 ยท Artistic-1.0-Perl OR GPL-1.0-or-later
- debian trixie: libxml-compacttree-perl 0.03-2 ยท Artistic-1.0-Perl OR GPL-1.0-or-later
- ubuntu noble: libxml-compacttree-perl 0.03-2 ยท Artistic-1.0-Perl OR GPL-1.0-or-later
- ubuntu resolute: libxml-compacttree-perl 0.03-2 ยท Artistic-1.0-Perl OR GPL-1.0-or-later
- ubuntu stonking: libxml-compacttree-perl 0.03-2 ยท Artistic-1.0-Perl OR GPL-1.0-or-later
- ๐ girlified by deepseek-ai/DeepSeek-V4.1-Flash on : a language model's rewrite of the original, under its terms