#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 2095226/week @ 2024-01-11 2405344/week @ 2024-01-18 2321853/week @ 2024-01-25 2396214/week @ 2024-02-01 2319792/week @ 2024-02-08 2268359/week @ 2024-02-15 2416007/week @ 2024-02-22 2489171/week @ 2024-02-29 2339639/week @ 2024-03-07 2320567/week @ 2024-03-14 2541441/week @ 2024-03-21 2465624/week @ 2024-03-28 2535167/week @ 2024-04-04 2481437/week @ 2024-04-11 2602672/week @ 2024-04-18 2050142/week @ 2024-04-25

10,149,552 downloads per month
Used in 34,888 crates (1,403 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

~180KB