基于list内存池雏形

#include<iostream>
#include<list>
using namespace std;
template <typename T>
class SafeQueue
{
public:
SafeQueue()
: m_size(0)
{


}


~SafeQueue()
{


}


public:
T front()
{
if (m_queue.empty())
{
return T(0);
}
else
{
return m_queue.front();
}
}


T pop()
{
if (!m_queue.empty())
{
T ret = m_queue.front();
m_queue.pop_front();
--m_size;
return ret;
}
else
{
return T(0);
}
}


void push(T val)
{
m_queue.push_back(val);
++m_size;
}


long size()
{
return m_size;
}




private:
list<T> m_queue;
int m_size;
};
template<typename T>
class ObjectPool
{
public:
ObjectPool(unsigned int initCount, unsigned int maxCount)
: m_initCount(initCount), m_maxCount(maxCount)
{
for (unsigned int i = 0; i != initCount; ++i)
{
push(new T);
}
}


~ObjectPool()
{
T *pVal = NULL;
while ((pVal = m_pool.pop()) != NULL)
{
delete pVal;
}
}


T* pop()
{
T *pVal = m_pool.pop();
if (pVal == NULL)
{
pVal = new T;
}
pVal->reset();


return pVal;
}


void push(T *pVal)
{
if (pVal != NULL)
{
pVal->reset();
m_pool.push(pVal);


if (m_pool.size() > m_maxCount)
{
delete m_pool.pop();
}
}
}


private:
SafeQueue<T*> m_pool;
int m_initCount;
int m_maxCount;
};
class GameMsg
{
public:
void reset()
{
cout<<"Rest"<<endl;
}
};
typedef SafeQueue<GameMsg*> GameMsgQueue;
int main()
{
ObjectPool<GameMsg> m_gameMsgPool(10,10);
GameMsg *msg= m_gameMsgPool.pop();
msg->reset();
return 0;
}