dtolnay / serde-untaggedLinks
Serde Visitor for deserializing untagged enums
☆67Updated last week
Alternatives and similar repositories for serde-untagged
Users that are interested in serde-untagged are comparing it to the libraries listed below
Sorting:
- Queue futures to run concurrently, in the order they're spawned, and with global and group limits.☆66Updated last week
- Static analysis tool for Rust library authors to set and verify which types from other libraries are allowed to be exposed in their publi…☆65Updated last month
- ☆76Updated 3 weeks ago
- Reports when tokio runtime threads are blocking☆66Updated last year
- Serde serializer for generating Starlark build targets☆69Updated last week
- Cargo subcommand for proper use of -Z minimal-versions and -Z direct-minimal-versions.☆65Updated last month
- Fast Function Dispatch: Improving the performance of Rust's dynamic function calls☆33Updated last year
- Mirror of Rust's allocator api for use on stable rust☆69Updated 2 months ago
- Graceful shutdown util for Rust projects using the Tokio Async runtime.☆143Updated last year
- ☆76Updated 3 months ago
- Parse JSON file at compile time and embed as serde_json::Value☆32Updated last week
- Attribute proc-macro to simplify deriving standard and other traits with custom generic type bounds.☆87Updated this week
- Find out about keys that are ignored when deserializing data☆95Updated last week
- Fast `cargo install` action using a GitHub-based binary cache and attestations☆79Updated last week
- Lending iterators on stable Rust☆83Updated last year
- Minimalist Rust syntax parsing for procedural macros☆66Updated last year
- Compile-time checks that an enum or match is written in sorted order☆119Updated last week
- Rust library that provides helpers for testing resilience of I/O operations.☆33Updated 2 years ago
- Take a value atomically once.☆30Updated 2 years ago
- Linked Atomic Random Insert Vector: a thread-safe, self-memory-managed vector with no guaranteed sequential insert.☆58Updated 2 years ago
- A simple in-memory search for collections and key-value stores.☆80Updated 6 months ago
- A futures abstraction that runs a set of futures which may complete in any order.☆91Updated last month
- Imitate the documentation build that docs.rs would do☆62Updated last week
- An unordered multiset/bag implementation backed by HashMap☆74Updated 2 weeks ago
- Helper macros: autoimpl, impl_scope☆68Updated 2 months ago
- ☆53Updated last week
- Alternative future adapters that provide cancel safety.☆76Updated this week
- Memory validation framework for Rust☆70Updated 2 months ago
- futures-buffered☆45Updated 4 months ago
- Rust traits for key comparison in maps.☆34Updated 9 months ago