bumpalo

A fast bump allocation arena for Rust (by fitzgen)

Bumpalo Alternatives

Similar projects and alternatives to bumpalo

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

bumpalo reviews and mentions

Posts with mentions or reviews of bumpalo. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2023-06-17.
  • Rust vs Zig Benchmarks
    6 projects | news.ycombinator.com | 17 Jun 2023
    Long story short, heap allocation is painfully slow. Any sort of malloc will always be slower than a custom pool or a bump allocator, because it has a lot more context to deal with.

    Rust makes it especially hard to use custom allocators, see bumpalo for example [0]. To be fair, progress is being made in this area [1].

    Theoretically one can use a "handle table" as a replacement for pools, you can find relevant discussion at [2].

    [0] https://github.com/fitzgen/bumpalo

  • Rust Memory Management
    1 project | /r/rust | 4 Jun 2023
    There are ways to accomplish this as well. Different allocator libraries exist for this kind of scenario, namely bumpallo which allocates a larger block of memory from the kernel, and allocates quickly thereafter. That would amortize the cost of memory allocations in the way I think you're after?
  • Custom allocators in Rust
    4 projects | /r/rust | 6 Apr 2023
  • A C Programmers take on Rust.
    6 projects | /r/rust | 9 Sep 2022
    Meaning, storing a lot of things in the same block of allocated memory? Vec is a thing, you know. There's also a bump allocator library.
  • Hypothetical scenario - What would be better - C, C++ or Rust? (Read desc.)
    1 project | /r/cpp | 1 Aug 2022
    There are data structures like slotmap, and relatively low-level crates like bumpalo. This is not to say that either fits your use case, just that you definitely have access to the necessary parts to fit what you describe.
  • Implementing "Drop" manually to show progress
    1 project | /r/rust | 4 May 2022
    Sometimes you can put everything in a bump allocator, then when you're done, free the entire bump allocator in one go. https://docs.rs/bumpalo/
  • Any languages doing anything interesting with allocators?
    4 projects | /r/ProgrammingLanguages | 23 Feb 2022
    This is useful with crates like bumpalo which give you bump-allocation arenas whose lifetimes are tied to the objects they allocate.
  • I’m Porting the TypeScript Type Checker Tsc to Go
    8 projects | news.ycombinator.com | 25 Jan 2022
    TSC doesn't need to "stick around", right? Just a run-once and the program is over?

    In those cases, https://github.com/fitzgen/bumpalo works amazingly as an arena. You can pretty much forget about reference counting and have direct references everywhere in your graph. The disadvantage is that it's hard to modify your tree without leaving memory around.

    We use it extensively in http://github.com/dioxusLabs/dioxus and don't need to worry about Rc anywhere in the graph/diffing code.

  • Allocating many Boxes at once
    2 projects | /r/rust | 12 Jan 2022
    Probably bumpalo, but then its Box will have a lifetime parameter - bumpalo::boxed::Box<'a, dyn MyTrait>
  • Graydon Hoare: What's next for language design? (2017)
    4 projects | news.ycombinator.com | 21 Nov 2021
    Strictly speaking, Rust doesn't need this as a built-in language feature, because its design allows it to be implemented as a third-party library: https://docs.rs/bumpalo

    The biggest problem is that there's some awkwardness around RAII; I'm not sure whether that could have been avoided with a different approach.

    Of course, ideally you'd want it to be compatible with the standard-library APIs that allocate. This is implemented, but is not yet at the point where they're sure they won't want to make backwards-incompatible changes to it, so you can only use it on nightly. https://doc.rust-lang.org/stable/std/alloc/trait.Allocator.h...

    Or are you suggesting that the choice of allocator should be dynamically scoped, so that allocations that occur while the bump allocator is alive automatically use it even if they're in code that doesn't know about it? I think it's not possible for that to be memory-safe; all allocations using the bump allocator need to know about its lifetime, so that they can be sure not to outlive it, which would cause use-after-free bugs. I'm assuming that Odin just makes the programmer responsible for this, and if they get it wrong then memory corruption might occur; for a memory-safe language like Rust, that's not acceptable.

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

Stats

Basic bumpalo repo stats
16
1,295
7.5
11 days ago

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