chain.cpp

中国移动的短信网关程序

#include "stdafx.h"
#include "chain.h"
#include <algorithm>
#if 0
template <class _Tp>
Chain<_Tp>::~Chain()
{
	list< _Tp*>::iterator iter;
	for ( iter = m_list.begin(); iter !=m_list.end(); iter ++ )
		delete ( *iter );
}

template <class _Tp>
void Chain<_Tp>::Insert(int index,  _Tp * pNode)
{
	list<_Tp* >::iterator iter = m_list.begin();
	advance( iter, index);
	m_list.insert( iter, pNode );
}

template <class _Tp>
void Chain<_Tp>::Append( _Tp * pNode)
{
	m_list.push_back( pNode );
}

template <class _Tp>
_Tp * Chain<_Tp>::Find(int index)
{
	list< _Tp*>::iterator iter = m_list.begin();
	advance( iter, index );
	return *iter;
}

template <class _Tp>
_Tp* Chain<_Tp>::Delete(int index)
{
	list< _Tp*>::iterator iter = m_list.begin();
	advance( iter, index );
	assert( iter != m_list.end() );
	_Tp* pVal = *iter;
	m_list.erase( iter );
	return pVal;
}

template <class _Tp>
int Chain<_Tp>::Search(const _Tp* pNode)
{
	list< _Tp*>::iterator iter;
	int i = 0;
	for ( iter = m_list.begin(); iter != m_list.end(); iter ++ )
	{
		if( *iter == *pNode )
			return i;
		i++;
	}
	return -1;
}

#endif