All Algorithms implemented in Rust
-
Updated
Jul 17, 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.
All Algorithms implemented in Rust
Tools for concurrent programming in Rust
📈 The fastest (for very small maps!) alternative of Rust HashMap, which doesn't use hashing and doesn't use heap
DSA Practice - leetcode
Hex patterns, include patterns and magic files for the use with the ImHex Hex Editor
All Algorithms implemented in Rust
A Rust library for accessing a collection of mathematical and cryptographic constants
Highly scalable archive format that can be compressed, encrypted, and split. Also, its data structure is inspired by the PNG data structure.
Tree data-structure in rust.
A data structure to enable conveniently building performant self referential collections such as trees, graphs and linked lists.
An efficient and recursive singly and doubly linked list implementation.
Daily uploads of Leetcode solutions to enhance my coding skills.
An immutable fixed capacity stack based generic copy string.
Fast, efficient, and robust memory reclamation for Rust.
very efficient rank and select
Logging of all read/write operations, errors and drop of underlying IO object.
Priority queue traits and efficient d-ary heap implementations.
Lock-free concurrent and single-threaded hash map implementations using Leapfrog probing. Currently the highest performance concurrent HashMap in Rust for certain use cases.
Rust newtype with guarantees 🇺🇦 🦀