Struct CellElem

pub struct CellElem<T>
where
    T: Copy + PartialEq,
{
    pub cell: Cell<T>,
}

Cell is much cheaper than RefCell, used to store basic types

Fields

cell: Cell<T>

Implementations

impl<T> CellElem<T>

where T: Copy + PartialEq,

pub fn into_inner(self) -> T

pub fn slice_into_inner<U>(inner_slice: &[CellElem<T>]) -> &[U]

pub fn slice_into_inner_mut<U>(inner_slice: &mut [CellElem<T>]) -> &mut [U]

pub fn slice_ref_into_inner<U>( inner_slice: Ref<'_, [CellElem<T>]>, ) -> Ref<'_, [U]>

pub fn slice_ref_into_inner_mut<U>( inner_slice: RefMut<'_, [CellElem<T>]>, ) -> RefMut<'_, [U]>

Trait Implementations

impl<T> Clone for CellElem<T>

where T: Clone + Copy + PartialEq,

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T> Debug for CellElem<T>

where T: Debug + Copy + PartialEq,

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

Formats the value using the given formatter.

impl<T> Element for CellElem<T>

where T: CellData,

fn from_value(val: GosValue) -> CellElem<T>

fn into_value(self, t: ValueType) -> GosValue

fn set_value(&self, val: &GosValue)

fn copy_or_clone_slice(dst: &mut [CellElem<T>], src: &[CellElem<T>])

fn need_gc() -> bool

impl<T> Hash for CellElem<T>

where T: CellData,

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

where H: Hasher,

Feeds this value into the given Hasher.

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> Ord for CellElem<T>

where T: Ord + Copy + PartialEq,

fn cmp(&self, other: &CellElem<T>) -> Ordering

This method returns an Ordering between self and other.

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

where Self: Sized,

Compares and returns the maximum of two values.

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

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<T> PartialEq for CellElem<T>

where T: PartialEq + Copy,

fn eq(&self, other: &CellElem<T>) -> 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> PartialOrd for CellElem<T>

where T: PartialOrd + Copy + PartialEq,

fn partial_cmp(&self, other: &CellElem<T>) -> Option<Ordering>

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

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

Tests less than (for self and other) and is used by the < operator.

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

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

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

Tests greater than (for self and other) and is used by the > operator.

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

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

impl<T> Eq for CellElem<T>

where T: Eq + Copy + PartialEq,

impl<T> StructuralPartialEq for CellElem<T>

where T: Copy + PartialEq,