rust-phf
string-cache
| rust-phf | string-cache | |
|---|---|---|
| 15 | 2 | |
| 1,721 | 184 | |
| 0.9% | 0.0% | |
| 4.8 | 4.0 | |
| about 1 month ago | about 2 months ago | |
| Rust | Rust | |
| MIT License | Apache License 2.0 |
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.
rust-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
- Announcing Rust 1.56.0 and Rust 2021
-
Memory efficient hashmap?
Are all the keys known at compile-time? If so https://github.com/rust-phf/rust-phf might be best.
string-cache
-
FlexStr – A flexible, simple to use, immutable, clone-efficient String replacement for Rust. It unifies literals, inlined, and heap allocated strings into a single type.
Servo and html5ever use https://github.com/servo/string-cache for things like DOM element names. Values in a statically-known set are stored as an index, short (up to 7 bytes) values are stored inline, and the rest are heap-allocated, atomically-reference-counted, and de-duplicated (interned) in a global hash map so that PartialEq is a simple 64-bit comparison
-
Optimizing Hashmaps Even More
https://github.com/servo/string-cache/ is a string interning library where an atom (interned string) is represented as a single u64 which is either:
What are some alternatives?
parallel-hashmap - A family of header-only, very fast and memory-friendly hashmap and btree containers.
rust - Empowering everyone to build reliable and efficient software.
bumpalo - A fast bump allocation arena for Rust
flexstr - A flexible, simple to use, immutable, clone-efficient String replacement for Rust
miri - An interpreter for Rust's mid-level intermediate representation
patterns - A catalogue of Rust design patterns, anti-patterns and idioms
sharded - Safe, fast, and obvious concurrent collections in Rust.
rust - Rust for the xtensa architecture. Built in targets for the ESP32 and ESP8266
doubly_linked_list - My attempt at reimplementing some of the rust standard containers, starting with a doubly linked list [Moved to: https://github.com/SKyletoft/containers]
compressed-emoji-shortcodes - A Quest to Find a Highly Compressed Emoji :shortcode: Lookup Function
matchgen - Generate Rust functions to quickly map byte string prefixes to values