-
Notifications
You must be signed in to change notification settings - Fork 7
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #25 from Halbaroth/release-0.5.1
Changes for release v0.5.1
- Loading branch information
Showing
1 changed file
with
25 additions
and
40 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,61 +1,46 @@ | ||
(!!! = may break code that uses previous versions) | ||
## unreleased | ||
|
||
version 0.5, November 15, 2022 | ||
=============================== | ||
## v0.5.1 (2024-03-28) | ||
* Add documentation for solving system (PR #16). | ||
* Separate types for coefficents and values (PR #17). | ||
* Remove the dependency on `num` (PR #19). | ||
* Remove messages at the `App` level (PR #22). | ||
|
||
## 0.4.1 (2023-04-21) | ||
* Fix the issue 13 about strict formats (PR #18). | ||
|
||
## 0.5 (2022-11-15) | ||
* Reworking the library build system, now only relying on dune. | ||
The Makefile is now clearer and simpler to use. | ||
|
||
* (!!!) Logs are handled by the `logs` library and debug is activated by this | ||
* Logs are handled by the `logs` library and debug is activated by this | ||
library. | ||
|
||
* (!!!) The `Rat2` module now abstract bounds as strict upper, strict lower or | ||
* The `Rat2` module now abstract bounds as strict upper, strict lower or | ||
soft bounds instead of pairs of rationals. | ||
|
||
version 0.4, August 22, 2017 | ||
=============================== | ||
|
||
* (!!!) Now, asserting bounds returns whether these bounds are | ||
## 0.4 (2017-08-22) | ||
* Now, asserting bounds returns whether these bounds are | ||
trivially implied by those that are already known | ||
|
||
* add a field nb_pivots in the environment to count the number of | ||
* Add a field nb_pivots in the environment to count the number of | ||
pivots that have been made so far. | ||
|
||
verion 0.3, November 09, 2016 | ||
=============================== | ||
## 0.3 (2016-11-09) | ||
* Bugfix in maximization | ||
|
||
* bugfix in maximization | ||
|
||
|
||
verion 0.2, August 24, 2016 | ||
=============================== | ||
|
||
* add support for linear optimization (!!!). An minimal example is given | ||
## 0.2 (2016-08-24) | ||
* Add support for linear optimization (!!!). An minimal example is given | ||
in tests/standalone_minimal_maximization.ml | ||
* Some bugfixes when assuming inconsistent bounds | ||
* Improve build and testing | ||
|
||
* some bugfixes when assuming inconsistent bounds | ||
|
||
* improve build and testing | ||
|
||
|
||
|
||
first public 0.1, July 11, 2016 | ||
=============================== | ||
|
||
## 0.1 (2016-07-11) | ||
* A functor called `Basic` provides three modules: | ||
|
||
- `Core`: provides some basic functions, and a function `empty` to | ||
create an empty environment | ||
|
||
- `Assert`: exports two functions `var` and `polys` to assert bounds | ||
on variables and polynomials, respectively | ||
|
||
- `Solve`: exports a function `solve` that tries to find a solution for | ||
the constrains | ||
|
||
* two flags can be set when creating an empty environment to activate | ||
* Two flags can be set when creating an empty environment to activate | ||
debug mode and some invariants verification | ||
|
||
* implementation is fully functional, incremental and backtrackable | ||
|
||
* linear optimization is not supported yet | ||
* Implementation is fully functional, incremental and backtrackable | ||
* Linear optimization is not supported yet |