commit | 594d5439faf6ded8a782433514b6c077cef95399 | [log] [tgz] |
---|---|---|
author | android-build-team Robot <android-build-team-robot@google.com> | Sun Feb 21 00:05:40 2021 +0000 |
committer | android-build-team Robot <android-build-team-robot@google.com> | Sun Feb 21 00:05:40 2021 +0000 |
tree | 301fc457c178d7a6e8031eb136d7bf951a404406 | |
parent | 652ff0d11161a9e3dcf7ac8c5bb7d95679bac6df [diff] | |
parent | ae2bd84a0a9a7f6ed1ac8a6f12618c2758195a4d [diff] |
Snap for 7160059 from ae2bd84a0a9a7f6ed1ac8a6f12618c2758195a4d to sc-d1-release Change-Id: I1b77f20f9b6fb3720c8fae37350e5cbb3ab0f075
“Small vector” optimization for Rust: store up to a small number of items on the stack
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();