| commit | f280663077822324fcde8f87a04e4a0b0b88622a | [log] [tgz] |
|---|---|---|
| author | Matthew Maurer <[email protected]> | Tue May 31 17:59:21 2022 +0000 |
| committer | Automerger Merge Worker <[email protected]> | Tue May 31 17:59:21 2022 +0000 |
| tree | 50eda7edf9ae0374b69141200860fcae20ee6799 | |
| parent | 638d0ee87b2ef1082fe674e75f89932b179fe32a [diff] | |
| parent | 97bd0f4a073a3849901494a961dae666784bed82 [diff] |
Update TEST_MAPPING am: d7bd97eae4 am: 871eb4c7c3 am: d001883707 am: 97bd0f4a07 Original change: https://android-review.googlesource.com/c/platform/external/rust/crates/smallvec/+/2108153 Change-Id: I2b6fb1168b3fdaf29bbe9e5db60b6802de7ea3d2 Signed-off-by: Automerger Merge Worker <[email protected]>
“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();