A-lintL-perfT-middlegood first issue
Repository metrics
- Stars
- (10,406 stars)
- PR merge metrics
- (平均マージ 19d 22h) (30d で 113 merged PRs)
説明
Based on this HIC++ guideline.
The stack explodes much faster using recursion than a huge BFS work queue would explode the heap. Therefore, if clippy detects some direct or indirect recursion that does not benefit from tail call optimisation, clippy should issue a warning along with a short description about why this is potentially bad and a short hint on how to transform recursive algorithms to iterative ones (e.g. using a work queue and BFS). And maybe a tl;dr about what tail calls are and how to make the algorithm tail recursive.