tag | a41c926b1311082f2d314f1f8e8b71763c06a2a9 | |
---|---|---|
tagger | The Android Open Source Project <initial-contribution@android.com> | Sat Oct 01 21:09:31 2022 -0700 |
object | 06525706f02aa7d25a341dee160e1cee147c7fb8 |
aml_go_sdk_330810000
commit | 06525706f02aa7d25a341dee160e1cee147c7fb8 | [log] [tgz] |
---|---|---|
author | Android Build Coastguard Worker <android-build-coastguard-worker@google.com> | Thu Jun 16 22:02:09 2022 +0000 |
committer | Android Build Coastguard Worker <android-build-coastguard-worker@google.com> | Thu Jun 16 22:02:09 2022 +0000 |
tree | da86de748981dd96113865df11834b360d9da02b | |
parent | 638d0ee87b2ef1082fe674e75f89932b179fe32a [diff] | |
parent | dd67dd31f83d56d34f933f3ff0204baa55a68aac [diff] |
Snap for 8736029 from dd67dd31f83d56d34f933f3ff0204baa55a68aac to mainline-go-sdkext-release Change-Id: I77a12e7b1589a3d4144ebe1bad4165c9e2d580c1
“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();