pub struct Ref<'b, T>where
T: 'b + ?Sized,{ /* private fields */ }Expand description
Wraps a borrowed reference to a value in a RefCell box.
A wrapper type for an immutably borrowed value from a RefCell<T>.
See the module-level documentation for more.
Implementations§
Source§impl<'b, T> Ref<'b, T>where
T: ?Sized,
impl<'b, T> Ref<'b, T>where
T: ?Sized,
Sourcepub fn clone(orig: &Ref<'b, T>) -> Ref<'b, T>
pub fn clone(orig: &Ref<'b, T>) -> Ref<'b, T>
Copies a Ref.
The RefCell is already immutably borrowed, so this cannot fail.
This is an associated function that needs to be used as
Ref::clone(...). A Clone implementation or a method would interfere
with the widespread use of r.borrow().clone() to clone the contents of
a RefCell.
Sourcepub fn map<U, F>(orig: Ref<'b, T>, f: F) -> Ref<'b, U>
pub fn map<U, F>(orig: Ref<'b, T>, f: F) -> Ref<'b, U>
Makes a new Ref for a component of the borrowed data.
The RefCell is already immutably borrowed, so this cannot fail.
This is an associated function that needs to be used as Ref::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, Ref};
let c = RefCell::new((5, 'b'));
let b1: Ref<'_, (u32, char)> = c.borrow();
let b2: Ref<'_, u32> = Ref::map(b1, |t| &t.0);
assert_eq!(*b2, 5)Sourcepub fn filter_map<U, F>(
orig: Ref<'b, T>,
f: F,
) -> Result<Ref<'b, U>, Ref<'b, T>>
pub fn filter_map<U, F>( orig: Ref<'b, T>, f: F, ) -> Result<Ref<'b, U>, Ref<'b, T>>
Makes a new Ref 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 immutably borrowed, so this cannot fail.
This is an associated function that needs to be used as
Ref::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, Ref};
let c = RefCell::new(vec![1, 2, 3]);
let b1: Ref<'_, Vec<u32>> = c.borrow();
let b2: Result<Ref<'_, u32>, _> = Ref::filter_map(b1, |v| v.get(1));
assert_eq!(*b2.unwrap(), 2);Sourcepub fn map_split<U, V, F>(orig: Ref<'b, T>, f: F) -> (Ref<'b, U>, Ref<'b, V>)
pub fn map_split<U, V, F>(orig: Ref<'b, T>, f: F) -> (Ref<'b, U>, Ref<'b, V>)
Splits a Ref into multiple Refs for different components of the
borrowed data.
The RefCell is already immutably borrowed, so this cannot fail.
This is an associated function that needs to be used as
Ref::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::{Ref, RefCell};
let cell = RefCell::new([1, 2, 3, 4]);
let borrow = cell.borrow();
let (begin, end) = Ref::map_split(borrow, |slice| slice.split_at(2));
assert_eq!(*begin, [1, 2]);
assert_eq!(*end, [3, 4]);Trait Implementations§
Auto Trait Implementations§
impl<'b, T> !RefUnwindSafe for Ref<'b, T>
impl<'b, T> !Send for Ref<'b, T>
impl<'b, T> !Sync for Ref<'b, T>
impl<'b, T> !UnwindSafe for Ref<'b, T>
impl<'b, T> Freeze for Ref<'b, T>where
T: ?Sized,
impl<'b, T> Unpin for Ref<'b, T>where
T: ?Sized,
impl<'b, T> UnsafeUnpin for Ref<'b, T>where
T: ?Sized,
Blanket Implementations§
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
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