Created attachment 570128 [details] [diff] [review] handle hairy cycles If we have the set of moves: a -> b b -> a b -> c depending on the ordering of the moves, we can emit b -> temp a -> b b -> c temp -> a which is wrong; we end up with the original value of a in c rather than the original value of b. This happens by first choosing |b -> a|, then choosing |a->b|, since it conflicts, and in fact forms a cycle, and since it forms a cycle, we short circuit and immediately emit the |a->b| part of the cycle, then resolving the rest of the checks, never seeing if anything conflicts with |a->b|. The patch removes this short circuiting. Ideally, we won't use the temp at all, and just use the copied value of b, however that will require more thorough algorithmic changes.
Patch is empty - wrong file?
Created attachment 570435 [details] [diff] [review] Handle hairy cycles (for real)