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

no-std smallvec

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

48 releases (21 stable)

2.0.0-alpha.7 Jul 27, 2024
2.0.0-alpha.5 Mar 23, 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 2849852/week @ 2024-07-21 2910947/week @ 2024-07-28 3032812/week @ 2024-08-04 3090061/week @ 2024-08-11 2998663/week @ 2024-08-18 3355686/week @ 2024-08-25 3141086/week @ 2024-09-01 3183647/week @ 2024-09-08 2836091/week @ 2024-09-15 3260763/week @ 2024-09-22 3633279/week @ 2024-09-29 4103990/week @ 2024-10-06 4100720/week @ 2024-10-13 3369271/week @ 2024-10-20 2957709/week @ 2024-10-27 2997082/week @ 2024-11-03

13,917,483 downloads per month
Used in 49,811 crates (1,598 directly)

MIT/Apache

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

~165KB