pub struct Cache(/* private fields */);Expand description
Implementations§
Source§impl Cache
impl Cache
Sourcepub fn store_scalar(&mut self, sid: ScalarID, value: Float)
pub fn store_scalar(&mut self, sid: ScalarID, value: Float)
Store a scalar value with the corresponding ScalarID.
Sourcepub fn store_complex_scalar(
&mut self,
csid: ComplexScalarID,
value: Complex<Float>,
)
pub fn store_complex_scalar( &mut self, csid: ComplexScalarID, value: Complex<Float>, )
Store a complex scalar value with the corresponding ComplexScalarID.
Sourcepub fn store_vector<const R: usize>(
&mut self,
vid: VectorID<R>,
value: SVector<Float, R>,
)
pub fn store_vector<const R: usize>( &mut self, vid: VectorID<R>, value: SVector<Float, R>, )
Store a vector with the corresponding VectorID.
Sourcepub fn store_complex_vector<const R: usize>(
&mut self,
cvid: ComplexVectorID<R>,
value: SVector<Complex<Float>, R>,
)
pub fn store_complex_vector<const R: usize>( &mut self, cvid: ComplexVectorID<R>, value: SVector<Complex<Float>, R>, )
Store a complex-valued vector with the corresponding ComplexVectorID.
Sourcepub fn store_matrix<const R: usize, const C: usize>(
&mut self,
mid: MatrixID<R, C>,
value: SMatrix<Float, R, C>,
)
pub fn store_matrix<const R: usize, const C: usize>( &mut self, mid: MatrixID<R, C>, value: SMatrix<Float, R, C>, )
Store a matrix with the corresponding MatrixID.
Sourcepub fn store_complex_matrix<const R: usize, const C: usize>(
&mut self,
cmid: ComplexMatrixID<R, C>,
value: SMatrix<Complex<Float>, R, C>,
)
pub fn store_complex_matrix<const R: usize, const C: usize>( &mut self, cmid: ComplexMatrixID<R, C>, value: SMatrix<Complex<Float>, R, C>, )
Store a complex-valued matrix with the corresponding ComplexMatrixID.
Sourcepub fn get_scalar(&self, sid: ScalarID) -> Float
pub fn get_scalar(&self, sid: ScalarID) -> Float
Retrieve a scalar value from the Cache.
Sourcepub fn get_complex_scalar(&self, csid: ComplexScalarID) -> Complex<Float>
pub fn get_complex_scalar(&self, csid: ComplexScalarID) -> Complex<Float>
Retrieve a complex scalar value from the Cache.
Sourcepub fn get_vector<const R: usize>(&self, vid: VectorID<R>) -> SVector<Float, R>
pub fn get_vector<const R: usize>(&self, vid: VectorID<R>) -> SVector<Float, R>
Retrieve a vector from the Cache.
Sourcepub fn get_complex_vector<const R: usize>(
&self,
cvid: ComplexVectorID<R>,
) -> SVector<Complex<Float>, R>
pub fn get_complex_vector<const R: usize>( &self, cvid: ComplexVectorID<R>, ) -> SVector<Complex<Float>, R>
Retrieve a complex-valued vector from the Cache.
Sourcepub fn get_matrix<const R: usize, const C: usize>(
&self,
mid: MatrixID<R, C>,
) -> SMatrix<Float, R, C>
pub fn get_matrix<const R: usize, const C: usize>( &self, mid: MatrixID<R, C>, ) -> SMatrix<Float, R, C>
Retrieve a matrix from the Cache.
Sourcepub fn get_complex_matrix<const R: usize, const C: usize>(
&self,
cmid: ComplexMatrixID<R, C>,
) -> SMatrix<Complex<Float>, R, C>
pub fn get_complex_matrix<const R: usize, const C: usize>( &self, cmid: ComplexMatrixID<R, C>, ) -> SMatrix<Complex<Float>, R, C>
Retrieve a complex-valued matrix from the Cache.
Trait Implementations§
Source§impl<'de> Deserialize<'de> for Cache
impl<'de> Deserialize<'de> for Cache
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Auto Trait Implementations§
impl Freeze for Cache
impl RefUnwindSafe for Cache
impl Send for Cache
impl Sync for Cache
impl Unpin for Cache
impl UnwindSafe for Cache
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<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> Serialize for T
impl<T> Serialize for T
fn erased_serialize(&self, serializer: &mut dyn Serializer) -> Result<(), Error>
fn do_erased_serialize( &self, serializer: &mut dyn Serializer, ) -> Result<(), ErrorImpl>
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.