2 releases

Uses old Rust 2015

0.1.1 Dec 28, 2019
0.1.0 Jun 6, 2016
Download history 32/week @ 2022-12-01 42/week @ 2022-12-08 87/week @ 2022-12-15 85/week @ 2022-12-22 38/week @ 2022-12-29 76/week @ 2023-01-05 86/week @ 2023-01-12 125/week @ 2023-01-19 71/week @ 2023-01-26 57/week @ 2023-02-02 45/week @ 2023-02-09 53/week @ 2023-02-16 16/week @ 2023-02-23 55/week @ 2023-03-02 38/week @ 2023-03-09 36/week @ 2023-03-16

158 downloads per month

MIT license

168 lines

smallset: a small unordered set

Build Status



This crate implements a small unordered-set data structure implemented using smallvec. It stores set elements in a simple unordered array, and when the set is smaller than a parameterizable size, the elements are stored completely inline (i.e., with zero heap allocations). The data structure is thus very space-efficient for sets of only a few elements, much more so than a tree-based or hash-table-based set data structure. It is also fast when the set is small: queries and inserts perform a linear scan, which is more cache-friendly than a pointer-chasing search through a tree.

smallset should be used where minimizing heap allocations is of primary importance and where it is expected that no more than a few elements will be present. If the set grows large, then it will exhibit poor (O(n) queries and inserts) performance.