tag | 1d244a6513f56f56668ff5dadbf5551ec67618b0 | |
---|---|---|
tagger | The Android Open Source Project <initial-contribution@android.com> | Fri May 26 06:14:07 2023 -0700 |
object | 581248637f5ec70f507c80cacdb75e878c2f31e2 |
aml_con_331413000
commit | 581248637f5ec70f507c80cacdb75e878c2f31e2 | [log] [tgz] |
---|---|---|
author | Android Build Coastguard Worker <android-build-coastguard-worker@google.com> | Tue May 10 07:08:35 2022 +0000 |
committer | Android Build Coastguard Worker <android-build-coastguard-worker@google.com> | Tue May 10 07:08:35 2022 +0000 |
tree | da86de748981dd96113865df11834b360d9da02b | |
parent | 06b926d5af978a3f55ee650204905ae411407b64 [diff] | |
parent | dd67dd31f83d56d34f933f3ff0204baa55a68aac [diff] |
Snap for 8564071 from dd67dd31f83d56d34f933f3ff0204baa55a68aac to mainline-conscrypt-release Change-Id: I84e64defb2c66b3706b615c9acf97a62918a13bc
“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();