c++编写xml操作类（添加关于多种编码的支持）

今天上网具体看了下关于编码格式的资料，想自己的xml解析程序一直都只支持ansi，那么我们就现学现用，让它支持Unicode和utf8编码吧。

xml.h:

#include <iostream> #include <string> #include <vector> #include "windows.h" #include "wininet.h" using namespace std; #pragma comment(lib,"wininet.lib") class xml; class nodecollect; class node{ public: string getattr(string); node* setattr(string,string); node* appned(node *); node* removechild(int); node* insert(int,node*); node *getnext(); node *getparent(); node *getprevious(); node *getchild(int); nodecollect *getnodebyname(string); int getcount(); string gettag(); string gettype(); node* removeattr(string); void remove(); int gettotlecount(); string gettext(); node *puttext(string); nodecollect *selectnodes(string); nodecollect *select(string); private: friend class xml; int count; node *child; node *next; node *parent; string data; string tag; string type; xml *x; }; class nodecollect{ public: nodecollect(); int getcount(); node *item(int); void push(node*); private: int count; vector<node*> v; }; class xml{ public: xml(); ~xml(); void loadstring(string); void scan(string); void out(string&,node *); node *getchild(int); nodecollect *getnodebyname(string); int getcount(); node *createnode(string); node *createtextnode(string); void loadfile(string); void savefile(string,int =ansi); void flush(); string gettext(); node *insertpi(); xml* append(node *); nodecollect *selectnodes(string); nodecollect *select(string,nodecollect * =0,node * =0); void loadurl(string); wstring UTF8ToUnicode( const string& ); string UnicodeToANSI( const wstring& ) ; enum {ansi=1,unicode=2,utf8=3}; private: friend class node; node* root; int count; string text; void output(node *,string&); };

xml.cpp:

