Struct Stored 

pub struct Stored<S, T> { /* private fields */ }

Implementations

impl<S, T> Stored<S, T>

pub fn load(&self) -> &Point<T>

impl<S: RainbowStore, T: Traversible> Stored<S, T>

pub async fn replace(&mut self, point: Point<T>) -> Result<Point<T>>

pub async fn new(store: S, point: Point<T>) -> Result<Self>

Trait Implementations

impl<S: Clone, T: Clone> Clone for Stored<S, T>

fn clone(&self) -> Stored<S, T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<S: Hash, T: Hash> Hash for Stored<S, 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<S, T> InlineOutput for Stored<S, T>

where Point<T>: InlineOutput, S: InlineOutput,

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

where Self: Sized,

impl<S: ListHashes, T> ListHashes for Stored<S, T>

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

fn topology_hash(&self) -> Hash

fn point_count(&self) -> usize

impl<S, T> MaybeHasNiche for Stored<S, T>

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

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

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

impl<S: Ord, T: Ord> Ord for Stored<S, T>

fn cmp(&self, other: &Stored<S, 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<S: RainbowStore + Parse<I>, T: 'static + FullHash + Parse<I>, I: PointInput<Extra: Send + Sync + ExtraFor<T>>> Parse<I> for Stored<S, T>

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

Parse consuming the whole stream.

impl<S: RainbowStore + ParseInline<I>, T: 'static + FullHash + Parse<I>, I: PointInput<Extra: Send + Sync + ExtraFor<T>>> ParseInline<I> for Stored<S, T>

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, Error>

For implementing Parse::parse.

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

Parse a Vec of Self. Customisable for optimisations.

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

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

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

Parse an array of Self. Customisable for optimisations.

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

where N: ArrayLength,

Parse a GenericArray of Self. Customisable for optimisations.

impl<S: PartialEq, T: PartialEq> PartialEq for Stored<S, T>

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

fn partial_cmp(&self, other: &Stored<S, 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<S, T> Size for Stored<S, T>

where Point<T>: Size, S: Size, TArr<U0, TArr<<Point<T> as Size>::Size, TArr<<S as Size>::Size, ATerm>>>: FoldAdd<Output: Unsigned>,

const SIZE: usize

type Size = <TArr<UTerm, TArr<<Point<T> as Size>::Size, TArr<<S as Size>::Size, ATerm>>> as FoldAdd>::Output

impl<S, T> Tagged for Stored<S, T>

where Point<T>: Tagged, S: Tagged,

const TAGS: Tags

const HASH: Hash = _

impl<S, T> ToOutput for Stored<S, T>

where Point<T>: InlineOutput, S: ToOutput,

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

fn data_hash(&self) -> Hash

fn mangle_hash(&self) -> Hash

fn output<T>(&self) -> T

where T: Output + Default,

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

impl<S: Topological, T> Topological for Stored<S, T>

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

fn topology(&self) -> Vec<Arc<dyn Singular>>

impl<S: Eq, T: Eq> Eq for Stored<S, T>

impl<S, T> StructuralPartialEq for Stored<S, T>