News for hackers. Stuff that matters.
Re:Static search trees: 40x faster than binary search by MobiusHorizons on Wednesday January 01, 2025 @09:56PM (#42571180)
One of the reasons to reach for a low level language is to have control over tradeoffs specific to your use case instead of using some pre-packaged option. Data structures are a very good example. Generic data structures like those in the standard library will likely suffice for many use cases, but a low level language must give the user the control to write their own. It’s just table stakes for this type of language.
Re:Static search trees: 40x faster than binary search by rcxdude on Thursday January 02, 2025 @04:19AM (#42572954)
Thankfully, rust does give you that level of control, you can write your own doubly-linked list implementation if you want, and you can pick your safety-overhead tradeoff.