#include "xml.h" xml::xml(){ root=0; count=0; } xml::~xml(){ } wstring xml::UTF8ToUnicode( const string& str ) { int len = str.length(); int unicodeLen = ::MultiByteToWideChar( CP_UTF8, 0, str.c_str(), -1, NULL, 0 ); wchar_t * pUnicode; pUnicode = new wchar_t[unicodeLen+1]; memset(pUnicode,0,(unicodeLen+1)*sizeof(wchar_t)); MultiByteToWideChar( CP_UTF8, 0, str.c_str(), -1, (LPWSTR)pUnicode, unicodeLen ); wstring rt = ( wchar_t* )pUnicode; delete pUnicode; return rt; } string xml::UnicodeToANSI( const wstring& str ) { char* pElementText; int iTextLen; // wide char to multi char iTextLen = WideCharToMultiByte( CP_ACP, 0, str.c_str(), -1, NULL, 0, NULL, NULL ); pElementText = new char[iTextLen + 1]; memset( ( void* )pElementText, 0, sizeof( char ) * ( iTextLen + 1 ) ); WideCharToMultiByte( CP_ACP, 0, str.c_str(), -1, pElementText, iTextLen, NULL, NULL ); string strText = pElementText; delete[] pElementText; return strText; } void xml::loadstring(string s){ scan(s); } void xml::loadurl(string s){ HINTERNET ie=InternetOpen("sx",INTERNET_OPEN_TYPE_PRECONFIG,0,0,0); HINTERNET ieo=InternetOpenUrl(ie,s.data(),0,0,INTERNET_FLAG_RELOAD,0); DWORD read=0; char b[100]={0}; InternetReadFile(ieo,b,98,&read); if(b[0]=='/xff' && b[1]=='/xfe'){ wstring s1; s1=(wchar_t*)(b+2); while(1){ memset(b,0,100); InternetReadFile(ieo,b,98,&read); if(read==0){ break; } s1+=(wchar_t*)b; } text=UnicodeToANSI(s1); }else if(b[0]=='/xef' && b[1]=='/xbb' && b[2]=='/xbf'){ text=(b+3); while(1){ memset(b,0,100); InternetReadFile(ieo,b,99,&read); if(read==0){ break; } text+=b; } text=UnicodeToANSI(UTF8ToUnicode(text)); }else{ text=b; while(1){ memset(b,0,100); InternetReadFile(ieo,b,99,&read); if(read==0){ break; } text+=b; } } loadstring(text); InternetCloseHandle(ieo); InternetCloseHandle(ie); } void xml::scan(string s){ int i=0; node *p=0; while(1){ if(i==s.length()){ break; } if(s[i]=='<' && s[i+1]!='/'){ node *n=new node; count++; n->next=0; n->child=0; n->count=0; n->x=this; n->type="node"; if(s[i+1]=='!'){ n->type="cdata"; } if(p){ n->parent=p; n->parent->count++; node *n1=p->child; if(n1){ while(n1->next){ n1=n1->next; } n1->next=n; }else{ p->child=n; } }else{ n->parent=0; if(!root){ root=n; }else{ node* n1=root; while(n1->next){ n1=n1->next; } n1->next=n; } } i++; while(s[i]!='>'){ if(s[i]!='/') n->data.append(1,s[i]); i++; } int index=n->data.find(' '); n->tag=n->data.substr(0,index!=-1?index:n->data.find('>')); if(s[i-1]!='/' && s[i-1]!='?' && s[i-1]!=']'){ p=n; } }else if(s[i]=='<' && s[i+1]=='/'){ if(p->parent){ p=p->parent; }else{ p=0; } while(s[i]!='>'){ char t=s[i]; i++; } }else if(s[i]!='/t' && s[i]!=' ' && s[i]!='/r' && s[i]!='/n'){ node *n=new node; count++; n->next=0; n->child=0; n->count=0; n->parent=p; n->x=this; n->type="text"; n->parent->count++; node *n1=p->child; if(n1){ while(n1->next){ n1=n1->next; } n1->next=n; }else{ p->child=n; } while(s[i]!='<'){ n->data.append(1,s[i]); i++; } for(int i1=n->data.length()-1;i1>=0;i1--){ if(n->data[i1]!='/t' && n->data[i1]!=' ' && n->data[i1]!='/r' && n->data[i1]!='/n'){ break; }else{ n->data.erase(i1,1); } } continue; } i++; } } void xml::out(string& s,node *n=0){ if(!n){ node *r=root; while(r){ output(r,s); s+="/r/n"; r=r->next; } } else{ output(n,s); } } void xml::output(node * n,string& s){ node *n1=n; int tab=0; if(n1->gettype()=="text"){ s=s+n1->data; return; }else if(n1->child){ s=s+"<"+n1->data+">"+"/r/n"; }else if(n1->gettag()=="?xml"){ s=s+"<"+n1->data+">"; return; }else{ s=s+"<"+n1->data+"/>"; return; } while(1){ if(n1->child){ n1=n1->child; tab++; for(int i1=0;i1<tab;i1++){ s=s+"/t"; } if(n1->type=="text"){ s=s+n1->data+"/r/n"; }else if(n1->gettype()=="cdata"){ s=s+"<"+n1->data+">/r/n"; }else{ if(n1->count>0){ s=s+"<"+n1->data+">"+"/r/n"; }else{ s=s+"<"+n1->data+"/>"+"/r/n"; } } }else if(n1->next && n1!=n){ if(n1->count>0){ for(int i2=0;i2<tab;i2++){ s=s+"/t"; } s=s+"</"+n1->tag+">"+"/r/n"; } n1=n1->next; for(int i1=0;i1<tab;i1++){ s=s+"/t"; } if(n1->type=="text"){ s=s+n1->data+"/r/n"; }else if(n1->gettype()=="cdata"){ s=s+"<"+n1->data+">/r/n"; }else{ if(n1->count>0){ s=s+"<"+n1->data+">"+"/r/n"; }else{ s=s+"<"+n1->data+"/>"+"/r/n"; } } }else{ //s=s+"</"+n1->tag+">"+"/r/n"; node *n2=n1->parent,*n3=0; if(n2 && n2!=n){ while(n2->next==0){ tab--; for(int i1=0;i1<tab;i1++){ s=s+"/t"; } s=s+"</"+n2->tag+">"+"/r/n"; n3=n2; n2=n2->parent; if(n2==n){ tab--; for(int i1=0;i1<tab;i1++){ s=s+"/t"; } s=s+"</"+n->tag+">"; goto a; } } tab--; for(int i1=0;i1<tab;i1++){ s=s+"/t"; } s=s+"</"+n2->tag+">"+"/r/n"; n1=n2->next; for(int i2=0;i2<tab;i2++){ s=s+"/t"; } if(n1->count>0){ s=s+"<"+n1->data+">"+"/r/n"; }else{ s=s+"<"+n1->data+"/>"+"/r/n"; } }else{ s=s+"</"+n->tag+">"; a: break; } } } } nodecollect *xml::selectnodes(string s){ nodecollect *nc=new nodecollect; int i=0; if(s[i]=='/' && s[i+1]=='/'){ int index=s.find('/',i+2); string s1; if(index!=-1){ s1=s.substr(2,index-2); }else{ s1=s.substr(2); } int i1=0; while(getchild(i1)){ node *n=getchild(i1); if(n->gettag()==s1){ if(index==-1){ nc->push(n); }else if(s[index+1]=='/'){ string s2=s.substr(index+2); for(int i2=0;i2<n->gettotlecount();i2++){ if(n->getchild(i2)->gettag()==s2){ nc->push(n->getchild(i2)); } } }else{ node *n1=n->child; string s2=s.substr(index+1); while(n1){ if(n1->gettag()==s2){ nc->push(n1); } n1=n1->next; } } } i1++; } }else{ int index=s.find('/',i+1); string s1; if(index!=-1){ s1=s.substr(1,index-1); }else{ s1=s.substr(1); } node *nn=root; while(nn){ node *n=nn; if(n->gettag()==s1){ if(index==-1){ nc->push(n); }else if(s[index+1]=='/'){ string s2=s.substr(index+2); for(int i2=0;i2<n->gettotlecount();i2++){ if(n->getchild(i2)->gettag()==s2){ nc->push(n->getchild(i2)); } } }else{ node *n1=n->child; string s2=s.substr(index+1); while(n1){ if(n1->gettag()==s2){ nc->push(n1); } n1=n1->next; } } } nn=nn->next; } } return nc; } nodecollect *xml::select(string s,nodecollect *nc,node *n){ if(!nc){ nc=new nodecollect; } if(s[1]=='/'){ int index=s.find('/',2); if(index==-1){ string data=s.substr(2); int attr=data.find('['); if(attr!=-1){ string tag,k,v; tag=data.substr(0,attr); int i1=attr+1; while(data[i1]!='='){ k.append(1,data[i1]); i1++; } i1++; while(data[i1]!=']'){ v.append(1,data[i1]); i1++; } if(n){ int l=n->gettotlecount(); for(int i2=0;i2<l;i2++){ node *n1=n->getchild(i2); if(n1->gettag()==tag && n1->getattr(k)==v){ nc->push(n1); } } return nc; }else{ n=root; while(n){ if(n->gettag()==tag && n->getattr(k)==v){ nc->push(n); } select(s,nc,n); n=n->next; } return nc; } }else{ string tag=data; if(n){ int l=n->gettotlecount(); for(int i2=0;i2<l;i2++){ node *n1=n->getchild(i2); if(n1->gettag()==tag){ nc->push(n1); } } return nc; }else{ n=root; while(n){ if(n->gettag()==tag){ nc->push(n); } select(s,nc,n); n=n->next; } return nc; } } }else{ string data=s.substr(2,index-2); string next=s.substr(index); int attr=data.find('['); if(attr!=-1){ string tag,k,v; tag=data.substr(0,attr); int i1=attr+1; while(data[i1]!='='){ k.append(1,data[i1]); i1++; } i1++; while(data[i1]!=']'){ v.append(1,data[i1]); i1++; } if(n){ int l=n->gettotlecount(); for(int i2=0;i2<l;i2++){ node *n1=n->getchild(i2); if(n1->gettag()==tag && n1->getattr(k)==v){ select(next,nc,n1); } } return nc; }else{ n=root; while(n){ if(n->gettag()==tag && n->getattr(k)==v){ select(next,nc,n); } for(int i=0;i<n->gettotlecount();i++){ if(n->getchild(i)->gettag()==tag && n->getchild(i)->getattr(k)==v){ select(next,nc,n->getchild(i)); } } n=n->next; } } }else{ string tag=data; if(n){ int l=n->gettotlecount(); for(int i2=0;i2<l;i2++){ node *n1=n->getchild(i2); if(n1->gettag()==tag){ select(next,nc,n1); } } return nc; }else{ n=root; while(n){ if(n->gettag()==tag){ select(next,nc,n); } for(int i=0;i<n->gettotlecount();i++){ if(n->getchild(i)->gettag()==tag){ select(next,nc,n->getchild(i)); } } n=n->next; } } } } }else{ int index=s.find('/',1); if(index==-1){ string data=s.substr(1); int attr=data.find('['); if(attr!=-1){ string tag,k,v; tag=data.substr(0,attr); int i1=attr+1; while(data[i1]!='='){ k.append(1,data[i1]); i1++; } i1++; while(data[i1]!=']'){ v.append(1,data[i1]); i1++; } if(n){ node *n1=n->child; while(n1){ if(n1->gettag()==tag && n1->getattr(k)==v){ nc->push(n1); } n1=n1->next; } return nc; }else{ n=root; while(n){ if(n->gettag()==tag && n->getattr(k)==v){ nc->push(n); } n=n->next; } return nc; } }else{ string tag=data; if(n){ node *n1=n->child; while(n1){ if(n1->gettag()==tag){ nc->push(n1); } n1=n1->next; } return nc; }else{ n=root; while(n){ if(n->gettag()==tag){ nc->push(n); } n=n->next; } return nc; } } }else{ string data=s.substr(1,index-1); string next=s.substr(index); int attr=data.find('['); if(attr!=-1){ string tag,k,v; tag=data.substr(0,attr); int i1=attr+1; while(data[i1]!='='){ k.append(1,data[i1]); i1++; } i1++; while(data[i1]!=']'){ v.append(1,data[i1]); i1++; } if(n){ node *n1=n->child; while(n1){ if(n1->gettag()==tag && n1->getattr(k)==v){ select(next,nc,n1); } n1=n1->next; } return nc; }else{ n=root; while(n){ if(n->gettag()==tag && n->getattr(k)==v){ select(next,nc,n); } n=n->next; } } }else{ string tag=data; if(n){ node *n1=n->child; while(n1){ if(n1->gettag()==tag){ select(next,nc,n1); } n1=n1->next; } return nc; }else{ n=root; while(n){ if(n->gettag()==tag){ select(next,nc,n); } n=n->next; } } } } } return nc; } int xml::getcount(){ return count; } node *xml::getchild(int i){ int i1=0; node *n=root; while(i1!=i){ if(!n){ return 0; } if(n->child){ n=n->child; }else{ if(n->next){ n=n->next; }else{ while(n->parent && n->parent->next==0){ n=n->parent; } if(n->parent){ n=n->parent->next; }else{ return 0; } } } i1++; } return n; } nodecollect *xml::getnodebyname(string s){ node *n1=root; nodecollect *nc=new nodecollect; if(n1->tag==s){ nc->push(n1); } while(1){ if(n1->child){ n1=n1->child; if(n1->tag==s){ nc->push(n1); } }else if(n1->next){ n1=n1->next; if(n1->tag==s){ nc->push(n1); } }else{ //cout<<"</"<<n1->tag<<">"<<endl; node *n2=n1->parent,*n3=0; if(n2){ while(n2->next==0){ n3=n2; n2=n2->parent; if(n2==0){ goto a; } } n1=n2->next; if(n1->tag==s){ nc->push(n1); } }else{ // cout<<"</"<<n1->tag<<">"<<endl; a: break; } } } return nc; } node *xml::createnode(string s){ node *n=new node; n->x=this; n->child=0; n->count=0; n->next=0; n->parent=0; n->type="node"; n->tag=s; n->data=s; return n; } node *xml::createtextnode(string s){ node *n=new node; n->x=this; n->child=0; n->count=0; n->next=0; n->parent=0; n->type="text"; n->data=s; return n; } void xml::loadfile(string s){ FILE *f=fopen(s.data(),"rb"); char buf[2048]={0}; fread(buf,1,2040,f); if(buf[0]=='/xff' && buf[1]=='/xfe'){ wstring s1; s1=(wchar_t*)(buf+2); while(!feof(f)){ memset(buf,0,2048); fread(buf,1,2046,f); s1=s1+(wchar_t*)buf; } text=UnicodeToANSI(s1); }else if(buf[0]=='/xef' && buf[1]=='/xbb' && buf[2]=='/xbf'){ text=(buf+3); while(!feof(f)){ memset(buf,0,2048); fread(buf,1,2047,f); text=text+buf; } text=UnicodeToANSI(UTF8ToUnicode(text)); }else{ text=buf; while(!feof(f)){ memset(buf,0,2048); fread(buf,1,2047,f); text+=buf; } } fclose(f); loadstring(text); } void xml::savefile(string s,int mode){ flush(); FILE *f=fopen(s.data(),"wb"); if(mode==ansi){ fwrite(text.data(),1,text.length(),f); }else if(mode==unicode){ fwrite("/xff/xfe",1,2,f); int wcsLen = ::MultiByteToWideChar(CP_ACP, NULL, text.data(), text.length(), NULL, 0); //分配空间要给'/0'留个空间，MultiByteToWideChar不会给'/0'空间 wchar_t* wszString = new wchar_t[wcsLen + 1]; //转换 ::MultiByteToWideChar(CP_ACP, NULL, text.data(), text.length(), wszString, wcsLen); //最后加上'/0' wszString[wcsLen] = '/0'; fwrite(wszString,2,wcsLen,f); delete []wszString; }else if(mode==utf8){ fwrite("/xef/xbb/xbf",1,3,f); int wcsLen = ::MultiByteToWideChar(CP_ACP, NULL, text.data(), text.length(), NULL, 0); //分配空间要给'/0'留个空间，MultiByteToWideChar不会给'/0'空间 wchar_t* wszString = new wchar_t[wcsLen + 1]; //转换 ::MultiByteToWideChar(CP_ACP, NULL, text.data(), text.length(), wszString, wcsLen); //最后加上'/0' wszString[wcsLen] = '/0'; int Len = ::WideCharToMultiByte( CP_UTF8, 0, wszString, -1, NULL, 0 ,0,0); char * p; p = new char[Len+1]; memset(p,0,(Len+1)*sizeof(char)); WideCharToMultiByte( CP_UTF8, 0, wszString, -1, p, Len,0,0); string s2 =p; delete p; fwrite(s2.data(),1,s2.length(),f); delete []wszString; } fclose(f); } void xml::flush(){ text=""; string s; node *r=root; while(r){ output(r,s); text+=s; s=""; text+="/r/n"; r=r->next; } //scan(text); } string xml::gettext(){ return text; } node *xml::insertpi(){ node * n=createnode("?xml"); n->setattr("version","1.0"); n->data+="?"; n->next=root; root=n; count++; return n; } xml* xml::append(node *n){ if(root){ node *n1=root; while(n1->next){ n1=n1->next; } n1->next=n; }else{ root=n; } count+=n->gettotlecount()+1; return this; } nodecollect::nodecollect(){ count=0; } int nodecollect::getcount(){ return count; } node *nodecollect::item(int i){ return v[i]; } void nodecollect::push(node* n){ v.push_back(n); count++; } node* node::appned(node *n){ if(child){ node *n1=child; while(n1->next){ n1=n1->next; } n1->next=n; count++; n->parent=this; x->count+=n->gettotlecount()+1; }else{ child=n; count++; n->parent=this; x->count+=n->gettotlecount()+1; } return this; } node* node::insert(int i,node *n){ if(i==0){ n->next=child; n->parent=this; count++; child=n; }else if(i==count){ appned(n); }else{ node *n1=child,*n2=0; int i1=0; while(i1!=i){ n2=n1; n1=n1->next; i1++; } n2->next=n; n->next=n1; count++; n->parent=this; } return this; } node* node::removechild(int i){ if(i==0){ node *n=child; child=child->next; count--; x->count=x->count-gettotlecount()-1; delete n; }else{ node *n=child,*n1=0; int i1=0; while(i1!=i){ n1=n; n=n->next; i1++; } n1->next=n->next; count--; x->count=x->count-gettotlecount()-1; delete n; } return this; } string node::getattr(string s){ string ss; char *i=strstr(data.data(),s.data()); c: if(i && (*(i-1)==' ' || *(i-1)=='/r' || *(i-1)=='/n' || *(i-1)=='/t') && (*(i+s.length())==' ' || *(i+s.length())=='=')){ char *i1=strstr(i+1,"/""); char *i2=strstr(i1+1,"/""); i1++; while(i1!=i2){ ss+=*i1; i1++; } }else{ if(i==0){ return ss; }else{ i=strstr(i+1,s.data()); goto c; } } return ss; } node* node::setattr(string k,string v){ char *i=strstr(data.data(),k.data()); c: if(i && (*(i-1)==' ' || *(i-1)=='/r' || *(i-1)=='/n' || *(i-1)=='/t') && (*(i+k.length())==' ' || *(i+k.length())=='=')){ char *i1=strstr(i+1,"/""); char *i2=strstr(i1+1,"/""); string d=i2; data=data.substr(0,i1-data.data()+1); data+=v; data+=d; }else{ if(i==0){ if(data.substr(data.length()-1,1)!="?"){ data=data+' '+k+"="+'/"'+v+'/"'; }else{ data=data.substr(0,data.length()-1)+' '+k+"="+'/"'+v+"/"?"; } }else{ i=strstr(i+1,k.data()); goto c; } } return this; } node* node::removeattr(string s){ char *i=strstr(data.data(),s.data()); c: if(i && (*(i-1)==' ' || *(i-1)=='/r' || *(i-1)=='/n' || *(i-1)=='/t') && (*(i+s.length())==' ' || *(i+s.length())=='=')){ char *i1=strstr(i+1,"/""); char *i2=strstr(i1+1,"/""); string d=i2+1; data=data.substr(0,i-data.data()-1); data+=d; }else{ if(i==0){ return this; }else{ i=strstr(i+1,s.data()); goto c; } } return this; } void node::remove(){ node *n=getparent(); if(n){ node *n1=getprevious(); if(n1){ n1->next=next; }else{ n->child=next; } n->count--; x->count=x->count-gettotlecount()-1; }else{ node *n1=getprevious(); if(n1){ n1->next=next; }else{ x->root=x->root->next; } x->count=x->count-gettotlecount()-1; } delete this; } node *node::getchild(int i){ int i1=-1; node *n=this; while(i1!=i){ if(n->child){ n=n->child; }else{ if(n->next){ n=n->next; }else{ while(n->parent && n->parent->next==0 && n->parent!=this){ n=n->parent; } if(n->parent!=this){ n=n->parent->next; }else{ return 0; } } } i1++; } return n; } nodecollect *node::getnodebyname(string s){ node *n1=this->child; nodecollect *nc=new nodecollect; if(n1->tag==s){ nc->push(n1); } while(1){ if(n1->child){ n1=n1->child; if(n1->tag==s){ nc->push(n1); } }else if(n1->next){ n1=n1->next; if(n1->tag==s){ nc->push(n1); } }else{ //cout<<"</"<<n1->tag<<">"<<endl; node *n2=n1->parent,*n3=0; if(n2 && n2!=this){ while(n2->next==0){ n3=n2; n2=n2->parent; if(n2==this){ goto a; } } n1=n2->next; if(n1->tag==s){ nc->push(n1); } }else{ // cout<<"</"<<n1->tag<<">"<<endl; a: break; } } } return nc; } int node::getcount(){ return count; } node *node::getnext(){ return next; } node *node::getparent(){ return parent; } node *node::getprevious(){ if(parent){ node *n=parent->child; while(n && n->next!=this){ n=n->next; } return n; }else{ node *n=x->getchild(0); while(n && n->next!=this){ n=n->next; } return n; } return 0; } string node::gettag(){ return tag; } string node::gettype(){ return type; } int node::gettotlecount(){ int i1=0; node *n=this->child; if(n) i1++; while(n){ if(n->child){ n=n->child; }else{ if(n->next){ n=n->next; }else{ while(n->parent && n->parent->next==0 && n->parent!=this){ n=n->parent; } if(n->parent!=this){ n=n->parent->next; }else{ break; } } } i1++; } return i1; } string node::gettext(){ string s; for(int i=0;i<gettotlecount();i++){ if(getchild(i)->gettype()=="text"){ s+=getchild(i)->data; } } return s; } node *node::puttext(string s){ if(child && child->gettype()=="text"){ child->remove(); } node *n=x->createtextnode(s); insert(0,n); return this; } nodecollect *node::selectnodes(string s){ nodecollect *nc=new nodecollect; int i=0; if(s[i]=='/' && s[i+1]=='/'){ int index=s.find('/',i+2); string s1; if(index!=-1){ s1=s.substr(2,index-2); }else{ s1=s.substr(2); } int i1=0; while(getchild(i1)){ node *n=getchild(i1); if(n->gettag()==s1){ if(index==-1){ nc->push(n); }else if(s[index+1]=='/'){ string s2=s.substr(index+2); for(int i2=0;i2<n->gettotlecount();i2++){ if(n->getchild(i2)->gettag()==s2){ nc->push(n->getchild(i2)); } } }else{ node *n1=n->child; string s2=s.substr(index+1); while(n1){ if(n1->gettag()==s2){ nc->push(n1); } n1=n1->next; } } } i1++; } }else{ int index=s.find('/',i+1); string s1; if(index!=-1){ s1=s.substr(1,index-1); }else{ s1=s.substr(1); } node *nn=child; while(nn){ node *n=nn; if(n->gettag()==s1){ if(index==-1){ nc->push(n); }else if(s[index+1]=='/'){ string s2=s.substr(index+2); for(int i2=0;i2<n->gettotlecount();i2++){ if(n->getchild(i2)->gettag()==s2){ nc->push(n->getchild(i2)); } } }else{ node *n1=n->child; string s2=s.substr(index+1); while(n1){ if(n1->gettag()==s2){ nc->push(n1); } n1=n1->next; } } } nn=nn->next; } } return nc; } nodecollect *node::select(string s){ return x->select(s,0,this); }

