#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 2774805/week @ 2024-07-18 2878584/week @ 2024-07-25 2932370/week @ 2024-08-01 3196557/week @ 2024-08-08 3038963/week @ 2024-08-15 3189538/week @ 2024-08-22 2961545/week @ 2024-08-29 3391617/week @ 2024-09-05 3058376/week @ 2024-09-12 2999071/week @ 2024-09-19 3526119/week @ 2024-09-26 3953139/week @ 2024-10-03 4076431/week @ 2024-10-10 3749544/week @ 2024-10-17 3058075/week @ 2024-10-24 3030341/week @ 2024-10-31

14,600,498 downloads per month
Used in 49,731 crates (1,596 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