chad-fast/src/Analysis, branch test-parallelAn implementation of CHAD, towards performance
https://git.tomsmeding.com/chad-fast/atom?h=test-parallel2025-06-18T08:09:56ZComplete pattern matches2025-06-18T08:09:56ZTom Smedingtom@tomsmeding.com2025-06-18T08:09:56Zurn:sha1:62639875102decae2bb96b3847ae48db5d1f8fd0Tests pass, should check if output is sensible2025-06-17T22:00:11ZTom Smedingtom@tomsmeding.com2025-06-17T22:00:11Zurn:sha1:d1b2e2c3a3cdaf49ff5e4bae6fe9b0612c3779c2ERecompute2025-05-25T21:35:31ZTom Smedingtom@tomsmeding.com2025-05-25T21:35:31Zurn:sha1:c36849cb6247f957b4e6b093e16d04421c8cea3dReorder TLEither to after TEither2025-04-29T18:38:05ZTom Smedingtom@tomsmeding.com2025-04-29T18:37:06Zurn:sha1:d0eb9a1edfb4233d557d954f46685f25382234d8WIP revamp accumulators again: explicit monoid types2025-04-27T21:34:59ZTom Smedingtom@tomsmeding.com2025-04-27T21:34:59Zurn:sha1:b1664532eaebdf0409ab6d93fc0ba2ef8dfbf372
No more D2 in accumulators! Paving the way for configurable sparsity of
products and arrays. The idea is to make separate monoid types for a
"product cotangent" and an "array cotangent" that can be lowered to
either a sparse monoid or a non-sparse monoid. Downsides of this
approach: lots of API duplication.
idana: Unify in either fallback case2025-04-21T19:58:32ZTom Smedingt.j.smeding@uu.nl2025-04-21T19:58:32Zurn:sha1:9be58cead6402e61a9f642e1410567e789d037caPopulate accumMap2025-04-06T15:07:22ZTom Smedingt.j.smeding@uu.nl2025-04-06T15:07:22Zurn:sha1:0a9e6dfc1accf9dc0254f0c720f633dab6e71f42Pass around an accumMap (but it's empty still)2025-03-28T21:40:41ZTom Smedingtom@tomsmeding.com2025-03-28T21:40:41Zurn:sha1:c06b4bd71a94601d467b509a26c08020d1fbd794Commutativity marker on fold1i2025-03-20T17:32:22ZTom Smedingt.j.smeding@uu.nl2025-03-20T17:32:22Zurn:sha1:d030802dd6d960afa80ac84a5580a46d39c02822Much process with accumulator revamp2025-03-14T22:29:51ZTom Smedingtom@tomsmeding.com2025-03-14T22:29:51Zurn:sha1:fff6beda3523abce3d27037ea2fb020fce31f502