一种读写可并发进行的队列的实现方法

四.
m_end->assignValue(v);
if(m_beg == m_end->next){
m_end->next = allocate(m_end->next);
m_size;
}
m_end = m_end->next;
}
bool empty() const
{
return m_beg == m_end;
}
const_reference front() const
{
return m_beg->value();
}
reference front()
{
return m_beg->value();
}
void pop_front()
{
if(m_beg != m_end)
{
m_beg->freeValue();
m_beg = m_beg->next;
}
}
size_type size() const
{
int ret = 0;
node_pointer pend = m_end;

for(node_pointer beg = m_beg; beg != m_end; ret, beg = beg->next);
return ret;
}
size_type buffer_size() const
{
return m_size;
}
private:
node_pointer m_end;
node_pointer m_beg;
size_type m_size;
//不明白allocator的使用方式,下面的表达式编译不通过
//typedef typename allocator_type::template rebind::other _node_alloc_type
//暂时使用new,delete来分配释放内存
node_pointer allocate()
{
return new node_type();
}
node_pointer allocate(node_pointer pnext)
{
return new node_type(pnext);
}
void deallocate(node_pointer pnode)
{
delete pnode;
}

struct ListNode
{
char buffer[sizeof(T)];
ListNode* next;
ListNode():next(this)
{
}
explicit ListNode(ListNode* pnext):next(pnext)
{
}
bool operator==(const ListNode& rhs) const
{
return next == rhs->next;
}
bool operator != (const ListNode& rhs) const
{
return !(*this == rhs);
}
void freeValue()
{
value().T::~T();
}
void assignValue(const T& data)
{
new(buffer) T(data);
}
T& value()
{
return *(T*)buffer;
}
const T& value() const
{
return *(T*)buffer;