| commit | 3f61819c8f370a1ef8a3a795f6f964a0ef05046c | [log] [tgz] |
|---|---|---|
| author | Android Build Coastguard Worker <[email protected]> | Fri Jul 07 01:04:36 2023 +0000 |
| committer | Android Build Coastguard Worker <[email protected]> | Fri Jul 07 01:04:36 2023 +0000 |
| tree | 40c1ec7f8824c6f65686d9ffb768102f82961542 | |
| parent | 344ae1798808cdbae31e1c3e28985edefc88b001 [diff] | |
| parent | 495bd26a973c32834671073f381f373d2c5b407b [diff] |
Snap for 10447354 from 495bd26a973c32834671073f381f373d2c5b407b to mainline-cellbroadcast-release Change-Id: I2be2b329f2b8c74b3a76a89856f28acc66baabca
“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();