56 Commits (62ad5cecf9c2279bf109160068a0c729d0e682e8)

Author	SHA1	Message	Date
Wilfred Hughes	c957818514	Explore two graph nodes for each parenthesis position ... This produces substantially better diff results, and fixes the 'last item in the list shown as changed' problem. This can produce slower diffing. typing_before.ml takes 10% more instructions and slow_before.rs takes 110% more instructions.	2022-08-21 16:34:17 +07:00
Wilfred Hughes	a71d6118cf	Store predecessors and neighbours as mutable fields in graph nodes ... This is a more traditional graph representation. It is slightly easier to reason about, and it's clearer that graph node creation time dominates graphs exploration. This is a slight performance regression, but it enables better exploration of parethesis nesting (see next commit). typing_before.ml has regressed from 3.75B instructions to 3.85B instructions and slow_before.rs has regressed from 1.73B instructions to 2.15B instructions. This change has also made the diff output for slow_before.rs slightly worse (note the `lhs` variable is now claimed as changed in more cases). It's not clear why, but presumably means that the node visit order has changed slightly. Closes #324	2022-08-21 16:25:54 +07:00
Wilfred Hughes	51ddcef393	Make clippy happier	2022-07-03 11:20:44 +07:00
Wilfred Hughes	d4285bed7c	Move more files into diff/	2022-05-25 09:31:12 +07:00
Wilfred Hughes	c5fe152f25	Define a parse submodule	2022-05-25 09:28:12 +07:00
Wilfred Hughes	373d7d9d81	Define a diff submodule	2022-05-24 09:33:47 +07:00