Purely for educational and recreational purposes. For real world production please use std::collections::HashMap.
For resolving collisions we use Open Addressing. For the hash function we use djb2
$ cargo run --release
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
kdtree K-dimensional tree in Rust for fast geospatial indexing and nearest neighbors lookup Crate Documentation Usage Benchmark License Usage Add kdtr
Rust Persistent Data Structures Rust Persistent Data Structures provides fully persistent data structures with structural sharing. Setup To use rpds a
progress-streams Rust crate to provide progress callbacks for types which implement io::Read or io::Write. Examples Reader extern crate progress_strea
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
RiteLinked -- HashMap-like containers that hold their key-value pairs in a user controllable order RiteLinked provides more up to date versions of Lin
afmt Simple rust library for parsing basic data structures from strings. Usage You can specify string formats to any strucute, via the use of the fmt
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
Serde is a framework for serializing and deserializing Rust data structures efficiently and generically.
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
Doubly-Linked List Implementation in Rust Purely for educational and recreational purposes. For real world production please use std::collections::Lin
skog Swedish for "forest". A pure rust implementation of Adobe's stlab::forest data structure. Introduction A "forest" is a tree-like data structure.
A lightweight Rust library for BitVector Rank&Select operations, coupled with a generic Sparse Array implementation
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
A hashmap implementation, which uses hashset, and keys are contained within values.
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
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
array_tool Array helpers for Rust. Some of the most common methods you would use on Arrays made available on Vectors. Polymorphic implementations for
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
139 Dec 30, 2022
152 Jan 2, 2023
883 Dec 31, 2022
19 Dec 3, 2022
34 Oct 22, 2022
52 Aug 19, 2022
4 May 8, 2021
30 Dec 16, 2022
6.5k Dec 31, 2022
157 Dec 28, 2022
9 Jul 28, 2022
1 Dec 8, 2021
5 Jun 20, 2022
57 Dec 19, 2022
2 Nov 29, 2022
360 Dec 28, 2022
20 Dec 7, 2022
69 Dec 9, 2022
325 Dec 25, 2022