Projected hash hash map over hash set.
Often when storing objects inside a hashmap, their keys are already contained inside them. It's more efficient to store every key exactly once..
ProjectedHashMap is implemented over HashSet.
It's defined for pair
Borrow
.
Itertools Extra iterator adaptors, functions and macros. Please read the API documentation here How to use with cargo: [dependencies] itertools = "0.1
array_tool Array helpers for Rust. Some of the most common methods you would use on Arrays made available on Vectors. Polymorphic implementations for
kdtree K-dimensional tree in Rust for fast geospatial indexing and nearest neighbors lookup Crate Documentation Usage Benchmark License Usage Add kdtr
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. The name 'obake' is taken from the Japanese 'お化け (おばけ)', a class of supernatural beings in Japanese folklore that shapeshift.
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
Serialize/DeSerialize for Rust built-in types and user defined types (complex struct types)
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
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
bst-rs Recursive & Iterative Binary Search Tree Implementations within Rust Table of Contents Personal Goals About Quick Start License Contributing In
RadixTrie A prefix tree (trie) is a data structure that allows you to store an associative array whose keys are strings. It is a root tree, each edge
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
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
Hash Table Implementation in Rust Purely for educational and recreational purposes. For real world production please use std::collections::HashMap. Fo
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
Serde is a framework for serializing and deserializing Rust data structures efficiently and generically.
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
1.9k Dec 30, 2022
69 Dec 9, 2022
152 Jan 2, 2023
49 Dec 14, 2022
174 Dec 26, 2022
14 Dec 29, 2022
2 May 3, 2022
8k Jan 8, 2023
360 Dec 28, 2022
6 Oct 1, 2022
2 Jan 28, 2022
552 Jan 1, 2023
157 Dec 28, 2022
9 Jul 28, 2022
1 Dec 8, 2021
5 Jun 20, 2022
6.5k Dec 31, 2022
17 Apr 24, 2022