| tag | 12e693e21d35e5a32cd48f33cf40e375c63a464a | |
|---|---|---|
| tagger | The Android Open Source Project <initial-contribution@android.com> | Thu Nov 10 21:08:56 2022 -0800 |
| object | 62d1611e9a2643c9c87b8bf08912a5c41cba46e7 |
aml_tz3_312410020
| commit | 62d1611e9a2643c9c87b8bf08912a5c41cba46e7 | [log] [tgz] |
|---|---|---|
| author | Android Build Coastguard Worker <android-build-coastguard-worker@google.com> | Wed Jun 15 21:45:35 2022 +0000 |
| committer | Android Build Coastguard Worker <android-build-coastguard-worker@google.com> | Wed Jun 15 21:45:35 2022 +0000 |
| tree | 3ed4f71564f78fb702412335da032629712bf1f3 | |
| parent | f6a11f1418743cc31b85f1dcc493f1922a052f46 [diff] | |
| parent | 06b926d5af978a3f55ee650204905ae411407b64 [diff] |
Snap for 8730993 from 06b926d5af978a3f55ee650204905ae411407b64 to mainline-tzdata3-release Change-Id: Ia929496550afb17cd31b5d43ca77890f76b525b9
“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();