/* Test Polyhedron::generalized_affine_image() with a linear expression
   as the left hand side: when the left hand side has no coefficients
   of the variables different form zero.
   Copyright (C) 2001-2004 Roberto Bagnara <bagnara@cs.unipr.it>

This file is part of the Parma Polyhedra Library (PPL).

The PPL is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the
Free Software Foundation; either version 2 of the License, or (at your
option) any later version.

The PPL is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
for more details.

You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
USA.

For the most up-to-date information see the Parma Polyhedra Library
site: http://www.cs.unipr.it/ppl/ . */

#include "ppl_test.hh"

using namespace std;
using namespace Parma_Polyhedra_Library;

#ifndef NOISY
#define NOISY 0
#endif

static void
test1() {
  Variable A(0);
  Variable B(1);

  C_Polyhedron ph(2);
  ph.add_constraint(B >= 0);
  ph.add_constraint(A >= 1);

  C_Polyhedron known_result(ph);

#if NOISY
  print_constraints(ph, "*** ph ***");
#endif

  ph.generalized_affine_image(LinExpression(2), EQUAL, A + B);

  known_result.add_constraint(A + B == 2);

  bool ok = (ph == known_result);

#if NOISY
  print_constraints(ph, "*** After ph.generalized_affine_image"
		    "(LinExpression(2), EQUAL, A + B) ***");
#endif

  if (!ok)
    exit(1);
}

static void
test2() {
  Variable A(0);
  Variable B(1);

  C_Polyhedron ph(2);
  ph.add_constraint(B >= 0);
  ph.add_constraint(A - B >= 1);

  C_Polyhedron known_result(ph);

#if NOISY
  print_constraints(ph, "*** ph ***");
#endif

  ph.generalized_affine_image(LinExpression(2), GREATER_THAN_OR_EQUAL, A + B);

  known_result.add_constraint(2 >= A + B);

  bool ok = (ph == known_result);

#if NOISY
  print_constraints(ph, "*** After ph.generalized_affine_image"
		    "(LinExpression(2), GREATER_THAN_OR_EQUAL, A + B) ***");
#endif

  if (!ok)
    exit(1);
}

static void
test3() {
  Variable A(0);
  Variable B(1);

  C_Polyhedron ph(2);
  ph.add_constraint(B >= 0);
  ph.add_constraint(A - B >= 1);

  C_Polyhedron known_result(ph);

#if NOISY
  print_constraints(ph, "*** ph ***");
#endif

  ph.generalized_affine_image(LinExpression(2), LESS_THAN_OR_EQUAL, A + B);

  known_result.add_constraint(2 <= A + B);

  bool ok = (ph == known_result);

#if NOISY
  print_constraints(ph, "*** After ph.generalized_affine_image"
		    "(LinExpression(2), LESS_THAN_OR_EQUAL, A + B) ***");
#endif

  if (!ok)
    exit(1);
}

static void
test4() {
  Variable A(0);
  Variable B(1);

  NNC_Polyhedron ph(2);
  ph.add_constraint(B > 0);
  ph.add_constraint(A - B > 1);

  NNC_Polyhedron known_result(ph);

#if NOISY
  print_constraints(ph, "*** ph ***");
#endif

  ph.generalized_affine_image(LinExpression(2), GREATER_THAN, A + B);

  known_result.add_constraint(2 > A + B);

  bool ok = (ph == known_result);

#if NOISY
  print_constraints(ph, "*** After ph.generalized_affine_image"
		    "(LinExpression(2), GREATER_THAN, A + B) ***");
#endif

  if (!ok)
    exit(1);
}

static void
test5() {
  Variable A(0);
  Variable B(1);

  NNC_Polyhedron ph(2);
  ph.add_constraint(B > 0);
  ph.add_constraint(A >= 1);

  NNC_Polyhedron known_result(ph);

#if NOISY
  print_constraints(ph, "*** ph ***");
#endif

  ph.generalized_affine_image(LinExpression(2), LESS_THAN, A + B);

  known_result.add_constraint(2 < A + B);

  bool ok = (ph == known_result);

#if NOISY
  print_constraints(ph, "*** After ph.generalized_affine_image"
		    "(LinExpression(2), LESS_THAN, A + B) ***");
#endif

  if (!ok)
    exit(1);
}

int
main() TRY {
  set_handlers();

  test1();
  test2();
  test3();
  test4();
  test5();

  return 0;
}
CATCH


syntax highlighted by Code2HTML, v. 0.9.1