willcrichton / indexicalLinks
Human-friendly indexed collections
☆56Updated 2 months ago
Alternatives and similar repositories for indexical
Users that are interested in indexical are comparing it to the libraries listed below
Sorting:
- Experimenting with Rust's fundamental data model☆56Updated 2 months ago
- Fast Function Dispatch: Improving the performance of Rust's dynamic function calls☆36Updated last year
- Alternative future adapters that provide cancel safety.☆79Updated 3 weeks ago
- Serde Visitor for deserializing untagged enums☆68Updated last week
- Memory validation framework for Rust☆74Updated 3 months ago
- A low-level I/O ownership and borrowing library☆106Updated 4 months ago
- ☆35Updated 11 months ago
- ☆64Updated 4 months ago
- A Rust library for runtime-checked linearish types☆36Updated 2 years ago
- Static analysis tool for Rust library authors to set and verify which types from other libraries are allowed to be exposed in their publi…☆66Updated 2 weeks ago
- An object system for Rust based on relative pointers☆38Updated 3 years ago
- Unbuffered and unlocked I/O streams☆45Updated 9 months ago
- Helps you frob those bits☆41Updated last year
- ☆24Updated 2 years ago
- Choose Rust types at compile-time via constants☆70Updated last year
- Nudging the compiler to auto-vectorize things☆75Updated 2 years ago
- Minimalist Rust syntax parsing for procedural macros☆66Updated last year
- A primitive for writing structural search and replace programs for rust☆31Updated 3 months ago
- Queue futures to run concurrently, in the order they're spawned, and with global and group limits.☆67Updated this week
- A concise, self-describing binary format written in Rust for Serde☆67Updated last year
- a reference-counting cycle collection library in rust☆77Updated 2 years ago
- A generic, fixed-size, associative cache☆40Updated last year
- structured parallel execution for async Rust☆37Updated last year
- Lending iterators on stable Rust☆83Updated last year
- ☆76Updated last month
- Faster integer division and modulus operations☆87Updated 6 months ago
- An unordered multiset/bag implementation backed by HashMap☆75Updated last month
- SIMD-optimized B+ Tree implementation that uses integer keys☆77Updated 5 months ago
- Linked Atomic Random Insert Vector: a thread-safe, self-memory-managed vector with no guaranteed sequential insert.☆58Updated 2 years ago
- A memory efficient syntax tree for language developers☆63Updated 4 months ago