Struct Point 

pub struct Point<T, Extra = ()> { /* private fields */ }

Implementations

impl<T, Extra: 'static + Clone> Point<T, Extra>

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

impl<T, Extra: 'static> Point<T, Extra>

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<Extra>, Extra: 'static + Send + Sync + Clone> Point<T, Extra>

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

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

pub fn from_object(object: T) -> Self

impl<T: Object<Extra> + Clone, Extra: 'static + Send + Sync + Clone> Point<T, Extra>

pub fn from_object_extra(object: T, extra: Extra) -> Self

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

pub async fn fetch_ref(&mut self) -> Result<&T>

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

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

impl<T: FullHash<Extra> + Default, Extra: 'static> Point<T, Extra>

pub fn is_default(&self) -> bool

Trait Implementations

impl<T, Extra> Clone for Point<T, Extra>

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, Extra: 'static> Equivalent<Point<T, Extra>> for Point<U, Extra>

This implementation is the main goal of Equivalent: we assume transmuting the pointer is safe.

fn into_equivalent(self) -> Point<T, Extra>

Inverse of Equivalent::from_equivalent.

fn from_equivalent(point: Point<T, Extra>) -> Self

Inverse of Equivalent::into_equivalent.

impl<T: Object<Extra>, Extra: 'static + Send + Sync> Fetch for Point<T, Extra>

type T = T

type Extra = Extra

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)

fn extra(&self) -> &Self::Extra

impl<T, Extra> FetchBytes for Point<T, Extra>

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

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

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

impl<T, Extra> MaybeHasNiche for Point<T, Extra>

type MnArray = <Hash as MaybeHasNiche>::MnArray

impl<T: Object<Extra>, Extra: 'static + Send + Sync + Clone> Object<Extra> for Point<T, Extra>

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

fn point_extra(self, extra: Extra) -> Point<Self, Extra>

where Self: Clone, Extra: Send + Sync + Clone,

fn to_resolve(&self) -> Arc<dyn Resolve>

where Self: Clone,

impl<T, Extra> Ord for Point<T, Extra>

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, Extra, __I: ParseInput> Parse<__I> for Point<T, Extra>

where Self: ParseInline<__I>,

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

impl<T: Object<I::Extra>, I: PointInput<Extra: Send + Sync>> ParseInline<I> for Point<T, I::Extra>

fn parse_inline(input: &mut I) -> Result<Self>

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

fn parse_vec(input: I) -> Result<Vec<Self>>

impl<T, Extra> PartialEq for Point<T, Extra>

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, Extra> PartialOrd for Point<T, Extra>

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, Extra> Singular for Point<T, Extra>

fn hash(&self) -> Hash

impl<T, Extra> Size for Point<T, Extra>

const SIZE: usize = 32usize

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

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

const TAGS: Tags = T::TAGS

const HASH: Hash = _

impl<T, Extra> ToOutput for Point<T, Extra>

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

fn data_hash(&self) -> Hash

fn slice_to_output(slice: &[Self], output: &mut dyn Output)

where Self: Sized,

fn output<T: Output + Default>(&self) -> T

fn vec(&self) -> Vec<u8>

impl<T: Object<Extra>, Extra: 'static> Topological<Extra> for Point<T, Extra>

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

fn point_count(&self) -> usize

fn topology_hash(&self) -> Hash

fn topology(&self) -> TopoVec

impl<T, Extra> Eq for Point<T, Extra>

impl<T: Object<Extra>, Extra: 'static + Send + Sync + Clone> Inline<Extra> for Point<T, Extra>