Lines Matching full:child
55 <tr><td class="mdescLeft"> </td><td class="mdescRight">The first child of this node. Will be null if there are no children. <br></td></tr>
59 <tr><td class="mdescLeft"> </td><td class="mdescRight">The first child of this node with the matching 'value'. Will be null if none found. <br></td></tr>
63 <tr><td class="mdescLeft"> </td><td class="mdescRight">The first child of this node with the matching 'value'. Will be null if none found. <br></td></tr>
67 <tr><td class="mdescLeft"> </td><td class="mdescRight">The last child of this node. Will be null if there are no children. <br></td></tr>
71 <tr><td class="mdescLeft"> </td><td class="mdescRight">The last child of this node matching 'value'. Will be null if there are no children. <br></td></tr>
117 <tr><td class="mdescLeft"> </td><td class="mdescRight">Replace a child of this node. <a href="#a30"></a><br></td></tr>
121 <tr><td class="mdescLeft"> </td><td class="mdescRight">Delete a child of this node. <br></td></tr>
391 Adds a child after the specified child. Returns a pointer to the new object or NULL if an error occured. </td>
430 Adds a child before the specified child. Returns a pointer to the new object or NULL if an error occured. </td>
460 Adds a child past the LastChild. Returns a pointer to the new object or NULL if an error occured. </td>
490 One way to iterate over nodes is: <div class="fragment"><pre class="fragment"> for( child = parent->FirstChild(); child; child = child->NextSibling() )
492 IterateChildren does the same thing with the syntax: <div class="fragment"><pre class="fragment"> child = 0;
493 while( child = parent->IterateChildren( child ) )
495 IterateChildren takes the previous child as input and finds the next one. If the previous child is null, it returns the first. IterateChildren will return null when done. </td>
525 Adds a child past the LastChild.<p>
624 Replace a child of this node.
