/*
 * IdPool_policy.hpp
 *
 *  Created on: Feb 7, 2012
 *      Author: heber
 */

#ifndef IDPOOL_POLICY_HPP_
#define IDPOOL_POLICY_HPP_

// include config.h
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif

#include "CodePatterns/Range.hpp"

class uniqueId{
public:
  typedef void is_IdPool_policy;
  template <class T> T getNextId_impl(std::set<range<T> > &pool, T&currId)
  {
    return currId++;
  }
};

class continuousId{
public:
  typedef void is_IdPool_policy;

  template <class T> T getNextId_impl(std::set<range<T> > &pool, T&currId)
  {
    // try to find an Id in the pool;
    if(!pool.empty()) {
      typename std::set<range<T> >::iterator iter=pool.begin();
      T id = iter->first;
      range<T> newRange = makeRange(id+1,iter->last);
      // we wont use this iterator anymore, so we don't care about invalidating
      pool.erase(iter);
      if(newRange.first<newRange.last)
        pool.insert(newRange);
      return id;
    }
    // Nothing in the pool... we are out of luck
    return currId++;
  }
};


#endif /* IDPOOL_POLICY_HPP_ */