Release Notes: This version fixes a bug with some expressions whose raw DNF can contain terms of the form a&a. It fixes a bug with the negation of a DNF composed only of useless terms, like (a&!a|a&!a).
Release Notes: This version fixes a bug where some expressions containing large negations would fail an assert statement instead of returning the expected null expression. It also fixes a bug where some duplicate terms would not be detected because their factors needed to be sorted and simplified themselves to allow that detection. In addition, g++ 4.7.2 compilation errors were fixed (re: swap() function).
Release Notes: The terms of the resulting DNF are now sorted so that duplicate terms can be eliminated. Compilation errors under g++ 4.4 have been fixed.
Release Notes: Memory leaks have been fixed. A bug with the expression a&!a has been fixed. The source code now compiles as is with g++ 4.3.0.
Release Notes: This is a maintenance release. Example programs are not installed anymore and do not end up in the RPM packages.
Release Notes: The DNF algorithm now detects cases where the resulting expression tree would be too large. The maximum number of tree nodes is set to 10000. The booldnf command now returns EXIT_FAILURE if one of the requested conversions fail.
Release Notes: A bug concerning expressions like !(!(a & m)) was fixed. Quoted variable names are no longer supported to avoid a dependency between the BoolExpr class template and the std::string type.
Release Notes: There is a new 'booldnf' command and an example Perl script that shows how to call it from a bidirectional pipe.
Release Notes: The getTreeVariables() method is now wrapped in the C API. A bug in the C API testing code has been fixed.
Release Notes: The DNF is now automatically simplified to eliminate useless (always false) terms. One can also obtain the roots of the terms of the DNF, and the variables involved in those terms. The example program has been updated to illustrate these functionalities.