pub struct RefMut<'b, T>where
T: 'b + ?Sized,{ /* private fields */ }
dep_bytemuck
only.Expand description
A wrapper type for a mutably borrowed value from a RefCell<T>
.
See the module-level documentation for more.
Implementations§
Source§impl<'b, T> RefMut<'b, T>where
T: ?Sized,
impl<'b, T> RefMut<'b, T>where
T: ?Sized,
1.8.0 · Sourcepub fn map<U, F>(orig: RefMut<'b, T>, f: F) -> RefMut<'b, U>
pub fn map<U, F>(orig: RefMut<'b, T>, f: F) -> RefMut<'b, U>
Makes a new RefMut
for a component of the borrowed data, e.g., an enum
variant.
The RefCell
is already mutably borrowed, so this cannot fail.
This is an associated function that needs to be used as
RefMut::map(...)
. A method would interfere with methods of the same
name on the contents of a RefCell
used through Deref
.
§Examples
use std::cell::{RefCell, RefMut};
let c = RefCell::new((5, 'b'));
{
let b1: RefMut<'_, (u32, char)> = c.borrow_mut();
let mut b2: RefMut<'_, u32> = RefMut::map(b1, |t| &mut t.0);
assert_eq!(*b2, 5);
*b2 = 42;
}
assert_eq!(*c.borrow(), (42, 'b'));
1.63.0 · Sourcepub fn filter_map<U, F>(
orig: RefMut<'b, T>,
f: F,
) -> Result<RefMut<'b, U>, RefMut<'b, T>> ⓘ
pub fn filter_map<U, F>( orig: RefMut<'b, T>, f: F, ) -> Result<RefMut<'b, U>, RefMut<'b, T>> ⓘ
Makes a new RefMut
for an optional component of the borrowed data. The
original guard is returned as an Err(..)
if the closure returns
None
.
The RefCell
is already mutably borrowed, so this cannot fail.
This is an associated function that needs to be used as
RefMut::filter_map(...)
. A method would interfere with methods of the
same name on the contents of a RefCell
used through Deref
.
§Examples
use std::cell::{RefCell, RefMut};
let c = RefCell::new(vec![1, 2, 3]);
{
let b1: RefMut<'_, Vec<u32>> = c.borrow_mut();
let mut b2: Result<RefMut<'_, u32>, _> = RefMut::filter_map(b1, |v| v.get_mut(1));
if let Ok(mut b2) = b2 {
*b2 += 2;
}
}
assert_eq!(*c.borrow(), vec![1, 4, 3]);
1.35.0 · Sourcepub fn map_split<U, V, F>(
orig: RefMut<'b, T>,
f: F,
) -> (RefMut<'b, U>, RefMut<'b, V>) ⓘ
pub fn map_split<U, V, F>( orig: RefMut<'b, T>, f: F, ) -> (RefMut<'b, U>, RefMut<'b, V>) ⓘ
Splits a RefMut
into multiple RefMut
s for different components of the
borrowed data.
The underlying RefCell
will remain mutably borrowed until both
returned RefMut
s go out of scope.
The RefCell
is already mutably borrowed, so this cannot fail.
This is an associated function that needs to be used as
RefMut::map_split(...)
. A method would interfere with methods of the
same name on the contents of a RefCell
used through Deref
.
§Examples
use std::cell::{RefCell, RefMut};
let cell = RefCell::new([1, 2, 3, 4]);
let borrow = cell.borrow_mut();
let (mut begin, mut end) = RefMut::map_split(borrow, |slice| slice.split_at_mut(2));
assert_eq!(*begin, [1, 2]);
assert_eq!(*end, [3, 4]);
begin.copy_from_slice(&[4, 3]);
end.copy_from_slice(&[2, 1]);
Sourcepub fn leak(orig: RefMut<'b, T>) -> &'b mut T
🔬This is a nightly-only experimental API. (cell_leak
)
pub fn leak(orig: RefMut<'b, T>) -> &'b mut T
cell_leak
)Converts into a mutable reference to the underlying data.
The underlying RefCell
can not be borrowed from again and will always appear already
mutably borrowed, making the returned reference the only to the interior.
This is an associated function that needs to be used as
RefMut::leak(...)
. A method would interfere with methods of the
same name on the contents of a RefCell
used through Deref
.
§Examples
#![feature(cell_leak)]
use std::cell::{RefCell, RefMut};
let cell = RefCell::new(0);
let value = RefMut::leak(cell.borrow_mut());
assert_eq!(*value, 0);
*value = 1;
assert!(cell.try_borrow_mut().is_err());
Trait Implementations§
impl<'b, T, U> CoerceUnsized<RefMut<'b, U>> for RefMut<'b, T>
impl<T> DerefPure for RefMut<'_, T>where
T: ?Sized,
impl<'b, T> PinCoerceUnsized for RefMut<'b, T>where
T: ?Sized,
Auto Trait Implementations§
impl<'b, T> Freeze for RefMut<'b, T>where
T: ?Sized,
impl<'b, T> !RefUnwindSafe for RefMut<'b, T>
impl<'b, T> !Send for RefMut<'b, T>
impl<'b, T> !Sync for RefMut<'b, T>
impl<'b, T> Unpin for RefMut<'b, T>where
T: ?Sized,
impl<'b, T> !UnwindSafe for RefMut<'b, T>
Blanket Implementations§
§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
§type ArchivedMetadata = ()
type ArchivedMetadata = ()
§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> ByteSized for T
impl<T> ByteSized for T
Source§const BYTE_ALIGN: usize = _
const BYTE_ALIGN: usize = _
Source§fn byte_align(&self) -> usize ⓘ
fn byte_align(&self) -> usize ⓘ
Source§fn ptr_size_ratio(&self) -> [usize; 2]
fn ptr_size_ratio(&self) -> [usize; 2]
Source§impl<T, R> Chain<R> for Twhere
T: ?Sized,
impl<T, R> Chain<R> for Twhere
T: ?Sized,
Source§impl<T> ExtAny for T
impl<T> ExtAny for T
Source§fn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
fn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
Source§impl<T> ExtMem for Twhere
T: ?Sized,
impl<T> ExtMem for Twhere
T: ?Sized,
Source§const NEEDS_DROP: bool = _
const NEEDS_DROP: bool = _
Source§fn mem_align_of_val(&self) -> usize ⓘ
fn mem_align_of_val(&self) -> usize ⓘ
Source§fn mem_size_of_val(&self) -> usize ⓘ
fn mem_size_of_val(&self) -> usize ⓘ
Source§fn mem_needs_drop(&self) -> bool
fn mem_needs_drop(&self) -> bool
true
if dropping values of this type matters. Read moreSource§fn mem_forget(self)where
Self: Sized,
fn mem_forget(self)where
Self: Sized,
self
without running its destructor. Read moreSource§fn mem_replace(&mut self, other: Self) -> Selfwhere
Self: Sized,
fn mem_replace(&mut self, other: Self) -> Selfwhere
Self: Sized,
Source§unsafe fn mem_zeroed<T>() -> T
unsafe fn mem_zeroed<T>() -> T
unsafe_layout
only.T
represented by the all-zero byte-pattern. Read moreSource§unsafe fn mem_transmute_copy<Src, Dst>(src: &Src) -> Dst
unsafe fn mem_transmute_copy<Src, Dst>(src: &Src) -> Dst
unsafe_layout
only.T
represented by the all-zero byte-pattern. Read moreSource§fn mem_as_bytes(&self) -> &[u8] ⓘ
fn mem_as_bytes(&self) -> &[u8] ⓘ
unsafe_slice
only.§impl<S> FromSample<S> for S
impl<S> FromSample<S> for S
fn from_sample_(s: S) -> S
Source§impl<T> Hook for T
impl<T> Hook for T
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more§impl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
impl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
fn into_sample(self) -> T
§impl<T> LayoutRaw for T
impl<T> LayoutRaw for T
§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError> ⓘ
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError> ⓘ
§impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
§unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
out
indicating that a T
is niched.