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.