#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 2939774/week @ 2024-07-30 3095106/week @ 2024-08-06 3060081/week @ 2024-08-13 3017192/week @ 2024-08-20 3154840/week @ 2024-08-27 3352822/week @ 2024-09-03 3125490/week @ 2024-09-10 2966115/week @ 2024-09-17 3260918/week @ 2024-09-24 3911884/week @ 2024-10-01 4133772/week @ 2024-10-08 3940649/week @ 2024-10-15 3124536/week @ 2024-10-22 2979418/week @ 2024-10-29 3105023/week @ 2024-11-05 2778292/week @ 2024-11-12

12,602,640 downloads per month
Used in 50,199 crates (1,610 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