pub struct FactorialStorageDyn { /* private fields */ }
Expand description

Dynamical size factorial storage.

Used as a lazy cache for factorial number. This is not actually used and might be removed later.

Implementations§

source§

impl FactorialStorageDyn

source

pub const fn new() -> Self

Create a new object with an empty storage.

source

pub fn build_storage(&mut self, value: usize)

Build the storage up to and including value.

#Example

let mut f = FactorialStorageDyn::new();
f.build_storage(6);
assert_eq!(*f.try_factorial(6).unwrap(), 720);
source

pub fn factorial(&mut self, value: usize) -> u128

Get the factorial number. If it is not already computed build internal storage

Panic

panic if value is greater than MAX_NUMBER_FACTORIAL (34) in debug, overflows otherwise.

Example
let mut f = FactorialStorageDyn::new();
assert_eq!(f.factorial(6), 720);
assert_eq!(f.factorial(4), 24);
source

pub fn try_factorial(&self, value: usize) -> Option<&u128>

try get factorial from storage

#Example

let mut f = FactorialStorageDyn::new();
assert_eq!(f.factorial(4), 24);
assert_eq!(*f.try_factorial(4).unwrap(), 24);
assert_eq!(f.try_factorial(6), None);
source

pub fn factorial_no_storage(&self, value: usize) -> u128

Get factorial but does build the storage if it is missing #Example

let mut f = FactorialStorageDyn::new();
assert_eq!(f.factorial(4), 24);
assert_eq!(f.factorial_no_storage(6), 720);
assert_eq!(f.try_factorial(6), None);

Trait Implementations§

source§

impl Clone for FactorialStorageDyn

source§

fn clone(&self) -> FactorialStorageDyn

Returns a copy of the value. Read more
1.0.0 · source§

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

Performs copy-assignment from source. Read more
source§

impl Debug for FactorialStorageDyn

source§

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

Formats the value using the given formatter. Read more
source§

impl Default for FactorialStorageDyn

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl Hash for FactorialStorageDyn

source§

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher. Read more
1.3.0 · source§

fn hash_slice<H>(data: &[Self], state: &mut H)where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher. Read more
source§

impl PartialEq<FactorialStorageDyn> for FactorialStorageDyn

source§

fn eq(&self, other: &FactorialStorageDyn) -> bool

This method tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

impl Eq for FactorialStorageDyn

source§

impl StructuralEq for FactorialStorageDyn

source§

impl StructuralPartialEq for FactorialStorageDyn

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

const: unstable · source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for Twhere U: From<T>,

const: unstable · source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

§

impl<T> Pointable for T

§

const ALIGN: usize = mem::align_of::<T>()

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
source§

impl<T> Same<T> for T

§

type Output = T

Should always be Self
§

impl<SS, SP> SupersetOf<SS> for SPwhere SS: SubsetOf<SP>,

§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
source§

impl<T> ToOwned for Twhere T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
const: unstable · source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
const: unstable · source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for Twhere V: MultiLane<T>,

§

fn vzip(self) -> V

source§

impl<T> Scalar for Twhere T: 'static + Clone + PartialEq<T> + Debug,