I previously proposed to switch from alphabetic order of processing of targets to topologically sorted w.r.t. to dependencies. The argument was that it may give some minor performance boost because we will reach a fixed point faster. However, there is another argument, in this case we can incrementally flush errors, because after we fully processed all targets in an SCC there is no way back.
I previously proposed to switch from alphabetic order of processing of targets to topologically sorted w.r.t. to dependencies. The argument was that it may give some minor performance boost because we will reach a fixed point faster. However, there is another argument, in this case we can incrementally flush errors, because after we fully processed all targets in an SCC there is no way back.