[PPL-devel] ppl ./NEWS ./TODO interfaces/C/ppl_c.cc interf ...

Roberto Bagnara roberto at spartacus.cs.unipr.it
Tue Apr 15 19:38:06 CEST 2003


CVSROOT:	/cvs/ppl
Module name:	ppl
Changes by:	roberto at cs.unipr.it	2003-04-15 19:38:06

Modified files:
	.              : NEWS TODO 
	interfaces/C   : ppl_c.cc ppl_c.h 
	interfaces/C/lpenum: lpenum.c 
	interfaces/Prolog: Prolog_interface.dox pl_check.pl 
	                   ppl_prolog.icc 
	interfaces/Prolog/Ciao: ppl_ciao.pl 
	interfaces/Prolog/GNU: ppl_gprolog.pl 
	interfaces/Prolog/SICStus: ppl_sicstus_sd.cc 
	interfaces/Prolog/SWI: ppl_swiprolog.cc 
	interfaces/Prolog/XSB: ppl_xsb.H ppl_xsb.cc 
	interfaces/Prolog/YAP: ppl_yap.cc 
	src            : C_Polyhedron.cc Determinate.inlines.hh 
	                 Polyhedron.defs.hh Polyhedron.inlines.hh 
	                 Polyhedron_public.cc 
	tests          : bounded1.cc disjoint1.cc disjoint2.cc 
	                 disjoint3.cc empty1.cc intersection2.cc 
	                 linearpartition1.cc linearpartition2.cc 
	                 linearpartition3.cc randphull1.cc smm1.cc 
	                 timeelapse5.cc topclosed1.cc topclosed2.cc 
	                 topclosed3.cc universe1.cc universe2.cc 
	                 universe3.cc universe4.cc universe5.cc 
	                 universe6.cc 

Log message:
	The methods Polyhedron::check_empty() and Polyhedron::check_universe()
	have been renamed is_empty() and is_universe(), respectively.
	The function check_disjoint(const Polyhedron&, const Polyhedron&)
	had been replaced by method Polyhedron::is_disjoint_from(const Polyhedron&).
	The methods Polyhedron::check_bounded() and
	Polyhedron::check_topologically_closed() have been renamed
	is_bounded() and is_topologically_closed(), respectively.

Patches:
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/NEWS.diff?cvsroot=ppl&r1=1.70&r2=1.71
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/TODO.diff?cvsroot=ppl&r1=1.45&r2=1.46
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/interfaces/C/ppl_c.cc.diff?cvsroot=ppl&r1=1.75&r2=1.76
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/interfaces/C/ppl_c.h.diff?cvsroot=ppl&r1=1.83&r2=1.84
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/interfaces/C/lpenum/lpenum.c.diff?cvsroot=ppl&r1=1.21&r2=1.22
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/interfaces/Prolog/Prolog_interface.dox.diff?cvsroot=ppl&r1=1.97&r2=1.98
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/interfaces/Prolog/pl_check.pl.diff?cvsroot=ppl&r1=1.60&r2=1.61
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/interfaces/Prolog/ppl_prolog.icc.diff?cvsroot=ppl&r1=1.108&r2=1.109
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/interfaces/Prolog/Ciao/ppl_ciao.pl.diff?cvsroot=ppl&r1=1.53&r2=1.54
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/interfaces/Prolog/GNU/ppl_gprolog.pl.diff?cvsroot=ppl&r1=1.35&r2=1.36
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/interfaces/Prolog/SICStus/ppl_sicstus_sd.cc.diff?cvsroot=ppl&r1=1.49&r2=1.50
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/interfaces/Prolog/SWI/ppl_swiprolog.cc.diff?cvsroot=ppl&r1=1.72&r2=1.73
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/interfaces/Prolog/XSB/ppl_xsb.H.diff?cvsroot=ppl&r1=1.22&r2=1.23
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/interfaces/Prolog/XSB/ppl_xsb.cc.diff?cvsroot=ppl&r1=1.35&r2=1.36
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/interfaces/Prolog/YAP/ppl_yap.cc.diff?cvsroot=ppl&r1=1.66&r2=1.67
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/src/C_Polyhedron.cc.diff?cvsroot=ppl&r1=1.5&r2=1.6
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/src/Determinate.inlines.hh.diff?cvsroot=ppl&r1=1.27&r2=1.28
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/src/Polyhedron.defs.hh.diff?cvsroot=ppl&r1=1.204&r2=1.205
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/src/Polyhedron.inlines.hh.diff?cvsroot=ppl&r1=1.73&r2=1.74
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/src/Polyhedron_public.cc.diff?cvsroot=ppl&r1=1.8&r2=1.9
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/tests/bounded1.cc.diff?cvsroot=ppl&r1=1.11&r2=1.12
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/tests/disjoint1.cc.diff?cvsroot=ppl&r1=1.5&r2=1.6
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/tests/disjoint2.cc.diff?cvsroot=ppl&r1=1.6&r2=1.7
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/tests/disjoint3.cc.diff?cvsroot=ppl&r1=1.5&r2=1.6
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/tests/empty1.cc.diff?cvsroot=ppl&r1=1.12&r2=1.13
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/tests/intersection2.cc.diff?cvsroot=ppl&r1=1.8&r2=1.9
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/tests/linearpartition1.cc.diff?cvsroot=ppl&r1=1.11&r2=1.12
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/tests/linearpartition2.cc.diff?cvsroot=ppl&r1=1.11&r2=1.12
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/tests/linearpartition3.cc.diff?cvsroot=ppl&r1=1.11&r2=1.12
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/tests/randphull1.cc.diff?cvsroot=ppl&r1=1.8&r2=1.9
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/tests/smm1.cc.diff?cvsroot=ppl&r1=1.13&r2=1.14
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/tests/timeelapse5.cc.diff?cvsroot=ppl&r1=1.7&r2=1.8
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/tests/topclosed1.cc.diff?cvsroot=ppl&r1=1.5&r2=1.6
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/tests/topclosed2.cc.diff?cvsroot=ppl&r1=1.4&r2=1.5
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/tests/topclosed3.cc.diff?cvsroot=ppl&r1=1.6&r2=1.7
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/tests/universe1.cc.diff?cvsroot=ppl&r1=1.8&r2=1.9
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/tests/universe2.cc.diff?cvsroot=ppl&r1=1.9&r2=1.10
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/tests/universe3.cc.diff?cvsroot=ppl&r1=1.9&r2=1.10
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/tests/universe4.cc.diff?cvsroot=ppl&r1=1.9&r2=1.10
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/tests/universe5.cc.diff?cvsroot=ppl&r1=1.10&r2=1.11
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/tests/universe6.cc.diff?cvsroot=ppl&r1=1.7&r2=1.8




More information about the PPL-devel mailing list