bumpalo
rust-phf
bumpalo | rust-phf | |
---|---|---|
17 | 17 | |
1,431 | 1,843 | |
- | 1.5% | |
6.7 | 2.2 | |
2 months ago | 3 months ago | |
Rust | Rust | |
Apache License 2.0 | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
bumpalo
-
Implementing Webpack from Scratch, But in Rust - [2] MVP Version
The Allocator is a memory allocation tool based on bumpalo. It seems that Allocator is commonly used in implementing parsers. You can refer to this tutorial for more information, but for now, we will skip it.
-
Rust vs Zig Benchmarks
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
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
-
A C Programmers take on Rust.
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.)
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
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?
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
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
Probably bumpalo, but then its Box will have a lifetime parameter - bumpalo::boxed::Box<'a, dyn MyTrait>
rust-phf
-
A good day to trie-hard: saving compute 1% at a time
Right. Out of curiosity I looked into what code gperf generates and it seems it would end up O(1) for misses and O(L) for hits, as a potential hit has to be confirmed by essentially a strcmp. Not sure how something like https://github.com/rust-phf/rust-phf would work, but probably similar?
- Rust-PHF generates efficient lookup tables at compile time using phf
-
Railwind 0.1.2 - A Tailwind compiler rewritten in Rust
could you create compile-time maps with https://github.com/rust-phf/rust-phf ? that way you don't pay the performance penalty of reading the ron files at runtime
-
Static reference to generic implementation
However I'm still stuck for the matching between packet and handler. Phf map (static maps) doesn't support mapping to enum so I have to make a matching clause :
-
What's everyone working on this week (4/2023)?
Have you seen the crate phf?
-
Hey Rustaceans! Got a question? Ask here! (37/2022)!
Maybe phf will come handy?
-
const string memory usage question
This is sort of an aside, but turning a not small index into a match statement is probably going to use more memory than the base data and suck for compile time. Might be smarter to include the index as bytes for ex with include! and interpret it directly. You could precompile a hash table with something like rust-phf: https://github.com/rust-phf/rust-phf.
-
How to pass data from build script to binary crate?
A great example of how this is typically done is the phf crate: https://github.com/rust-phf/rust-phf
-
Be still my static heart
https://github.com/rust-phf/rust-phf comes to mind.
-
How does Rust implement matching against strings?
If you’re looking for something like gperf: https://github.com/rust-phf/rust-phf
What are some alternatives?
generational-arena - A safe arena allocator that allows deletion without suffering from the ABA problem by using generational indices.
parallel-hashmap - A family of header-only, very fast and memory-friendly hashmap and btree containers.
hashbrown - Rust port of Google's SwissTable hash map
string-cache - String interning for Rust
feel
sharded - Safe, fast, and obvious concurrent collections in Rust.
ocaml-multicore - Multicore OCaml
patterns - A catalogue of Rust design patterns, anti-patterns and idioms
moonfire-nvr - Moonfire NVR, a security camera network video recorder
rust - Empowering everyone to build reliable and efficient software.
substrate-open-working-groups - The Susbstrate Open Working Groups (SOWG) are community-based mechanisms to develop standards, specifications, implementations, guidelines or general initiatives in regards to the Substrate framework. It could, but not restricted to, lead to new Polkadot Standards Proposals. SOWG is meant as a place to find and track ongoing efforts and enable everybody with similar interests to join and contribute.
matchgen - Generate Rust functions to quickly map byte string prefixes to values