Re:Static search trees: 40x faster than binary search
by norman784 on Wednesday January 01, 2025 @08:53AM
(#42566017)
I would argue that in some sense it is, just because of the enforced safety and correctness.
[ Parent
| on HN ]
Re:Static search trees: 40x faster than binary search
by peoplefromibiza on Wednesday January 01, 2025 @09:07AM
(#42566094)
So it's Ada since 1980, before C++ was even created.
Re:Static search trees: 40x faster than binary search
by sroussey on Wednesday January 01, 2025 @11:05AM
(#42566850)
I wrote my first optimizing compiler for Ada in C++ around 1990.
Re:Static search trees: 40x faster than binary search
by uecker on Wednesday January 01, 2025 @05:13PM
(#42569760)
It does neither enforce correctness nor safety. It enforces memory safety in programs that stick to the safe subset. But don't get me wrong, Rust certainly has many good ideas and the focus on memory safety is good. I still do not think it is a great language.