summaryrefslogtreecommitdiff
path: root/editors
diff options
context:
space:
mode:
authoradam <adam@pkgsrc.org>2017-07-23 18:39:51 +0000
committeradam <adam@pkgsrc.org>2017-07-23 18:39:51 +0000
commit3ebf79e4ed9acce1eba8f8db41c374893ad028be (patch)
tree1015931a0ee84844b711a2107d4efd86056b4363 /editors
parent4d221351b5bda16ea28a08441d90f4f5e7e4dac4 (diff)
downloadpkgsrc-3ebf79e4ed9acce1eba8f8db41c374893ad028be.tar.gz
Version 1.0.11:
Docs are now generated with pdoc. Merged Pull Request 24, from @czlee: * Change to step 4: When it looks for a uncovered zero, rather than starting at row 0, column 0, it starts where it left off, i.e. at the last uncovered zero it found. Since it doesn't start at (0,0), when it gets to the last column it now loops around to the first, and exits unsuccessfully if it got back to where it started. This change reduces this reduces the solving time for (certain) large matrices. For instance, in tests, solving a matrix of size 394×394 goes from about 2 minutes to about 4 seconds. * Since Python 3 started cracking down on unnatural comparisons, the DISALLOWED constant added in Pull Request 19 no longer works. (It raises a TypeError for unorderable types, as is expected in Python 3.) Since this constant is meant to act like infinity, this modification just changes the two lines where it would otherwise try to make an illegal (in Python 3) comparison between a number and DISALLOWED_OBJ() and gets it to behave as if DISALLOWED is always larger. Added Travis CI integration. Added some unit tests. See tests and tests/README.md.
Diffstat (limited to 'editors')
0 files changed, 0 insertions, 0 deletions