Struct SharedCell 

pub struct SharedCell<T>(/* private fields */);

Strong, shared ownership of T with interior mutability.

Implementations

impl<T> SharedCell<T>

pub fn new(value: T) -> Self

Wraps a value inside Rc<RefCell<..>>.

pub fn downgrade(&self) -> WeakCell<T>

Creates a WeakCell pointing to the same allocation.

pub fn borrow(&self) -> Ref<'_, T>

Immutable borrow of the inner value.

pub fn borrow_mut(&self) -> RefMut<'_, T>

Mutable borrow of the inner value.

pub fn try_borrow(&self) -> Result<Ref<'_, T>, BorrowError>

Attempts to immutably borrow the inner value.

Errors

Returns BorrowError if the value is currently mutably borrowed.

pub fn try_borrow_mut(&self) -> Result<RefMut<'_, T>, BorrowMutError>

Attempts to mutably borrow the inner value.

Errors

Returns BorrowMutError if the value is currently borrowed (mutably or immutably).

pub fn strong_count(&self) -> usize

Number of active strong references.

pub fn weak_count(&self) -> usize

Number of active weak references.

pub fn as_ptr(&self) -> *const RefCell<T>

Returns the raw pointer to the underlying cell, useful for identity diagnostics.

pub fn with<R>(&self, f: impl FnOnce(&T) -> R) -> R

Runs f against an immutable borrow of the inner value, returning its result.

The borrow is dropped at the end of the closure, so callers can safely follow the call with operations that re-enter the same cell (e.g. event dispatch).

pub fn with_mut<R>(&self, f: impl FnOnce(&mut T) -> R) -> R

Runs f against a mutable borrow of the inner value, returning its result.

The borrow is dropped at the end of the closure, so callers can safely follow the call with operations that re-enter the same cell.

Trait Implementations

impl<T> Clone for SharedCell<T>

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Debug> Debug for SharedCell<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T> Deref for SharedCell<T>

type Target = Rc<RefCell<T>>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<T> Eq for SharedCell<T>

impl<T> From<Rc<RefCell<T>>> for SharedCell<T>

fn from(inner: Rc<RefCell<T>>) -> Self

Converts to this type from the input type.

impl<T> From<SharedCell<T>> for Rc<RefCell<T>>

fn from(shared: SharedCell<T>) -> Self

Converts to this type from the input type.

impl<T> Hash for SharedCell<T>

fn hash<H: Hasher>(&self, state: &mut H)

Hashes the cell’s pointer address, consistent with the identity-based PartialEq impl.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T> PartialEq for SharedCell<T>

fn eq(&self, other: &Self) -> bool

Identity equality: two handles compare equal when they point to the same cell.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.