March 2010 - PPL-devel - BUGSENG Mailman

[GIT] ppl/ppl(termination): Implemented the improved Podelski and Rybalchenko termination test.
by Roberto Bagnara 09 Mar '10

09 Mar '10

Module: ppl/ppl Branch: termination Commit: a1d4481a3175ce3a55d90267c66befb9247827e9 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=a1d4481a3175… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Tue Mar 9 17:03:16 2010 +0400 Implemented the improved Podelski and Rybalchenko termination test. --- src/termination.cc | 54 +++++++++++++++-- src/termination.templates.hh | 78 +++++++++++++++++++++++--- tests/Polyhedron/termination1.cc | 115 ++++++++++++++++++++++++++++++++++++- 3 files changed, 228 insertions(+), 19 deletions(-) Diff: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commitdiff;h=a1d4481a…

1 0

[GIT] ppl/ppl(sparse_matrices): PIP_Tree: optimize static functions add_mul_assign_row() and sub_assign() for sparse rows.
by Marco Poletti 09 Mar '10

09 Mar '10

Module: ppl/ppl Branch: sparse_matrices Commit: ce75130024c763df23fbb968e0dcd44bd610da8d URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=ce75130024c7… Author: Marco Poletti <poletti.marco(a)gmail.com> Date: Tue Mar 9 13:37:22 2010 +0100 PIP_Tree: optimize static functions add_mul_assign_row() and sub_assign() for sparse rows. --- src/PIP_Tree.cc | 100 ++++++++++++++++++++++++++++++++++++++++++++++++++++-- 1 files changed, 96 insertions(+), 4 deletions(-) diff --git a/src/PIP_Tree.cc b/src/PIP_Tree.cc index f69f55e..9137180 100644 --- a/src/PIP_Tree.cc +++ b/src/PIP_Tree.cc @@ -46,16 +46,108 @@ inline void add_mul_assign_row(PIP_Tree_Node::matrix_row_reference_type x, Coefficient_traits::const_reference c, PIP_Tree_Node::matrix_row_const_reference_type y) { - for (dimension_type i = x.size(); i-- > 0; ) - add_mul_assign(x[i], c, y[i]); + PIP_Tree_Node::matrix_row_iterator i = x.begin(); + PIP_Tree_Node::matrix_row_iterator last_i = x.begin(); + PIP_Tree_Node::matrix_row_iterator i_end = x.end(); + PIP_Tree_Node::matrix_const_row_const_iterator j = y.begin(); + PIP_Tree_Node::matrix_const_row_const_iterator j_end = y.end(); + if (i != i_end && j != j_end) { + if ((*i).first == (*j).first) { + add_mul_assign((*i).second,c,(*j).second); + last_i = i; + ++i; + ++j; + } else + if ((*i).first < (*j).first) { + // We should do (*i).second += c*0, so do nothing. + last_i = i; + ++i; + } else { + last_i = x.find_create((*j).first,(*j).second); + (*last_i).second *= c; + ++j; + } + } else + if (j != j_end) { + last_i = x.find_create((*j).first,(*j).second); + neg_assign((*last_i).second); + ++j; + } + while (i != i_end && j != j_end) + if ((*i).first == (*j).first) { + add_mul_assign((*i).second,c,(*j).second); + last_i = i; + ++i; + ++j; + } else + if ((*i).first < (*j).first) { + // We should do (*i).second += c*0, so do nothing. + last_i = i; + ++i; + } else { + last_i = x.find_create((*j).first,(*j).second,last_i); + (*last_i).second *= c; + ++j; + } + while (j != j_end) { + last_i = x.find_create((*j).first,(*j).second,last_i); + (*last_i).second *= c; + ++j; + } } // Compute x -= y inline void sub_assign(PIP_Tree_Node::matrix_row_reference_type x, PIP_Tree_Node::matrix_row_const_reference_type y) { - for (dimension_type i = x.size(); i-- > 0; ) - x[i] -= y[i]; + PIP_Tree_Node::matrix_row_iterator i = x.begin(); + PIP_Tree_Node::matrix_row_iterator last_i = x.begin(); + PIP_Tree_Node::matrix_row_iterator i_end = x.end(); + PIP_Tree_Node::matrix_const_row_const_iterator j = y.begin(); + PIP_Tree_Node::matrix_const_row_const_iterator j_end = y.end(); + if (i != i_end && j != j_end) { + if ((*i).first == (*j).first) { + (*i).second -= (*j).second; + last_i = i; + ++i; + ++j; + } else + if ((*i).first < (*j).first) { + // We should do (*i).second -= 0, so do nothing. + last_i = i; + ++i; + } else { + last_i = x.find_create((*j).first,(*j).second); + neg_assign((*last_i).second); + ++j; + } + } else + if (j != j_end) { + last_i = x.find_create((*j).first,(*j).second); + neg_assign((*last_i).second); + ++j; + } + while (i != i_end && j != j_end) + if ((*i).first == (*j).first) { + (*i).second -= (*j).second; + last_i = i; + ++i; + ++j; + } else + if ((*i).first < (*j).first) { + // We should do (*i).second += c*0, so do nothing. + last_i = i; + ++i; + } else { + last_i = x.find_create((*j).first,(*j).second,last_i); + neg_assign((*last_i).second); + ++j; + } + while (j != j_end) { + last_i = x.find_create((*j).first,(*j).second,last_i); + neg_assign((*last_i).second); + ++j; + } } // Merge constraint system to a Matrix-form context such as x = x U y

1 0

[GIT] ppl/ppl(sparse_matrices): Dense_Row: add find() and find_create() methods, for compatibility with Sparse_Row.
by Marco Poletti 09 Mar '10

09 Mar '10

Module: ppl/ppl Branch: sparse_matrices Commit: 72882a3727550d333b7faeb80c172a54b88b5ecd URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=72882a372755… Author: Marco Poletti <poletti.marco(a)gmail.com> Date: Tue Mar 9 13:35:53 2010 +0100 Dense_Row: add find() and find_create() methods, for compatibility with Sparse_Row. --- src/Dense_Row.defs.hh | 14 ++++++++++++++ src/Dense_Row.inlines.hh | 25 +++++++++++++++++++++++++ 2 files changed, 39 insertions(+), 0 deletions(-) diff --git a/src/Dense_Row.defs.hh b/src/Dense_Row.defs.hh index 44decef..ebb6e68 100644 --- a/src/Dense_Row.defs.hh +++ b/src/Dense_Row.defs.hh @@ -167,6 +167,20 @@ public: void get2(const dimension_type c1,const dimension_type c2, const Coefficient*& p1,const Coefficient*& p2) const; + //! Provided for compatibility with Sparse_Row. + iterator find(dimension_type i); + + //! Provided for compatibility with Sparse_Row. + //! itr must point to an element before the searched one. + iterator find(dimension_type i,iterator itr); + + //! Provided for compatibility with Sparse_Row. + iterator find_create(dimension_type i,const Coefficient& x); + + //! Provided for compatibility with Sparse_Row. + //! itr must point to an element before the modified one. + iterator find_create(dimension_type i,const Coefficient& x,iterator itr); + //! \name Subscript operators //@{ //! Returns a reference to the element of the row indexed by \p k. diff --git a/src/Dense_Row.inlines.hh b/src/Dense_Row.inlines.hh index 7e766d7..7232a3c 100644 --- a/src/Dense_Row.inlines.hh +++ b/src/Dense_Row.inlines.hh @@ -161,6 +161,31 @@ Dense_Row::get2(const dimension_type c1,const dimension_type c2, p2 = &(get(c2)); } +inline Dense_Row::iterator +Dense_Row::find(dimension_type i) { + return iterator(*this,i); +} + +inline Dense_Row::iterator +Dense_Row::find(dimension_type i,iterator itr) { + PPL_ASSERT((*itr).first < i); + return iterator(*this,i); +} + +inline Dense_Row::iterator +Dense_Row::find_create(dimension_type i,const Coefficient& x) { + (*this)[i] = x; + return find(i); +} + +inline Dense_Row::iterator +Dense_Row::find_create(dimension_type i,const Coefficient& x,iterator itr) { + PPL_ASSERT(itr != end()); + PPL_ASSERT((*itr).first < i); + (*this)[i] = x; + return find(i); +} + inline Coefficient& Dense_Row::operator[](const dimension_type k) { return row[k];

1 0

[GIT] ppl/ppl(sparse_matrices): Dense_Row: make iterator and const_iterator Assignable.
by Marco Poletti 09 Mar '10

09 Mar '10

Module: ppl/ppl Branch: sparse_matrices Commit: c43588786d85464bc357116785cebebc5fbfc6c7 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=c43588786d85… Author: Marco Poletti <poletti.marco(a)gmail.com> Date: Tue Mar 9 13:33:14 2010 +0100 Dense_Row: make iterator and const_iterator Assignable. --- src/Dense_Row.defs.hh | 4 ++-- src/Dense_Row.inlines.hh | 30 +++++++++++++++--------------- 2 files changed, 17 insertions(+), 17 deletions(-) diff --git a/src/Dense_Row.defs.hh b/src/Dense_Row.defs.hh index 23d3054..44decef 100644 --- a/src/Dense_Row.defs.hh +++ b/src/Dense_Row.defs.hh @@ -280,7 +280,7 @@ public: bool OK() const; private: - Dense_Row& row; + Dense_Row* row; dimension_type i; }; @@ -305,7 +305,7 @@ public: bool OK() const; private: - const Dense_Row& row; + const Dense_Row* row; dimension_type i; }; diff --git a/src/Dense_Row.inlines.hh b/src/Dense_Row.inlines.hh index daf8664..7e766d7 100644 --- a/src/Dense_Row.inlines.hh +++ b/src/Dense_Row.inlines.hh @@ -246,25 +246,25 @@ Dense_Row::operator const Row&() const { inline Dense_Row::iterator::iterator(Dense_Row& row1,dimension_type i1) - : row(row1), i(i1) { + : row(&row1), i(i1) { PPL_ASSERT(OK()); } inline Dense_Row::iterator::value_type Dense_Row::iterator::operator*() { - PPL_ASSERT(i < row.size()); - return value_type(i,row[i]); + PPL_ASSERT(i < row->size()); + return value_type(i,(*row)[i]); } inline Dense_Row::iterator::const_type Dense_Row::iterator::operator*() const { - PPL_ASSERT(i < row.size()); - return const_type(i,row[i]); + PPL_ASSERT(i < row->size()); + return const_type(i,(*row)[i]); } inline Dense_Row::iterator& Dense_Row::iterator::operator++() { - PPL_ASSERT(i < row.size()); + PPL_ASSERT(i < row->size()); ++i; PPL_ASSERT(OK()); return *this; @@ -294,7 +294,7 @@ Dense_Row::iterator::operator--(int) { inline bool Dense_Row::iterator::operator==(const iterator& x) const { - return (&row == &(x.row)) && (i == x.i); + return (row == x.row) && (i == x.i); } inline bool @@ -304,31 +304,31 @@ Dense_Row::iterator::operator!=(const iterator& x) const { inline Dense_Row::iterator::operator const_iterator() const { - return const_iterator(row,i); + return const_iterator(*row,i); } inline bool Dense_Row::iterator::OK() const { // i can be equal to row.size() for past-the-end iterators - return (i <= row.size()); + return (i <= row->size()); } inline Dense_Row::const_iterator::const_iterator(const Dense_Row& row1,dimension_type i1) - : row(row1), i(i1) { + : row(&row1), i(i1) { PPL_ASSERT(OK()); } inline Dense_Row::const_iterator::const_type Dense_Row::const_iterator::operator*() const { - PPL_ASSERT(i < row.size()); - return const_type(i,row[i]); + PPL_ASSERT(i < row->size()); + return const_type(i,(*row)[i]); } inline Dense_Row::const_iterator& Dense_Row::const_iterator::operator++() { - PPL_ASSERT(i < row.size()); + PPL_ASSERT(i < row->size()); ++i; PPL_ASSERT(OK()); return *this; @@ -358,7 +358,7 @@ Dense_Row::const_iterator::operator--(int) { inline bool Dense_Row::const_iterator::operator==(const const_iterator& x) const { - return (&row == &(x.row)) && (i == x.i); + return (row == x.row) && (i == x.i); } inline bool @@ -369,7 +369,7 @@ Dense_Row::const_iterator::operator!=(const const_iterator& x) const { inline bool Dense_Row::const_iterator::OK() const { // i can be equal to row.size() for past-the-end iterators - return (i <= row.size()); + return (i <= row->size()); } } // namespace Parma_Polyhedra_Library

1 0

[GIT] ppl/ppl(sparse_matrices): Dense_Row: temporarily add unneeded include to please KDevelop4.
by Marco Poletti 09 Mar '10

09 Mar '10

Module: ppl/ppl Branch: sparse_matrices Commit: 3617741defb167f58a756e2194e21b7fc90cb1be URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=3617741defb1… Author: Marco Poletti <poletti.marco(a)gmail.com> Date: Tue Mar 9 13:31:45 2010 +0100 Dense_Row: temporarily add unneeded include to please KDevelop4. --- src/Dense_Row.inlines.hh | 4 ++++ 1 files changed, 4 insertions(+), 0 deletions(-) diff --git a/src/Dense_Row.inlines.hh b/src/Dense_Row.inlines.hh index f09f680..daf8664 100644 --- a/src/Dense_Row.inlines.hh +++ b/src/Dense_Row.inlines.hh @@ -23,6 +23,10 @@ site: http://www.cs.unipr.it/ppl/ . */ #ifndef PPL_Dense_Row_inlines_hh #define PPL_Dense_Row_inlines_hh 1 +// FIXME: Remove this. +// Added to please KDevelop4. +#include "Dense_Row.defs.hh" + namespace Parma_Polyhedra_Library { inline dimension_type

1 0

[GIT] ppl/ppl(termination): Function renamed. Unwanted stuff removed from comment.
by Roberto Bagnara 09 Mar '10

09 Mar '10

Module: ppl/ppl Branch: termination Commit: df002a70c37365fc661bb7674ba60baf71898ccb URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=df002a70c373… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Tue Mar 9 14:31:09 2010 +0400 Function renamed. Unwanted stuff removed from comment. --- src/termination.cc | 24 +++++++----------------- src/termination.templates.hh | 14 +++++++------- 2 files changed, 14 insertions(+), 24 deletions(-) diff --git a/src/termination.cc b/src/termination.cc index 31b257a..cd1d168 100644 --- a/src/termination.cc +++ b/src/termination.cc @@ -176,13 +176,9 @@ fill_constraint_systems_MS(const Constraint_System& cs, \param cs_out The output constraint system, where variables indices are allocated as follows: - - \f$ \mu_1, \ldots, \mu_n \f$ go onto space dimensions - \f$ 0, \ldots, n-1 \f$; - - \f$ \mu_0\f$ goes onto space dimension \f$ n \f$; - - \f$ y_1, \ldots, y_m \f$ go onto space dimensions - \f$ n+1, \ldots, n+m \f$; - - \f$ z_1, ..., z_m, z_{m+1}, z_{m+2} \f$ go onto space dimensions - \f$ n+m+1, ..., n+2*m+2 \f$. + - \f$ u_3 \f$ goes onto space dimensions \f$ 0, \ldots, s-1 \f$; + - \f$ u_2 \f$ goes onto space dimensions \f$ s, \ldots, s+r-1 \f$; + - \f$ u_1 \f$ goes onto space dimensions \f$ s+r, \ldots, s+2r-1 \f$. The improved Podelski-Rybalchenko method described in the paper is based on a loop encoding of the form @@ -259,18 +255,12 @@ fill_constraint_systems_MS(const Constraint_System& cs, \f$ \vect{u}_3 \in \Qset_-^s \f$. The space of ranking functions is then spanned by \f$ \vect{u}_3^\transpose E_C' \vect x \f$. - - The allocation of variable indices in the output constraint - system \p cs_out is as follows: - - \f$ u_3 \f$ goes onto space dimensions \f$ 0, \ldots, s-1 \f$; - - \f$ u_2 \f$ goes onto space dimensions \f$ s, \ldots, s+r-1 \f$; - - \f$ u_1 \f$ goes onto space dimensions \f$ s+r, \ldots, s+2r-1 \f$. */ void -fill_constraint_systems_PR(const Constraint_System& cs, - const dimension_type n, - const dimension_type m, - Constraint_System& cs_out) { +fill_constraint_system_PR(const Constraint_System& cs, + const dimension_type n, + const dimension_type m, + Constraint_System& cs_out) { // Determine the partitioning of the m rows into the r rows // of E_B and the s rows of E'_C|E_C. std::deque<bool> in_A_B(m, true); diff --git a/src/termination.templates.hh b/src/termination.templates.hh index 84b56c3..0b28c19 100644 --- a/src/termination.templates.hh +++ b/src/termination.templates.hh @@ -119,10 +119,10 @@ fill_constraint_systems_MS(const Constraint_System& cs, Constraint_System& cs_out2); void -fill_constraint_systems_PR(const Constraint_System& cs, - const dimension_type n, - const dimension_type m, - Constraint_System& cs_out); +fill_constraint_system_PR(const Constraint_System& cs, + const dimension_type n, + const dimension_type m, + Constraint_System& cs_out); template <typename PSET> void @@ -344,7 +344,7 @@ termination_test_PR(const PSET& pset) { prepare_input_MS_PR(pset, cs, n, m, "termination_test_PR"); Constraint_System cs_mip; - fill_constraint_systems_PR(cs, n, m, cs_mip); + fill_constraint_system_PR(cs, n, m, cs_mip); MIP_Problem mip = MIP_Problem(cs_mip.space_dimension(), cs_mip); @@ -361,7 +361,7 @@ one_affine_ranking_function_PR(const PSET& pset, Generator& mu) { prepare_input_MS_PR(pset, cs, n, m, "one_affine_ranking_function_PR"); Constraint_System cs_mip; - fill_constraint_systems_PR(cs, n, m, cs_mip); + fill_constraint_system_PR(cs, n, m, cs_mip); MIP_Problem mip = MIP_Problem(cs_mip.space_dimension(), cs_mip); @@ -386,7 +386,7 @@ all_affine_ranking_functions_PR(const PSET& pset, C_Polyhedron& mu_space) { prepare_input_MS_PR(pset, cs, n, m, "all_affine_ranking_functions_PR"); Constraint_System cs_out; - fill_constraint_systems_PR(cs, n, m, cs_out); + fill_constraint_system_PR(cs, n, m, cs_out); mu_space = C_Polyhedron(n+1, EMPTY); }

1 0

[GIT] ppl/ppl(termination): LaTeX code fixed.
by Roberto Bagnara 09 Mar '10

09 Mar '10

Module: ppl/ppl Branch: termination Commit: 8e69262acd5baac8500ac0e81e1e9842d246fdb1 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=8e69262acd5b… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Tue Mar 9 13:43:32 2010 +0400 LaTeX code fixed. --- src/termination.cc | 6 +++--- 1 files changed, 3 insertions(+), 3 deletions(-) diff --git a/src/termination.cc b/src/termination.cc index 40911c5..31b257a 100644 --- a/src/termination.cc +++ b/src/termination.cc @@ -200,9 +200,9 @@ fill_constraint_systems_MS(const Constraint_System& cs, \end{pmatrix}, \f] where - \f$ \mat{A}_B \in \Qset^{r \times n} \f$, - \f$ \mat{A}_C \in \Qset^{s \times n} \f$, - \f$ \mat{A}'_C \in \Qset^{s \times n} \f$, + \f$ A_B \in \Qset^{r \times n} \f$, + \f$ A_C \in \Qset^{s \times n} \f$, + \f$ A'_C \in \Qset^{s \times n} \f$, \f$ \vect{b}_B \in \Qset^r \f$, \f$ \vect{b}_C \in \Qset^s \f$. The corresponding system is:

1 0

[GIT] ppl/ppl(termination): Merge branch 'master' into termination
by Roberto Bagnara 09 Mar '10

09 Mar '10

Module: ppl/ppl Branch: termination Commit: 5d0d81dc0f79d7213fc4c9536be45f057c9a260e URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=5d0d81dc0f79… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Tue Mar 9 13:38:21 2010 +0400 Merge branch 'master' into termination ---

1 0

[GIT] ppl/ppl(termination): Updated.
by Roberto Bagnara 09 Mar '10

09 Mar '10

Module: ppl/ppl Branch: termination Commit: 114f0e38474584e74743f67fd1203487241b60e8 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=114f0e384745… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Tue Mar 9 13:36:12 2010 +0400 Updated. --- doc/devref-language-interface.doxyconf.in | 97 ++++++++++-------- doc/devref.doxyconf-html.in | 155 +++++++++++++++------------- doc/devref.doxyconf-latex.in | 157 +++++++++++++++-------------- doc/user-language-interface.doxyconf.in | 97 ++++++++++-------- doc/user.doxyconf-html.in | 103 ++++++++++--------- doc/user.doxyconf-latex.in | 105 +++++++++++--------- 6 files changed, 384 insertions(+), 330 deletions(-) Diff: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commitdiff;h=114f0e38…

1 0

[GIT] ppl/ppl(termination): Missing files added.
by Roberto Bagnara 09 Mar '10

09 Mar '10

Module: ppl/ppl Branch: termination Commit: f06b3826db776f932cb42a63778ce272baf4c560 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=f06b3826db77… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Tue Mar 9 13:31:49 2010 +0400 Missing files added. --- doc/devref.doxyconf-latex.in | 46 ++++++++++++++++++++++++++++++++++++++++++ 1 files changed, 46 insertions(+), 0 deletions(-) diff --git a/doc/devref.doxyconf-latex.in b/doc/devref.doxyconf-latex.in index 7c24163..7fd2496 100644 --- a/doc/devref.doxyconf-latex.in +++ b/doc/devref.doxyconf-latex.in @@ -314,6 +314,52 @@ INPUT = @srcdir@/definitions.dox \ @srcdir@/../src/Octagonal_Shape.inlines.hh \ @srcdir@/../src/Octagonal_Shape.templates.hh \ @srcdir@/../src/Octagonal_Shape.cc \ + @srcdir@/../src/PIP_Problem.cc \ + @srcdir@/../src/PIP_Problem.defs.hh \ + @srcdir@/../src/PIP_Problem.inlines.hh \ + @srcdir@/../src/PIP_Problem.templates.hh \ + @srcdir@/../src/PIP_Problem.types.hh \ + @srcdir@/../src/PIP_Tree.defs.hh \ + @srcdir@/../src/PIP_Tree.inlines.hh \ + @srcdir@/../src/PIP_Tree.types.hh \ + @srcdir@/../src/Floating_Point_Expression.types.hh \ + @srcdir@/../src/Floating_Point_Expression.defs.hh \ + @srcdir@/../src/Floating_Point_Expression.inlines.hh \ + @srcdir@/../src/Floating_Point_Expression.templates.hh \ + @srcdir@/../src/Cast_Floating_Point_Expression.types.hh \ + @srcdir@/../src/Cast_Floating_Point_Expression.defs.hh \ + @srcdir@/../src/Cast_Floating_Point_Expression.inlines.hh \ + @srcdir@/../src/Cast_Floating_Point_Expression.templates.hh \ + @srcdir@/../src/Constant_Floating_Point_Expression.types.hh \ + @srcdir@/../src/Constant_Floating_Point_Expression.defs.hh \ + @srcdir@/../src/Constant_Floating_Point_Expression.inlines.hh \ + @srcdir@/../src/Difference_Floating_Point_Expression.types.hh \ + @srcdir@/../src/Difference_Floating_Point_Expression.defs.hh \ + @srcdir@/../src/Difference_Floating_Point_Expression.inlines.hh \ + @srcdir@/../src/Difference_Floating_Point_Expression.templates.hh \ + @srcdir@/../src/Division_Floating_Point_Expression.types.hh \ + @srcdir@/../src/Division_Floating_Point_Expression.defs.hh \ + @srcdir@/../src/Division_Floating_Point_Expression.inlines.hh \ + @srcdir@/../src/Division_Floating_Point_Expression.templates.hh \ + @srcdir@/../src/Multiplication_Floating_Point_Expression.types.hh \ + @srcdir@/../src/Multiplication_Floating_Point_Expression.defs.hh \ + @srcdir@/../src/Multiplication_Floating_Point_Expression.inlines.hh \ + @srcdir@/../src/Multiplication_Floating_Point_Expression.templates.hh \ + @srcdir@/../src/Opposite_Floating_Point_Expression.types.hh \ + @srcdir@/../src/Opposite_Floating_Point_Expression.defs.hh \ + @srcdir@/../src/Opposite_Floating_Point_Expression.inlines.hh \ + @srcdir@/../src/Sum_Floating_Point_Expression.types.hh \ + @srcdir@/../src/Sum_Floating_Point_Expression.defs.hh \ + @srcdir@/../src/Sum_Floating_Point_Expression.inlines.hh \ + @srcdir@/../src/Sum_Floating_Point_Expression.templates.hh \ + @srcdir@/../src/Variable_Floating_Point_Expression.types.hh \ + @srcdir@/../src/Variable_Floating_Point_Expression.defs.hh \ + @srcdir@/../src/Variable_Floating_Point_Expression.inlines.hh \ + @srcdir@/../src/Linear_Form.types.hh \ + @srcdir@/../src/Linear_Form.defs.hh \ + @srcdir@/../src/Linear_Form.inlines.hh \ + @srcdir@/../src/Linear_Form.templates.hh \ + @srcdir@/../src/Linear_Form.cc \ @srcdir@/gpl.dox \ @srcdir@/fdl.dox INPUT_ENCODING = UTF-8

1 0