/* Test Polyhedron::is_topologically_closed(): a polyhedron
   described by a system of generators composed by a point,
   a line and an unmatched closure point lying on the same line of
   the point is topologically closed.
   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

int
main() TRY {
  set_handlers();

  Variable A(0);
  Variable B(1);

  GenSys gs;
  gs.insert(point(0*B));
  gs.insert(closure_point(-A));
  gs.insert(closure_point(A));
  gs.insert(line(A));

  NNC_Polyhedron ph(gs);

  bool ok = ph.is_topologically_closed();

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

  return ok ? 0 : 1;
}
CATCH