tag | 6898714ab2ed3790d46d4134ff9e8441d80ca5de | |
---|---|---|
tagger | The Android Open Source Project <initial-contribution@android.com> | Mon Apr 15 11:21:21 2024 -0700 |
object | 2551c1d0c6cbb77e29431d75bfcb2f6f2cad14e3 |
Android 14.0.0 Release 32 (AP1A.240405.002.A2)
commit | 2551c1d0c6cbb77e29431d75bfcb2f6f2cad14e3 | [log] [tgz] |
---|---|---|
author | Android Build Coastguard Worker <android-build-coastguard-worker@google.com> | Wed Nov 15 00:14:03 2023 +0000 |
committer | Android Build Coastguard Worker <android-build-coastguard-worker@google.com> | Wed Nov 15 00:14:03 2023 +0000 |
tree | 85bba2898c7ba5b053d723b80a04dee78593f109 | |
parent | adb2f137e637768093c0d0ce79ba2919e028c288 [diff] | |
parent | a3484a314f48899674d59ff0c1704ef460033e1d [diff] |
Snap for 11097608 from a3484a314f48899674d59ff0c1704ef460033e1d to 24Q1-release Change-Id: Ic0fb0f0fd8b6454e2b7b56b0d64aecf57ca7e926
“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();