EQ2EMu/EQ2/source/depends/boost_1_72_0/libs/polygon/test/polygon_interval_test.cpp

// Boost.Polygon library polygon_interval_test.cpp file

//          Copyright Andrii Sydorchuk 2012.
// Distributed under the Boost Software License, Version 1.0.
//    (See accompanying file LICENSE_1_0.txt or copy at
//          http://www.boost.org/LICENSE_1_0.txt)

// See http://www.boost.org for updates, documentation, and revision history.

#include <boost/core/lightweight_test.hpp>
#include <boost/polygon/interval_concept.hpp>
#include <boost/polygon/interval_data.hpp>
#include <boost/polygon/interval_traits.hpp>

using namespace boost::polygon;

void interval_data_test()
{
  typedef interval_data<int> interval_type;
  interval_type interval1(1, 2);
  interval_type interval2;
  interval2 = interval1;

  BOOST_TEST_EQ(interval1.low(), 1);
  BOOST_TEST_EQ(interval1.high(), 2);
  BOOST_TEST_EQ(interval1.get(LOW), 1);
  BOOST_TEST_EQ(interval1.get(HIGH), 2);
  BOOST_TEST(interval1 == interval2);
  BOOST_TEST(!(interval1 != interval2));
  BOOST_TEST(!(interval1 < interval2));
  BOOST_TEST(!(interval1 > interval2));
  BOOST_TEST(interval1 <= interval2);
  BOOST_TEST(interval1 >= interval2);

  interval1.low(2);
  interval1.high(1);
  BOOST_TEST_EQ(interval1.low(), 2);
  BOOST_TEST_EQ(interval1.high(), 1);
  BOOST_TEST(!(interval1 == interval2));
  BOOST_TEST(interval1 != interval2);

  interval2.set(LOW, 2);
  interval2.set(HIGH, 1);
  BOOST_TEST(interval1 == interval2);
}

void interval_traits_test()
{
  typedef interval_data<int> interval_type;

  interval_type interval = interval_mutable_traits<interval_type>::construct(1, 2);
  BOOST_TEST_EQ(interval_traits<interval_type>::get(interval, LOW), 1);
  BOOST_TEST_EQ(interval_traits<interval_type>::get(interval, HIGH), 2);

  interval_mutable_traits<interval_type>::set(interval, LOW, 3);
  interval_mutable_traits<interval_type>::set(interval, HIGH, 4);
  BOOST_TEST_EQ(interval_traits<interval_type>::get(interval, LOW), 3);
  BOOST_TEST_EQ(interval_traits<interval_type>::get(interval, HIGH), 4);
}

template <typename T>
struct Interval {
  T left;
  T right;
};

namespace boost {
namespace polygon {
  template <typename T>
  struct geometry_concept< Interval<T> > {
    typedef interval_concept type;
  };

  template <typename T>
  struct interval_traits< Interval<T> > {
    typedef T coordinate_type;

    static coordinate_type get(const Interval<T>& interval, direction_1d dir) {
      return (dir == LOW) ? interval.left : interval.right;
    }
  };

  template <typename T>
  struct interval_mutable_traits< Interval<T> > {
    typedef T coordinate_type;

    static void set(Interval<T>& interval, direction_1d dir, T value) {
      (dir == LOW) ? interval.left = value : interval.right = value;
    }

    static Interval<T> construct(coordinate_type left, coordinate_type right) {
      Interval<T> interval;
      interval.left = left;
      interval.right = right;
      return interval;
    }
  };
}  // polygon
}  // boost

void interval_concept_test1()
{
  typedef Interval<int> interval_type;

  interval_type interval1 = construct<interval_type>(2, 1);
  BOOST_TEST_EQ(interval1.left, 1);
  BOOST_TEST_EQ(interval1.right, 2);

  set(interval1, LOW, 3);
  set(interval1, HIGH, 4);
  BOOST_TEST_EQ(get(interval1, LOW), 3);
  BOOST_TEST_EQ(get(interval1, HIGH), 4);

  interval_type interval2 = copy_construct<interval_type>(interval1);
  BOOST_TEST(equivalence(interval1, interval2));

  low(interval2, 1);
  high(interval2, 2);
  BOOST_TEST_EQ(low(interval2), 1);
  BOOST_TEST_EQ(high(interval2), 2);

  assign(interval1, interval2);
  BOOST_TEST(equivalence(interval1, interval2));
}

