zoukankan      html  css  js  c++  java
  • LD SDK LDCControlDll 中 CXMLFile的进一步使用方法,建议以后改进

     1、遍历子节点
                    DWORD dRes;
                    if ( 0 == (dRes=xmloper.selectFirstChildNode()) )
                    {
                     // nodetxt = "Programe"
                     while (0==dRes)
                     {
                      CString strProg;
                      xmloper.readNodeValue(strProg);
                      
                      CDocument *pDoc = this->OpenDocumentFile(strProg);
                      dRes = xmloper.selectNextNode();
                     }
                     xmloper.selectParentNode();
                    }
                    
                  2、获取节点ID
                    xmloper.readNodeAttribute(_T("ID"), strID);
                    nScreenID = _ttoi(strID);

                  3、添加子节点属性操作,                   
                  4、在子节点查找,   
                    // !!在一组节点中找到符合条件的节点,并得到他的ID
                    xmloper.selectRootNode();
                    xmloper.selectNode(_T("/Root/ScreenProgrames"), 2);
                    DWORD dRes;
                    if ( 0 == (dRes=xmloper.selectFirstChildNode()) )
                    {
                     // nodetxt = "Programe"
                     while (0==dRes)
                     {
                      CString strProg;
                      xmloper.readNodeValue(strProg);
                      if (0==strProg.Compare(lpszPathName))!!!
                      {
                       xmloper.readNodeAttribute(_T("ID"), strID);
                       nScreenID = _ttoi(strID);
                       break;
                      }
                      
                     ` dRes = xmloper.selectNextNode();
                     }
                     xmloper.selectParentNode();
                    }      

  • 相关阅读:
    搜索进阶1、八数码(HDU1043)
    D.迷宫2 (BFS+优先队列)
    小H的询问(线段树)
    B.迷宫(BFS)
    【UVA】10935 Throwing cards away I(STL队列)
    【UVA】10391 Compound Words(STL map)
    【UVA】12100 Printer Queue(STL队列&优先队列)
    【UVA】1596 Bug Hunt(模拟)
    【UVA】201 Squares(模拟)
    【UVA】1595 Symmetry(模拟)
  • 原文地址:https://www.cnblogs.com/carl2380/p/2317354.html
Copyright © 2011-2022 走看看