rust-lang/rust-clippy

lint long chains of into/float additions/multiplications

Open

#1,243 建立於 2016年9月25日

在 GitHub 查看
 (13 留言) (0 反應) (0 負責人)Rust (10,406 star) (1,391 fork)batch import
A-lintL-perfT-ASTgood first issue

描述

In generall, (a+b+c)+(d+e+f) is faster to compute than a+b+c+d+e+f, because the former reduces data dependencies, allowing the CPU to run additions in parallel. For float arithmetic, the tree-like addition may improve numerical stability. Suggest inserting parenthesis.

貢獻者指南

技術棧
rust
領域
toolingdeveloper experience
議題類型
feature
難度面向新貢獻者的預計實作難度，1 表示很小改動，5 表示專家級工作。
3
預計時間有經驗貢獻者完成調查、實作、測試並準備 pull request 的粗略時間範圍。
1-2 days
活動狀態議題目前的可參與程度：新鮮、活躍、陳舊、阻塞或等待維護者輸入。
stale
清晰度議題是否清楚說明預期改動、驗收標準和下一步。
clear
前置要求
Rust programmingclippy internals
新手友善度1-100 的估計分數，表示該議題對首次貢獻者的友善程度。
20
研究方向
This issue requests a new lint to suggest inserting parentheses in long chains of float additions/multiplications to improve performance and numerical stability. The implementation would require analyzing the AST for binary operation chains in clippy lints/src/. The discussion in the thread includes some ideas but no concrete design. The issue is stale and may need maintainer input to refine scope and acceptance criteria.