#small-vec #stack #vec #numbers #item #number-of-items #no-std

no-std smallvec

'Small vector' optimization: store up to a small number of items on the stack

55 releases (24 stable)

2.0.0-alpha.11 Mar 20, 2025
2.0.0-alpha.9 Dec 17, 2024
2.0.0-alpha.7 Jul 27, 2024
2.0.0-alpha.5 Mar 23, 2024
0.1.5 Jun 30, 2015

#4 in Data structures

Download history 4476732/week @ 2025-03-06 4527670/week @ 2025-03-13 5250775/week @ 2025-03-20 4383993/week @ 2025-03-27 4895739/week @ 2025-04-03 4881397/week @ 2025-04-10 4409575/week @ 2025-04-17 4670577/week @ 2025-04-24 4429752/week @ 2025-05-01 4605526/week @ 2025-05-08 4815529/week @ 2025-05-15 4276357/week @ 2025-05-22 4262782/week @ 2025-05-29 4603270/week @ 2025-06-05 5495952/week @ 2025-06-12 4616989/week @ 2025-06-19

19,769,090 downloads per month
Used in 61,082 crates (1,872 directly)

MIT/Apache

110KB
2.5K SLoC

rust-smallvec

⚠️ Note: This is the code for smallvec 2.0, which is not yet ready for release. For details about the changes in version 2.0, please see #183, #240, and #284.

The source code for the latest smallvec 1.x.y release can be found on the v1 branch. Bug fixes for smallvec 1 should be based on that branch, while new feature development should go on the v2 branch.

About smallvec

Documentation

Release notes

"Small vector" optimization for Rust: store up to a small number of items on the stack

Example

use smallvec::{SmallVec, smallvec};
    
// This SmallVec can hold up to 4 items on the stack:
let mut v: SmallVec<i32, 4> = smallvec![1, 2, 3, 4];

// It will automatically move its contents to the heap if
// contains more than four items:
v.push(5);

// SmallVec points to a slice, so you can use normal slice
// indexing and other methods to access its contents:
v[0] = v[1] + v[2];
v.sort();

Dependencies

~215KB