Module: ppl/ppl Branch: master Commit: 01c5219d84f3b74f297be7a98b373592b9c0f1d4 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=01c5219d84f3b...
Author: Roberto Bagnara bagnara@cs.unipr.it Date: Tue Jul 14 16:07:36 2009 +0200
Todo items reorganized. Removed the one about NOT_EQUAL.
---
TODO | 15 +++++++-------- 1 files changed, 7 insertions(+), 8 deletions(-)
diff --git a/TODO b/TODO index a94f7d4..1a63c8d 100644 --- a/TODO +++ b/TODO @@ -2,14 +2,8 @@ Enhancements for PPL 0.11 =========================
-- Add the domain of circular linear progressions. -- Finish the domain of intervals. - Make all the *affine*image() methods uniform as far as the specification is concerned. -- Check the use or the NOT_EQUAL Relation_Symbol everywhere. -- Intervals are best instantiated with checked numbers with - particular policies: review all the interfaced boxes, - augment the testsuite, and update the documentation.
Commits to consider should we release PPL 0.10.3 @@ -35,6 +29,12 @@ This allows to use a non-installed build of GMP in DIR.) Enhancements for PPL 0.12 or later versions ===========================================
+- Add the domain of circular linear progressions. +- Finish the domain of intervals. +- Intervals are best instantiated with checked numbers with + particular policies: review all the interfaced boxes, + augment the testsuite, and update the documentation. +- Make the library thread-safe. - Modify the Makefile.am's to extend silent mode to our own rules. - Reduce the number of FIXMEs to no more than 20. - Consider switching to MLGMPIDL for the OCaml interface @@ -98,10 +98,9 @@ Enhancements for PPL 0.12 or later versions - Any_Pointset domain: check the interface for lacking or useless methods.
-Enhancements for PPL 0.12 or later versions +Enhancements for PPL 0.13 or later versions ===========================================
-- Make the library thread-safe. - Find a way to let the GMP and checked-int versions of the PPL coexist so as to allow using them in the same application. - Provide methods computing approximations of the integer convex hull