EnumMap for Rust.
-
Updated
May 26, 2024 - Rust
A data structure is a particular way storing and organizing data in a computer for efficient access and modification. Data structures are designed for a specific purpose. Examples include arrays, linked lists, and classes.
EnumMap for Rust.
All Algorithms implemented in Rust
DSA Practice - leetcode
📈 The fastest (for very small maps!) alternative of Rust HashMap, which doesn't use hashing and doesn't use heap
Rust `Vec<T>` wrapper that gurantees to contain at least 1 element
Tools for concurrent programming in Rust
A priority queue for Rust with efficient change function.
The IRCA is an indicator that evaluates the quality of water for human consumption based on the results of physicochemical and microbiological characteristics.
Fast polygon mesh library with different data structures and traits to abstract over those.
Fast, efficient, and robust memory reclamation for Rust.
A library to represent a tree data structure in rust.
Highly scalable archive format that can be compressed, encrypted, and split. Also, its data structure is inspired by the PNG data structure.
"A Common-Sense Guide to Data Structures and Algorithms" code illustrations in Rust
All Algorithms implemented in Rust
Hex patterns, include patterns and magic files for the use with the ImHex Hex Editor
Wrapper for IO objects like `std::net::TcpStream` to enable logging of all read and write operations, errors and drop.
A bunch of maps implemented in Rust because this was honestly the best idea I had to learn this language
Toy implementation of the CVM algorithm (2024)
Ergonomic, versatile, strong types wrapping MIDI 2.0 message data.