Queue.cpp
上传用户:sunyong76
上传日期:2021-10-03
资源大小:2236k
文件大小:3k
- //////////////////////////////////////////////////////////////////////
- //ICTCLAS简介:计算所汉语词法分析系统ICTCLAS(Institute of Computing Technology, Chinese Lexical Analysis System),
- // 功能有:中文分词;词性标注;未登录词识别。
- // 分词正确率高达97.58%(973专家评测结果),
- // 未登录词识别召回率均高于90%,其中中国人名的识别召回率接近98%;
- // 处理速度为31.5Kbytes/s。
- //著作权: Copyright?2002-2005中科院计算所 职务著作权人:张华平 刘群
- //遵循协议:自然语言处理开放资源许可证1.0
- //Email: zhanghp@software.ict.ac.cn
- //Homepage:www.nlp.org.cn;mtgroup.ict.ac.cn
- // Queue.cpp: implementation of the CQueue class.
- //
- //////////////////////////////////////////////////////////////////////
- #include "stdafx.h"
- #include "Queue.h"
- #include "malloc.h"
- #include "stdlib.h"
- #include "memory.h"
- //////////////////////////////////////////////////////////////////////
- // Construction/Destruction
- //////////////////////////////////////////////////////////////////////
- CQueue::CQueue()
- {
- m_pHead=NULL;
- m_pLastAccess=NULL;
- }
- CQueue::~CQueue()
- {
- PQUEUE_ELEMENT pCur=m_pHead,pTemp;//The pointer of queue chain
- while(pCur!=NULL)
- {
- pTemp=pCur->next;
- delete pCur;
- pCur=pTemp;
- }
- }
- int CQueue::Push(unsigned int nValue,//The value for parent node
- unsigned int nIndex,//number of index in the parent node
- ELEMENT_TYPE eWeight//the weight of last path
- )
- {//Sort it
- PQUEUE_ELEMENT pAdd,pCur=m_pHead,pPre=0;//The pointer of queue chain
-
- while(pCur!=NULL&&pCur->eWeight<eWeight)
- {//Get the proper posption,sort according the weight
- pPre=pCur;
- pCur=pCur->next;
- }
- pAdd=(PQUEUE_ELEMENT)new QUEUE_ELEMENT;
- pAdd->nParent=nValue;
- pAdd->nIndex=nIndex;
- pAdd->eWeight=eWeight;
- pAdd->next=pCur;
- if(pPre==0)
- m_pHead=pAdd;
- else
- pPre->next=pAdd;
- return 1;
- }
- int CQueue::Pop(unsigned int *npValue,//The value for parent node
- unsigned int *npIndex,//number of index in the parent node
- ELEMENT_TYPE *epWeight,//the weight of last path
- bool bModify,//not modify the data
- bool bFirstGet//first get data,just for browse
- )
- {
- PQUEUE_ELEMENT pTemp;
- if(bModify)
- pTemp=m_pHead;//The temp buffer
- else
- {
- if(bFirstGet)//First get the data
- m_pLastAccess=m_pHead;//The temp buffer
- pTemp=m_pLastAccess;
- }
- if(pTemp==NULL)
- return -1;//fail get the value
- if(npValue!=0)
- *npValue=pTemp->nParent;
- if(npIndex!=0)
- *npIndex=pTemp->nIndex;
- if(epWeight!=0)
- *epWeight=pTemp->eWeight;
- if(bModify)//modify and get rid of the node
- {
- m_pHead=pTemp->next;
- delete pTemp;//free the buffer
- }
- else
- {
- m_pLastAccess=pTemp->next;
- }
- return 1;
- }
- bool CQueue::IsEmpty(bool bBrowsed)//bBrowsed=true: judge whether the browse pointer got end.
- {
- if(bBrowsed==true)
- return (m_pLastAccess==NULL);
- return (m_pHead==NULL);
- }
- bool CQueue::IsSingle()
- {
- return (m_pHead!=NULL&&m_pHead->next==NULL);
- }