Incremental flushing of messages in fine grained incremental mode

Open

#4,911 opened on Apr 14, 2018 2 comments 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

Assessment

Difficulty: 5/5
Estimated time: Over a week
Newbie friendliness: 25/100

Issue type: Feature
Clarity: Needs clarification
Activity status: Stale
Tech stack: python
Domain: compilers

Research direction

The issue discusses topologically sorting targets by dependency in fine-grained incremental mode and incrementally flushing errors after processing strongly connected components. No files, tests, or entry points are named, so start by locating the fine-grained incremental processing implementation. The issue does not define a concrete completion test or exact expected behavior.

Written by the indexing model from the issue text.

Description

feature needs discussion priority-2-low topic-fine-grained-incremental

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.

Dominant language: Python
Stars: 20.6k
Forks: 3.3k
Avg merge: 1d 18h
Merged PRs (30d): 54

Contributor guide

Open the contributing guide

First steps

Read the whole issue, then the project's contributing guide.
Comment on the issue to say you are picking it up — it saves two people doing the same work.
Fork the repository and make your change on a branch.
Open a pull request that references the issue number.