tag | 5964d86828eae1bf93a050633ffa228a0ee9e877 | |
---|---|---|
tagger | The Android Open Source Project <initial-contribution@android.com> | Thu Feb 02 01:12:35 2023 -0800 |
object | 2e1b000794671f92f1307289580979a6d733c351 |
aml_neu_331310000 (9219948,com.google.android.neuralnetworks)
commit | 2e1b000794671f92f1307289580979a6d733c351 | [log] [tgz] |
---|---|---|
author | Android Build Coastguard Worker <android-build-coastguard-worker@google.com> | Tue May 10 06:58:11 2022 +0000 |
committer | Android Build Coastguard Worker <android-build-coastguard-worker@google.com> | Tue May 10 06:58:11 2022 +0000 |
tree | da86de748981dd96113865df11834b360d9da02b | |
parent | 06b926d5af978a3f55ee650204905ae411407b64 [diff] | |
parent | dd67dd31f83d56d34f933f3ff0204baa55a68aac [diff] |
Snap for 8564071 from dd67dd31f83d56d34f933f3ff0204baa55a68aac to mainline-neuralnetworks-release Change-Id: Ic216aa8509a4e12a7f0c0b89f703b2bcf775a861
“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();