Filter By
76 Repositories
Rust Data structures
All Algorithms implemented in Rust
The Algorithms - Rust All algorithms implemented in Rust (for educational purposes) These are for demonstration purposes only. RESTART BUILD Sort Algo
Broot - A new way to see and navigate directory trees
Broot A better way to navigate directories Installation Instructions Get an overview of a directory, even a big one br -s Notice the unlisted? That's
Common data structures and algorithms in Rust
Contest Algorithms in Rust A collection of classic data structures and algorithms, emphasizing usability, beauty and clarity over full generality. As
Generic array types in Rust
generic-array This crate implements generic array types for Rust. Requires minumum Rust version of 1.36.0, or 1.41.0 for From[T; N] implementations
Roaring bitmap implementation for Rust
RoaringBitmap This is not yet production ready. The API should be mostly complete now. This is a Rust port of the Roaring bitmap data structure, initi
Fast, efficient, and robust memory reclamation for concurrent data structures
Seize Fast, efficient, and robust memory reclamation for concurrent data structures. Introduction Concurrent data structures are faced with the proble
Leetcode - solve questions in leetcode by Rust
leetcode Solve questions in leetcode by Rust 前言 由于 Rust 写数据结构相关的资料特别少并且理解非常困难，所以专门建了个 Repo 用来记录 Rust 刷 leetcode 的解法并包含心得体会，欢迎 Star ✨ 会长期稳定更新。 努力写出最容易理
Extra iterator adaptors, iterator methods, free functions, and macros.
Itertools Extra iterator adaptors, functions and macros. Please read the API documentation here How to use with cargo: [dependencies] itertools = "0.1
Novusk-based OS running the Ardaku engine.
Arc Novusk-based OS running the Ardaku engine. Build Environment You will need the nightly toolchain and sources as well as cargo-binutils. rustup too
enum-map enum-map xfix/enum-map [enum-map] — An optimized map implementation for enums using an array to store values.
enum-map A library providing enum map providing type safe enum array. It is implemented using regular Rust arrays, so using them is as fast as using r
Doubly-Linked List Implementation in Rust
Doubly-Linked List Implementation in Rust Purely for educational and recreational purposes. For real world production please use std::collections::Lin
Rust-algorithm-club - Learn algorithms and data structures with Rust
Rust Algorithm Club 🚧 🚧 This repo is under construction. Most materials are written in Chinese. Check it out here if you are able to read Chinese. W
Algorithms and Data Structures of all kinds written in Rust.
Classic Algorithms in Rust This repo contains the implementation of various classic algorithms for educational purposes in Rust. Right now, it is in i
Obake is a procedural macro for declaring and maintaining versioned data-structures.
Obake is a procedural macro for declaring and maintaining versioned data-structures. The name 'obake' is taken from the Japanese 'お化け (おばけ)', a class of supernatural beings in Japanese folklore that shapeshift.
Rust Persistent Data Structures
Rust Persistent Data Structures Rust Persistent Data Structures provides fully persistent data structures with structural sharing. Setup To use rpds a
Serde is a framework for serializing and deserializing Rust data structures efficiently and generically.
Serde is a framework for serializing and deserializing Rust data structures efficiently and generically.
my leetcode solutions in rust
My Leetcode Solution in Rust Run cargo run {id} to initialize the template submission file of "question #id". Run cargo test test_{id} to test the sol
NixEl is a Rust library that turns Nix code into a variety of correct, typed, memory-safe data-structures
🐉 NixEL Lexer, Parser, Abstract Syntax Tree and Concrete Syntax Tree for the Nix Expressions Language. NixEl is a Rust library that turns Nix code in
K-dimensional tree in Rust for fast geospatial indexing and lookup
kdtree K-dimensional tree in Rust for fast geospatial indexing and nearest neighbors lookup Crate Documentation Usage Benchmark License Usage Add kdtr
A proof of concept implementation of cyclic data structures in stable, safe, Rust.
A proof of concept implementation of cyclic data structures in stable, safe, Rust. This demonstrates the combined power of the static-rc crate and the
A priority queue for Rust with efficient change function.
PriorityQueue This crate implements a Priority Queue with a function to change the priority of an object. Priority and items are stored in an IndexMap
A simple rust library to help create octrees and quadtrees for chunked level of detail
LodTree LodTree, a simple tree data structure for doing chunk-based level of detail. Goals The aim of this crate is to provide a generic, easy to use
Untree converts tree diagrams produced by tree back into directory file structures.
Untree: Undoing tree for fun and profit Untree converts tree diagrams produced by tree back into directory file structures. Let's say you have the fol
A lightweight Rust library for BitVector Rank&Select operations, coupled with a generic Sparse Array implementation
A lightweight Rust library for BitVector Rank&Select operations, coupled with a generic Sparse Array implementation
disk backed wal queue
Repository Template Queue like disk backed WAL Pronouced Quál - from the german wordrd for agony - because it is. Operations The basic concept is si
Ternary search tree collection in rust
tst Ternary search tree collection in rust with similar API to std::collections as it possible. Ternary search tree is a type of trie (sometimes calle
Redis Tree(Ploytree) Structure Module
RedisTree is a Redis module that implements Polytree as a native data type. It allows creating,locating,pushing and detaching tree from Redi
Message/job queue based on bonsaidb, similar to sqlxmq.
Bonsaimq Simple database message queue based on bonsaidb. The project is highly influenced by sqlxmq. Warning: This project is in early alpha and shou
Sort (key, value) data sets that don't fit in memory
kv-par-merge-sort Key-Value Parallel Merge Sort Sort Pod (key, value) data sets that don't fit in memory. This crate provides the kv_par_merge_sort li
A number of collections, such as linked-lists, binary-trees, or B-Trees are most easily implemented with aliasing pointers.
StaticRc is a safe reference-counted pointer, similar to Rc or Arc, though performing its reference-counting at compile-time rather than run-time, and
Collection of Data Structures in Rust
cds - Collection of Data Structures !!! UNDER CONSTRUCTION !!! The version v0.0.1 is a crates.io placeholder. License Licensed under either of Apache
Succinct data structures in Rust
sucds: Succinct data structures in Rust sucds contains some succinct data structures written in Rust. Data structures So far, the following data struc
RiteLinked - LinkedHashMap & LinkedHashSet in Rust
RiteLinked -- HashMap-like containers that hold their key-value pairs in a user controllable order RiteLinked provides more up to date versions of Lin
Special FUSE filesystem to map /etc/resolv.conf to different files depending on Linux network namespace
Linux network namespaces allow separate networking environment for a group of processes (sharing uid or from a separate user). DNS settings (/etc/resolv.conf) are however shared between all those environments, which may be inconvenient in some setups.
Library containing implementations of various sequential data-structures.
Library containing implementations of various sequential data-structures.
Array helpers for Rust's Vector and String types
array_tool Array helpers for Rust. Some of the most common methods you would use on Arrays made available on Vectors. Polymorphic implementations for
SegVec data structure for rust. Similar to Vec, but allocates memory in chunks of increasing size.
segvec This crate provides the SegVec data structure. It is similar to Vec, but allocates memory in chunks of increasing size, referred to as "segment
Serialize/DeSerialize for Rust built-in types and user defined types (complex struct types)
Serialize/DeSerialize for Rust built-in types and user defined types (complex struct types)
Blazing fast immutable collection datatypes for Rust.
imbl Blazing fast immutable collection datatypes for Rust. This is a fork of the im crate, which appears to be unmaintained. (This fork is not current
Rust Vec Doubly Linked List
Rust Vec Doubly Linked List Just like doubly linked list(e.g. std::LinkedList), but supports that returning a index of the vec when push. And you can
Dade is data definition for Rust structures.
dade dade is data definition for Rust structures. For the easy handle of data, the following will support it. Data validation. Data schema conforms Js
Conditional compilation using boolean expression syntax, rather than any(), all(), not()
Conditional compilation expressions Conditional compilation using boolean expression syntax, rather than any(), all(), not(). [dependencies] efg = "0.
Coding-challenge - Algorithms and Data-structures, problems and solutions in Rust language using cargo-workspaces
Coding Challenge LeetCode/Hackerrank e.t.c Using this as an opportunity to improve my knowledge of rust lang If you found this repo useful to you, add
Hash Table Implementation in Rust
Hash Table Implementation in Rust Purely for educational and recreational purposes. For real world production please use std::collections::HashMap. Fo
TreeFlat - the simplest way to build & traverse a pre-order Tree in Rust
TreeFlat is the simplest way to build & traverse a pre-order Tree for Rust. Alpha-relase! If you build a Tree in pre-order, and display in pre-order,
A redis module that provides a type for inventory deduction in flash sales
A redis module that provides a type for inventory deduction in flash sales
Parameterized routing for generic resources in Rust
Usher Usher provides an easy way to construct parameterized routing trees in Rust. The nodes of these trees is naturally generic, allowing Usher to le
A library for comparing data structures in Rust, oriented toward testing
The comparable crate defines the trait [Comparable], along with a derive macro for auto-generating instances of this trait for most data types. Primar
A library for comparing data structures in Rust, oriented toward testing
Delta: Structural differencing in Rust The delta crate defines the trait Delta, along with a derive macro for auto-generating instances of this trait
A tree structure in Rust optimized for looking up domain names, with wildcard support
domain-lookup-tree Overview DomainLookupTree is a data structure which provides efficient domain name lookup matching with support for wildcard entrie
Use Rust to solve questions on Leetcode.
Rust for Leetcode 本仓库用于记录我使用Rust刷Leetcode的代码，尽量做到日更。 题目列表 编号 名称 题目类型 题解 678 有效的括号字符串 栈 valid-parenthesis-string.rs 461 汉明距离 位运算 hamming-distance.rs 62
Recursive & Iterative Binary Search Tree Implementations within Rust
bst-rs Recursive & Iterative Binary Search Tree Implementations within Rust Table of Contents Personal Goals About Quick Start License Contributing In
The solutions for Leetcode's problem
Leetcode The solutions for Leetcode's problem # Ttitle Solution Diffculty 1 Two Sum Rust, TypeScript Easy 5 Longest Palindromic Substring Rust, TypeSc