记录一次rust浮点数计算没有java速度快的例子

不同的电脑执行如下代码可能会有不同的结果。但是我在同一台机器上的结果,java会比rust快5倍。

java代码:

java 复制代码
public class Test {
    private static final int MAX = 10000000;
    public static void main(String[] args) {
        test(1, 3.141592653589793, 2.718281828459045, "Addition");
        test(2, 3.141592653589793, 2.718281828459045, "Subtraction");
        test(3, 3.141592653589793, 2.718281828459045, "Multiplication");
        test(4, 3.141592653589793, 2.718281828459045, "Division");
    }
    public static void test(int step, double a, double b, String msg) {
        long startTime = System.currentTimeMillis();
        double sum = 0;
        switch (step) {
            case 1 -> {
                for (int i = 0; i < MAX; i++) {
                    sum += a + b;
                }
            }
            case 2 -> {
                for (int i = 0; i < MAX; i++) {
                    sum += a - b;
                }
            }
            case 3 -> {
                for (int i = 0; i < MAX; i++) {
                    sum += a * b;
                }
            }
            case 4 -> {
                for (int i = 0; i < MAX; i++) {
                    sum += a / b;
                }
            }
        }
        long endTime = System.currentTimeMillis();
        System.out.println(msg + " Time taken: " + (endTime - startTime) + "ms result: " + sum);
    }
}

java代码的运行结果

bash 复制代码
Addition Time taken: 15ms result: 5.8598744811975874E7
Subtraction Time taken: 14ms result: 4233108.251312001
Multiplication Time taken: 17ms result: 8.539734223664734E7
Division Time taken: 15ms result: 1.155727349739092E7
rust 复制代码
fn main() {
    _test1(1, 3.141592653589793, 2.718281828459045, "Addition");
    _test1(2, 3.141592653589793, 2.718281828459045, "Subtraction");
    _test1(3, 3.141592653589793, 2.718281828459045, "Multiplication");
    _test1(4, 3.141592653589793, 2.718281828459045, "Division");
}
const MAX: usize = 10000000;
fn _test1(step: u8, a: f64, b: f64, msg: &str) {
    let start = std::time::Instant::now();
    let mut sum = 0.0;
    match step {
        1 => {
            for _ in 0..MAX {
                sum += a + b;
            }
        }
        2 => {
            for _ in 0..MAX {
                sum += a - b;
            }
        }
        3 => {
            for _ in 0..MAX {
                sum += a * b;
            }
        }
        4 => {
            for _ in 0..MAX {
                sum += a / b;
            }
        }
        _ => {
            println!("Invalid step");
        }
    }
    println!("{} Time take: {:?}ms result: {}", msg, start.elapsed().as_millis(), sum);
}
bash 复制代码
Addition Time take: 82ms result: 58598744.811975874
Subtraction Time take: 75ms result: 4233108.251312001
Multiplication Time take: 73ms result: 85397342.23664734
Division Time take: 70ms result: 11557273.49739092
相关推荐
怒放吧德德14 小时前
Netty 4.2 入门指南:从概念到第一个程序
java·后端·netty
雨中飘荡的记忆15 小时前
大流量下库存扣减的数据库瓶颈:Redis分片缓存解决方案
java·redis·后端
心之语歌18 小时前
基于注解+拦截器的API动态路由实现方案
java·后端
华仔啊19 小时前
Stream 代码越写越难看?JDFrame 让 Java 逻辑回归优雅
java·后端
ray_liang19 小时前
用六边形架构与整洁架构对比是伪命题?
java·架构
Ray Liang20 小时前
用六边形架构与整洁架构对比是伪命题?
java·python·c#·架构设计
Java水解21 小时前
Java 中间件:Dubbo 服务降级(Mock 机制)
java·后端
蚂蚁背大象1 天前
Rust 所有权系统是为了解决什么问题
后端·rust
布列瑟农的星空1 天前
前端都能看懂的rust入门教程(五)—— 所有权
rust
SimonKing1 天前
OpenCode AI辅助编程,不一样的编程思路,不写一行代码
java·后端·程序员