xml - How to use Attribute as search keyword with TinyXML2(C++) -


i'm trying use attribute keyword find element want. can work when first element.

bool readxml(){ string gateway_str="",user_input=""; xmldocument xml_file; xml_file.loadfile("exception_ip.xml");                      //xml file name xmlhandle dochandle( &xml_file );                           //xmlhandle xmlnode* node_ctrl;                                         //node pointer xmlelement* gateway_ele = dochandle.firstchildelement("exception_ip").firstchildelement("ip").toelement();  //get node xmlhandle , turn element  cout<<"test ip3=";                                          //show user  cin>>user_input;                                            //user input  if(gateway_ele){                                            //is gateway_ele null?     gateway_str=gateway_ele->name();                        //get element name , show     cout<< "got gateway_ele = "<<gateway_str<<endl; } if(gateway_ele ->attribute("ip3",(user_input.c_str()))){    //find attribute ip3 = "user input"         node_ctrl=gateway_ele->firstchild();                //make node_ctrl point firstchild         if(node_ctrl==nullptr){                             //is nullptr?             cout<<"node_ctrl = nullptr";             return false;         }         else{                                                            gateway_ele=node_ctrl->toelement();             //turn node_ctel element             gateway_str = gateway_ele->gettext();           //get text             cout<<"gateway = "<<gateway_str<<endl;          //show             return true;                                    //return true         }     } return false;

}

and xml 

<?xml version="1.0" ?>   <exception_ip>    	<ip ip3="23">	        <gateway>123.123.23.1</gateway>        <dnsp>dnsp23</dnsp>        <dnss>dnss23</dnss>  	</ip>  	<ip ip3="24">	        <gateway>123.123.24.1</gateway>        <dnsp>dnsp24</dnsp>        <dnss>dnss24</dnss>  	</ip>  </exception_ip>

it work when input 23

and had tried use nextsiblingelement("ip") make point keep going next sibling element. infinite loop

do{ if(gateway_ele ->attribute("ip3",(user_input.c_str()))){    //find attribute ip3 = "user input"         node_ctrl=gateway_ele->firstchild();                //make node_ctrl point firstchild         if(node_ctrl==nullptr){                             //is nullptr?             cout<<"node_ctrl = nullptr";             return false;         }         else{                                                            gateway_ele=node_ctrl->toelement();             //turn node_ctel element             gateway_str = gateway_ele->gettext();           //get text             cout<<"gateway = "<<gateway_str<<endl;          //show             return true;                                    //return true         }     } else{     gateway_ele->nextsiblingelement("ip"); } }while(true);

thanks !

you need iterate on "ip" elements, testing "ip3" attribute until find 1 want. here's easy way using my tinyxml2 extension :

#include <string> #include <iostream> #include <conio.h>  // _getch() // include header tinyxml2ex includes tinyxml2, remember put them on include path #include "tixml2ex.h"  using namespace std;  int main() {     // put xml string simplicity     string testxml{ r"-( <?xml version="1.0" ?> <exception_ip>     <ip ip3="23">     <gateway>123.123.23.1</gateway>     <dnsp>dnsp23</dnsp>     <dnss>dnss23</dnss>     </ip>     <ip ip3="24">     <gateway>123.123.24.1</gateway>     <dnsp>dnsp24</dnsp>     <dnss>dnss24</dnss>     </ip> </exception_ip> )-"s };      auto doc = tinyxml2::load_document (testxml);     // find required element xpath , list member elements     if (auto ip = find_element (*doc, "/exception_ip/ip[@ip3='24']"s))     {         (auto e : ip)             cout << e->name() << " " << text (e) << endl;     }     else         cout << "could not find ip element" << endl;     return 0; }

Comments

Post a Comment

Popular posts from this blog

Sort a complex associative array in PHP -

this question has answer here: php sort array subarray value 5 answers i have associative array in php like: $newarray1 = array ( [producta] => array ( [link] => http://sanjosespartan.com/blog/products/agile-java-development/ [visitcount] => 4 ) [productd] => array ( [link] => http://sanjosespartan.com/blog/products/intro-to-go/ [visitcount] => 1 ) [productg] => array ( [link] => http://sanjosespartan.com/blog/products/node-js-for-developers/ [visitcount] => 1 ) [productb] => array ( [link] => http://sanjosespartan.com/blog/products/beginning-mysql/ [visitcount] => 1 ) [productc] => array ( [link] => http://sanjosespartan.com/blog/products/computer-networks/ [visitcount] => 1 ) ...
Read more

vb.net - How to ignore if a cell is empty nothing -

how use roscolor() ignore value (like empty cell) ? color row if value upper 5 when there nothing in cell, want ignore roscolor() apply, how? public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val integer val = quotedatagridview1.rows(i).cells(3).value if val = vbempty quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white elseif val < 5 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.red elseif val > 5 , val < 10 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.lightyellow end if next end sub you can check empty value following public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val = quotedatagridview1.rows(i).cells(3).value if isdbnull(val) or val nothing quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white ...
Read more

recursion - Can every recursive algorithm be improved with dynamic programming? -

i first year undergraduate csc student looking competitive programming. recursion involves defining , solving sub problems. understand, top down dynamic programming (dp) involves memoizing solutions sub problems reduce time complexity of algorithm. can top down dp used improve efficiency of every recursive algorithm overlapping sub problems? dp fail work , how can identify this? the short answer is: yes. however, there constraints. obvious 1 recursive calls must overlap. i.e. during execution of algorithm, recursive function must called multiple times same parameters. lets truncate recursion tree memoization. can use memoization reduce number of calls. however, reduction of calls comes price. need store results somewhere. next obvious constraint need have enough memory. comes not-so obvious constraint. memory access requires time. first need find result stored , maybe copy location. in cases, might faster let recursion calculate result instead of loading somewher...
Read more