Findafactor

This release turns the use of `std::map` into use of `std::vector` with no downside. Memory footprint should also be lower overall.

**Full Changelog**: https://github.com/vm6502q/FindAFactor/compare/v3.2.3...v3.2.4

sha1sum results:
cf338bf0e02690c3c31726ac5314a5a911708826 FindAFactor-3.2.4-cp310-cp310-manylinux_2_35_x86_64.whl
8e2dc139c875516e0e8a12eb04dfd2a1d4597599 FindAFactor-3.2.4-cp312-cp312-manylinux_2_39_x86_64.whl
7a991b348d9c691a7c7fb8d8c53a125d5a7ad57e FindAFactor-3.2.4-cp312-cp312-win_amd64.whl
6a05005bef0cb4a59fda96b81d2240c0214bfe46 FindAFactor-3.2.4-cp313-cp313-macosx_13_0_x86_64.whl
66659fdb28b69ddba52c096e11aa7c33ed4cf44b FindAFactor-3.2.4-cp313-cp313-macosx_14_0_arm64.whl
423d474b7a139859b795fd598f51b3ebdc2fed02 FindAFactor-3.2.4-cp313-cp313-macosx_15_0_arm64.whl
6bb17233197eb8a1a850741ff8e1339ed2937100 FindAFactor-3.2.4-cp38-cp38-manylinux_2_31_x86_64.whl
a16be9a2bb723f2c64fd09cda9921169de91000a findafactor-3.2.4.tar.gz

By keying the `std::map` of factorization parity vectors to the `size_t` position of the number in an auxiliary `std::vector`, we can avoid redundant work that has already been completed up to the `size_t` index position in the `std::vector`.

**Full Changelog**: https://github.com/vm6502q/FindAFactor/compare/v3.2.2...v3.2.3

sha1sum results:
91c7b0588184574423439046a15c632985befe95 FindAFactor-3.2.3-cp310-cp310-manylinux_2_35_x86_64.whl
b4cf272d860c194fdcf8345244f1972ecd4cf59b FindAFactor-3.2.3-cp312-cp312-manylinux_2_39_x86_64.whl
4d5a40f81279efd75dc4d8947c12a48408899cf3 FindAFactor-3.2.3-cp312-cp312-win_amd64.whl
3c0cdb1282b5eab2bcc45183953f35dd6f341fb3 FindAFactor-3.2.3-cp313-cp313-macosx_13_0_x86_64.whl
d9444b5e1f3962299ffe971d81da5040dbb0ef17 FindAFactor-3.2.3-cp313-cp313-macosx_14_0_arm64.whl
60f53cdeee84270c123432dd2fe998a1f95af3c1 FindAFactor-3.2.3-cp313-cp313-macosx_15_0_arm64.whl
a1726ce4cb843000cbdb4e470be0623fe3da7d04 FindAFactor-3.2.3-cp38-cp38-manylinux_2_31_x86_64.whl
0e58fb867d871f678cc319609c38aeefd12162b1 findafactor-3.2.3.tar.gz

Before Gaussian elimination, `FIndAFactor` creates a matrix that encodes the _parity_ of its prime factorization. Two numbers produce a perfect square if-and-only-if their matrix rows are identical. Hence, Gaussian elimination can be entirely avoided, just searching for row duplicates instead.

**Full Changelog**: https://github.com/vm6502q/FindAFactor/compare/v3.2.1...v3.2.2

sha1sum results:
733d6869065f9e9fc3c0f6d1b6686d7492e08580 FindAFactor-3.2.2-cp310-cp310-manylinux_2_35_x86_64.whl
83f168e4683a4293ed3f402cb9712b70f8366c00 FindAFactor-3.2.2-cp312-cp312-manylinux_2_39_x86_64.whl
6e67811e74b02137b1fc0e11342a99749b5720da FindAFactor-3.2.2-cp312-cp312-win_amd64.whl
75c29dfb89ff4e15899c443d8bef415c063252d5 FindAFactor-3.2.2-cp313-cp313-macosx_13_0_x86_64.whl
3d1f5859c8eae52a00eff136f612b8134d3974a1 FindAFactor-3.2.2-cp313-cp313-macosx_14_0_arm64.whl
162207fc23243dab9d69bd3f2e7bb49b18007a55 FindAFactor-3.2.2-cp313-cp313-macosx_15_0_arm64.whl
0fc5dd8683f29a07ded5e287739522dc10778fde FindAFactor-3.2.2-cp38-cp38-manylinux_2_31_x86_64.whl
569043da98a69d3f69db810d062a8a1b1bdb0b82 findafactor-3.2.2.tar.gz

This release improves the algorithm by eliminating roughly half of loop-stopping conditional overhead in Gaussian elimination.

**Full Changelog**: https://github.com/vm6502q/FindAFactor/compare/v3.2.0...v3.2.1

