Struct Local 

pub struct Local<T>(pub T);

Tuple Fields

0: T

Trait Implementations

impl<T: Clone> Clone for Local<T>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Copy> Copy for Local<T>

impl<T: Debug> Debug for Local<T>

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

Formats the value using the given formatter.

impl<T: Default> Default for Local<T>

fn default() -> Local<T>

Returns the “default value” for a type.

impl<T> Deref for Local<T>

type Target = T

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<T> DerefMut for Local<T>

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.

impl<T: Eq> Eq for Local<T>

impl<T: Traversible + Clone> Fetch for Local<T>

type T = T

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

fn try_fetch_local(&self) -> Result<Option<Node<Self::T>>>

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

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

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

fn try_unwrap(self: Arc<Self>) -> Option<Self::T>

fn get_mut_finalize(&mut self)

fn into_dyn_fetch<'a>(self) -> Arc<dyn Fetch<T = Self::T> + 'a>

where Self: 'a + Sized,

impl<T: Traversible> FetchBytes for Local<T>

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

fn fetch_data(&self) -> FailFuture<'_, Vec<u8>>

fn fetch_bytes_local(&self) -> Result<Option<ByteNode>>

fn fetch_data_local(&self) -> Option<Vec<u8>>

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

fn as_resolve(&self) -> Option<&Arc<dyn Resolve>>

fn try_unwrap_resolve(self: Arc<Self>) -> Option<Arc<dyn Resolve>>

impl<T> From<T> for Local<T>

fn from(object: T) -> Self

Converts to this type from the input type.

impl<T: Hash> Hash for Local<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, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T> InlineOutput for Local<T>

where T: InlineOutput,

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

where Self: Sized,

impl<T> ListHashes for Local<T>

where T: ListHashes,

fn list_hashes(&self, visitor: &mut impl FnMut(Hash))

fn topology_hash(&self) -> Hash

fn point_count(&self) -> usize

impl<T> MaybeHasNiche for Local<T>

where T: MaybeHasNiche<MnArray: MnArray<MaybeNiche: MaybeNiche>>,

type MnArray = TArr<<<T as MaybeHasNiche>::MnArray as MnArray>::MaybeNiche, ATerm>

Should implement [MnArray]. Not constraint explicitly, because that breaks things.

impl<T: Ord> Ord for Local<T>

fn cmp(&self, other: &Local<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.

fn clamp_to<R>(self, range: R) -> Self

where Self: Sized, R: ClampBounds<Self>,

🔬This is a nightly-only experimental API. (clamp_to)

Restrict a value to a certain range.

impl<T, __I: ParseInput> Parse<__I> for Local<T>

where T: Parse<__I>,

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

Parse consuming the whole stream.

impl<T, __I: ParseInput> ParseInline<__I> for Local<T>

where T: ParseInline<__I>,

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

Parse without consuming the whole stream. Errors on unexpected EOF.

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

For implementing Parse::parse.

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

Parse a Vec of Self. Customisable for optimisations.

fn parse_vec_n(input: &mut I, n: usize) -> Result<Vec<Self>>

Parse a Vec of Self of length n. Customisable for optimisations.

fn parse_array<const N: usize>(input: &mut I) -> Result<[Self; N]>

Parse an array of Self. Customisable for optimisations.

fn parse_generic_array<N: ArrayLength>( input: &mut I, ) -> Result<GenericArray<Self, N>>

Parse a GenericArray of Self. Customisable for optimisations.

impl<T: PartialEq> PartialEq for Local<T>

fn eq(&self, other: &Local<T>) -> bool

Equality operator ==.

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

Inequality operator !=.

impl<T: PartialOrd> PartialOrd for Local<T>

fn partial_cmp(&self, other: &Local<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: Traversible> Singular for Local<T>

fn hash(&self) -> Hash

impl<T> Size for Local<T>

where Self: SizeSumHelper<SizeArray: FoldAdd<Output: Unsigned>>,

const SIZE: usize = <Self as ::object_rainbow::SizeSumHelper>::SIZE_ARRAY

type Size = <<Local<T> as SizeSumHelper>::SizeArray as FoldAdd>::Output

impl<T: PartialEq> StructuralPartialEq for Local<T>

impl<T> Tagged for Local<T>

where T: Tagged,

const TAGS: Tags = <T as ::object_rainbow::Tagged>::TAGS

const HASH: Hash = _

impl<T> ToOutput for Local<T>

where T: ToOutput,

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

fn data_hash(&self) -> Hash

fn mangle_hash(&self) -> Hash

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

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

impl<T> Topological for Local<T>

where T: Topological,

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

fn topology(&self) -> TopoVec

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