#include <set>

#include "MantidKernel/IndexSet.h"
#include "MantidKernel/Exception.h"

using namespace Mantid;
using namespace Kernel;

/// Constructor for a set covering the full range from 0 to fullRange-1.
IndexSet::IndexSet(size_t fullRange) : m_size(fullRange) {}

/// Constructor for a set covering the range from min to max. Range is verified
/// at construction time.
IndexSet::IndexSet(int64_t min, int64_t max, size_t fullRange) {
  if (min < 0 || min > max)
    throw Exception::IndexError(min, max, "IndexSet - min");
  if (max >= static_cast<int64_t>(fullRange))
    throw Exception::IndexError(max, fullRange - 1, "IndexSet - max");

  // Bounds checked, cast should be fine in all cases.
  m_min = static_cast<size_t>(min);
  m_size = static_cast<size_t>(max - min + 1);
}

/// Constructor for a set containing all specified indices. Range is verified at
/// construction time and duplicates are removed.
IndexSet::IndexSet(const std::vector<size_t> indices, size_t fullRange)
    : m_isRange(false) {
  // We use a set to create unique and ordered indices.
  std::set<size_t> index_set;
  for (const auto &index : indices) {
    if (index >= fullRange)
      throw Exception::IndexError(index, fullRange - 1,
                                  "IndexSet - index vector entry");
    index_set.insert(index);
  }
  m_indices = std::vector<size_t>(begin(index_set), end(index_set));
  m_size = m_indices.size();
}