Priority Queue Solver

gistfile1.cpp

#define DEVEL_BUFFER_SIZE 128

/**
 * Priority queue solver.
 * <P> implements the concept of ordered list.
 * <T> implements the concept of weighted solution.
 * <E> is an environment object (should be reentrant).
 */
template <class P, class T, typename E> void solve(T**seeds,
         int seedSize,
         E *context,
         int threshold) {
  P<T> *queue = new P<T>(threshold);
  T *tmp;
  T **buffer = new T*[DEVEL_BUFFER_SIZE];
  int size;

  queue->insert(seeds, seedSize);
  while(!(queue->empty() || context->solved())) {
    tmp = queue.pool();
    size = tmp->compute(buffer, DEVEL_BUFFER_SIZE, threshold, context);
    queue->insert(buffer, size);
  }
  delete []buffer;
  delete queue;
}

Too many method call, isn't it ?