![]() |
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++) 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>
#include <CkXml.h> void ChilkatSample(void) { CkXml xml; // The sample input XML is available at http://www.chilkatsoft.com/data/fruit.xml bool success = xml.LoadXmlFile("qa_data/xml/fruit.xml"); if (success != true) { std::cout << xml.lastErrorText() << "\r\n"; 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. CkXml *child = xml.FindChild("meat"); if (xml.get_LastMethodSuccess() == false) { std::cout << "No direct child having the tag \"meat\" was found." << "\r\n"; } else { std::cout << "Content = " << child->content() << "\r\n"; 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. std::cout << "Content = " << xml.content() << "\r\n"; // Restore the reference back to the parent. success = xml.GetParent2(); } else { std::cout << "No direct child having the tag \"meat\" was found." << "\r\n"; } } |
© 2000-2025 Chilkat Software, Inc. All Rights Reserved.