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

no-std smallvec

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

46 releases (21 stable)

2.0.0-alpha.5 Mar 23, 2024
2.0.0-alpha.3 Jan 20, 2024
2.0.0-alpha.1 Nov 7, 2023
1.13.2 Mar 20, 2024
0.1.5 Jun 30, 2015

#4 in Data structures

Download history 2235294/week @ 2024-01-13 2295890/week @ 2024-01-20 2420330/week @ 2024-01-27 2352384/week @ 2024-02-03 2296588/week @ 2024-02-10 2334762/week @ 2024-02-17 2431817/week @ 2024-02-24 2434742/week @ 2024-03-02 2329706/week @ 2024-03-09 2388031/week @ 2024-03-16 2498878/week @ 2024-03-23 2518765/week @ 2024-03-30 2494739/week @ 2024-04-06 2492139/week @ 2024-04-13 2640286/week @ 2024-04-20 2028633/week @ 2024-04-27

10,060,092 downloads per month
Used in 35,029 crates (1,404 directly)

MIT/Apache

100KB
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

~175KB