Struct BTreeMapStorage

pub struct BTreeMapStorage<T>(/* private fields */);

A helper type for defining Computations with BTreeMap-backed storage

Implementations

impl<T> BTreeMapStorage<T>

pub fn new(value: T) -> Self

Trait Implementations

impl<T: Clone> Clone for BTreeMapStorage<T>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T> Computation for BTreeMapStorage<T>

where T: Computation + Ord,

type Output = <T as Computation>::Output

type Storage = (BTreeMap<BTreeMapStorage<T>, Cell>, BTreeMap<Cell, (BTreeMapStorage<T>, Option<<BTreeMapStorage<T> as Computation>::Output>)>)

fn run(&self, handle: &mut DbHandle<'_, impl Computation>) -> Self::Output

fn input_to_cell( input: &Self, (self_to_cell, _): &Self::Storage, ) -> Option<Cell>

fn get_function_and_output( cell: Cell, (_, cell_to_output): &Self::Storage, ) -> (&Self, Option<&Self::Output>)

fn set_output( cell: Cell, new_output: Self::Output, (_, cell_to_output): &mut Self::Storage, )

fn insert_new_cell(cell: Cell, function: 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

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

fn dispatch_run<FullComputation: Computation>( cell: Cell, computation_id: u32, original_computation_id: u32, db: &mut Db<FullComputation>, ) -> bool

where Self: Clone, Self::Output: Eq,

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.

fn dispatch_update_output<Concrete, FullComputation>( cell: Cell, computation_id: u32, original_computation_id: u32, output: Concrete::Output, db: &mut Db<FullComputation>, ) -> bool

where Concrete: Computation, FullComputation: Computation, Self::Output: Eq,

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

where Concrete: 'static + Computation + Any, Concrete::Storage: 'static,

impl<T: Debug> Debug for BTreeMapStorage<T>

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

Formats the value using the given formatter.

impl<T: Default> Default for BTreeMapStorage<T>

fn default() -> BTreeMapStorage<T>

Returns the “default value” for a type.

impl<T: Hash> Hash for BTreeMapStorage<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: Ord> Ord for BTreeMapStorage<T>

fn cmp(&self, other: &BTreeMapStorage<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<T: PartialEq> PartialEq for BTreeMapStorage<T>

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

fn partial_cmp(&self, other: &BTreeMapStorage<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: Copy> Copy for BTreeMapStorage<T>

impl<T: Eq> Eq for BTreeMapStorage<T>

impl<T> StructuralPartialEq for BTreeMapStorage<T>