| commit | e19ee5e937567916a13bbf2112eaf12c72279970 | [log] [tgz] |
|---|---|---|
| author | android-build-team Robot <android-build-team-robot@google.com> | Wed Feb 17 03:17:04 2021 +0000 |
| committer | android-build-team Robot <android-build-team-robot@google.com> | Wed Feb 17 03:17:04 2021 +0000 |
| tree | 301fc457c178d7a6e8031eb136d7bf951a404406 | |
| parent | 0bb4efa4aa74ce50e8b190e56d7a6608e18d7f78 [diff] | |
| parent | 00003e8e8fcafcfd790f6c78eb389b2ef210dd8a [diff] |
Snap for 7149879 from 00003e8e8fcafcfd790f6c78eb389b2ef210dd8a to sc-v2-release Change-Id: Id177babfc6c693c5d5d17bb1ed2b0a9df9380f52
"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();