|  | 
Chilkat  HOME  Android™  AutoIt  C  C#  C++  Chilkat2-Python  CkPython  Classic ASP  DataFlex  Delphi DLL  Go  Java  Node.js  Objective-C  PHP Extension  Perl  PowerBuilder  PowerShell  PureBasic  Ruby  SQL Server  Swift  Tcl  Unicode C  Unicode C++  VB.NET  VBScript  Visual Basic 6.0  Visual FoxPro  Xojo Plugin
| (C++) Iterate over Direct Children with a Specific TagDemonstrates how to iterate over direct children having a specific tag. The input XML, available at http://www.chilkatsoft.com/data/fruit.xml, is this: 
<root>
    <fruit color="red">apple</fruit>
    <fruit color="green">pear</fruit>
    <veg color="orange">carrot</veg>
    <meat animal="cow">beef</meat>
    <xyz>
        <fruit color="blue">blueberry</fruit>
        <veg color="green">broccoli</veg>
    </xyz>
    <fruit color="purple">grape</fruit>
    <cheese color="yellow">cheddar</cheese>
</root>
 #include <CkXml.h> void ChilkatSample(void) { CkXml xml; CkXml *child = 0; int numWithTag; int i; bool success; // The sample input XML is available at http://www.chilkatsoft.com/data/fruit.xml success = xml.LoadXmlFile("fruit.xml"); if (success != true) { std::cout << xml.lastErrorText() << "\r\n"; return; } // Get the number of direct children having the tag "fruit" numWithTag = xml.NumChildrenHavingTag("fruit"); if (numWithTag > 0) { for (i = 0; i <= numWithTag - 1; i++) { child = xml.GetNthChildWithTag("fruit",i); std::cout << i << ": " << child->tag() << " : " << child->content() << "\r\n"; delete child; } std::cout << "-----" << "\r\n"; // Do the same as the above loop, but instead of creating // a new object instance for each child, call GetNthChildWithTag2 to // update the object's reference instead. for (i = 0; i <= numWithTag - 1; i++) { // Navigate to the Nth child. success = xml.GetNthChildWithTag2("fruit",i); std::cout << i << ": " << xml.tag() << " : " << xml.content() << "\r\n"; // Navigate back up to the parent: success = xml.GetParent2(); } std::cout << "-----" << "\r\n"; } } | ||||||
© 2000-2025 Chilkat Software, Inc. All Rights Reserved.