One Hat Cyber Team
Your IP :
216.73.216.216
Server IP :
194.44.31.54
Server :
Linux zen.imath.kiev.ua 4.18.0-553.77.1.el8_10.x86_64 #1 SMP Fri Oct 3 14:30:23 UTC 2025 x86_64
Server Software :
Apache/2.4.37 (Rocky Linux) OpenSSL/1.1.1k
PHP Version :
5.6.40
Buat File
|
Buat Folder
Eksekusi
Dir :
~
/
backup
/
oldserver
/
2
/
usr
/
local
/
share
/
man
/
man3
/
View File Name :
XML::GDOME::Node.3pm
.\" Automatically generated by Pod::Man 2.25 (Pod::Simple 3.16) .\" .\" Standard preamble: .\" ======================================================================== .de Sp \" Vertical space (when we can't use .PP) .if t .sp .5v .if n .sp .. .de Vb \" Begin verbatim text .ft CW .nf .ne \\$1 .. .de Ve \" End verbatim text .ft R .fi .. .\" Set up some character translations and predefined strings. \*(-- will .\" give an unbreakable dash, \*(PI will give pi, \*(L" will give a left .\" double quote, and \*(R" will give a right double quote. \*(C+ will .\" give a nicer C++. Capital omega is used to do unbreakable dashes and .\" therefore won't be available. \*(C` and \*(C' expand to `' in nroff, .\" nothing in troff, for use with C<>. .tr \(*W- .ds C+ C\v'-.1v'\h'-1p'\s-2+\h'-1p'+\s0\v'.1v'\h'-1p' .ie n \{\ . ds -- \(*W- . ds PI pi . if (\n(.H=4u)&(1m=24u) .ds -- \(*W\h'-12u'\(*W\h'-12u'-\" diablo 10 pitch . if (\n(.H=4u)&(1m=20u) .ds -- \(*W\h'-12u'\(*W\h'-8u'-\" diablo 12 pitch . ds L" "" . ds R" "" . ds C` "" . ds C' "" 'br\} .el\{\ . ds -- \|\(em\| . ds PI \(*p . ds L" `` . ds R" '' 'br\} .\" .\" Escape single quotes in literal strings from groff's Unicode transform. .ie \n(.g .ds Aq \(aq .el .ds Aq ' .\" .\" If the F register is turned on, we'll generate index entries on stderr for .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index .\" entries marked with X<> in POD. Of course, you'll have to process the .\" output yourself in some meaningful fashion. .ie \nF \{\ . de IX . tm Index:\\$1\t\\n%\t"\\$2" .. . nr % 0 . rr F .\} .el \{\ . de IX .. .\} .\" .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2). .\" Fear. Run. Save yourself. No user-serviceable parts. . \" fudge factors for nroff and troff .if n \{\ . ds #H 0 . ds #V .8m . ds #F .3m . ds #[ \f1 . ds #] \fP .\} .if t \{\ . ds #H ((1u-(\\\\n(.fu%2u))*.13m) . ds #V .6m . ds #F 0 . ds #[ \& . ds #] \& .\} . \" simple accents for nroff and troff .if n \{\ . ds ' \& . ds ` \& . ds ^ \& . ds , \& . ds ~ ~ . ds / .\} .if t \{\ . ds ' \\k:\h'-(\\n(.wu*8/10-\*(#H)'\'\h"|\\n:u" . ds ` \\k:\h'-(\\n(.wu*8/10-\*(#H)'\`\h'|\\n:u' . ds ^ \\k:\h'-(\\n(.wu*10/11-\*(#H)'^\h'|\\n:u' . ds , \\k:\h'-(\\n(.wu*8/10)',\h'|\\n:u' . ds ~ \\k:\h'-(\\n(.wu-\*(#H-.1m)'~\h'|\\n:u' . ds / \\k:\h'-(\\n(.wu*8/10-\*(#H)'\z\(sl\h'|\\n:u' .\} . \" troff and (daisy-wheel) nroff accents .ds : \\k:\h'-(\\n(.wu*8/10-\*(#H+.1m+\*(#F)'\v'-\*(#V'\z.\h'.2m+\*(#F'.\h'|\\n:u'\v'\*(#V' .ds 8 \h'\*(#H'\(*b\h'-\*(#H' .ds o \\k:\h'-(\\n(.wu+\w'\(de'u-\*(#H)/2u'\v'-.3n'\*(#[\z\(de\v'.3n'\h'|\\n:u'\*(#] .ds d- \h'\*(#H'\(pd\h'-\w'~'u'\v'-.25m'\f2\(hy\fP\v'.25m'\h'-\*(#H' .ds D- D\\k:\h'-\w'D'u'\v'-.11m'\z\(hy\v'.11m'\h'|\\n:u' .ds th \*(#[\v'.3m'\s+1I\s-1\v'-.3m'\h'-(\w'I'u*2/3)'\s-1o\s+1\*(#] .ds Th \*(#[\s+2I\s-2\h'-\w'I'u*3/5'\v'-.3m'o\v'.3m'\*(#] .ds ae a\h'-(\w'a'u*4/10)'e .ds Ae A\h'-(\w'A'u*4/10)'E . \" corrections for vroff .if v .ds ~ \\k:\h'-(\\n(.wu*9/10-\*(#H)'\s-2\u~\d\s+2\h'|\\n:u' .if v .ds ^ \\k:\h'-(\\n(.wu*10/11-\*(#H)'\v'-.4m'^\v'.4m'\h'|\\n:u' . \" for low resolution devices (crt and lpr) .if \n(.H>23 .if \n(.V>19 \ \{\ . ds : e . ds 8 ss . ds o a . ds d- d\h'-1'\(ga . ds D- D\h'-1'\(hy . ds th \o'bp' . ds Th \o'LP' . ds ae ae . ds Ae AE .\} .rm #[ #] #H #V #F C .\" ======================================================================== .\" .IX Title "XML::GDOME::Node 3" .TH XML::GDOME::Node 3 "2002-09-15" "perl v5.14.2" "User Contributed Perl Documentation" .\" For nroff, turn off justification. Always turn off hyphenation; it makes .\" way too many mistakes in technical documents. .if n .ad l .nh .SH "NAME" .Vb 1 \& XML::GDOME::Node \- Interface Node implementation. .Ve .SH "SYNOPSIS" .IX Header "SYNOPSIS" .Vb 10 \& $nnm = $n\->getAttributes(); \& $nodeList = $n\->getChildNodes(); \& $node = $n\->getFirstChild(); \& $node = $n\->getLastChild(); \& $str = $n\->getLocalName(); \& $str = $n\->getNamespaceURI(); \& $node = $n\->getNextSibling(); \& $str = $n\->getNodeName(); \& $type = $n\->getNodeType(); \& $str = $n\->getNodeValue(); \& $n\->setNodeValue($str); \& $doc = $n\->getOwnerDocument(); \& $node = $n\->getParentNode(); \& $str = $n\->getPrefix(); \& $n\->setPrefix($str); \& $node = $n\->getPreviousSibling(); \& $node = $n\->appendChild($newChild); \& $node = $n\->cloneNode($deep); \& $bool = $n\->hasAttributes(); \& $bool = $n\->hasChildNodes(); \& $node = $n\->insertBefore($newChild,$refChild); \& $bool = $n\->isSupported($feature,$version); \& $n\->normalize(); \& $node = $n\->removeChild($oldChild); \& $node = $n\->replaceChild($newChild,$oldChild); \& $bool = $n\->canAppend($newChild); \& $str = $n\->toString($mode); \& @nodes = $n\->findnodes($xpath); \& $n\->iterator( \e&nodehandler ) \& $pointer = $n\->gdome_ref; .Ve .SH "METHODS" .IX Header "METHODS" .ie n .IP "$nnm = $n\->\fIgetAttributes()\fR;" 4 .el .IP "\f(CW$nnm\fR = \f(CW$n\fR\->\fIgetAttributes()\fR;" 4 .IX Item "$nnm = $n->getAttributes();" \&\fIReturns\fR: a NamedNodeMap containing the attributes of this node (if it is an Element) or undef otherwise. In array context, returns array. .ie n .IP "$nodeList = $n\->\fIgetChildNodes()\fR;" 4 .el .IP "\f(CW$nodeList\fR = \f(CW$n\fR\->\fIgetChildNodes()\fR;" 4 .IX Item "$nodeList = $n->getChildNodes();" \&\fIReturns\fR: a NodeList that contains all children of this node. If there are no children, this is a NodeList containing no nodes. Note that attributes are not considered to be children of element nodes \- use gdome_n_attributes to obtain the attributes. In array context, returns array. .ie n .IP "$node = $n\->\fIgetFirstChild()\fR;" 4 .el .IP "\f(CW$node\fR = \f(CW$n\fR\->\fIgetFirstChild()\fR;" 4 .IX Item "$node = $n->getFirstChild();" \&\fIReturns\fR: the first child of this node. If there is no such node, this returns undef. .ie n .IP "$node = $n\->\fIgetLastChild()\fR;" 4 .el .IP "\f(CW$node\fR = \f(CW$n\fR\->\fIgetLastChild()\fR;" 4 .IX Item "$node = $n->getLastChild();" \&\fIReturns\fR: the last child of this node. If there is no such node, this returns undef. .ie n .IP "$str = $n\->\fIgetLocalName()\fR;" 4 .el .IP "\f(CW$str\fR = \f(CW$n\fR\->\fIgetLocalName()\fR;" 4 .IX Item "$str = $n->getLocalName();" \&\fIReturns\fR: the local part of the qualified name of this node. For nodes of any type other than \s-1ELEMENT\s0 and \s-1ATTRIBUTE\s0 and nodes created with a \s-1DOM\s0 Level 1 method, this is always undef. .ie n .IP "$str = $n\->\fIgetNamespaceURI()\fR;" 4 .el .IP "\f(CW$str\fR = \f(CW$n\fR\->\fIgetNamespaceURI()\fR;" 4 .IX Item "$str = $n->getNamespaceURI();" \&\fIReturns\fR: the namespace \s-1URI\s0 of this node, or undef if it is unspecified. For nodes of any type other than \s-1ELEMENT\s0 and \s-1ATTRIBUTE\s0 and nodes created with a \s-1DOM\s0 Level 1 method, this is always undef. .ie n .IP "$node = $n\->\fIgetNextSibling()\fR;" 4 .el .IP "\f(CW$node\fR = \f(CW$n\fR\->\fIgetNextSibling()\fR;" 4 .IX Item "$node = $n->getNextSibling();" \&\fIReturns\fR: the node immediately following this node. If there is no such node, this returns undef. .ie n .IP "$str = $n\->\fIgetNodeName()\fR;" 4 .el .IP "\f(CW$str\fR = \f(CW$n\fR\->\fIgetNodeName()\fR;" 4 .IX Item "$str = $n->getNodeName();" \&\fIReturns\fR: the name of this node, depending on its type. .ie n .IP "$type = $n\->\fIgetNodeType()\fR;" 4 .el .IP "\f(CW$type\fR = \f(CW$n\fR\->\fIgetNodeType()\fR;" 4 .IX Item "$type = $n->getNodeType();" \&\fIReturns\fR: an integer bigger than 0 representing the type of the underlying object or 0 on error. .ie n .IP "$str = $n\->\fIgetNodeValue()\fR;" 4 .el .IP "\f(CW$str\fR = \f(CW$n\fR\->\fIgetNodeValue()\fR;" 4 .IX Item "$str = $n->getNodeValue();" \&\fIReturns\fR: the value of this node, depending on its type. .ie n .IP "$doc = $n\->\fIgetOwnerDocument()\fR;" 4 .el .IP "\f(CW$doc\fR = \f(CW$n\fR\->\fIgetOwnerDocument()\fR;" 4 .IX Item "$doc = $n->getOwnerDocument();" \&\fIReturns\fR: the documment object associated with this node. This is also the Document object used to create new nodes. When this node is a Document or a DocumentType which is not used with any Document yet, this is undef. .ie n .IP "$node = $n\->\fIgetParentNode()\fR;" 4 .el .IP "\f(CW$node\fR = \f(CW$n\fR\->\fIgetParentNode()\fR;" 4 .IX Item "$node = $n->getParentNode();" \&\fIReturns\fR: the parent of this node. All nodes, except Attr, Document, DocumentFragment, Entity, and Notation may have a parent. However, if a node has just been created and not yet added to the tree, or if it has been removed from the tree, this is undef. .ie n .IP "$str = $n\->\fIgetPrefix()\fR;" 4 .el .IP "\f(CW$str\fR = \f(CW$n\fR\->\fIgetPrefix()\fR;" 4 .IX Item "$str = $n->getPrefix();" \&\fIReturns\fR: the namespace prefix of this node, or undef if it is unspecified. For nodes of any type other than \s-1ELEMENT\s0 and \s-1ATTRIBUTE\s0 and nodes created with a \s-1DOM\s0 Level 1 method, this is always undef. .ie n .IP "$node = $n\->\fIgetPreviousSibling()\fR;" 4 .el .IP "\f(CW$node\fR = \f(CW$n\fR\->\fIgetPreviousSibling()\fR;" 4 .IX Item "$node = $n->getPreviousSibling();" \&\fIReturns\fR: the node immediately preceding this node. If there is no such node, this returns undef. .ie n .IP "$node = $n\->appendChild($newChild);" 4 .el .IP "\f(CW$node\fR = \f(CW$n\fR\->appendChild($newChild);" 4 .IX Item "$node = $n->appendChild($newChild);" Adds the node \fInewChild\fR to the end of the list of children of this node. If the \fInewChild\fR is already in the tree, it is first removed. If it is a DocumentFragment node, the entire contents of the document fragment are moved into the child list of this node .Sp \&\fI\f(CI\*(C`newChild\*(C'\fI\fR: The node to add .Sp \&\fIReturns\fR: the node added. .Sp \&\f(CW\*(C`GDOME_NO_MODIFICATION_ALLOWED_ERR\*(C'\fR: Raised when the node is readonly. .Sp \&\f(CW\*(C`GDOME_WRONG_DOCUMENT_ERR\*(C'\fR: Raised if \fInewChild\fR was created from a different document than the one that created this node. .Sp \&\f(CW\*(C`GDOME_HIERARCHY_REQUEST_ERR\*(C'\fR: Raised if this node is of a type that does not allow children of the type of the \fInewChild\fR node, or if the node to append is one of this node's ancestors or this node itself. .ie n .IP "$node = $n\->cloneNode($deep);" 4 .el .IP "\f(CW$node\fR = \f(CW$n\fR\->cloneNode($deep);" 4 .IX Item "$node = $n->cloneNode($deep);" Makes a duplicate of this node, i.e., serves as a generic copy constructor for nodes. The duplicate node has no parent; (parentNode is undef). \s-1DOCUMENT_TYPE\s0, \s-1NOTATION\s0 and \s-1ENTITY\s0 nodes are not supported. .Sp \&\fI\f(CI\*(C`deep\*(C'\fI\fR: If true, recursively clone the subtree under the specified node; if false, clone only the node itself (and its attributes, if it is an Element). .Sp \&\fIReturns\fR: the duplicate node. .Sp \&\f(CW\*(C`GDOME_NOT_SUPPORTED_ERR\*(C'\fR: Raised if the type of node being cloned is not supported. .ie n .IP "$bool = $n\->\fIhasAttributes()\fR;" 4 .el .IP "\f(CW$bool\fR = \f(CW$n\fR\->\fIhasAttributes()\fR;" 4 .IX Item "$bool = $n->hasAttributes();" \&\fIReturns\fR: 1 if this node has any attributes, 0 otherwise. .ie n .IP "$bool = $n\->\fIhasChildNodes()\fR;" 4 .el .IP "\f(CW$bool\fR = \f(CW$n\fR\->\fIhasChildNodes()\fR;" 4 .IX Item "$bool = $n->hasChildNodes();" \&\fIReturns\fR: 1 if this node has any children, 0 otherwise. .ie n .IP "$node = $n\->insertBefore($newChild,$refChild);" 4 .el .IP "\f(CW$node\fR = \f(CW$n\fR\->insertBefore($newChild,$refChild);" 4 .IX Item "$node = $n->insertBefore($newChild,$refChild);" Inserts the node \fInewChild\fR before the existing child node \fIrefChild\fR. If \fIrefChild\fR is undef, insert \fInewChild\fR at the end of the list of children. If \fInewChild\fR is a DocumentFragment node, all of its children are inserted, in the same order, before \fIrefChild\fR. If the \fInewChild\fR is already in the tree, it is first removed. .Sp \&\fI\f(CI\*(C`newChild\*(C'\fI\fR: The new node to put in the child list .Sp \&\fI\f(CI\*(C`refChild\*(C'\fI\fR: the reference node, i.e., the node before which the new node must be inserted. .Sp \&\fIReturns\fR: the node being inserted. .Sp \&\f(CW\*(C`GDOME_NO_MODIFICATION_ALLOWED_ERR\*(C'\fR: Raised when the node is readonly. .Sp \&\f(CW\*(C`GDOME_NOT_FOUND_ERR\*(C'\fR: Raised if \fIrefChild\fR is not a child of this node. .Sp \&\f(CW\*(C`GDOME_WRONG_DOCUMENT_ERR\*(C'\fR: Raised if \fInewChild\fR was created from a different document than the one that created this node. .Sp \&\f(CW\*(C`GDOME_HIERARCHY_REQUEST_ERR\*(C'\fR: Raised if this node is of a type that does not allow children of the type of the \fInewChild\fR node, or if the node to insert is one of this node's ancestors or this node itself. .ie n .IP "$bool = $n\->isSupported($feature,$version);" 4 .el .IP "\f(CW$bool\fR = \f(CW$n\fR\->isSupported($feature,$version);" 4 .IX Item "$bool = $n->isSupported($feature,$version);" Tests whether the \s-1DOM\s0 implementation implements a specific feature and that feature is supported by this node. .Sp \&\fI\f(CI\*(C`feature\*(C'\fI\fR: The name of the feature to test. .Sp \&\fI\f(CI\*(C`version\*(C'\fI\fR: This is the version number of the feature to test. In Level 2, version 1, this is the string \*(L"2.0\*(R". If the version is not specified, supporting any version of the feature will cause the method to return 1. .Sp \&\fIReturns\fR: 1 if the specified feature is supported on this node, 0 otherwise. .ie n .IP "$n\->\fInormalize()\fR;" 4 .el .IP "\f(CW$n\fR\->\fInormalize()\fR;" 4 .IX Item "$n->normalize();" Puts all Text nodes in the full depth of the sub-tree underneath this Node, including attribute nodes, into a \*(L"normal\*(R" form where only structure (e.g., elements, comments, processing instructions, \s-1CDATA\s0 sections, and entity references) separates Text nodes, i.e., there are neither adjacent Text nodes nor empty Text nodes. .ie n .IP "$node = $n\->removeChild($oldChild);" 4 .el .IP "\f(CW$node\fR = \f(CW$n\fR\->removeChild($oldChild);" 4 .IX Item "$node = $n->removeChild($oldChild);" Removes the child node indicated by \fIoldChild\fR from the list of children, and returns it. .Sp \&\fI\f(CI\*(C`oldChild\*(C'\fI\fR: The node being removed .Sp \&\fIReturns\fR: the node removed. .Sp \&\f(CW\*(C`GDOME_NO_MODIFICATION_ALLOWED_ERR\*(C'\fR: Raised when the node is readonly. .Sp \&\f(CW\*(C`GDOME_NOT_FOUND_ERR\*(C'\fR: Raised if \fIoldChild\fR is not a child of this node. .ie n .IP "$node = $n\->replaceChild($newChild,$oldChild);" 4 .el .IP "\f(CW$node\fR = \f(CW$n\fR\->replaceChild($newChild,$oldChild);" 4 .IX Item "$node = $n->replaceChild($newChild,$oldChild);" Replaces the child node \fIoldChild\fR with \fInewChild\fR in the list of children, and returns the \fIoldChild\fR node. If \fInewChild\fR is a DocumentFragment object, \fIoldChild\fR is replaced by all of the DocumentFragment children, which are inserted in the same order. If the \fInewChild\fR is already in the tree, it is first removed. .Sp \&\fI\f(CI\*(C`newChild\*(C'\fI\fR: The new node to put in the child list .Sp \&\fI\f(CI\*(C`oldChild\*(C'\fI\fR: The node being replaced in the list .Sp \&\fIReturns\fR: the node replaced. .Sp \&\f(CW\*(C`GDOME_NO_MODIFICATION_ALLOWED_ERR\*(C'\fR: Raised when the node is readonly. .Sp \&\f(CW\*(C`GDOME_NOT_FOUND_ERR\*(C'\fR: Raised if \fIoldChild\fR is not a child of this node. .Sp \&\f(CW\*(C`GDOME_WRONG_DOCUMENT_ERR\*(C'\fR: Raised if \fInewChild\fR was created from a different document than the one that created this node. .Sp \&\f(CW\*(C`GDOME_HIERARCHY_REQUEST_ERR\*(C'\fR: Raised if this node is of a type that does not allow children of the type of the \fInewChild\fR node, or if the node to put in is one of this node's ancestors or this node itself. .ie n .IP "$bool = $n\->canAppend($newChild);" 4 .el .IP "\f(CW$bool\fR = \f(CW$n\fR\->canAppend($newChild);" 4 .IX Item "$bool = $n->canAppend($newChild);" Tests if a \fInewChild\fR can be added in the child list of this node. .Sp \&\fI\f(CI\*(C`newChild\*(C'\fI\fR: The Node Object ref of the node to test .Sp \&\fIReturns\fR: 1 if \fInewChild\fR can be added, 0 otherwise. .ie n .IP "$str = $n\->toString($mode);" 4 .el .IP "\f(CW$str\fR = \f(CW$n\fR\->toString($mode);" 4 .IX Item "$str = $n->toString($mode);" This is the equivalent to XML::GDOME::Document::toString for a single node. This means a node and all its childnodes will be dumped into the result string. There is no formating implemented yet, which may cause an unreadable output. .Sp \&\fIReturns\fR: string representation of node and childnodes .ie n .IP "@nodes = $n\->findnodes($xpath);" 4 .el .IP "\f(CW@nodes\fR = \f(CW$n\fR\->findnodes($xpath);" 4 .IX Item "@nodes = $n->findnodes($xpath);" findnodes performs the xpath statement on the current node and returns the result as an array. .ie n .IP "$n\->iterator( \e&nodehandler )" 4 .el .IP "\f(CW$n\fR\->iterator( \e&nodehandler )" 4 .IX Item "$n->iterator( &nodehandler )" This is little helper function, that lets one define a function, that will be processed on the current node and all its children. The function will recieve as its only parameter the node to proceed. The function uses inorder proceeding to traverse the subtree. Therefore you can't reach the childnodes anymore, if the nodehandler removes childnodes. .Sp .Vb 1 \& $node\->iterator( sub { print $_[0]\->nodeName(), "\en"; } ); .Ve .Sp The example will print all node names in the current subtree. .Sp \&\fIReturns\fR: return value of the nodehandler while processing the last child of the current node. .ie n .IP "$pointer = $n\->gdome_ref;" 4 .el .IP "\f(CW$pointer\fR = \f(CW$n\fR\->gdome_ref;" 4 .IX Item "$pointer = $n->gdome_ref;" This returns the pointer to the node in the underlying C libxml2 library. It is useful for testing if two nodes are the same. For namespace declaration attributes and xpath namespaces, returns pointer to libxml2 namespace. Similar to getPointer method in XML::LibXML .Sp \&\fIReturns\fR: Value of pointer to libxml2 C structure.