rkyv
rust-phf
rkyv | rust-phf | |
---|---|---|
13 | 15 | |
2,572 | 1,721 | |
1.6% | 1.2% | |
8.9 | 4.8 | |
10 days ago | about 1 month ago | |
Rust | Rust | |
MIT License | 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.
rkyv
-
Müsli - An experimental binary serialization framework with more choice
And before you ask: This only provides partial zero-copy support in strings and byte arrays like serde. But it's not like rkyv which constructs validated references into the data.
-
A new major version of jql has been released
Regarding JSON, what kind of other implementation do you have in mind? I've seen e.g. `rkyv` which looks really neat (https://github.com/rkyv/rkyv/issues/85). So far `serde_json` is providing a clean surface API but maybe there's best solution?
-
My negative views on Rust
Thank you for your concern. I've done plenty of projects that go beyond a "Hello World" such as a GPU accelerated password cracker. I am starting soon a C++/Rust job. I already contributed to codebases I didn't write.
-
Hey Rustaceans! Got a question? Ask here! (37/2022)!
rkyv is awesome because it supports full zero-copy deserialization. You can serialize your HashMap to a file. Later you can directly use the HashMap from the file without creating and populating a new HashMap in memory (rkyv directly indexes into the raw bytes). For even faster access times you can even mmap the file.
-
Bizarre memory leak caused by tokio runtime
I had the same problem when trying to deserialize a big struct with rkyv: see rkyv#277.
-
Advice for the next dozen Rust GUIs
Any chance of working with zero-copy deserialization frameworks? like https://github.com/rkyv/rkyv or capnproto
-
Pijul 1.0 Beta
Hi, you seem to know a bit about Sanakirja!
It stores 4kb blobs, right? Does Pijul first parses the data (copying it to other allocations), or uses the data as is? I mean, there are some libraries like cap'n'proto[0] and rkyv[1] that can directly use the file contents as an in-memory data structure, I was wondering if Pijul did anything like that.
I mean, is this btree page [2] stored exactly like this on disk, and does Pijul exploits that to avoid further copying data?
(I guess there's a trouble with compression there: to decompress you really need to write in another buffer)
Also, is the I/O done with something that prevent userspace copies like mmap or io_uring, or does it eventually calls read() to copy the data to its own buffer?
I want to build something like Sanakirja, but with those features, so I'm wondering if there's any overlap.
[0] https://github.com/capnproto/capnproto-rust
[1] https://github.com/rkyv/rkyv
[2] https://docs.rs/sanakirja-core/latest/sanakirja_core/btree/p...
-
Is there a library like Serde but which makes it easy to mutate serialized data stored in a [u8] or Vec<u8>?
I think https://github.com/rkyv/rkyv does this. Also capnproto like was mentioned here, and perhaps https://docs.rs/zerocopy/0.6.1/zerocopy/index.html too
-
rkyv 0.7: Endian-agnostic types, `no_std` validation, performance improvements, github sponsors and more!
It's been two months since the last major rkyv release, and three months since the last major feature release. After all that time, I'm proud to announce that rkyv 0.7 is finally out!
-
rkyv 0.5: Comparison derives, serialize bounds, and the future
After roughly two months of work, rkyv 0.5 is finally out!
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?
rust-serialization-benchmarks
parallel-hashmap - A family of header-only, very fast and memory-friendly hashmap and btree containers.
NoProto - Flexible, Fast & Compact Serialization with RPC
bumpalo - A fast bump allocation arena for Rust
capnproto-rust - Cap'n Proto for Rust
string-cache - String interning for Rust
zero-copy-pads - Padding/aligning values without heap allocation
rust - Empowering everyone to build reliable and efficient software.
jj - A Git-compatible VCS that is both simple and powerful
patterns - A catalogue of Rust design patterns, anti-patterns and idioms
tree-buf - An experimental serialization system written in Rust
sharded - Safe, fast, and obvious concurrent collections in Rust.