Struct RefMut

pub struct RefMut<'a, R: 'a> { /* private fields */ }

Implementations

impl<'a, R> RefMut<'a, R>

pub fn new(inner: CellRefMut<'a, dyn Resource>) -> Self

Trait Implementations

impl<'a, R> Deref for RefMut<'a, R>

where R: Resource,

type Target = R

The resulting type after dereferencing.

fn deref(&self) -> &R

Dereferences the value.

impl<'a, R> DerefMut for RefMut<'a, R>

where R: Resource,

fn deref_mut(&mut self) -> &mut R

Mutably dereferences the value.

impl<'a, 'b, T> Join for &'a mut RefMut<'b, T>

where &'a mut T: Join, T: Resource,

type Type = <&'a mut T as Join>::Type

Type of joined components.

type Value = <&'a mut T as Join>::Value

Type of joined storages.

type Mask = <&'a mut T as Join>::Mask

Type of joined bit mask.

unsafe fn open(self) -> (Self::Mask, Self::Value)

Open this join by returning the mask and the storages.

unsafe fn get(v: &mut Self::Value, i: Index) -> Self::Type

Get a joined component value by a given index.

fn is_unconstrained() -> bool

If this Join typically returns all indices in the mask, then iterating over only it or combined with other joins that are also dangerous will cause the JoinIter/ParJoin to go through all indices which is usually not what is wanted and will kill performance.

fn join(self) -> JoinIter<Self>

where Self: Sized,

Create a joined iterator over the contents.

fn maybe(self) -> MaybeJoin<Self>

where Self: Sized,

Returns a Join-able structure that yields all indices, returning None for all missing elements and Some(T) for found elements.

impl<'a, 'b, T> ParJoin for &'a mut RefMut<'b, T>

where &'a mut T: ParJoin, T: Resource,

fn par_join(self) -> JoinParIter<Self>

where Self: Sized,