#small-vec #stack #vec #no-std

no-std smallvec

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

54 releases (23 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

#3 in Data structures

Download history 3648323/week @ 2025-01-29 3773000/week @ 2025-02-05 3876062/week @ 2025-02-12 4578001/week @ 2025-02-19 4108790/week @ 2025-02-26 4482651/week @ 2025-03-05 4495747/week @ 2025-03-12 5245474/week @ 2025-03-19 4448121/week @ 2025-03-26 4814499/week @ 2025-04-02 4926890/week @ 2025-04-09 4408869/week @ 2025-04-16 4607046/week @ 2025-04-23 4453964/week @ 2025-04-30 4639362/week @ 2025-05-07 3941451/week @ 2025-05-14

18,436,976 downloads per month
Used in 57,061 crates (1,828 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

~205KB