ginst
rust-phf
| ginst | rust-phf | |
|---|---|---|
| 4 | 15 | |
| 9 | 1,721 | |
| - | 1.2% | |
| 10.0 | 4.8 | |
| 11 months ago | about 1 month ago | |
| Rust | Rust | |
| GNU General Public License v3.0 only | 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.
ginst
- ginst - Never re-search for installation instructions on GNU/Linux again
-
What's everyone working on this week (4/2023)?
Currently making an installer tool. I was pretty tired of writing a bash script for installing my most needed Linux applications for all the different distros so i thought of something more scalable.
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.
What are some alternatives?
rusqttbom - RusQTTbom takes weather data from the Bureau of Meteorology (BOM) and publishes that data via MQTT messages.
parallel-hashmap - A family of header-only, very fast and memory-friendly hashmap and btree containers.
htmlize - Rust crate to encode and decode HTML entities in UTF-8 according to the standard
bumpalo - A fast bump allocation arena for Rust
evolution - A self contained evolutionary ecosystem written in Rust, with Neural Nets and Genetic Evolution
string-cache - String interning for Rust
gmp-wasm - Fork of the GNU Multiple Precision Arithmetic Library (GMP), suitable for compilation into WebAssembly.
rust - Empowering everyone to build reliable and efficient software.
walker - A link walker that recursively checks for broken links in a website.
patterns - A catalogue of Rust design patterns, anti-patterns and idioms
matchgen - Generate Rust functions to quickly map byte string prefixes to values
sharded - Safe, fast, and obvious concurrent collections in Rust.