rphmeier / allocators
A collection of custom allocators
☆44Updated 7 years ago
Alternatives and similar repositories for allocators:
Users that are interested in allocators are comparing it to the libraries listed below
- A growable bit-vector for Rust, optimized for size☆40Updated last month
- An owned, grow-able UTF-8 string that stores small strings inline and avoids heap-allocation.☆68Updated 3 years ago
- ☆31Updated 5 years ago
- Dynamically query a type-erased object for any trait implementation☆65Updated 2 years ago
- Target "triple" support☆50Updated last month
- (More or less) accurate floating point algorithms☆57Updated 8 months ago
- Portable high-level bitwise manipulation algorithms☆50Updated 3 years ago
- ☆52Updated 5 years ago
- Arena allocator and a handful of useful data structures☆40Updated 5 years ago
- ☆61Updated 7 years ago
- Token tree calling convention☆79Updated 2 years ago
- Synchronization primitives for lazy and one-time initialization (no_std compatible).☆33Updated last year
- Modular register allocator algorithms☆106Updated 2 years ago
- A perf script for helping to answer queries about how much time a given function occupies, where it is called from, and so forth.☆38Updated 6 years ago
- Unsafe marker trait for types that deref to a stable address☆31Updated last year
- A rust implementation of the va_list type from `stdarg.h`☆20Updated 6 months ago
- x86_64 OS kernel with completely async userspace and single address space [WIP; but basic kernel functionality implemented]☆31Updated 4 years ago
- Tutorial and demo of rust compiler replacement tooling☆56Updated 4 years ago
- A symbolic evaluator for MIR☆19Updated 5 years ago
- ☆23Updated 5 years ago
- Data structures like Rust `alloc` which reuse user allocated memory☆54Updated 6 months ago
- Machine scalar casting that meets your expectations☆74Updated 3 years ago
- A safe-guarded transmute for Rust☆38Updated 10 months ago
- The peano numbers implemented in Rust's type system.☆24Updated 8 years ago
- Sound unchecked indexing using “generativity”; a type system approach to indices, pointers and ranges that are trusted to be in bounds.