关于编码的知识，大家可以上网查查，添加后打开文件会自动识别ansi，Unicode和utf8这三种编码，并讲后两种编码统一转化成ansi方便操作，在savefile保存文件时可以指定编码保存。下面给出个实例：

main(){
xml x;
x.loadurl("file://c://aa.xml");
cout<<x.getchild(0)->getattr("SoundEffect");
x.savefile("c://111.xml",xml::ansi);
}

本文有不足之处，还望大家多多指教。

ps后期处理实用技巧2

1、除灰： A、色阶，将暗部及明部往中间移，将亮面压亮，将暗面压暗 B、曲线中的黑白灰吸管也可除灰 2、局部太暗处理： A、ctl+alt+2选取亮部，ctl+alt+i反选，再复制粘贴，改为滤色 B、新建空白图层、柔光、
Linux下设置ip和主机名进行绑定

1：输入命令gedit /etc/hosts 这样你就打开了一个文本，然后在文本的末尾进行添加如下： ip地址主机名
从win10系统到win7，再装回win10，以及卸载更新各种同类型键盘驱动

身为信息系计算机专业的我，碰到电脑出了些问题，一般不会直接去找售后诊断问题的所在，而是自己慢慢去研究解决。而这次我的笔记本出现的问题是比较头疼的。一是：键盘锁定不可用，敲击却会有叮叮的响声回应，二：相继的电脑桌面图标也被锁定，选中一个图标后不会自动取消，点击其他图标会出现全选
Angular 中级

