Chilkat HOME Android™ ASP Visual Basic VB.NET C# iOS (IPhone) Objective-C C++ C Unicode C++ Unicode C MFC Delphi DLL Delphi ActiveX FoxPro Java Perl PHP Extension PHP ActiveX Python PowerShell Ruby SQL Server VBScript
(C++) Find Direct Child with Specific TagDemonstrates how to find a direct child 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>
Downloads: MS Windows Visual C/C++ Libraries Linux/CentOS C/C++ Libraries MAC OS X C/C++ Libraries Solaris C/C++ Libraries C++ Builder Libraries FreeBSD C++ Libraries HP-UX C++ Libraries BlackBerry QNX C++ Libraries #include <CkXml.h> void ChilkatSample(void) { CkXml xml; CkXml *child = 0; bool success; // The sample input XML is available at http://www.chilkatsoft.com/data/fruit.xml success = xml.LoadXmlFile("fruit.xml"); if (success != true) { printf("%s\n",xml.lastErrorText()); return; } // Find the direct child node having the tag "meat", and // return a new instance of the XML object referencing the // child node, if found. child = xml.FindChild("meat"); if (child == 0 ) { printf("No direct child having the tag \"meat\" was found.\n"); } else { printf("Content = %s\n",child->content()); delete child; } // The same can be accomplished without creating a new // XML object instance. Instead, the FindChild2 method updates // the caller's internal reference to the found child, if successful. success = xml.FindChild2("meat"); if (success == true) { // Success! The xml object now references the found child. printf("Content = %s\n",xml.content()); // Restore the reference back to the parent. xml.GetParent2(); } else { printf("No direct child having the tag \"meat\" was found.\n"); } } |
© 2000-2013 Chilkat Software, Inc. All Rights Reserved.