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

no-std smallvec

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

52 releases (22 stable)

2.0.0-alpha.10 Jan 15, 2025
2.0.0-alpha.9 Dec 17, 2024
2.0.0-alpha.7 Jul 27, 2024
2.0.0-alpha.5 Mar 23, 2024
0.1.5 Jun 30, 2015

#12 in Data structures

Download history 3019141/week @ 2024-10-30 3094394/week @ 2024-11-06 3308404/week @ 2024-11-13 3309808/week @ 2024-11-20 2822541/week @ 2024-11-27 3494047/week @ 2024-12-04 3448181/week @ 2024-12-11 2824196/week @ 2024-12-18 1572606/week @ 2024-12-25 2415218/week @ 2025-01-01 3257441/week @ 2025-01-08 3149536/week @ 2025-01-15 3384917/week @ 2025-01-22 3648323/week @ 2025-01-29 3773000/week @ 2025-02-05 3204958/week @ 2025-02-12

14,563,166 downloads per month
Used in 54,449 crates (1,737 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

~155KB