Code source gestion de mémoire méthode fifo

struct fifo_node
{
struct fifo_node *next;
value_type value;
};

class fifo
{
fifo_node *front;
fifo_node *back;

fifo_node *dequeue(void)
{
fifo_node *tmp = front;
front = front->next;
return tmp;
}

queue(value)
{
fifo_node *tempNode = new fifo_node;
tempNode->value = value;
back->next = tempNode;
back = tempNode;
}
};