Struct gazebo::cell::ARef

pub struct ARef<'a, T: ?Sized + 'a> { /* private fields */ }

A Ref that might not actually be borrowed. Either a Ptr (a normal & style reference), or a Ref (like from RefCell), but exposes all the methods available on Ref.

Implementations

impl<'a, T: ?Sized + 'a> ARef<'a, T>

pub fn new_ptr(x: &'a T) -> Self

Create a new ARef from a pointer.

pub fn new_ref(x: Ref<'a, T>) -> Self

Create a new ARef from a reference.

pub fn clone(orig: &Self) -> Self

See Ref.clone. Not a self method since that interferes with the Deref.

pub fn map<U: ?Sized, F>(orig: ARef<'a, T>, f: F) -> ARef<'a, U>where
    F: FnOnce(&T) -> &U,

See Ref.map. Not a self method since that interferes with the Deref.

pub fn map_split<U: ?Sized, V: ?Sized, F>(
    orig: ARef<'a, T>,
    f: F
) -> (ARef<'a, U>, ARef<'a, V>)where
    F: FnOnce(&T) -> (&U, &V),

See Ref.map_split. Not a self method since that interferes with the Deref.

pub fn filter_map<U: ?Sized, F>(
    orig: ARef<'a, T>,
    f: F
) -> Result<ARef<'a, U>, Self>where
    F: FnOnce(&T) -> Option<&U>,

See Ref.filter_map. Not a self method since that interferes with the Deref.

Trait Implementations

impl<'a, T: Debug + ?Sized + 'a> Debug for ARef<'a, T>

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

Formats the value using the given formatter.

impl<T: ?Sized> Deref for ARef<'_, T>

type Target = T

The resulting type after dereferencing.

fn deref(&self) -> &T

Dereferences the value.

impl<T: Display + ?Sized> Display for ARef<'_, T>

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

Formats the value using the given formatter.

impl<T: ?Sized> Drop for ARef<'_, T>

fn drop(&mut self)

Executes the destructor for this type.

impl<T: Hash + ?Sized> Hash for ARef<'_, T>

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

Feeds this value into the given Hasher.

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

Feeds a slice of this type into the given Hasher.

impl<A: Ord + ?Sized> Ord for ARef<'_, A>

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

const fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

const fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

const fn clamp(self, min: Self, max: Self) -> Selfwhere
    Self: PartialOrd<Self>,

Restrict a value to a certain interval.

impl<A: PartialEq<B> + ?Sized, B: ?Sized> PartialEq<ARef<'_, B>> for ARef<'_, A>

fn eq(&self, other: &ARef<'_, B>) -> bool

This method tests for self and other values to be equal, and is used by ==.

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

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

impl<A: PartialOrd<B> + ?Sized, B: ?Sized> PartialOrd<ARef<'_, B>> for ARef<'_, A>

fn partial_cmp(&self, other: &ARef<'_, B>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<A: Eq + ?Sized> Eq for ARef<'_, A>