diff options
author | JSDurand <mmemmew@gmail.com> | 2023-01-28 10:17:24 +0800 |
---|---|---|
committer | JSDurand <mmemmew@gmail.com> | 2023-01-28 10:22:57 +0800 |
commit | f28155105134b90fd86049c65478d307e0d8dbbc (patch) | |
tree | 72b3b4872d5dba89413eca70bcaae9e421def7ee /ChangeLog | |
parent | e8ea01319b3a9032a3f4f69f65e9ca96562b87b9 (diff) |
a prototype of an item derivation forest
It seems to be complete now, but still awaits more tests to see where
the errors are, which should be plenty, haha.
Diffstat (limited to 'ChangeLog')
-rw-r--r-- | ChangeLog | 19 |
1 files changed, 19 insertions, 0 deletions
@@ -1,3 +1,22 @@ +2023-01-28 Jean Sévère Durand <durand@jsdurand.xyz> + + * chain: Move the forest crate to the item module in the chain + crate. That crate used to provide a kind of forests. This turns + out to be an item derivation forest for the chain-rule machine. + So it seems appropriate to implement this in the chain crate + instead. + + * chain: Also the chain rule machine seems to be complete now. It + remains to test the machine to find the must-be errors. + + * graph: Now the doubly linked graphs do not exclude nodes with + duplicate edge sets. That is, previously, when adding a node + whose children set is equal to that of another existing node, the + graph just reuses that old node. Now this is not the case + anymore. The reason is that this only saves some minor memory + usage, at the cost of more expensive graph operations, and might + affect the time complixity, so I just remove this functionality. + 2023-01-22 Jean Sévère Durand <durand@jsdurand.xyz> * forest: Correctly clone nodes. |