C / C++ / MFC

CADORecordset* m_Rpipe;

CPipeLineView

bool DetectSeque(int pipeID)

CPipeLineView

bool CPipeLineView::DetectSeque(int pipeID

<br />
bool CPipeLineView::DetectSeque(int pipeID)<br />
{<br />
	 m_Rpipe=CPipeDAL::GetPipeByID(pipeID);//业务信息的表示,pipeID为当前制定计划的管线编号<br />
		<br />
	m_Rpipe->->MoveFirst();<br />
<br />
	bool flag=false;<br />
<br />
	<br />
	<br />
	//将当前管线与其他异类管线进行比较<br />
<br />
	while(!m_Rpipe->IsEOF()&&!m_Rpipe->IsBof())<br />
	{<br />
// 		m_Rpipe->MoveNext();<br />
<br />
		if()//敷设优先级的值越大，优先级越小<br />
		{<br />
                  .....<br />
		}<br />
        m_Rpipe->MoveNext();<br />
        }<br />
	return flag;<br />
}<br />
<br />

m_Rpipe->MoveNext()

m_Rpipe->MoveNext();

if

<?xml version="1.0"?>
<request>
<properties name ="TicketID">T5jkbec7i2f410m</properties>
<Form1Buttons>Login,Reset,Exit</Form1Buttons>
</request>

const char* common::Parse_XML_Document(char* filename, char* tagname)
{
    TiXmlDocument * tiDoc = new TiXmlDocument(filename);
	TiXmlElement * tiElement = new TiXmlElement(tagname);
	const char * value = new char[1024];
	//TiXmlAttribute * tiAttribute = new TiXmlElement(tagname);
	if(tiDoc->LoadFile())
	{
      value = tiElement->GetText();
	}
	return value;
}

void generateHuffman(Queue& q1, Queue& q2)
{/*
input - an initial sorted queue q1 of the frequencies of each character
output - a sorted list q2 composed where every node is the sum of two elements 
         in q1 and has cursors in each one of these.
*/

QueueNode *leftChild, *rightChild, *tempNode;

q1.enqueue(q1.dequeue());
q2.enqueue(q1.front()+q1.back());
rightChild = q1.backNode();
q1.enqueue(q1.dequeue());
leftChild = q1.backNode();

q2.setCursor(leftChild, rightChild);


while (q1.back() <= q1.front())
{//@pre: q1 has all the elements sorted
//@post: all elements in q1 will be back in place with each of them referenced
//       by elements in q2
	q2.enqueue( q1.front()+q2.front() );
	tempNode = q2.backNode();
	q2.enqueue(q2.dequeue());
	tempNode->rightCursor = q2.backNode();
	
	q1.enqueue(q1.dequeue());
	tempNode->leftCursor = q1.backNode();

	while( q2.frontNode() != tempNode)
		q2.enqueue(q2.dequeue());
	tempNode = NULL;
}

}

/**Queue.h*/

#include "QueueException.h"
typedef int QueueItemType;

struct QueueNode
          {
                 QueueItemType item;
                 QueueNode *leftCursor;
                 QueueNode *rightCursor;
                 QueueNode *next;
          };
          
class Queue
{
public: 
        Queue();
        ~Queue();
        
        bool isEmpty() const;
        QueueItemType front() const throw(QueueException);
        QueueItemType back() const throw(QueueException);
        QueueItemType dequeue() throw(QueueException);
        QueueNode *frontNode() const throw(QueueException);
        QueueNode *backNode() const throw(QueueException);
        
        //void sortQueue(Queue& q)  throw(QueueException);
        void dequeue(QueueItemType& queueFront)       throw(QueueException);
        void enqueue(const QueueItemType& newItem)  throw(QueueException);
        void setCursor(QueueNode *l, QueueNode *r)  throw(QueueException);
        
private:  
          QueueNode *backPtr;
          QueueNode *frontPtr;
};