#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 3316571/week @ 2025-01-11 3133790/week @ 2025-01-18 3500718/week @ 2025-01-25 3758239/week @ 2025-02-01 3897845/week @ 2025-02-08 4230350/week @ 2025-02-15 4297136/week @ 2025-02-22 4385484/week @ 2025-03-01 4404257/week @ 2025-03-08 4767592/week @ 2025-03-15 4943423/week @ 2025-03-22 4486467/week @ 2025-03-29 5043651/week @ 2025-04-05 4618452/week @ 2025-04-12 4523538/week @ 2025-04-19 3885938/week @ 2025-04-26

18,809,402 downloads per month
Used in 58,247 crates (1,803 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