-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathuninit.rs
29 lines (25 loc) · 1.05 KB
/
uninit.rs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
// Copyright (c) 2019-2020, The rav1e contributors. All rights reserved
//
// This source code is subject to the terms of the BSD 2 Clause License and
// the Alliance for Open Media Patent License 1.0. If the BSD 2 Clause License
// was not distributed with this source code in the LICENSE file, you can
// obtain it at www.aomedia.org/license/software. If the Alliance for Open
// Media Patent License 1.0 was not distributed with this source code in the
// PATENTS file, you can obtain it at www.aomedia.org/license/patent.
use std::mem::MaybeUninit;
pub fn init_slice_repeat_mut<T: Copy>(
slice: &'_ mut [MaybeUninit<T>], value: T,
) -> &'_ mut [T] {
// Fill all of slice
for a in slice.iter_mut() {
*a = MaybeUninit::new(value);
}
// Defined behavior, since all elements of slice are initialized
unsafe { assume_slice_init_mut(slice) }
}
/// Assume all the elements are initialized
pub unsafe fn assume_slice_init_mut<T: Copy>(
slice: &'_ mut [MaybeUninit<T>],
) -> &'_ mut [T] {
&mut *(slice as *mut [std::mem::MaybeUninit<T>] as *mut [T])
}