090811项目进展

  

今天终于把一个Server的文件遍历搞定，最终还是使用了WPS的方法，回过头再试DPS还是不行，唯一的区别就在于DPS同时会有两个CFtpFileFind去连接同一个CFtpConnect，而WPS每次都只有一个。

 

void CListContent::OnGetContent() {UpdateData(true);m_IPAddrDest.GetWindowText(m_FtpSite);if(!m_IsConnected) {if(ConnectToServer()) {m_IsConnected = TRUE;m_btnGetContent.SetWindowText("断开连接");}else {return ;}m_Directory = "/"; /* 原程序 *///DownLoadContent(); /* DPS */// m_fileTree.DeleteAllItems();// /* 确定根目录 */// HTREEITEM hItem1A = m_fileTree.InsertItem(m_Directory, 0, 1);// DownLoadTreeContent_DPS(hItem1A, m_Directory, m_Directory); /* WPS */ m_fileTree.DeleteAllItems(); DownLoadTreeContent_WPS(3);}else {DisconnectedFromServer();m_IsConnected = FALSE;m_btnGetContent.SetWindowText("连接主机");//m_listContent.DeleteAllItems(); m_fileTree.DeleteAllItems();}}

 

 

 

 

以下是WPS的实现：

 

void CListContent::DownLoadTreeContent_WPS(int maxLayer){if(m_IsConnected) { BOOL IsContinue = FALSE; CQueue queue; HTREEITEM hItem1A = m_fileTree.InsertItem(m_FtpSite, 0, 1); CQueueNode qNode("/", hItem1A, 0); queue.PutQueueObject(qNode); CFtpFileFind *pFileTreeFind = NULL; while (!queue.IsEmpty()) { CQueueNode newNode = queue.GetQueueObject(); CString dirName = newNode.GetString(); HTREEITEM hItemParent = newNode.GetTreeItem(); int newLayer = newNode.GetLayer(); if (newLayer >= maxLayer) { return; } pFileTreeFind=newCFtpFileFind(pConnection); if(!pConnection->SetCurrentDirectory(dirName)) { pFileTreeFind->Close(); deletepFileTreeFind; pFileTreeFind = NULL; return; } IsContinue=pFileTreeFind->FindFile("*"); while(IsContinue) { /* 同层次的list */ IsContinue=pFileTreeFind->FindNextFile(); m_FileName=pFileTreeFind->GetFileName(); if(pFileTreeFind->IsDirectory()) { HTREEITEM hItem2_1B = m_fileTree.InsertItem(m_FileName,0,1, hItemParent, TVI_LAST); if (dirName == "/") { CQueueNode childNode(dirName + m_FileName, hItem2_1B, newLayer + 1); queue.PutQueueObject(childNode); } else { CQueueNode childNode(dirName + "/" + m_FileName, hItem2_1B, newLayer + 1); queue.PutQueueObject(childNode); } } else { m_fileTree.InsertItem(m_FileName,0,1, hItemParent, TVI_LAST); } } pFileTreeFind->Close(); deletepFileTreeFind; pFileTreeFind = NULL; } }}

 

队列的声名和定义：

 

 class CQueue;class CQueueNode{public: CQueueNode(const CString &str, HTREEITEM hti, int maxLayer); CString GetString(); HTREEITEM GetTreeItem(); int GetLayer();friend class CQueue;private: CString data; HTREEITEM hTreeItem; CQueueNode *next; int layer;};/////////////////////////////////////////////////////////////////////////////// CQueueclass CQueue{public: CQueue(); void PutQueueObject(const CQueueNode &queueNode); CQueueNode GetQueueObject(); ~CQueue(); BOOL IsEmpty();private: CQueueNode *head, *rear;};

 /////////////////////////////////////////////////////////////////////////////// CQueueNodeCQueueNode::CQueueNode(const CString &str, HTREEITEM hti, int iLayer){ data = str; hTreeItem = hti; layer = iLayer; /* 这个初始化很重要啊 */ next = NULL;}CString CQueueNode::GetString(){ return data;}HTREEITEM CQueueNode::GetTreeItem(){ return hTreeItem;}int CQueueNode::GetLayer(){ return layer;}/////////////////////////////////////////////////////////////////////////////// CQueueCQueue::CQueue(){ head = rear = NULL;}void CQueue::PutQueueObject(const CQueueNode &queueNode){ if (NULL == head) { head = rear = new CQueueNode(queueNode); } else { rear->next = new CQueueNode(queueNode); rear = rear->next; }}CQueueNode CQueue::GetQueueObject(){ CQueueNode *p = head; head = head->next; CQueueNode node = *p; delete p; return node;}BOOL CQueue::IsEmpty(){ return (NULL == head);}CQueue::~CQueue(){ while (NULL != head) { CQueueNode *p = head; head = head->next; delete p; p = NULL; }}

 

连接下载后的树形效果: