commit | 6121f74b640ff7bd25f8ac0638ae48fe122761d1 | [log] [tgz] |
---|---|---|
author | Android Build Coastguard Worker <android-build-coastguard-worker@google.com> | Wed Apr 06 20:37:29 2022 +0000 |
committer | Android Build Coastguard Worker <android-build-coastguard-worker@google.com> | Wed Apr 06 20:37:29 2022 +0000 |
tree | da86de748981dd96113865df11834b360d9da02b | |
parent | bcbb2293e68b7ea9e451b4af2b3c5474708b6f59 [diff] | |
parent | 638d0ee87b2ef1082fe674e75f89932b179fe32a [diff] |
Snap for 8414339 from 638d0ee87b2ef1082fe674e75f89932b179fe32a to tm-qpr1-release Change-Id: Ib416b013c9fb167ba492d8343ce482c6ebf4adbd
"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();