Struct CArc 

pub struct CArc<T: 'static> { /* private fields */ }

Reference-counting pointer based on Arc<RwLock<T>> with methods for access wrapped data from asynchronous code

Implementations

impl<T: 'static> CArc<T>

pub fn new(object: T) -> Self

pub fn new_cyclic<F>(data_fn: F) -> Self

where F: FnOnce(WCArc<T>) -> T,

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

pub fn id(&self) -> usize

impl<T: 'static> CArc<T>

pub fn async_call<R, F: FnOnce(&T) -> R>(&self, f: F) -> impl Future<Output = R>

pub fn async_call_mut<R, F: FnOnce(&mut T) -> R>( &self, f: F, ) -> impl Future<Output = R>

pub fn call<R, F: FnOnce(&T) -> R>(&self, f: F) -> R

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

Trait Implementations

impl<T: 'static> Clone for CArc<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: 'static> PartialEq for CArc<T>

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

Tests for self and other values to be equal, and is used by ==.

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

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