sha1sum results:
bbea4a83f5103f5548230c579fba1f83c31118ca FindAFactor-3.2.1-cp310-cp310-manylinux_2_35_x86_64.whl
0f05628199842d1f54b7ad6b1eda3b58168d6320 FindAFactor-3.2.1-cp312-cp312-manylinux_2_39_x86_64.whl
81637c6f60122101efd4528bc6cba2da2cfb0a15 FindAFactor-3.2.1-cp312-cp312-win_amd64.whl
06759353aa7457d03bc1dbb5973d58c39be67188 FindAFactor-3.2.1-cp313-cp313-macosx_13_0_x86_64.whl
2c45d831c25569fc81f9b840816401177cb76c5a FindAFactor-3.2.1-cp313-cp313-macosx_14_0_arm64.whl
81613055b07251b71bdce3ecad1a4084e483680e FindAFactor-3.2.1-cp313-cp313-macosx_15_0_arm64.whl
48788e608a8b5289a6de0a87c0269249e22743da FindAFactor-3.2.1-cp38-cp38-manylinux_2_31_x86_64.whl
af0157e32f56bc08d1bec59c2023c29dac7297c9 findafactor-3.2.1.tar.gz

v.3.3.1
The number of factorization parity rows to start checking for duplicates was off-by-one. This has been fixed. (This might make `FindAFactor` a "complete" project. Thanks for bearing with multiple release iterations per day, for a week or two, until this point that the code might be stable indefinitely.)

**Full Changelog**: https://github.com/vm6502q/FindAFactor/compare/v3.3.0...v.3.3.1

sha1sum results:
d830121370c6e0ed8a25b9be345a751c04a76eed FindAFactor-3.3.1-cp310-cp310-manylinux_2_35_x86_64.whl
bb1714e7cea3cca66e80d4e87b3eb27a780e1904 FindAFactor-3.3.1-cp312-cp312-manylinux_2_39_x86_64.whl
44be88f39ad35c1b35316da18aedd4d7087107e4 FindAFactor-3.3.1-cp312-cp312-win_amd64.whl
7c72a75c7e5210c0f9b49f0098882e6022a65139 FindAFactor-3.3.1-cp313-cp313-macosx_13_0_x86_64.whl
152174575d86835781b899260bedc87f61cbaa6a FindAFactor-3.3.1-cp313-cp313-macosx_14_0_arm64.whl
0cda3277f497e831e94a187a06c527828a052303 FindAFactor-3.3.1-cp313-cp313-macosx_15_0_arm64.whl
56887f430d1a9ec30dd61f6c88b4775b204fc1ec FindAFactor-3.3.1-cp38-cp38-manylinux_2_31_x86_64.whl
a688f0e8ef3e5eaceca6219357b4305fe4b21002 findafactor-3.3.1.tar.gz

Empirical tests reveal that 11/7 gear/wheel factorization might be a better default than 11/5.

**Full Changelog**: https://github.com/vm6502q/FindAFactor/compare/v3.1.0...v3.2.0

sha1sum results:
9ed89c0c8d128159826ca5899d20b9c6e80915a5 FindAFactor-3.2.0-cp310-cp310-manylinux_2_35_x86_64.whl
845a31c25b62581489d2ed55d6f22754c78041de FindAFactor-3.2.0-cp312-cp312-manylinux_2_39_x86_64.whl
86263928dcd948aea0b4c7d4751d5de52b201d61 FindAFactor-3.2.0-cp312-cp312-win_amd64.whl
d9833ecd04189884fca8f06f6701f0dcbbb20afa FindAFactor-3.2.0-cp313-cp313-macosx_13_0_x86_64.whl
34bfed343cddcc1a05ffeb56ad3cfac436176899 FindAFactor-3.2.0-cp313-cp313-macosx_14_0_arm64.whl
c5707d0153d06ca6baf15d013479ec0514ae83c8 FindAFactor-3.2.0-cp313-cp313-macosx_15_0_arm64.whl
de46780f5781eae2eb19e8b307d9bfcfb5b362b9 FindAFactor-3.2.0-cp38-cp38-manylinux_2_31_x86_64.whl
18db2ceb584cdf805f1602ea710cdf5d9e8e7d49 findafactor-3.2.0.tar.gz

Gaussian elimination parallelism relies on a lambda that previously reached end-of-control without a `return` statement. This was undefined behavior and has been fixed.

**Full Changelog**: https://github.com/vm6502q/FindAFactor/compare/v.3.0.0...v3.1.0

sha1sum results:
2fb55aceab3a4c7c8576cb5b1354c864b837b420 FindAFactor-3.1.0-cp310-cp310-manylinux_2_35_x86_64.whl
656cb9b9d552540b4b7cbc934ecd09de095ff3e7 FindAFactor-3.1.0-cp312-cp312-manylinux_2_39_x86_64.whl
41116c5ee99a1b74521d11c9368d5f9975a386a9 FindAFactor-3.1.0-cp312-cp312-win_amd64.whl
c7cf0ac78d93a4588f0e9c4385d60911fe1dbf61 FindAFactor-3.1.0-cp313-cp313-macosx_13_0_x86_64.whl
6711f1d151eee54736bcabc7bda16d0650dc1571 FindAFactor-3.1.0-cp313-cp313-macosx_14_0_arm64.whl
3bc34aa8c207fcb1783aabb65103f52faf802d54 FindAFactor-3.1.0-cp313-cp313-macosx_15_0_arm64.whl
1ce3010d56434f33716e7537c2cbd57dcd01068f FindAFactor-3.1.0-cp38-cp38-manylinux_2_31_x86_64.whl
8f20b60bba587800e0a45823fbc536eb535ffe0f findafactor-3.1.0.tar.gz