This repo provide some useful data-structures, such as: Array, HashMap, HashSet, BTreeMap, BTreeSet, etc...
That lives on the stack. It's a good choice for fixed size storage.
Implementation
- Array
- BTreeMap - In progress
🏃 - HashMap
- HashSet
- BTreeSet
Some collections to store a fixed number of elements of a specific type.
Overview
You might also like...
Log structured append-only key-value store from Rust In Action with some enhancements.
riakv Log structured, append only, key value store implementation from Rust In Action with some enhancements. Features Persistent key value store with
5 Oct 29, 2022
A memory efficient immutable string type that can store up to 24* bytes on the stack
compact_str A memory efficient immutable string type that can store up to 24* bytes on the stack. * 12 bytes for 32-bit architectures About A CompactS
342 Jan 2, 2023
concat-arrays: a rust macro for concatenating fixed-size arrays
concat-arrays: a rust macro for concatenating fixed-size arrays This crate defines concat_arrays!, a macro that allows you to concatenate arrays.
5 May 25, 2021
Source code for our paper "Higher-order finite elements for embedded simulation"
Higher-order Finite Elements for Embedded Simulation This repository contains the source code used to produce the results for our paper: Longva, A., L
18 Sep 30, 2022
A wallet library for Elements / Liquid written in Rust!
EDK Elements Dev Kit A modern, lightweight, descriptor-based wallet library for Elements / Liquid written in Rust! Inspired by BDK for Elements & Liqu
11 Dec 11, 2021
CosmWasm implementation for limited edition, fixed-price NFTs
CW721 Editions This contract enables the creation of limited edition fixed price NFTs according to the cw721 token standard. Instantiation To instanti
4 Oct 5, 2022
A vector with a fixed capacity. (Rust)
arrayvec OR A vector with fixed capacity. Please read the API documentation here License Dual-licensed to be compatible with the Rust project. License
522 Dec 20, 2022
Displays 9-Patch UI elements in Bevy
Bevy 9-Patch plugin Implementation of 9-patch images in Bevy. Let you have a UI that scale only the right parts of your images. See the examples for w
23 Jan 4, 2023
It's implemented by laying out the elements in memory contiguously like alloc::vec::Vec
A VecT: ?Sized It's implemented by laying out the elements in memory contiguously like alloc::vec::Vec Layout A Vechonk is 4 usize long. It owns a s
4 Sep 15, 2022
An iterator adapter to peek at future elements without advancing the cursor of the underlying iterator.
multipeek An iterator adapter to peek at future elements without advancing the cursor of the underlying iterator. Check out the documentation for more
20 Jul 16, 2022
Fixed point to floating point (and back) conversion utility
fixed2float Simple utility for fixed point to real number conversions, using the VisSim (Fxm.b) and Q (Qm.n) notations. Usage as a dependency of your
2 Aug 5, 2022
A simple allocator written in Rust that manages memory in fixed-size chunks.
Simple Chunk Allocator A simple no_std allocator written in Rust that manages memory in fixed-size chunks/blocks. Useful for basic no_std binaries whe
7 Aug 8, 2022
Peekable iterator that allows to peek the next N elements without consuming them.
peekaboo docs - crates.io Peekable iterator that allows to peek the next N elements without consuming them. It's no_std compatible by default. It also
6 Nov 27, 2022
Rmt - similar to the rm command, but it allows me to save the deleted elements in the trash
Rmt is similar to the rm command but saves the deleted elements in the trash and restores them. Rmt is written in Rust 🦀
255 Jan 3, 2023
📈 The fastest map possible in Rust, where keys are integers and the capacity is fixed (faster than Vec!)
It is an alternative on-heap implementation of a map with keys of type usize and a fixed capacity. It works much faster than a standard HashMap becaus
6 Apr 26, 2023
The most primitive and the fastest implementation of a fixed-size last-in-first-out stack on stack in Rust, for Copy-implementing types
This is the simplest and the fastest (faster than Vec!) implementation of a last-in-first-out stack data structure, on stack, when stack elements are
10 Jun 18, 2023
A UI component library for Leptos, based on Tailwind Elements.
leptos-twelements A UI component library for Leptos, based on Tailwind Elements. Installation (for projects using cargo leptos) Use the nightly rust c
4 Oct 20, 2023
🦖 Evolve your fixed length data files into Apache Arrow tables, fully parallelized!
🦖 Evolve your fixed length data files into Apache Arrow tables, fully parallelized! 🔎 Overview ... 📦 Installation The easiest way to install evolut
3 Dec 22, 2023
replaces fixed-sized string prefixes & whole sections in binaries for fast, debuggable, reproducible builds
Replacing fixed-sized string prefixes in binaries to refix them to their build context Here's the long story about what refix does and why you'd want
30 Jul 16, 2024
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
57 Dec 19, 2022
A prefix tree (trie) is a data structure that allows you to store an associative array whose keys are strings
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
2 Jan 28, 2022
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
2 Mar 18, 2022
Serializable map of any type.
??️ type_reg Serializable map of any type. This library provides a map that can store any serializable type, and retrieve it as the strong type. Seria
3 Dec 26, 2022
Type erased vector. All elements have the same type.
Type erased vector. All elements have the same type. Designed to be type-erased as far as possible - most of the operations does not know about concre
7 Dec 3, 2022
Additional Rust collections not found in std::collections
More collections Rust crate with additional collections not found in std::collections. Multimaps Completion Name Behaves like ?? ?? ?? ⬜️ ⬜️ HashSetMu
4 Dec 21, 2022
This library implements a type macro for a zero-sized type that is Serde deserializable only from one specific value.
Monostate This library implements a type macro for a zero-sized type that is Serde deserializable only from one specific value. [dependencies] monosta
125 Dec 26, 2022
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
372 Dec 19, 2022
File Tree Fuzzer allows you to create a pseudo-random directory hierarchy filled with some number of files.
FTZZ File Tree Fuzzer allows you to create a pseudo-random directory hierarchy filled with some number of files. Installation $ cargo +nightly install
22 Dec 28, 2022
Uindex is a data store, for data that can be parsed as sentences in some context-free language.
Uindex - Universal index Uindex is a data store, for data that can be parsed as sentences in some context-free language.
3 Jul 20, 2021