Struct RcRecursion 

#[repr(transparent)]
pub struct RcRecursion<T>(pub Weak<RefCell<Option<T>>>);

The possibly recursive reference to the parent anchor that must be RcRecursive. See RcRecursive for code example.

Tuple Fields

0: Weak<RefCell<Option<T>>>

Implementations

impl<T> RcRecursion<T>

pub fn upgrade(&self) -> Option<RcRecursive<T>>

Try to upgrade the weak reference to RcRecursive<T>.

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

Access the recursive value in one step, if it is still alive.

pub fn is_dangling(&self) -> bool

Returns true if the underlying value has been dropped (no strong refs remain).

Trait Implementations

impl<T: Clone> Clone for RcRecursion<T>

fn clone(&self) -> RcRecursion<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T> Debug for RcRecursion<T>

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

Formats the value using the given formatter.

impl<'de, T> Deserialize<'de> for RcRecursion<T>

where T: Deserialize<'de> + 'static,

Available on crate feature deserialize only.

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T> From<&RcRecursive<T>> for RcRecursion<T>

fn from(rca: &RcRecursive<T>) -> Self

Converts to this type from the input type.

impl<T> PartialEq for RcRecursion<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.

impl<T: Serialize> Serialize for RcRecursion<T>

fn serialize<S: Serializer>(&self, s: S) -> Result<S::Ok, S::Error>

Serialize this value into the given Serde serializer.

impl<T> Eq for RcRecursion<T>