| tag | 4dec24b89740c7e500877f1c438abf6cda8eeb5d | |
|---|---|---|
| tagger | The Android Open Source Project <initial-contribution@android.com> | Tue Mar 14 07:26:03 2023 -0700 |
| object | 4fa9cf52329a510f41e8fdf6790a211d03d69222 |
Android security 12.0.0 release 45
| commit | 4fa9cf52329a510f41e8fdf6790a211d03d69222 | [log] [tgz] |
|---|---|---|
| author | android-build-team Robot <android-build-team-robot@google.com> | Wed Apr 28 01:05:56 2021 +0000 |
| committer | android-build-team Robot <android-build-team-robot@google.com> | Wed Apr 28 01:05:56 2021 +0000 |
| tree | 3ed4f71564f78fb702412335da032629712bf1f3 | |
| parent | ddce28fbf040bb2561aec3e2765ae2f83c81b7bd [diff] | |
| parent | 7728b23a4c8c9fe64126df78c24d366aad6720cb [diff] |
Snap for 7318334 from 7728b23a4c8c9fe64126df78c24d366aad6720cb to sc-release Change-Id: I4f796c176c576fc62b5367ce2722acb41e60ecc9
“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();