void interval_concept_test2()
{
  typedef Interval<int> interval_type;

  interval_type interval1 = construct<interval_type>(1, 3);
  BOOST_TEST_EQ(center(interval1), 2);
  BOOST_TEST_EQ(delta(interval1), 2);

  flip(interval1, -1);
  BOOST_TEST_EQ(low(interval1), -5);
  BOOST_TEST_EQ(high(interval1), -3);

  scale_up(interval1, 2);
  BOOST_TEST_EQ(low(interval1), -10);
  BOOST_TEST_EQ(high(interval1), -6);

  scale_down(interval1, 2);
  BOOST_TEST_EQ(low(interval1), -5);
  BOOST_TEST_EQ(high(interval1), -3);

  move(interval1, 5);
  BOOST_TEST_EQ(low(interval1), 0);
  BOOST_TEST_EQ(high(interval1), 2);

  convolve(interval1, 1);
  BOOST_TEST_EQ(low(interval1), 1);
  BOOST_TEST_EQ(high(interval1), 3);

  deconvolve(interval1, 2);
  BOOST_TEST_EQ(low(interval1), -1);
  BOOST_TEST_EQ(high(interval1), 1);

  interval_type interval2 = construct<interval_type>(-1, 2);
  convolve(interval1, interval2);
  BOOST_TEST_EQ(low(interval1), -2);
  BOOST_TEST_EQ(high(interval1), 3);

  deconvolve(interval1, interval2);
  BOOST_TEST_EQ(low(interval1), -1);
  BOOST_TEST_EQ(high(interval1), 1);

  reflected_convolve(interval1, interval2);
  BOOST_TEST_EQ(low(interval1), -3);
  BOOST_TEST_EQ(high(interval1), 2);

  reflected_deconvolve(interval1, interval2);
  BOOST_TEST_EQ(low(interval1), -1);
  BOOST_TEST_EQ(high(interval1), 1);
}

void interval_concept_test3()
{
  typedef Interval<int> interval_type;

  interval_type interval1 = construct<interval_type>(1, 3);
  BOOST_TEST_EQ(euclidean_distance(interval1, -2), 3);
  BOOST_TEST_EQ(euclidean_distance(interval1, 2), 0);
  BOOST_TEST_EQ(euclidean_distance(interval1, 4), 1);

  interval_type interval2 = construct<interval_type>(-1, 0);
  BOOST_TEST_EQ(euclidean_distance(interval1, interval2), 1);
  BOOST_TEST(!intersects(interval1, interval2));
  BOOST_TEST(!boundaries_intersect(interval1, interval2));
  BOOST_TEST(!intersect(interval2, interval1));
  BOOST_TEST_EQ(low(interval2), -1);
  BOOST_TEST_EQ(high(interval2), 0);

  interval_type interval3 = construct<interval_type>(-1, 6);
  BOOST_TEST_EQ(euclidean_distance(interval1, interval3), 0);
  BOOST_TEST(intersects(interval1, interval3));
  BOOST_TEST(!boundaries_intersect(interval1, interval3));
  BOOST_TEST(intersect(interval3, interval1));
  BOOST_TEST_EQ(low(interval3), 1);
  BOOST_TEST_EQ(high(interval3), 3);

  interval_type interval4 = construct<interval_type>(5, 6);
  BOOST_TEST_EQ(euclidean_distance(interval1, interval4), 2);
  BOOST_TEST(!intersects(interval1, interval4));
  BOOST_TEST(!boundaries_intersect(interval1, interval4));
  BOOST_TEST(!intersect(interval4, interval1));
  BOOST_TEST_EQ(low(interval4), 5);
  BOOST_TEST_EQ(high(interval4), 6);

  interval_type interval5 = construct<interval_type>(3, 5);
  BOOST_TEST_EQ(euclidean_distance(interval1, interval5), 0);
  BOOST_TEST(!intersects(interval1, interval5, false));
  BOOST_TEST(boundaries_intersect(interval1, interval5));
  BOOST_TEST(intersect(interval5, interval1));
  BOOST_TEST_EQ(low(interval5), 3);
  BOOST_TEST_EQ(high(interval5), 3);
}

void interval_concept_test4()
{
  typedef Interval<int> interval_type;

  interval_type interval1 = construct<interval_type>(1, 3);
  interval_type interval2 = construct<interval_type>(3, 5);
  BOOST_TEST(!abuts(interval1, interval2, LOW));
  BOOST_TEST(abuts(interval1, interval2, HIGH));
  BOOST_TEST(abuts(interval1, interval2));

  bloat(interval1, 1);
  BOOST_TEST_EQ(low(interval1), 0);
  BOOST_TEST_EQ(high(interval1), 4);
  BOOST_TEST(!abuts(interval1, interval2));

  bloat(interval1, LOW, 1);
  BOOST_TEST_EQ(low(interval1), -1);
  BOOST_TEST_EQ(high(interval1), 4);

  shrink(interval1, LOW, 1);
  BOOST_TEST_EQ(low(interval1), 0);
  BOOST_TEST_EQ(high(interval1), 4);

  shrink(interval1, 1);
  BOOST_TEST_EQ(low(interval1), 1);
  BOOST_TEST_EQ(high(interval1), 3);

  BOOST_TEST(encompass(interval1, 4));
  BOOST_TEST_EQ(low(interval1), 1);
  BOOST_TEST_EQ(high(interval1), 4);

  BOOST_TEST(encompass(interval1, interval2));
  BOOST_TEST_EQ(low(interval1), 1);
  BOOST_TEST_EQ(high(interval1), 5);

  interval1 = get_half(interval1, LOW);
  BOOST_TEST_EQ(low(interval1), 1);
  BOOST_TEST_EQ(high(interval1), 3);

  BOOST_TEST(join_with(interval1, interval2));
  BOOST_TEST_EQ(low(interval1), 1);
  BOOST_TEST_EQ(high(interval1), 5);
}

int main()
{
    interval_data_test();
    interval_traits_test();
    interval_concept_test1();
    interval_concept_test2();
    interval_concept_test3();
    interval_concept_test4();
    return boost::report_errors();
}