tpl_nodePool.H

# ifndef TPL_NODEPOOL_H
# define TPL_NODEPOOL_H

# include <tpl_arrayStack.H>

    template <class Node>
class Node_Pool
{

  FixedStack<Node*> node_pool;
  const size_t n;

public:

  Node_Pool(size_t __n = 100) : node_pool(__n), n(__n) { /* empty */ }

  Node * allocate()
  {
    return node_pool.is_empty() ? new Node : node_pool.pop();
  }

  Node * allocate(const typename Node::key_type & key)
  {
    return new (allocate()) Node (key);
  }

  Node * allocate(typename Node::key_type && key)
  {
    return new (allocate()) Node (std::move(key));
  }  

  void deallocate(Node * p)
  {
    if (node_pool.size() == n)
      delete p;
    else
      node_pool.push(p);
  }

  ~Node_Pool()
  {
    while (not node_pool.is_empty())
      delete node_pool.pop();
  }
};

# endif // TPL_NODEPOOL_H