commit | 1aa2aabf1bb33d5808fd5c4ec64d6c7980564d4b | [log] [tgz] |
---|---|---|
author | Android Build Coastguard Worker <android-build-coastguard-worker@google.com> | Wed May 10 16:19:38 2023 +0000 |
committer | Android Build Coastguard Worker <android-build-coastguard-worker@google.com> | Wed May 10 16:19:38 2023 +0000 |
tree | 40c1ec7f8824c6f65686d9ffb768102f82961542 | |
parent | 2ce73eea87049957a7b48fc54bbc303fa3d57996 [diff] | |
parent | 495bd26a973c32834671073f381f373d2c5b407b [diff] |
Snap for 10103804 from 495bd26a973c32834671073f381f373d2c5b407b to mainline-tzdata5-release Change-Id: I6916d3d48c5e1fee065a5749c6c8d02ad212ff40
“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();