list.cpp

BREW 应用

// List.cpp: implementation of the CList class.
//
//////////////////////////////////////////////////////////////////////

#include "List.h"

//////////////////////////////////////////////////////////////////////
// Construction/Destruction
//////////////////////////////////////////////////////////////////////

CLIST::CLIST()
{
	m_nItemCount = 0;
	m_pStartItem = m_pCurrItem = m_pLastItem = 0;
}

CLIST::~CLIST()
{

}

void* CLIST::GetHead()
{
	m_pCurrItem = m_pStartItem;
	return (void*)m_pStartItem;
}

void* CLIST::GetTail()
{
	m_pCurrItem = m_pLastItem;
	return (void*)m_pLastItem;
}

void* CLIST::RemoveHead()
{
	PLISTITEM pTemp;
	pTemp = m_pStartItem;
	m_pStartItem = pTemp->pNext;//(_LISTITEM)pTemp.pNext;
	m_pStartItem->pPrev = NULL;
	pTemp->pNext= NULL;
	delete pTemp;
	m_nItemCount--;
	m_pCurrItem = m_pStartItem;
	return m_pStartItem;
}

void* CLIST::RemoveTail()
{
	PLISTITEM pTemp;
	pTemp = m_pLastItem;
	m_pLastItem = pTemp->pPrev;
	m_pLastItem->pNext = NULL;
	delete pTemp;
	m_nItemCount--;
	m_pCurrItem = m_pLastItem;
	return m_pLastItem;	
}

int CLIST::AddHead(void *pItem)
{
	PLISTITEM pNew = new LISTITEM;
	pNew->pPrev = NULL;
	pNew->pKey = pItem;
	pNew->pNext = m_pStartItem;
	m_pStartItem->pPrev = pNew;
	m_nItemCount++;
	m_pCurrItem = pNew;
	return 0;
}

int CLIST::AddTail(void *pItem)
{
	PLISTITEM pNew = new LISTITEM;
	pNew->pNext = NULL;
	pNew->pKey = pItem;
	pNew->pPrev = m_pLastItem;
	m_pLastItem->pNext = pNew;
	m_nItemCount++;
	m_pCurrItem = pNew;
	return m_nItemCount-1;
}

void CLIST::RemoveAll()
{
	PLISTITEM pTemp;
	
	for( pTemp = m_pStartItem; pTemp->pNext != NULL; pTemp = pTemp->pNext) 
		delete pTemp;
	m_nItemCount = 0;
	m_pStartItem = m_pCurrItem = m_pLastItem = NULL;	
}

void* CLIST::GetNext()
{
	if( m_pCurrItem->pNext != NULL )
		m_pCurrItem = m_pCurrItem->pNext;
	return (void*)m_pCurrItem;
}

void* CLIST::GetPrev()
{
	if( m_pCurrItem->pPrev != NULL )
		m_pCurrItem = m_pCurrItem->pPrev;
	return (void*)m_pCurrItem;
}

void* CLIST::GetAt(int idx)
{
	PLISTITEM pTemp;
	if( idx >= m_nItemCount )
		return NULL;
	pTemp = m_pStartItem;
	for( int i=0; i < idx; i++ ) {
		pTemp = pTemp->pNext;
	}
	return pTemp;
}

int CLIST::SetAt(int idx, void *pItem)
{
	PLISTITEM pTemp;
	PLISTITEM pNew = new LISTITEM;
	if( idx >= m_nItemCount )
		return 0;
	pTemp = m_pStartItem;
	for( int i=0; i < idx; i++ ) {
		pTemp = pTemp->pNext;
	}
	pNew->pPrev = pTemp->pPrev;
	pNew->pNext = pTemp;
	pNew->pPrev->pNext = pNew;
	pTemp->pPrev = pNew;
	return idx;
}

void CLIST::RemoveAt(int idx)
{
	PLISTITEM pTemp;
	if( idx >= m_nItemCount )
		return;
	pTemp = m_pStartItem;
	for( int i=0; i < idx; i++ ) {
		pTemp = pTemp->pNext;
	}
	pTemp->pPrev->pNext = pTemp->pNext;
	pTemp->pNext->pPrev = pTemp->pPrev;
}

int CLIST::GetCount()
{
	return m_nItemCount;
}

bool CLIST::IsEmpty()
{
	if( m_nItemCount == 0 )
		return true;
	else
		return false;
}
int CLIST::Find(void *pItem)
{
	PLISTITEM pTemp;
	
	pTemp = m_pStartItem;
	for( int i = 0; i < m_nItemCount; i++ ) {
		if( pTemp == pItem )
			return i;
		if( (pTemp = pTemp->pNext) == NULL )
			return -1;		
	}	
	return -1;
}