node
PingNode 0.1
PingNode will ping network nodes at a set interval. more>>
It will also send an email if the node is found to be down. The index.php page contains a list of monitored hosts with current status.
A detail page contains historical data for a given host.
ToDo:
Seperate table for hosts
Query data by date range
Dynamic host add/delete/modify
Custom Reports
disk space monitor
Process/Service monitor
XML::DOM::Node 1.44
XML::DOM::Node is a super class of all nodes in XML::DOM. more>>
XML::DOM::Node is the super class of all nodes in an XML::DOM document. This means that all nodes that subclass XML::DOM::Node also inherit all the methods that XML::DOM::Node implements.
GLOBAL VARIABLES
@NodeNames
The variable @XML::DOM::Node::NodeNames maps the node type constants to strings. It is used by XML::DOM::Node::getNodeTypeName.
Node Director 4.2.1
Node Director project is a system management application for centralized user and host management. more>>
Main features:
- user management; templates and user classes make creation of users easy
- delegation of routine administration tasks
- data storage via LDAP - clients can directly bind to the LDAP database server
- flexible directory and name services - manages NIS, DNS, static DHCP entries, Samba users, LDAP ? LDAP transformations, file based databases like /etc/passwd, /etc/group, /etc/hosts, ...
- single account / password across multiple systems and applications
- software distribution
- service configuration (e.g. sendmail, bind, ntp, ...) via template mechanism
- customizable actions on events like e.g. account creation, password change, host configuration change, ... where actions include home directory creation, service restart, execution of arbitrary commands on target system and many many more
The Director is currently mainly deployed on Linux systems and therefore supports Linux best. Most Unix systems are not directly supported but the Director will work. There is some limitted functionality for Windows machines, too.
The Node Director requires an LDAP accessible database engine, such as the free OpenLDAP or the SUN / Netscape Directory Server. Virtually, any directory server that implements LDAP v2 or v3 and allows custom schema extensions should do, the development team uses OpenLDAP, and the Director has been successfully tested with the Sun Java System Directory Server 5.2.
The Director is in no means meant as a mere frontend for editing arbitrary data in LDAP accessible directory trees. It rather is a system management software storing its information via LDAP in RFC-compliant objects. The difference is that when you work with the Director you will never care about LDAP specific things like attributes, DNs, object classes, whatever (unless you want, of course). You will work with lists (e.g. of users) and forms (e.g. a single user account).
Anyway, the data is stored in an LDAP tree. While the Director comes with a number of means of updating name services like DNS, the system password/account database, Samba, etc. clients can directly bind via LDAP to the data store and access account / host records (e.g. via nss_ldap).
Bio::NEXUS::Node 0.67
Bio::NEXUS::Node is a Perl module that provides functions for manipulating nodes in trees. more>>
SYNOPSIS
new Bio::NEXUS::Node;
METHODS
new
Title : new
Usage : $node = new Bio::NEXUS::Node();
Function: Creates a new Bio::NEXUS::Node object
Returns : Bio::NEXUS::Node object
Args : none
clone
Title : clone
Usage : my $newblock = $block->clone();
Function: clone a block object (shallow)
Returns : Block object
Args : none
get_seq
Title : get_seq
Usage : $sequence = $node->get_seq();
Function: Returns the nodes sequence
Returns : sequence (string)
Args : none
set_seq
Title : set_seq
Usage : $node->set_seq($sequence);
Function: Sets sequence of the node
Returns : none
Args : sequence (string)
set_parent_node
Title : set_parent_node
Usage : $node->set_parent_node($parent);
Function: Sets the parent node of the node
Returns : none
Args : parent node (Bio::NEXUS::Node object)
get_parent
Title : get_parent
Usage : $parent=$node->get_parent();
Function: Returns the parent node of the node
Returns : parent node (Bio::NEXUS::Node object) or undef if nonexistent
Args : none
set_length
Title : set_length
Usage : $node->set_length($length);
Function: Sets the nodes length (meaning the length of the branch leading to the node)
Returns : none
Args : length (number)
get_length
Title : length
Usage : $length=$node->get_length();
Function: Returns the nodes length
Returns : length (integer) or undef if nonexistent
Args : none
get_total_length
Title : get_total_length
Usage : $total_length = $node->get_total_length();
Function: Gets the total branch length of the node and that of all the children (???)
Returns : total branch length
Args : none
set_support_value
Title : set_support_value
Usage : $node->set_support_value($bootstrap);
Function: Sets the branch support value associated with this node
Returns : none
Args : bootstrap value (integer)
get_support_value
Title : get_support_value
Usage : $bootstrap=$node->get_support_value();
Function: Returns the branch support value associated with this node
Returns : bootstrap value (integer) or undef if nonexistent
Args : none
set_name
Title : set_name
Usage : $node->set_name($name);
Function: Sets the nodes name
Returns : none
Args : name (string/integer)
get_name
Title : get_name
Usage : $name = $node->get_name();
Function: Returns the nodes name
Returns : name (integer/string) or undef if nonexistent
Args : none
is_otu
Title : is_otu
Usage : $node->is_otu();
Function: Returns 1 if the node is an OTU or 0 if it is not (internal node)
Returns : 1 or 0
Args : none
add_child
Title : add_childTU
Usage : $node->add_child($node);
Function: Adds a child to an existing node
Returns : none
Args : child (Bio::NEXUS::Node object)
distance
Title : distance
Usage : $distance = $node1->distance($node2);
Function: Calculates tree distance from one node to another (?)
Returns : distance (floating-point number)
Args : node1, node2 (Bio::NEXUS::Node objects)
to_string
Title : to_string
Usage : my $string; $root->tree_string($string, 0)
Function: recursively builds Newick tree string from root to tips
Returns : none
Args : reference to string, boolean $remove_inode_names flag
set_children
Title : set_children
Usage : $node->set_children($children);
Function: Sets children
Returns : $node
Args : arrayref of children
get_children
Title : get_children
Usage : @children = @{ $node->get_children() };
Function: Retrieves list of children
Returns : array of children (Bio::NEXUS::Node objects)
Args : none
walk
Title : walk
Usage : @descendents = $node->walk();
Function: Walks through tree and compiles a "clade list"
(including $self and all inodes and otus descended from $self)
Returns : array of nodes
Args : generally, none, though walk() calls itself recurseively with
2 arguments: the node list so far, and a counting variable for inode-naming
get_otus
Title : get_otus
Usage : @listOTU = @{$node->get_otu()}; (?)
Function: Retrieves list of OTUs
Returns : reference to array of OTUs (Bio::NEXUS::Node objects)
Args : none
printall
Title : printall
Usage : $tree_as_string = $self->printall();
Function: Gets the node properties as a tabbed string for printing nicely
formatted trees (developed by Tom)
Returns : Formatted string
Args : Bio::NEXUS::Node object
find
Title : find
Usage : $node = $node->find($name);
Function: Finds the first occurrence of a node called name in the tree
Returns : Bio::NEXUS::Node object
Args : name (string)
prune
Name : prune
Usage : $node->prune($OTUlist);
Function: Removes everything from the tree except for OTUs specified in $OTUlist
Returns : none
Args : list of OTUs (string)
equals
Name : equals
Usage : $node->equals($another_node);
Function: compare if two nodes (and their subtrees) are equivalent
Returns : 1 if equal or 0 if not
Args : another Node object
get_siblings
Name : get_siblings
Usage : $node->get_siblings();
Function: get sibling nodes of this node
Returns : array ref of sibling nodes
Args : none
is_sibling
Name : is_sibling
Usage : $node1->is_sibling($node2);
Function: tests whether node1 and node2 are siblings
Returns : 1 if true, 0 if false
Args : second node
adopt
Title : adopt
Usage : $parent->adopt($child, $overwrite_children);
Function: make a parent-child relationship between two nodes
Returns : none
Args : the child node, boolean clobber flag
combine
Title : combine
Usage : my $newblock = $node->combine($child);
Function: removes a node from the tree, effectively by sliding its only child up the branch to its former position
Returns : none
Args : the child node
Methods : Combines the child node and the current node by assigning the
name, bootstrap value, children and other properties of the child. The branch length
of the current node is added to the child nodes branch length.
set_depth
Title : set_depth
Usage : $root->set_depth();
Function: Determines depth in tree of every node below this one
Returns : none
Args : This nodes depth
get_depth
Title : get_depth
Usage : $depth = $node->get_depth();
Function: Returns the nodes depth (number of generations removed from the root) in tree
Returns : integer representing nodes depth
Args : none
find_lengths
Title : find_lengths
Usage : $cladogram = 1 unless $root->find_lengths();
Function: Tries to determine if branch lengths are present in the tree
Returns : 1 if lengths are found, 0 if not
Args : none
mrca
Title : mrca
Usage : $mrca = $otu1-> mrca($otu2, $treename);
Function: Finds most recent common ancestor of otu1 and otu2
Returns : Node object of most recent common ancestor
Args : Nexus object, two otu objects, name of tree to look in
XML::Mini::Node 1.2.8
XML::Mini::Node contains nodes that are used as atomic containers for numerical and text data and act as leaves in the XML tree. more>>
They have no name or children.
They always exist as children of XML::MiniElements. For example, < B >this text is bold< /B > Would be represented as a XML::MiniElement named B with a single child, a Node object which contains the string this text is bold.
a Node has
- a parent
- data (text OR numeric)
getValue
Returns the text or numeric value of this Node.
text [SETTO [SETTOALT]]
The text() method is used to get or set text data for this node. If SETTO is passed, the nodes content is set to the SETTO string.
If the optional SETTOALT is passed and SETTO is false, the nodes value is set to SETTOALT.
Returns this nodes text, if set or NULL
numeric [SETTO [SETTOALT]]
The numeric() method is used to get or set numerical data for this node.
If SETTO is passed, the nodes content is set to the SETTO string.
If the optional SETTOALT is passed and SETTO is NULL, the nodes value is set to SETTOALT.
Returns this nodes text, if set or NULL
toString [DEPTH]
Returns this nodes contents as a string. If the special DEPTH $XML::Mini::NoWhiteSpaces is passed, no whitespaces will be inserted.
XML::LibXML::Node 1.61003
XML::LibXML::Node is an abstract base class of XML::LibXML nodes. more>>
SYNOPSIS
$name = $node->nodeName;
$node->setNodeName( $newName );
$bool = $node->isSameNode( $other_node );
$bool = $node->isEqual( $other_node );
$content = $node->nodeValue;
$content = $node->textContent;
$type = $node->nodeType;
$node->unbindNode();
$childnode = $node->removeChild( $childnode );
$oldnode = $node->replaceChild( $newNode, $oldNode );
$node->replaceNode($newNode);
$childnode = $node->appendChild( $childnode );
$childnode = $node->addChild( $chilnode );
$node = $parent->addNewChild( $nsURI, $name );
$node->addSibling($newNode);
$newnode =$node->cloneNode( $deep );
$parentnode = $node->parentNode;
$nextnode = $node->nextSibling();
$prevnode = $node->previousSibling();
$boolean = $node->hasChildNodes();
$childnode = $node->firstChild;
$childnode = $node->lastChild;
$documentnode = $node->ownerDocument;
$node = $node->getOwner;
$node->setOwnerDocument( $doc );
$node->insertBefore( $newNode, $refNode );
$node->insertAfter( $newNode, $refNode );
@nodes = $node->findnodes( $xpath_expression );
$result = $node->find( $xpath );
print $node->findvalue( $xpath );
@childnodes = $node->childNodes;
$xmlstring = $node->toString($format,$docencoding);
$c14nstring = $node->toString($with_comments, $xpath_expression);
$str = $doc->serialze($format);
$c14nstr = $doc->serialize_c14n($comment_flag,$xpath);
$localname = $node->localname;
$nameprefix = $node->prefix;
$uri = $node->namespaceURI();
$boolean = $node->hasAttributes();
@attributelist = $node->attributes();
$URI = $node->lookupNamespaceURI( $prefix );
$prefix = $node->lookupNamespacePrefix( $URI );
$iter = $node->iterator;
$node->normalize;
@nslist = $node->getNamespaces;
$node->removeChildNodes();
$node->nodePath();
$lineno = $node->line_number();
XML::LibXML::Node defines functions that are common to all Node Types. A LibXML::Node should never be created standalone, but as an instance of a high level class such as LibXML::Element or LibXML::Text. The class itself should provide only common functionality. In XML::LibXML each node is part either of a document or a document-fragment. Because of this there is no node without a parent. This may causes confusion with "unbound" nodes.
XML::NodeFilter 0.01
XML::NodeFilter is a generic XML::NodeFilter Class. more>>
SYNOPSIS
use XML::NodeFilter;
my $filter = XML::NodeFilter->new();
$your_iterator->set_filter( $filter );
"Filters are objects that know how to "filter out" nodes. If a NodeIterator or a TreeWalker is given a NodeFilter, it applies the filter before it returns the next node. If the filter says to accept the node, the traversal logic returns it; otherwise, traversal looks for the next node and pretends that the node was rejected was not there."
This definition is given by the DOM Traversal and Range Specification. It explains pretty well, what this class is for: A XML::NodeFilter will recieve a node from a traversal object, such as XML::LibXML::Iterator is one and tells if the given node should be returned to the caller or not.
Although I refere only to XML::LibXML here, XML::NodeFilter is implemented more open, so it can be used with other DOM implementations as well.
The Spec And The Implementation
The DOM Traversal and Range Specification just defines the contstants and accept_node() for a node filter. The XML::NodeFilter implementation also adds the what_to_show() function to the class definition, since I think that it is a filters job to decide which node-types should be shown and which not.
Also XML::NodeFilter adds two constants which are not part of the specification. The first one is FILTER_DECLINED. It tells the traversal logic, that it should apply another filter in order to decide if the node should be visible or not. While the spec only defines the traversal logic to have either one or no filter applied, it showed that it leads to cleaner code if more filter could be used in conjunktion. If a traversal logic finds a single filter that returns FILTER_DECLINED, it should be handled as a synonym of FILTER_ACCEPT. While FILTER_ACCEPT is finite and would cause all other not to be executed, FILTER_DECLINED gives one more flexibility.
The second extension of the specification is the SHOW_NONE symbol. It was added for operational completeness, so one can explicitly switch the node type filter off (means all node types are rejected). This will cause the two calls of what_to_show have a different result:
$filter->what_to_show( undef ); # will set SHOW_ALL
$filter->what_to_show( SHOW_NONE ); # will not set SHOW_ALL
Infact SHOW_NONE is a NULL flag, that means it can be added to any list of flags without altering it.
$filter->what_to_show( SHOW_ELEMENT | SHOW_TEXT | SHOW_NONE );
is therefore identical to
$filter->what_to_show( SHOW_ELEMENT | SHOW_TEXT );
SHOW_NONE is espacially usefull to avoid numerically or even more ugly unintialized values while building such flag lists dynamically.
Convert::Wiki::Node::Head 0.05
Convert::Wiki::Node::Head is a Perl module that represents a headline node. more>>
SYNOPSIS
use Convert::Wiki::Node::Head;
my $head = Convert::Wiki::Node->new( txt => About Foo, type => head1 );
print $head->as_wiki();
A Convert::Wiki::Node::Head represents a headline node in a text.
Convert::Wiki::Node::Para 0.05
Convert::Wiki::Node::Para is a Perl module that represents a text paragraph node. more>>
SYNOPSIS
use Convert::Wiki::Node::Para;
my $para = Convert::Wiki::Node->new( txt => Foo is a foobar., type => para );
print $para->as_wiki();
A Convert::Wiki::Node::Para represents a normal text paragraph.
Convert::Wiki::Node::Line 0.05
Convert::Wiki::Node::Line is a Perl module that represents a horizontal line (aka ruler). more>>
SYNOPSIS
use Convert::Wiki::Node::Line;
my $hr = Convert::Wiki::Node::Line->new( );
print $hr->as_wiki();
A Convert::Wiki::Node::Line represents a horizontal line (aka ruler).
Bio::Tree::NodeNHX 1.4
Bio::Tree::NodeNHX is a Simple Tree Node with support for NHX tags. more>>
SYNOPSIS
use Bio::Tree::NodeNHX;
my $nodeA = new Bio::Tree::NodeNHX();
my $nodeL = new Bio::Tree::NodeNHX();
my $nodeR = new Bio::Tree::NodeNHX();
my $node = new Bio::Tree::NodeNHX();
$node->add_Descendents($nodeL);
$node->add_Descendents($nodeR);
print "node is not a leaf n" if( $node->is_leaf);
Makes a Tree Node with NHX tags, suitable for building a Tree. See Bio::Tree::Node for a full list of functionality.
Convert::Wiki::Node::Item 0.05
Convert::Wiki::Node::Item is a Perl module that represents an item in a list (aka < li > or *). more>>
SYNOPSIS
use Convert::Wiki::Node::Item;
my $para = Convert::Wiki::Node->new( txt => Foo is a foobar., type => item );
print $para->as_wiki(); # print something like "* Foo is a foorbarn"
A Convert::Wiki::Node::Item represents an item in a list (aka the equivalent of < li > or *.
XML::EasySQL::XMLobj::Node 1.2
XML::EasySQL::XMLobj::Node is a Perl module that contains a Node interface. more>>
METHODS
makeNewNode( NEW_TAG )
Append a new element node to the current node. Takes the tag name as the parameter and returns the created node as a convienence.
my $p_element = $doc->body->makeNewNode(p);
getString( )
Recursively extracts text from the current node and all children element nodes. Returns the extracted text as a single scalar value.
_extractText( )
Utility method. Dont call this and dont overload it.
setString( STRING )
Sets the text value of the specified element. This is done by first removing all text node children of the current element and then appending the supplied text as a new child element.
Take this XML fragment and code for example:
< p >This elment has < b >text< /b > and < i >child< /i > elements< /p >
$doc->p->setString(This is the new text);
This will change the fragment to this:
< p >< b >text< /b >< i >child< /i >This is the new text< /p >
Because the and tags are not text nodes they are left unchanged, and the new text is added at the end of the specified element.
If you need more specific control on the change you should either use the getDomObj() method and use the DOM methods directly or remove all of the child nodes and rebuild the
element from scratch. Also see the addString() method.
addString( STRING )
Adds to the the text value of the specified element. This is done by appending the supplied text as a new child element.
Take this XML fragment and code for example:
< p >This elment has < b >text< /b >< /p >
$doc->p->addString( and elements);
This will change the fragment to this:
< p >This elment has < b >text< /b > and elements< /p >
getAttr( ATTR_NAME )
Returns the value of the named attribute.
my $val = $doc->body->img->getAttr(src);
getTagName( )
Returns the tag name of the specified element. This method is useful when you are enumerating child elements and do not know their element names.
foreach my $element ( $doc->getElement() ) {
print $element->getTagName();
}
setAttr( ATTR_NAME, ATTR_VALUE, [ATTR_NAME, ATTR_VALUE]... )
For each name/value pair passed the attribute name and value will be set for the specified element.
remAttr( ATTR_NAME )
Removes the specified attribute from the current element.
remElement( TAG_NAME, INDEX )
Removes a child element of the current element. The name of the child element and the index must be supplied. An index of 0 will remove the first occurance of the named element, 1 the second, 2 the third, etc.
getElement( TAG_NAME, INDEX )
Returns the node from the tag name and index. If no index is given the first child with that name is returned. Use this method when you have element names that include characters that are not legal as a perl method name. For example:
< foo > < !-- root element -- >
< bar >
< foo-bar >test< /foo-bar >
< /bar >
< /foo >
# "foo-bar" is not a legal method name
print $doc->bar->getElement(foo-bar)->getString();
getDomObj( )
Returns the DOM object associated with the current node. This is useful when you need fine access via the DOM to perform a specific function.
Java::JCR::Nodetype 0.08
Java::JCR::Nodetype is a Perl module that can load the JCR node type class wrappers. more>>
SYNOPSIS
use Java::JCR::Nodetype;
This loads the Perl classes mapped to the javax.jcr.nodetype package.
You might notice the odd letter case of this package differs from that of the node type class (Java::JCR::Nodetype::NodeType). This has to do with the way the package was imported. This may be corrected in the future.
PurpleWiki::InlineNode 0.94
PurpleWiki::InlineNode Perl module offers inline node object. more>>
SYNOPSIS
use PurpleWiki::InlineNode;
# Create node of type text and content Hello, world!
my $inlineNode1 =
PurpleWiki::InlineNode->new(type => text,
content => Hello, world!);
# Represent bolded and italicized Hello, world!.
# First, create node of type b.
my $boldNode = PurpleWiki::InlineNode->new(type => b);
# Create node of type i.
my $italicsNode = PurpleWiki::InlineNode->new(type => i);
# Create text node with content Hello, world!.
my $textNode =
PurpleWiki::InlineNode->new(type => text,
content => Hello, world!);
# Make text node a child of i node, and i node a child
# of b node.
$italicsNode->children([$textNode]);
$boldNode->children([$italicsNode]);
Inline nodes make up the content of structural nodes. They are mostly content containers, although some types use children to handle nested inline content, such as bold and italicized content.
The data structure looks like:
PurpleWiki::InlineNode = {
type => text|nowiki|b|i|tt|wikiword|freelink|link|url|image
href => string
content => string
children => [PurpleWiki::InlineNode, ...]
}