Changelog - Kero76/logisticae GitHub Wiki
Table of Release
- V0.4.0 - Documentae update
- V0.3.0 - Stringae update
- V0.2.0 - Physicae update
- V0.1.0 - Mathematicae update
V0.5.0 - Unnamed update
Currently in development
Features
- [Mathematics] - Implementation of the Fibonacci Number
- [Mathematics] - Implementation of a method to check if a number is a Cyclop Number
V0.4.0 - Documentae update
Release on January 11, 2020
Features
- [Physics] - Add degree converter to convert Celsius, Fahrenheit or Kelvin into another one.
- [Mathematics] - Implementation of Lucas-Lehmer algorithm.
- [Mathematics] - Implementation of isPrimeNumber method.
- [Mathematics] - Implementation of the line slope computation.
Developer's features
- [Refactor] - Add ESLint to check code formatting.
- [Refactor] - Add Prettier to format source code.
- [Test] - Add code coverage for unit tests.
- [NPM] - Add
npm run build
to build source,npm run docs
to generate the API documentation,npm run lint
to execute the linter on source code andnpm run coverage
to execute code coverage.<>
Community features
- Add the Code of Conduct file for the project
- Add CONTRIBUTING.md for people who would contribute to the project Logisticae
- Add default template for issues and pull requests
V0.3.0 - Stringae update
Release on December 23, 2019
Features
- Implementation of an algorithm to reverse a text.
- Implementation of an algorithm to check if a text is a palindrome.
V0.2.0 - Physicae update
Release on December 21, 2019
Features
- Implementation of a simple converter to convert distance, liter or weight unit into another one.
- Implementation of the Ohm's law.
V0.1.0 - Mathematicae update
Release on December 18, 2019
Features
- Initial configuration project.
- Add the following mathematics algorithms :
- Pythagorean Theorem and his converse.
- Intercept Theorem also known as Thales's Theorem and his converse.
- Euclidean algorithm to compute the Greatest Common Divisor between 2 numbers.
- LCM algorithm to compute the Least Common Multiple between 2 numbers.