Chilkat HOME .NET Core C# Android™ AutoIt C C# C++ Chilkat2-Python CkPython Classic ASP DataFlex Delphi ActiveX Delphi DLL Go Java Lianja Mono C# Node.js Objective-C PHP ActiveX PHP Extension Perl PowerBuilder PowerShell PureBasic Ruby SQL Server Swift 2 Swift 3,4,5... 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 <C_CkXml.h> void ChilkatSample(void) { HCkXml xml; HCkXml child; int numWithTag; int i; BOOL success; xml = CkXml_Create(); // The sample input XML is available at http://www.chilkatsoft.com/data/fruit.xml success = CkXml_LoadXmlFile(xml,"fruit.xml"); if (success != TRUE) { printf("%s\n",CkXml_lastErrorText(xml)); CkXml_Dispose(xml); return; } // Get the number of direct children having the tag "fruit" numWithTag = CkXml_NumChildrenHavingTag(xml,"fruit"); if (numWithTag > 0) { for (i = 0; i <= numWithTag - 1; i++) { child = CkXml_GetNthChildWithTag(xml,"fruit",i); printf("%d: %s : %s\n",i,CkXml_tag(child),CkXml_content(child)); CkXml_Dispose(child); } printf("-----\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 = CkXml_GetNthChildWithTag2(xml,"fruit",i); printf("%d: %s : %s\n",i,CkXml_tag(xml),CkXml_content(xml)); // Navigate back up to the parent: success = CkXml_GetParent2(xml); } printf("-----\n"); } CkXml_Dispose(xml); } |
© 2000-2024 Chilkat Software, Inc. All Rights Reserved.