tag | 51519fc0a658d3a56b1bc9af723a65fa1f37fb2a | |
---|---|---|
tagger | The Android Open Source Project <initial-contribution@android.com> | Sat Dec 10 00:27:50 2022 -0800 |
object | 91b5f2242d7589c7610a538ca62030e6f1c28f5b |
aml_ext_331112010 (9161278,com.google.android.extservices)
commit | 91b5f2242d7589c7610a538ca62030e6f1c28f5b | [log] [tgz] |
---|---|---|
author | Android Build Coastguard Worker <android-build-coastguard-worker@google.com> | Tue May 10 07:04:34 2022 +0000 |
committer | Android Build Coastguard Worker <android-build-coastguard-worker@google.com> | Tue May 10 07:04:34 2022 +0000 |
tree | da86de748981dd96113865df11834b360d9da02b | |
parent | 06b926d5af978a3f55ee650204905ae411407b64 [diff] | |
parent | dd67dd31f83d56d34f933f3ff0204baa55a68aac [diff] |
Snap for 8564071 from dd67dd31f83d56d34f933f3ff0204baa55a68aac to mainline-extservices-release Change-Id: Icb21535a72602282615d6cf280d1867ea4fd576a
“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();