目录（6 - 12 章）
Material Design之TextInputLayout

代码奉上 implementation 'com.android.support:appcompat-v7:28.0.0' implementation 'com.android.support:support-v4:28.0.0' implementation 'com.
Redis 分区

分区类型 Redis 有两种类型分区。假设有4个Redis实例 R0，R1，R2，R3，和类似user:1，user:2这样的表示用户的多个key，对既定的key有多种不同方式来选择这个key存放在哪个实例中。也就是说，有不同的系统来映射某个key到某个Redis服务。
jquery复选框思路

复选框的思路复选框的主要问题就是多个框以及父子框之间的联系以及因果关系,然后编写时有两个思路。先暂写一个思路一，剩下的下次再补源码
iOS-UI控件-UIScrollView-滚动视图

UIScrollView滚动分页步骤
Hive Cli / HiveServer2 中使用 dayofweek 函数引发的BUG！

文章目录
python+pytest接口自动化_Python+Pytest+Allure+Git+Jenkins接口自动化框架

Python+Pytest+Allure+Git+Jenkins接口自动化框架一、接口基础接口测试是对系统和组件之间的接口进行测试，主要是效验数据的交换，传递和控制管理过程，以及相互逻辑依赖关系。其中接口协议分为HTTP，RPC，Webservice，Dubb