#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

#8 in Data structures

Download history 2258784/week @ 2024-01-14 2279003/week @ 2024-01-21 2445497/week @ 2024-01-28 2340313/week @ 2024-02-04 2292288/week @ 2024-02-11 2342698/week @ 2024-02-18 2443224/week @ 2024-02-25 2423651/week @ 2024-03-03 2315065/week @ 2024-03-10 2411645/week @ 2024-03-17 2490645/week @ 2024-03-24 2530499/week @ 2024-03-31 2475649/week @ 2024-04-07 2492019/week @ 2024-04-14 2631532/week @ 2024-04-21 2314203/week @ 2024-04-28

10,094,756 downloads per month
Used in 35,078 crates (1,406 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

~190KB