#include "include/Saver.h"
#include <CGAL/Simple_cartesian.h>
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
#include <CGAL/Shape_regularization.h>

namespace SR = CGAL::Shape_regularization;

template<class Traits>
void test_0_segments() {

  using FT        = typename Traits::FT;
  using Segment_2 = typename Traits::Segment_2;
  using Segments  = std::vector<Segment_2>;
  using Indices   = std::vector<std::size_t>;
  using Saver     = SR::Tests::Saver<Traits>;

  using Segment_map = CGAL::Identity_property_map<Segment_2>;

  using NQ = SR::Segments::Delaunay_neighbor_query_2<Traits, Segments, Segment_map>;
  using AR = SR::Segments::Angle_regularization_2<Traits, Segments, Segment_map>;
  using OR = SR::Segments::Offset_regularization_2<Traits, Segments, Segment_map>;
  using QP = CGAL::OSQP_quadratic_program_traits<FT>;

  using QP_AR = SR::QP_regularization<Traits, Segments, NQ, AR, QP>;
  using QP_OR = SR::QP_regularization<Traits, Segments, NQ, OR, QP>;

  Saver saver;
  Segment_map smap;
  Segments segments;
  assert(segments.size() == 0);

  // saver.export_eps_segments(segments, "0_input", 100);

  NQ neighbor_query(
    segments, CGAL::parameters::segment_map(smap));
  AR angle_regularization(
    segments, CGAL::parameters::segment_map(smap));

  QP qp_angles;
  QP_AR qp_ar(
    segments, neighbor_query, angle_regularization, qp_angles);
  qp_ar.regularize();

  std::vector<Indices> parallel_groups;
  angle_regularization.parallel_groups(
    std::back_inserter(parallel_groups));

  std::vector<Indices> orthogonal_groups;
  angle_regularization.orthogonal_groups(
    std::back_inserter(orthogonal_groups));

  const std::size_t num_segments_angles =
    angle_regularization.number_of_modified_segments();

  // saver.export_eps_segments(segments, "0_angles", 100);

  assert(segments.size() == 0);
  assert(parallel_groups.size() == 0);
  assert(orthogonal_groups.size() == 0);
  assert(num_segments_angles == 0);

  OR offset_regularization(
    segments, CGAL::parameters::segment_map(smap));

  neighbor_query.clear();
  for (const auto& parallel_group : parallel_groups) {
    neighbor_query.add_group(parallel_group);
    offset_regularization.add_group(parallel_group);
  }

  QP qp_offsets;
  QP_OR qp_or(
    segments, neighbor_query, offset_regularization, qp_offsets);
  qp_or.regularize();

  std::vector<Indices> collinear_groups;
  offset_regularization.collinear_groups(
    std::back_inserter(collinear_groups));

  std::vector<Segment_2> unique_segments;
  offset_regularization.unique_segments(
    std::back_inserter(unique_segments));

  const std::size_t num_segments_offsets =
    offset_regularization.number_of_modified_segments();

  // saver.export_eps_segments(segments, "0_offsets", 100);
  // saver.export_eps_segments(unique_segments, "0_unique", 100);

  assert(segments.size() == 0);
  assert(collinear_groups.size() == 0);
  assert(unique_segments.size() == 0);
  assert(num_segments_offsets == 0);
}

int main() {
  test_0_segments< CGAL::Simple_cartesian<double> >();
  test_0_segments< CGAL::Exact_predicates_inexact_constructions_kernel >();
  test_0_segments< CGAL::Exact_predicates_exact_constructions_kernel >();
  std::cout << "test_0_segments: SUCCESS" << std::endl;
  return EXIT_SUCCESS;
}