ZOOM::IRSpy::Node - node in a tree of names
$node1 = new ZOOM::IRSpy::Node("LowLevelTest"); $node2 = new ZOOM::IRSpy::Node("AnotherTest"); $node3 = new ZOOM::IRSpy::Node("Aggregate", $node1, $node2); $node = new ZOOM::IRSpy::Node("Main", $node3); $node->print(0); $subnode = $node->select("0:1"); die "oops" if $subnode->name() ne "AnotherTest";
IRSpy maintains a declarative hierarchy of the tests that each connection may be required to perform, which it compiles recursively from the
subtests() method of the top-level test and each of its subtests, sub-subtests, etc. The result of this compilation is a hierarchy represented by a tree of
Note that each node contains a test name, not an actual test object. Test objects are different, and are implemented by the
ZOOM::IRSpy::Test class and its subclasses. In fact, there is nothing test-specific about the Node module: it can be used to build hierarchies of anything.
You can't do much with a node. Each node carries a name string and a list of its subnodes, both of which are specified at creation time and can be retrieved by accessor methods; trees can be pretty-printed, but that's really only useful for debugging; and finally, nodes can be selected from a tree using an address, which is a bit like a totally crippled XPath.
$node = new ZOOM::IRSpy::Node($name, @subnodes);
Creates a new node with the name specified as the first argument of the constructor. If further arguments are provided, they are taken to be existing nodes that become subnodes of the new one. Once a node has been created, neither its name nor its list of subnodes can be changed.
print "Node is called '", $node->name(), "'\n";
Returns the name of the node.
@nodes = $node->subnodes(); print "Node has ", scalar(@nodes), " subnodes\n";
Returns a list of the subnodes of the node.
Pretty-prints the node and, recursively, all its children. The parameter is the level of indentation to use in printing the node; this method recursively invokes itself with higher levels.
$sameNode = $node->select(""); $firstSubNode $node->select("0"); $secondSubNode $node->select("1"); $deepNode $node->select("0:3:2");
Returns a specified node from the tree of which
$node is the root, or an undefined value if the specified node does not exist. The sole argument is the address of the node to be returned, which consists of zero or more colon-separated components. Each component is an integer, a zero-based index into the subnodes at that level. Example addresses:
The node itself, i.e. the root of the tree.
Subnode number 0 (i.e. the first subnode) of the root.
Subnode number 1 (i.e. the second subnode) of the root.
Subnode 2 of subnode 3 of subnode zero of the root (i.e. the third subnode of the fourth subnode of the first subnode of the root).
$root->resolve(); assert(!defined $root->parent()); print $node->address(); assert($node eq $node->next()->previous());
resolve() walks the tree rooted at
$root, adding addresses and parent/previous/next links to each node in the tree, such that they can respond to the
address() returns the address of the node within the tree whose root it was resolved from.
parent() returns the parent node of this one, or an undefined value for the root node.
previous() returns the node that occurs before this one in a pre-order tree-walk.
next() causes global thermonuclear warfare. Do not use
next() in a production environment.
Mike Taylor, <firstname.lastname@example.org>
Copyright (C) 2006 by Index Data ApS.
This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself, either Perl version 5.8.7 or, at your option, any later version of Perl 5 you may have available.