Sophie

Sophie

distrib > Mandriva > 8.2 > i586 > by-pkgid > 6282078ae76a671f49c6af38c67b1a07 > files > 1539

kdelibs-devel-2.2.2-49.2mdk.i586.rpm

<HTML>
<HEAD>
<TITLE>class NodeList</TITLE>

<META NAME="Generator" CONTENT="KDOC ">
</HEAD>
<BODY bgcolor="#ffffff" text="#000000" link="#0000ff" vlink="#000099" alink= "#ffffff">
<TABLE WIDTH="100%" BORDER="0">
<TR>
<TD>
	<TABLE BORDER="0">
		<TR><TD valign="top" align="left" cellspacing="10">
		<h1>class NodeList</h1>
		</TD>
		<TD valign="top" align="right" colspan="1">
 The <code> NodeList </code> interface provides the abstraction of
 an ordered collection of nodes, without defining or constraining
 how this collection is implemented. <small><A HREF="#longdesc">More...</A></small></TD></TR>
	</TABLE>
	<HR>
	<TABLE BORDER="0">
		<TR><TH>Full name</TH><TD><code><A HREF="DOM.html">DOM</A>::NodeList</code></TD></TR>
<TR><TH>Definition</TH><TD><code>#include &lt;<A HREF="dom__node_h.html">dom_node.h</A>&gt;</code></TD></TR>
<TR><TH><A HREF="full-list-DOM__NodeList.html">List of all Methods</A></TH></TR>
	</TABLE>
	</TD>
<TD align="right"><TABLE BORDER="0"><TR><TD><small><A HREF="index-long.html">Annotated List</A></small></TD></TR>
<TR><TD><small><A HREF="header-list.html">Files</A></small></TD></TR>
<TR><TD><small><A HREF="all-globals.html">Globals</A></small></TD></TR>
<TR><TD><small><A HREF="hier.html">Hierarchy</A></small></TD></TR>
<TR><TD><small><A HREF="index.html">Index</A></small></TD></TR>
</TABLE></TD></TR></TABLE>
<h4>Public Methods</h4><ul><LI>&nbsp;<b><A HREF="#ref5">NodeList</A></b> () 
</LI>
<LI>&nbsp;<b><A HREF="#ref6">NodeList</A></b> (const NodeList &other) 
</LI>
<LI>NodeList & &nbsp;<b><A HREF="#ref7">operator = </A></b> (const NodeList &other) 
</LI>
<LI>&nbsp;<b><A HREF="#ref8">~NodeList</A></b> () 
</LI>
<LI>unsigned long &nbsp;<b><A HREF="#ref9">length</A></b> ()  const
</LI>
<LI>Node &nbsp;<b><A HREF="#ref10">item</A></b> ( unsigned long index )  const
</LI>
<LI>NodeListImpl *&nbsp;<b><A HREF="#ref11">handle</A></b> ()  const
</LI>
<LI>bool &nbsp;<b><A HREF="#ref12">isNull</A></b> ()  const
</LI>
</ul><h4>Protected Methods</h4><ul><LI>&nbsp;<b><A HREF="#ref13">NodeList</A></b> (const NodeListImpl *i) 
</LI>
</ul><h4>Protected Members</h4><ul><LI>NodeListImpl *<b><A HREF="#ref14">impl</A></b></LI>
</ul><HR><H2><A NAME="longdesc">Detailed Description</A></H2><p>
 The <code> NodeList </code> interface provides the abstraction of
 an ordered collection of nodes, without defining or constraining
 how this collection is implemented.
</p>
<p>  The items in the <code> NodeList </code> are accessible via an
 integral index, starting from 0.
</p>
<p> </p>
<A NAME="NodeList"></A><A NAME="ref5"></A><table width="100%"><tr bgcolor="#eeeeee"><td>&nbsp;<strong>NodeList</strong> ()
<br></td><td align="right"><h3><strong>NodeList</strong></h3></td></tr></table><p></p><A NAME="NodeList"></A><A NAME="ref6"></A><table width="100%"><tr bgcolor="#eeeeee"><td>&nbsp;<strong>NodeList</strong> (const NodeList &other)
<br></td><td align="right"><h3><strong>NodeList</strong></h3></td></tr></table><p></p><A NAME="operator%20=%20"></A><A NAME="ref7"></A><table width="100%"><tr bgcolor="#eeeeee"><td>NodeList & &nbsp;<strong>operator = </strong> (const NodeList &other)
<br></td><td align="right"><h3><strong>operator = </strong></h3></td></tr></table><p></p><A NAME="~NodeList"></A><A NAME="ref8"></A><table width="100%"><tr bgcolor="#eeeeee"><td>&nbsp;<strong>~NodeList</strong> ()
<br></td><td align="right"><h3><strong>~NodeList</strong></h3></td></tr></table><p></p><A NAME="length"></A><A NAME="ref9"></A><table width="100%"><tr bgcolor="#eeeeee"><td>unsigned long &nbsp;<strong>length</strong> ()
<br></td><td align="right"><h3><strong>length</strong></h3></td></tr></table><p> <small>[const]</small></p><p>
 The number of nodes in the list. The range of valid child node
 indices is 0 to <code> length-1 </code> inclusive.
</p>
<p>     </p>
<A NAME="item"></A><A NAME="ref10"></A><table width="100%"><tr bgcolor="#eeeeee"><td>Node &nbsp;<strong>item</strong> ( unsigned long index )
<br></td><td align="right"><h3><strong>item</strong></h3></td></tr></table><p> <small>[const]</small></p><p>
 Returns the <code> index </code> th item in the collection. If
 <code> index </code> is greater than or equal to the number of
 nodes in the list, this returns <code> null </code> .
</p>
<p></p>
<p></p>
<p>     </p>
<p><b>Parameters</b>:<TABLE BORDER="0" CELLPADDING="5">
<TR><TD align="left" valign="top"><i>index</i></TD><TD align="left" valign="top">Index into the collection.
</TD></TR>
</TABLE></P>
<p><b>Returns</b>: The node at the <code> index </code> th position in the
 <code> NodeList </code> , or <code> null </code> if that is not
 a valid index.
</p>
<A NAME="handle"></A><A NAME="ref11"></A><table width="100%"><tr bgcolor="#eeeeee"><td>NodeListImpl *&nbsp;<strong>handle</strong> ()
<br></td><td align="right"><h3><strong>handle</strong></h3></td></tr></table><p> <small>[const]</small></p><p>
 not part of the DOM
     </p>
<A NAME="isNull"></A><A NAME="ref12"></A><table width="100%"><tr bgcolor="#eeeeee"><td>bool &nbsp;<strong>isNull</strong> ()
<br></td><td align="right"><h3><strong>isNull</strong></h3></td></tr></table><p> <small>[const]</small></p><A NAME="NodeList"></A><A NAME="ref13"></A><table width="100%"><tr bgcolor="#eeeeee"><td>&nbsp;<strong>NodeList</strong> (const NodeListImpl *i)
<br></td><td align="right"><h3><strong>NodeList</strong></h3></td></tr></table><p> <small>[protected]</small></p><A NAME="impl"></A><A NAME="ref14"></A><table width="100%"><tr bgcolor="#eeeeee"><td>NodeListImpl * <strong>impl</strong>
</td><td align="right"><h3><strong>impl</strong></h3></td></tr></table><p> <small>[protected]</small></p><HR>
	<table>
	<tr><td><small>Generated by: qateam on updates.mandrakesoft.com on Mon Dec 30 16:09:31 2002, using kdoc 2.0a53.</small></td></tr>
	</table>
</BODY>
</HTML>