commit | cc99dd48e98d2da2f614780d1d9df065ddd99458 | [log] [tgz] |
---|---|---|
author | Android Build Coastguard Worker <android-build-coastguard-worker@google.com> | Thu Jun 16 22:02:23 2022 +0000 |
committer | Android Build Coastguard Worker <android-build-coastguard-worker@google.com> | Thu Jun 16 22:02:23 2022 +0000 |
tree | da86de748981dd96113865df11834b360d9da02b | |
parent | 7cd42366066bf852efd3ced513a9f678db929b57 [diff] | |
parent | dd67dd31f83d56d34f933f3ff0204baa55a68aac [diff] |
Snap for 8736029 from dd67dd31f83d56d34f933f3ff0204baa55a68aac to mainline-go-art-release Change-Id: Ie443dacdd801c2f960418d71d7c89a646bbf8975
“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();