Re:Static search trees: 40x faster than binary search
by barbegal on Tuesday December 31, 2024 @08:15PM
(#42563170)
Neither of those languages gives you portable SIMD. Rust is rapidly becoming the language of choice for high performance code.
[ Parent
| on HN ]
Re:Static search trees: 40x faster than binary search
by npalli on Tuesday December 31, 2024 @08:28PM
(#42563231)
google has a mature C++ library for portable SIMD. The original article seems to be a translation of the excellent algorithmica site which had it in C++.
Re:Static search trees: 40x faster than binary search
by ryao on Tuesday December 31, 2024 @09:13PM
(#42563457)
You can do portable SIMD in GNU C/C++ using the vector extension:
Re:Static search trees: 40x faster than binary search
by swiftcoder on Wednesday January 01, 2025 @04:45AM
(#42565018)
I'm not sure that "portable" and "only works on one specific compiler vendor" are very compatible concepts
Re:Static search trees: 40x faster than binary search
by bigpingo on Wednesday January 01, 2025 @06:46AM
(#42565469)
gcc is available on and targets more platforms than rust.
So if GNU C is not considered portable you can forget about 'portable rust'.
Re:Static search trees: 40x faster than binary search
by swiftcoder on Wednesday January 01, 2025 @10:22AM
(#42566525)
Portability in the C and C++ worlds generally means across standard-conforming compilers, not just across platforms