Make Data.Partition.isRefinement faster
Joshua Moerman has a faster version of isRefinement
, namely one which is quasilinear, whereas copar's implementation Data.Partition.isRefinement
is quadratic. Here's Joshua's implementation:
https://git.cs.ou.nl/joshua.moerman/mealy-decompose/-/blob/main/src/Partition.hs?ref_type=heads#L33
For Joshua's example, the speedup was a factor of 40x.