Struct Point 

pub struct Point<T> { /* private fields */ }

Implementations

impl<T> Point<T>

pub fn raw(self) -> RawPoint<T>

impl<T> Point<T>

pub fn extract_resolve<R: Any>(&self) -> Option<(&Address, &R)>

impl<T: Object> Point<T>

pub fn from_address(address: Address, resolve: Arc<dyn Resolve>) -> Self

impl<T: Object + Clone> Point<T>

pub fn from_object(object: T) -> Self

pub async fn fetch_mut(&mut self) -> Result<PointMut<'_, T>>

impl<T: 'static + ToOutput> Point<T>

pub fn map<U>(self, f: impl 'static + Send + Sync + Fn(T) -> U) -> Point<U>

Trait Implementations

impl<T> Clone for Point<T>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<U: 'static + Equivalent<T>, T: 'static> Equivalent<Point<T>> for Point<U>

fn into_equivalent(self) -> Point<T>

fn from_equivalent(object: Point<T>) -> Self

impl<T: Object> Fetch for Point<T>

type T = T

fn fetch_full(&self) -> FailFuture<'_, (Self::T, Arc<dyn Resolve>)>

fn fetch(&self) -> FailFuture<'_, Self::T>

fn get(&self) -> Option<&Self::T>

fn get_mut(&mut self) -> Option<&mut Self::T>

fn get_mut_finalize(&mut self)

impl<T> FetchBytes for Point<T>

fn fetch_bytes(&self) -> FailFuture<'_, ByteNode>

fn extension(&self, typeid: TypeId) -> Result<&dyn Any>

fn as_inner(&self) -> Option<&dyn Any>

impl<T> MaybeHasNiche for Point<T>

type MnArray = SomeNiche<ZeroNiche<<Point<T> as Size>::Size>>

impl<T: Object> Object for Point<T>

fn full_hash(&self) -> Hash

fn extension(&self, typeid: TypeId) -> Result<&dyn Any>

impl<T> Ord for Point<T>

fn cmp(&self, other: &Self) -> 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, __I: ParseInput> Parse<__I> for Point<T>

where Self: ParseInline<__I>,

fn parse(input: __I) -> Result<Self>

impl<T: Object> ParseInline<Input<'_>> for Point<T>

fn parse_inline(input: &mut Input<'_>) -> Result<Self>

fn parse_as_inline(input: I) -> Result<Self>

impl<T> PartialEq for Point<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> PartialOrd for Point<T>

fn partial_cmp(&self, other: &Self) -> 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> Singular for Point<T>

fn hash(&self) -> &Hash

impl<T> Size for Point<T>

const SIZE: usize = 32usize

type Size = <Const<HASH_SIZE> as ToUInt>::Output

impl<T: Tagged> Tagged for Point<T>

const TAGS: Tags = T::TAGS

const HASH: Hash = _

impl<T> ToOutput for Point<T>

fn to_output(&self, output: &mut dyn Output)

fn data_hash(&self) -> Hash

impl<T: Object> Topological for Point<T>

fn accept_points(&self, visitor: &mut impl PointVisitor)

fn topology_hash(&self) -> Hash

fn topology(&self) -> TopoVec

impl<T> Eq for Point<T>

impl<T: Object> Inline for Point<T>