graphprotocol / graphprotocol/graph-node
Refactor subgraph runner
Nobody has claimed this yet.
- Dominant language
- Rust
- Stars
- 3.2k
- Forks
- 1.1k
- Avg merge
- 4d 1h
- Merged PRs (30d)
- 1
Description
Subgraph runner has some code duplication and a lot of if-else-ish code. We should try to improve it by making some concerns more isolated and the error more testable.
This is probably going to require several iterations on different parts but the sooner we start the sooner we finish.
As @lutter pointed out, this last PR added some more code duplication which doesn't help https://github.com/graphprotocol/graph-node/pull/4916#issuecomment-1839289761
Contributor 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.
Research direction
Start by locating the subgraph runner and reviewing the duplication discussed in PR #4916 and its linked comment. Identify the separate concerns and error paths before deciding on the refactor shape; done means the duplication and if-else-heavy logic are reduced and the error behavior is covered by tests.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- rust
- Domain
- backend
- Issue type
- Refactor
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100