Algorithm-QuineMcCluskey
view release on metacpan or search on metacpan
- Consequently, removed attributes and methods that are
now in Logic::Minimizer, and are provided automatically.
- Use L::M's catch_errors() for attribute validation.
- Update Build.PL with Logic::Minimizer requirement.
- And updated the version number everywhere.
0.19
2019-07-31
- There was more processing than needed in least_covered() to do
what was basically a find-the-minimum loop, plus it was
throwing away information that had to be re-created by the
next line of code.
Consolidated all of that, resulting in fewer hash-of-array
manipulations, and changed the return value from the single
term to the term plus its covers.
This won't result in a significant speed increase, as most
terms are already eliminated by the time we reach this code,
but it does simplify it and make it more readable.
- A side-effect of the above is that countels() is no longer
needed, and was removed.
- Also, while I was doing A-B comparisons, the new version of the
( run in 0.400 second using v1.01-cache-2.11-cpan-496ff517765 )