pub struct SingletonStorage<T>(/* private fields */);Expand description
Helper to define a Computation for a simple input type which has no fields and thus does not require a HashMap to cache each possible value.
Examples include struct SourceFile; or struct Time;
Implementations§
Source§impl<T> SingletonStorage<T>
impl<T> SingletonStorage<T>
Trait Implementations§
Source§impl<T: Clone> Clone for SingletonStorage<T>
impl<T: Clone> Clone for SingletonStorage<T>
Source§fn clone(&self) -> SingletonStorage<T>
fn clone(&self) -> SingletonStorage<T>
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl<T: Computation> Computation for SingletonStorage<T>
impl<T: Computation> Computation for SingletonStorage<T>
type Output = <T as Computation>::Output
type Storage = (Option<Cell>, SingletonStorage<T>, Option<<SingletonStorage<T> as Computation>::Output>)
fn run(&self, handle: &mut DbHandle<'_, impl Computation>) -> Self::Output
fn input_to_cell(_: &Self, storage: &Self::Storage) -> Option<Cell>
fn get_function_and_output( _: Cell, storage: &Self::Storage, ) -> (&Self, Option<&Self::Output>)
fn set_output(_: Cell, new_output: Self::Output, storage: &mut Self::Storage)
fn insert_new_cell(cell: Cell, this: Self, storage: &mut Self::Storage)
fn computation_id_of<T: Computation>() -> u32
fn get_storage<Concrete: Computation + 'static>( computation_id: u32, container: &Self::Storage, ) -> &Concrete::Storage
fn get_storage_mut<Concrete: Computation + 'static>( computation_id: u32, container: &mut Self::Storage, ) -> &mut Concrete::Storage
Source§fn output_is_unset<FullComputation: Computation>(
cell: Cell,
computation_id: u32,
original_computation_id: u32,
db: &Db<FullComputation>,
) -> bool
fn output_is_unset<FullComputation: Computation>( cell: Cell, computation_id: u32, original_computation_id: u32, db: &Db<FullComputation>, ) -> bool
True if this has any cached output
Source§fn dispatch_run<FullComputation: Computation>(
cell: Cell,
computation_id: u32,
original_computation_id: u32,
db: &mut Db<FullComputation>,
) -> bool
fn dispatch_run<FullComputation: Computation>( cell: Cell, computation_id: u32, original_computation_id: u32, db: &mut Db<FullComputation>, ) -> bool
Given a Cell, TypeId pair dispatch to the correct run function
and return true if the value has changed. This should also cache
the new value if it has changed.
Note that in dispatch functions
Self is always the concrete, non-tuple type.Source§fn dispatch_update_output<Concrete, FullComputation>(
cell: Cell,
computation_id: u32,
original_computation_id: u32,
output: Concrete::Output,
db: &mut Db<FullComputation>,
) -> bool
fn dispatch_update_output<Concrete, FullComputation>( cell: Cell, computation_id: u32, original_computation_id: u32, output: Concrete::Output, db: &mut Db<FullComputation>, ) -> bool
Dispatch to the correct update_output function to cache the new output
and return true if the value has changed.
Note that in dispatch functions
Self is the current type being dispatched,
Concrete, if present, is the non-tuple type of the target computation,
and FullComputation is the type of the Db computation parameter which is
usually a tuple of every possible computation.fn dispatch_input_to_cell<Concrete>(
input: &Concrete,
container: &Self::Storage,
) -> Option<Cell>where
Concrete: 'static + Computation + Any,
fn dispatch_insert_new_cell<Concrete>( cell: Cell, input: Concrete, storage: &mut Self::Storage, )
Source§impl<T: Debug> Debug for SingletonStorage<T>
impl<T: Debug> Debug for SingletonStorage<T>
Source§impl<T: Default> Default for SingletonStorage<T>
impl<T: Default> Default for SingletonStorage<T>
Source§fn default() -> SingletonStorage<T>
fn default() -> SingletonStorage<T>
Returns the “default value” for a type. Read more
Source§impl<T: Ord> Ord for SingletonStorage<T>
impl<T: Ord> Ord for SingletonStorage<T>
Source§fn cmp(&self, other: &SingletonStorage<T>) -> Ordering
fn cmp(&self, other: &SingletonStorage<T>) -> Ordering
1.21.0 · Source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the maximum of two values. Read more
Source§impl<T: PartialEq> PartialEq for SingletonStorage<T>
impl<T: PartialEq> PartialEq for SingletonStorage<T>
Source§impl<T: PartialOrd> PartialOrd for SingletonStorage<T>
impl<T: PartialOrd> PartialOrd for SingletonStorage<T>
impl<T: Copy> Copy for SingletonStorage<T>
impl<T: Eq> Eq for SingletonStorage<T>
impl<T> StructuralPartialEq for SingletonStorage<T>
Auto Trait Implementations§
impl<T> Freeze for SingletonStorage<T>where
T: Freeze,
impl<T> RefUnwindSafe for SingletonStorage<T>where
T: RefUnwindSafe,
impl<T> Send for SingletonStorage<T>where
T: Send,
impl<T> Sync for SingletonStorage<T>where
T: Sync,
impl<T> Unpin for SingletonStorage<T>where
T: Unpin,
impl<T> UnwindSafe for SingletonStorage<T>where
T: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.