rust

Empowering everyone to build reliable and efficient software. (by rust-lang)

Rust Alternatives

Similar projects and alternatives to rust

NOTE: The number of mentions on this list indicates mentions on common posts plus user suggested alternatives. Hence, a higher number means a better rust alternative or higher similarity.

rust reviews and mentions

Posts with mentions or reviews of rust. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2024-03-13.
  • Algorithms for Modern Hardware
    2 projects | news.ycombinator.com | 13 Mar 2024
    There’s also other reasons. For example, take binary search:

    * prefetch + cmov. These should be part of the STL but languages and compilers struggle to emit the cmov properly (Rust’s been broken for 6 years: https://github.com/rust-lang/rust/issues/53823). Prefetch is an interesting one because while you do optimize the binary search in a micro benchmark, you’re potentially putting extra pressure on the cache with “garbage” data which means it’s a greedy optimization that might hurt surrounding code. Probably should have separate implementations as binary search isn’t necessarily always in the hot path.

    * Eytzinger layout has additional limitations that are often not discussed when pointing out “hey this is faster”. Adding elements is non-trivial since you first have to add + sort (as you would for binary search) and then rebuild a new parallel eytzinger layout from scratch (i.e. you’d have it be an index of pointers rather than the values themselves which adds memory overhead + indirection for the comparisons). You can’t find the “insertion” position for non-existent elements which means it can’t be used for std::lower_bound (i.e. if the element doesn’t exist, you just get None back instead of Err(position where it can be slotted in to maintain order).

    Basically, optimizations can sometimes rely on changing the problem domain so that you can trade off features of the algorithm against the runtime. These kinds of algorithms can be a bad fit for a standard library which aims to be a toolbox of “good enough” algorithms and data structures for problems that appear very very frequently. Or they could be part of the standard library toolkit just under a different name but you also have to balance that against maintenance concerns.

  • Rust: Actix-web and Daily Logging
    3 projects | dev.to | 13 Mar 2024
  • Groovy 🎷 Cheat Sheet - 01 Say "Hello" from Groovy
    7 projects | dev.to | 7 Mar 2024
    But that said, - and again I might be a bit biased - Groovy is too slow for me! I compared it to Rust in this LinkedIn post and it was waaaaay slow. Keep in mind that subjectively comparing programming languages might be a tricky business. But at the end, it will be up to your use case/project to prefer a language over the other.
  • Top Paying Programming Technologies 2024
    19 projects | dev.to | 6 Mar 2024
    13. Rust - $87,012
  • Dada, an Experiement by the Creators of Rust
    9 projects | news.ycombinator.com | 6 Mar 2024
    Yes, actually.

    https://github.com/rust-lang/rust/blob/d0ea1d767925d53b2230e...

    Limited to the rust codebase itself, but I'm sure the developers would force it on everyone else if they thought they could get away with it.

  • 7 Programming Languages Every Cloud Engineer Should Know in 2024!
    4 projects | dev.to | 5 Mar 2024
    Rust is gaining momentum in the cloud computing domain due to its emphasis on safety, speed, and concurrency without a garbage collector. These features make Rust an appealing choice for cloud engineers looking to develop high-performance, secure, and reliable cloud services and infrastructure. Rust's memory safety guarantees and efficient compilation to machine code position it as an ideal language for system-level and embedded applications in cloud environments, where performance and security are paramount.
  • Borrow Checking Without Lifetimes
    4 projects | news.ycombinator.com | 4 Mar 2024
    > I'm not sure what's neutered about Rust's current plans for generators

    They're neutered because they can't suspend and transfer control to a function other than the one that called them ("Note also that "coroutines" here are really "semicoroutines" since they can only yield back to their caller." https://lang-team.rust-lang.org/design_notes/general_corouti...) and you can't pass values into resume and get them out from the yield statement in the coroutine (https://github.com/rust-lang/rust/issues/43122#issuecomment-...).

    > and they aren't separate from async, they're the foundation that async desugars to.

    Yeah I just looked it up again and I don't know why I had it in my head that they were separate, you're correct, they are the same thing under the hood, so honestly that eliminates my biggest problem with them.

    > 'm also not sure what your objection is to Polonius, which, so far, is still just a strictly more permissive version of the borrow checker, with nothing new to learn on the user end.

    The entire model is different under the hood, though, since it switches from lifetimes+borrows to loans, and so in order to fully understand its behavior the user really would have to change their mental model, and as I said above I'm a huge fan of the lifetimes model and less so of the loan model. I just feel like it's much more natural to treat the ownership of a memory object and therefore amount of time in your code that object lives as the fixed point, and borrows as wrong for outliving what they refer to, then to treat borrows as the fixed point, and objects as wrong for going out of scope and being dropped before the borrow ends, because the fundamental memory management model of Rust is single ownership of objects, moves, and scope based RAII via Drop, so the lifetime of an object kind of is the more basic building block of the memory model, with borrows sort of conceptually orbiting around that and naturally being adjusted to fit that, with the checker being a way to force you to adhere to that. The loan based way of thinking would make more sense for an ARC-based language where references actually are more basic because objects really do only live for as long as there are references to them.

    4 projects | news.ycombinator.com | 4 Mar 2024
    > you can't pass values into resume and get them out from the yield statement in the coroutine

    I think that the linked comment is out of date, and that this is supported now (hard to tell because it hasn't been close enough to stabilization to be properly documented): https://github.com/rust-lang/rust/pull/68524

    As for Polonius changing the underlying mental model, I think this is a natural progression. Rust 1.0 tried to present a simple lexical model of borrowing, and then enough people complained that it has long since replaced the simple model with non-lexical lifetimes in order to trade simplicity for "do what I mean". And since it's not allowed to break any old code, if you want to continue treating borrowing like it has the previous model then that shouldn't present any difficulties.

  • Why do we need for an Undefined Behavior Annex to C++
    3 projects | news.ycombinator.com | 1 Mar 2024
    I don't see where those methods are getting called from a Unix signal handler but the code is complex enough that it's easy to miss, especially perusing through github instead of vscode.

    AFAICT those methods are called from `guard::current`. In turn, `guard::current` is used to initialize TLS data when a thread is spawned before a signal is generated (& right after the signal handler is installed): https://github.com/rust-lang/rust/blob/26907374b9478d84d766a...

    It doesn't look like there's any UB behavior being relied upon but I could very easily be misreading. If I missed it, please give me some more pointers cause this should be a github issue if it's the case - calling non async-safe methods from a signal handler typically can result in a deadlock which is no bueno.

    3 projects | news.ycombinator.com | 1 Mar 2024
    On Unix targets, it installs a signal handler for SIGSEGV and checks if the faulting address falls within the range of the stack guards. See https://github.com/rust-lang/rust/blob/411f34b/library/std/s...

    The stack guards would normally be setup by the system runtime (e.g. kernel in the case of the main thread stack, libc for thread stacks), not Rust's runtime. Likewise, stack probes that ensure stack operations don't skip guard pages are usually (always?) emitted by the compiler backend (e.g. GCC, LLVM), not Rust's instrumentation, per se.

    In this sense Rust isn't doing anything different than any other typical C or C++ binary, except hijacking SIGSEGV as Rust does is normally frowned upon, especially when it's merely for aesthetics--i.e. printing a pretty message. Also, attempting to introspect current thread metadata from a signal handler gives me pause. I'm not familiar enough with Rust to down the underlying code. I presume it's using at some POSIX threads interfaces, but POSIX thread interfaces aren't async-signal-safe, and though SIGSEGV is a synchronous signal, that doesn't mean the Rust runtime isn't technically relying on undefined behavior.

  • A note from our sponsor - SaaSHub
    www.saashub.com | 19 Mar 2024
    SaaSHub helps you find the best software and product alternatives Learn more →

Stats

Basic rust repo stats
2672
91,688
10.0
about 6 hours ago

rust-lang/rust is an open source project licensed under GNU General Public License v3.0 or later which is an OSI approved license.

The primary programming language of rust is Rust.

SaaSHub - Software Alternatives and Reviews
SaaSHub helps you find the best software and product alternatives
www.saashub.com