38 releases

0.4.15 Sep 25, 2022
0.4.10 Feb 9, 2022
0.4.8 Dec 15, 2021
0.4.6 Jul 23, 2021
0.0.12 Jul 6, 2017

#171 in Data structures

Download history 768/week @ 2023-06-05 528/week @ 2023-06-12 813/week @ 2023-06-19 251/week @ 2023-06-26 435/week @ 2023-07-03 579/week @ 2023-07-10 711/week @ 2023-07-17 955/week @ 2023-07-24 587/week @ 2023-07-31 751/week @ 2023-08-07 653/week @ 2023-08-14 658/week @ 2023-08-21 1443/week @ 2023-08-28 1052/week @ 2023-09-04 578/week @ 2023-09-11 1141/week @ 2023-09-18

4,238 downloads per month
Used in 9 crates (7 directly)



Build Status Build status Crates.io version

Read the documentation.


tinyset contains a few collections that are optimized to scale in size well for small numbers of elements, while still scaling well in time (and size) for numbers of elements. We now have just a few types that you might care for.

  1. Set64 is a set for types that are 64 bits in size or less and are Copy, intended for essentially integer types. This is our most efficient type, since it can store small sets with just the size of one pointer, with no heap storage.

  2. SetU64 just holds u64 items, and is the internal storage of Set64.

  3. SetU32 just holds u32 items, and can use a bit less memory than SetU64.

  4. SetUsize holds usize items, and uses either [SetU64] or [SetU32] internally.

All of these set types will do no heap allocation for small sets of small elements. On 64-bit systems, each set will store up to seven elements with no heap allocation, if the elements are small. The more elements there are, the smaller they need to be. For details of implementation, see SetU64.

These sets all differ from the standard sets in that they iterate over items rather than references to items, because they do not store values directly in a way that can be referenced. All of the type-specific sets further differ in that remove and contains accept values rather than references.

This crate has an optional dependency on the rand crate (enabled by default), used for randomization to avoid DOS collision attacks. You can speed up your compile by disabling this feature with

tinyset = { version = "0.4", default-features = false }

which will result in using a very simple pseudorandom number generator seeded by the system time.

There is a second optional dependency on serde, which serializes sets in non-compressed form. You can use

tinyset = { version = "0.4.13", features = ["serde"] }

to enable this feature.

There is also an experimental feature compactserde which serializes in a compact form identical to what is held in memory. The format used, however, is not stable, so you cannot expect your serialized sets to be readable by a different version of tinyset. If you would like to have a stable and compact serialized format, please file an issue. Note also that a corrupt (or malicious) file could easily trigger undefined behavior, besides just triggering incorrect and confusing behavior.


To run the benchmark suite, run

cargo bench

This will give you loads of timings and storage requirements for a wide variety of set types.