Struct qsym2::target::determinant::SlaterDeterminant
source · pub struct SlaterDeterminant<'a, T>where
T: ComplexFloat + Lapack,{ /* private fields */ }
Expand description
Structure to manage single-determinantal wavefunctions.
Implementations§
source§impl<'a, T> SlaterDeterminant<'a, T>where
T: ComplexFloat + Clone + Lapack,
impl<'a, T> SlaterDeterminant<'a, T>where
T: ComplexFloat + Clone + Lapack,
sourcepub fn builder() -> SlaterDeterminantBuilder<'a, T>
pub fn builder() -> SlaterDeterminantBuilder<'a, T>
Returns a builder to construct a new SlaterDeterminant
.
sourcepub fn complex_symmetric(&self) -> bool
pub fn complex_symmetric(&self) -> bool
Returns the complex-symmetric flag of the determinant.
sourcepub fn spin_constraint(&self) -> &SpinConstraint
pub fn spin_constraint(&self) -> &SpinConstraint
Returns the spin constraint imposed on the coefficients.
sourcepub fn bao(&self) -> &BasisAngularOrder<'_>
pub fn bao(&self) -> &BasisAngularOrder<'_>
Returns the basis angular order information of the basis set in which the coefficients are expressed.
sourcepub fn mo_energies(&self) -> Option<&Vec<Array1<T>>>
pub fn mo_energies(&self) -> Option<&Vec<Array1<T>>>
Returns the molecular-orbital energies.
sourcepub fn occupations(&self) -> &Vec<Array1<<T as ComplexFloat>::Real>>
pub fn occupations(&self) -> &Vec<Array1<<T as ComplexFloat>::Real>>
Returns the occupation patterns of the molecular orbitals.
sourcepub fn coefficients(&self) -> &Vec<Array2<T>>
pub fn coefficients(&self) -> &Vec<Array2<T>>
Returns a shared reference to a vector of coefficient arrays.
sourcepub fn threshold(&self) -> <T as ComplexFloat>::Real
pub fn threshold(&self) -> <T as ComplexFloat>::Real
Returns the threshold with which determinants are compared.
sourcepub fn nelectrons(&self) -> <T as ComplexFloat>::Real
pub fn nelectrons(&self) -> <T as ComplexFloat>::Real
Returns the total number of electrons in the determinant.
sourcepub fn to_generalised(&self) -> Self
pub fn to_generalised(&self) -> Self
Augments the encoding of coefficients in this Slater determinant to that in the corresponding generalised spin constraint.
§Returns
The equivalent Slater determinant with the coefficients encoded in the generalised spin constraint.
sourcepub fn to_orbitals(&self) -> Vec<Vec<MolecularOrbital<'a, T>>>
pub fn to_orbitals(&self) -> Vec<Vec<MolecularOrbital<'a, T>>>
Extracts the molecular orbitals in this Slater determinant.
§Returns
A vector of the molecular orbitals constituting this Slater determinant. In the restricted spin constraint, the identical molecular orbitals across different spin spaces are only given once. Each molecular orbital does contain an index of the spin space it is in.
source§impl<'a> SlaterDeterminant<'a, f64>
impl<'a> SlaterDeterminant<'a, f64>
sourcepub fn to_densities(&'a self) -> Result<DensitiesOwned<'a, f64>, Error>
pub fn to_densities(&'a self) -> Result<DensitiesOwned<'a, f64>, Error>
Constructs a vector of real densities, one for each spin space in a Slater determinant.
For restricted and unrestricted spin constraints, spin spaces are well-defined. For generalised spin constraints, each spin-space density is constructed from the corresponding diagonal block of the overall density matrix.
Occupation numbers are also incorporated in the formation of density matrices.
§Returns
A vector of real densities, one for each spin space.
source§impl<'a, T> SlaterDeterminant<'a, Complex<T>>
impl<'a, T> SlaterDeterminant<'a, Complex<T>>
sourcepub fn to_densities(&'a self) -> Result<DensitiesOwned<'a, Complex<T>>, Error>
pub fn to_densities(&'a self) -> Result<DensitiesOwned<'a, Complex<T>>, Error>
Constructs a vector of complex densities, one from each coefficient matrix in a Slater determinant.
For restricted and unrestricted spin constraints, spin spaces are well-defined. For generalised spin constraints, each spin-space density is constructed from the corresponding diagonal block of the overall density matrix.
Occupation numbers are also incorporated in the formation of density matrices.
§Arguments
sd
- A Slater determinant.
§Returns
A vector of complex densities, one for each spin space.
Trait Implementations§
source§impl<'a, T> Clone for SlaterDeterminant<'a, T>where
T: ComplexFloat + Lapack + Clone,
impl<'a, T> Clone for SlaterDeterminant<'a, T>where
T: ComplexFloat + Lapack + Clone,
source§fn clone(&self) -> SlaterDeterminant<'a, T>
fn clone(&self) -> SlaterDeterminant<'a, T>
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moresource§impl<'a, T> ComplexConjugationTransformable for SlaterDeterminant<'a, T>where
T: ComplexFloat + Lapack,
impl<'a, T> ComplexConjugationTransformable for SlaterDeterminant<'a, T>where
T: ComplexFloat + Lapack,
source§fn transform_cc_mut(&mut self) -> Result<&mut Self, TransformationError>
fn transform_cc_mut(&mut self) -> Result<&mut Self, TransformationError>
Performs a complex conjugation in-place.
source§fn transform_cc(&self) -> Result<Self, TransformationError>
fn transform_cc(&self) -> Result<Self, TransformationError>
source§impl<'a, T> Debug for SlaterDeterminant<'a, T>
impl<'a, T> Debug for SlaterDeterminant<'a, T>
source§impl<'a, T> Display for SlaterDeterminant<'a, T>
impl<'a, T> Display for SlaterDeterminant<'a, T>
source§impl<'a, T> From<SlaterDeterminant<'a, T>> for SlaterDeterminant<'a, Complex<T>>
impl<'a, T> From<SlaterDeterminant<'a, T>> for SlaterDeterminant<'a, Complex<T>>
source§fn from(value: SlaterDeterminant<'a, T>) -> Self
fn from(value: SlaterDeterminant<'a, T>) -> Self
source§impl<'a, G, T> Orbit<G, SlaterDeterminant<'a, T>> for SlaterDeterminantSymmetryOrbit<'a, G, T>where
G: SymmetryGroupProperties,
T: ComplexFloat + Debug + Lapack,
SlaterDeterminant<'a, T>: SymmetryTransformable,
impl<'a, G, T> Orbit<G, SlaterDeterminant<'a, T>> for SlaterDeterminantSymmetryOrbit<'a, G, T>where
G: SymmetryGroupProperties,
T: ComplexFloat + Debug + Lapack,
SlaterDeterminant<'a, T>: SymmetryTransformable,
§type OrbitIter = OrbitIterator<'a, G, SlaterDeterminant<'a, T>>
type OrbitIter = OrbitIterator<'a, G, SlaterDeterminant<'a, T>>
source§fn origin(&self) -> &SlaterDeterminant<'a, T>
fn origin(&self) -> &SlaterDeterminant<'a, T>
source§impl<'a, T> Overlap<T, Dim<[usize; 2]>> for SlaterDeterminant<'a, T>where
T: Lapack + ComplexFloat<Real = <T as Scalar>::Real> + Debug + Mul<<T as ComplexFloat>::Real, Output = T>,
<T as ComplexFloat>::Real: Debug + RelativeEq<<T as ComplexFloat>::Real> + AbsDiffEq<Epsilon = <T as Scalar>::Real>,
impl<'a, T> Overlap<T, Dim<[usize; 2]>> for SlaterDeterminant<'a, T>where
T: Lapack + ComplexFloat<Real = <T as Scalar>::Real> + Debug + Mul<<T as ComplexFloat>::Real, Output = T>,
<T as ComplexFloat>::Real: Debug + RelativeEq<<T as ComplexFloat>::Real> + AbsDiffEq<Epsilon = <T as Scalar>::Real>,
source§fn overlap(
&self,
other: &Self,
metric: Option<&Array2<T>>,
metric_h: Option<&Array2<T>>,
) -> Result<T, Error>
fn overlap( &self, other: &Self, metric: Option<&Array2<T>>, metric_h: Option<&Array2<T>>, ) -> Result<T, Error>
Computes the overlap between two Slater determinants.
Determinants with fractional electrons are currently not supported.
When one or both of the Slater determinants have been acted on by an antiunitary operation, the correct Hermitian or complex-symmetric metric will be chosen in the evalulation of the overlap.
§Arguments
metric
- The atomic-orbital overlap matrix with respect to the conventional sesquilinear inner product.metric_h
- The atomic-orbital overlap matrix with respect to the bilinear inner product.
§Panics
Panics if self
and other
have mismatched spin constraints or numbers of coefficient
matrices, or if fractional occupation numbers are detected.
source§fn overlap_definition(&self) -> String
fn overlap_definition(&self) -> String
Returns the mathematical definition of the overlap between two Slater determinants.
source§fn complex_symmetric(&self) -> bool
fn complex_symmetric(&self) -> bool
true
, the inner product is bilinear and $\hat{\iota} = \hat{\kappa}
$. If false
,
the inner product is sesquilinear and $\hat{\iota} = \mathrm{id}
$.source§impl<'a, T> PartialEq for SlaterDeterminant<'a, T>where
T: ComplexFloat<Real = f64> + Lapack,
impl<'a, T> PartialEq for SlaterDeterminant<'a, T>where
T: ComplexFloat<Real = f64> + Lapack,
source§impl<'a, G, T> RepAnalysis<G, SlaterDeterminant<'a, T>, T, Dim<[usize; 2]>> for SlaterDeterminantSymmetryOrbit<'a, G, T>where
G: SymmetryGroupProperties,
G::CharTab: SubspaceDecomposable<T>,
T: Lapack + ComplexFloat<Real = <T as Scalar>::Real> + Debug + Mul<<T as ComplexFloat>::Real, Output = T>,
<T as ComplexFloat>::Real: Debug + Zero + From<u16> + ToPrimitive + RelativeEq<<T as ComplexFloat>::Real> + AbsDiffEq<Epsilon = <T as Scalar>::Real>,
SlaterDeterminant<'a, T>: SymmetryTransformable,
impl<'a, G, T> RepAnalysis<G, SlaterDeterminant<'a, T>, T, Dim<[usize; 2]>> for SlaterDeterminantSymmetryOrbit<'a, G, T>where
G: SymmetryGroupProperties,
G::CharTab: SubspaceDecomposable<T>,
T: Lapack + ComplexFloat<Real = <T as Scalar>::Real> + Debug + Mul<<T as ComplexFloat>::Real, Output = T>,
<T as ComplexFloat>::Real: Debug + Zero + From<u16> + ToPrimitive + RelativeEq<<T as ComplexFloat>::Real> + AbsDiffEq<Epsilon = <T as Scalar>::Real>,
SlaterDeterminant<'a, T>: SymmetryTransformable,
source§fn analyse_rep(
&self,
) -> Result<<<G as CharacterProperties>::CharTab as SubspaceDecomposable<T>>::Decomposition, DecompositionError>
fn analyse_rep( &self, ) -> Result<<<G as CharacterProperties>::CharTab as SubspaceDecomposable<T>>::Decomposition, DecompositionError>
Reduces the representation or corepresentation spanned by the determinants in the orbit to a direct sum of the irreducible representations or corepresentations of the generating symmetry group.
§Returns
The decomposed result.
§Errors
Errors if the decomposition fails, e.g. because one or more calculated multiplicities are non-integral, or also because the combination of group type, transformation type, and oddity of the number of electrons would not give sensible symmetry results. In particular, spin or spin-spatial symmetry analysis of odd-electron systems in unitary-represented magnetic groups is not valid.
source§fn set_smat(&mut self, smat: Array2<T>)
fn set_smat(&mut self, smat: Array2<T>)
source§fn smat(&self) -> Option<&Array2<T>>
fn smat(&self) -> Option<&Array2<T>>
source§fn xmat(&self) -> &Array2<T>
fn xmat(&self) -> &Array2<T>
\mathbf{X}
$ for the overlap matrix $\mathbf{S}
$
between the items in the orbit. Read moresource§fn norm_preserving_scalar_map(&self, i: usize) -> Result<fn(_: T) -> T, Error>
fn norm_preserving_scalar_map(&self, i: usize) -> Result<fn(_: T) -> T, Error>
f
$ for every element of the generating group
defined by Read moresource§fn integrality_threshold(&self) -> <T as ComplexFloat>::Real
fn integrality_threshold(&self) -> <T as ComplexFloat>::Real
source§fn eigenvalue_comparison_mode(&self) -> &EigenvalueComparisonMode
fn eigenvalue_comparison_mode(&self) -> &EigenvalueComparisonMode
source§fn calc_smat(
&mut self,
metric: Option<&Array<T, D>>,
metric_h: Option<&Array<T, D>>,
use_cayley_table: bool,
) -> Result<&mut Self, Error>
fn calc_smat( &mut self, metric: Option<&Array<T, D>>, metric_h: Option<&Array<T, D>>, use_cayley_table: bool, ) -> Result<&mut Self, Error>
source§fn normalise_smat(&mut self) -> Result<&mut Self, Error>
fn normalise_smat(&mut self) -> Result<&mut Self, Error>
source§fn calc_dmat(&self, op: &G::GroupElement) -> Result<Array2<T>, Error>
fn calc_dmat(&self, op: &G::GroupElement) -> Result<Array2<T>, Error>
\mathbf{D}(g)
$ for a particular
element $g
$ in the generating group in the basis of the orbit. Read moresource§fn calc_character(&self, op: &G::GroupElement) -> Result<T, Error>
fn calc_character(&self, op: &G::GroupElement) -> Result<T, Error>
g
$ in the generating group in the basis
of the orbit. Read moresource§fn calc_characters(
&self,
) -> Result<Vec<(<G as ClassProperties>::ClassSymbol, T)>, Error>
fn calc_characters( &self, ) -> Result<Vec<(<G as ClassProperties>::ClassSymbol, T)>, Error>
source§impl<'a, T> SpatialUnitaryTransformable for SlaterDeterminant<'a, T>
impl<'a, T> SpatialUnitaryTransformable for SlaterDeterminant<'a, T>
source§fn transform_spatial_mut(
&mut self,
rmat: &Array2<f64>,
perm: Option<&Permutation<usize>>,
) -> Result<&mut Self, TransformationError>
fn transform_spatial_mut( &mut self, rmat: &Array2<f64>, perm: Option<&Permutation<usize>>, ) -> Result<&mut Self, TransformationError>
source§fn transform_spatial(
&self,
rmat: &Array2<f64>,
perm: Option<&Permutation<usize>>,
) -> Result<Self, TransformationError>
fn transform_spatial( &self, rmat: &Array2<f64>, perm: Option<&Permutation<usize>>, ) -> Result<Self, TransformationError>
source§impl<'a, T> SpinUnitaryTransformable for SlaterDeterminant<'a, Complex<T>>where
T: Clone,
Complex<T>: ComplexFloat<Real = T> + LinalgScalar + ScalarOperand + Lapack + Mul<Complex<T>, Output = Complex<T>> + Mul<Complex<f64>, Output = Complex<T>>,
impl<'a, T> SpinUnitaryTransformable for SlaterDeterminant<'a, Complex<T>>where
T: Clone,
Complex<T>: ComplexFloat<Real = T> + LinalgScalar + ScalarOperand + Lapack + Mul<Complex<T>, Output = Complex<T>> + Mul<Complex<f64>, Output = Complex<T>>,
source§fn transform_spin_mut(
&mut self,
dmat: &Array2<Complex<f64>>,
) -> Result<&mut Self, TransformationError>
fn transform_spin_mut( &mut self, dmat: &Array2<Complex<f64>>, ) -> Result<&mut Self, TransformationError>
Performs a spin transformation in-place.
§Arguments
dmat
- The two-dimensional representation matrix of the transformation in the basis of the $\{ \alpha, \beta \}
$ spinors (i.e. decreasing $m
$ order).
§Panics
Panics if the spin constraint is not generalised. Spin transformations can only be performed with generalised spin constraint.
source§fn transform_spin(
&self,
dmat: &Array2<Complex<f64>>,
) -> Result<Self, TransformationError>
fn transform_spin( &self, dmat: &Array2<Complex<f64>>, ) -> Result<Self, TransformationError>
source§impl<'a> SpinUnitaryTransformable for SlaterDeterminant<'a, f64>
impl<'a> SpinUnitaryTransformable for SlaterDeterminant<'a, f64>
source§fn transform_spin_mut(
&mut self,
dmat: &Array2<Complex<f64>>,
) -> Result<&mut Self, TransformationError>
fn transform_spin_mut( &mut self, dmat: &Array2<Complex<f64>>, ) -> Result<&mut Self, TransformationError>
Performs a spin transformation in-place.
§Arguments
dmat
- The two-dimensional representation matrix of the transformation in the basis of the $\{ \alpha, \beta \}
$ spinors (i.e. decreasing $m
$ order).
source§fn transform_spin(
&self,
dmat: &Array2<Complex<f64>>,
) -> Result<Self, TransformationError>
fn transform_spin( &self, dmat: &Array2<Complex<f64>>, ) -> Result<Self, TransformationError>
source§impl<'a, T> SymmetryTransformable for SlaterDeterminant<'a, T>where
T: ComplexFloat + Lapack,
SlaterDeterminant<'a, T>: SpatialUnitaryTransformable + SpinUnitaryTransformable + TimeReversalTransformable,
impl<'a, T> SymmetryTransformable for SlaterDeterminant<'a, T>where
T: ComplexFloat + Lapack,
SlaterDeterminant<'a, T>: SpatialUnitaryTransformable + SpinUnitaryTransformable + TimeReversalTransformable,
source§fn sym_permute_sites_spatial(
&self,
symop: &SymmetryOperation,
) -> Result<Permutation<usize>, TransformationError>
fn sym_permute_sites_spatial( &self, symop: &SymmetryOperation, ) -> Result<Permutation<usize>, TransformationError>
source§fn sym_transform_spatial_mut(
&mut self,
symop: &SymmetryOperation,
) -> Result<&mut Self, TransformationError>
fn sym_transform_spatial_mut( &mut self, symop: &SymmetryOperation, ) -> Result<&mut Self, TransformationError>
source§fn sym_transform_spatial(
&self,
symop: &SymmetryOperation,
) -> Result<Self, TransformationError>
fn sym_transform_spatial( &self, symop: &SymmetryOperation, ) -> Result<Self, TransformationError>
source§fn sym_transform_spatial_with_spintimerev_mut(
&mut self,
symop: &SymmetryOperation,
) -> Result<&mut Self, TransformationError>
fn sym_transform_spatial_with_spintimerev_mut( &mut self, symop: &SymmetryOperation, ) -> Result<&mut Self, TransformationError>
source§fn sym_transform_spatial_with_spintimerev(
&self,
symop: &SymmetryOperation,
) -> Result<Self, TransformationError>
fn sym_transform_spatial_with_spintimerev( &self, symop: &SymmetryOperation, ) -> Result<Self, TransformationError>
source§fn sym_transform_spin_mut(
&mut self,
symop: &SymmetryOperation,
) -> Result<&mut Self, TransformationError>
fn sym_transform_spin_mut( &mut self, symop: &SymmetryOperation, ) -> Result<&mut Self, TransformationError>
source§fn sym_transform_spin(
&self,
symop: &SymmetryOperation,
) -> Result<Self, TransformationError>
fn sym_transform_spin( &self, symop: &SymmetryOperation, ) -> Result<Self, TransformationError>
source§fn sym_transform_spin_spatial_mut(
&mut self,
symop: &SymmetryOperation,
) -> Result<&mut Self, TransformationError>
fn sym_transform_spin_spatial_mut( &mut self, symop: &SymmetryOperation, ) -> Result<&mut Self, TransformationError>
source§fn sym_transform_spin_spatial(
&self,
symop: &SymmetryOperation,
) -> Result<Self, TransformationError>
fn sym_transform_spin_spatial( &self, symop: &SymmetryOperation, ) -> Result<Self, TransformationError>
impl<'a, T> DefaultTimeReversalTransformable for SlaterDeterminant<'a, T>where
T: ComplexFloat + Lapack,
impl<'a, T> Eq for SlaterDeterminant<'a, T>where
T: ComplexFloat<Real = f64> + Lapack,
Auto Trait Implementations§
impl<'a, T> Freeze for SlaterDeterminant<'a, T>
impl<'a, T> RefUnwindSafe for SlaterDeterminant<'a, T>
impl<'a, T> Send for SlaterDeterminant<'a, T>
impl<'a, T> Sync for SlaterDeterminant<'a, T>
impl<'a, T> Unpin for SlaterDeterminant<'a, T>
impl<'a, T> UnwindSafe for SlaterDeterminant<'a, T>
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
source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§default unsafe fn clone_to_uninit(&self, dst: *mut T)
default unsafe fn clone_to_uninit(&self, dst: *mut T)
clone_to_uninit
)§impl<T> Conv for T
impl<T> Conv for T
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.§impl<T> FmtForward for T
impl<T> FmtForward for T
§fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
self
to use its Binary
implementation when Debug
-formatted.§fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
self
to use its Display
implementation when
Debug
-formatted.§fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
self
to use its LowerExp
implementation when
Debug
-formatted.§fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
self
to use its LowerHex
implementation when
Debug
-formatted.§fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
self
to use its Octal
implementation when Debug
-formatted.§fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
self
to use its Pointer
implementation when
Debug
-formatted.§fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
self
to use its UpperExp
implementation when
Debug
-formatted.§fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
self
to use its UpperHex
implementation when
Debug
-formatted.§fn fmt_list(self) -> FmtList<Self>where
&'a Self: for<'a> IntoIterator,
fn fmt_list(self) -> FmtList<Self>where
&'a Self: for<'a> IntoIterator,
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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>
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>
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 more§impl<T> Pipe for Twhere
T: ?Sized,
impl<T> Pipe for Twhere
T: ?Sized,
§fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
§fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
self
and passes that borrow into the pipe function. Read more§fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
self
and passes that borrow into the pipe function. Read more§fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
§fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R,
) -> R
fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R, ) -> R
§fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
self
, then passes self.as_ref()
into the pipe function.§fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
self
, then passes self.as_mut()
into the pipe
function.§fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
self
, then passes self.deref()
into the pipe function.§impl<T> Pointable for T
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
self
from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
self
is actually part of its subset T
(and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
self.to_subset
but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self
to the equivalent element of its superset.§impl<T> Tap for T
impl<T> Tap for T
§fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
Borrow<B>
of a value. Read more§fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
BorrowMut<B>
of a value. Read more§fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
AsRef<R>
view of a value. Read more§fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
AsMut<R>
view of a value. Read more§fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
Deref::Target
of a value. Read more§fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
Deref::Target
of a value. Read more§fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
.tap()
only in debug builds, and is erased in release builds.§fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
.tap_mut()
only in debug builds, and is erased in release
builds.§fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
.tap_borrow()
only in debug builds, and is erased in release
builds.§fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
.tap_borrow_mut()
only in debug builds, and is erased in release
builds.§fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
.tap_ref()
only in debug builds, and is erased in release
builds.§fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
.tap_ref_mut()
only in debug builds, and is erased in release
builds.§fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
.tap_deref()
only in debug builds, and is erased in release
builds.source§impl<T> TimeReversalTransformable for T
impl<T> TimeReversalTransformable for T
source§fn transform_timerev_mut(&mut self) -> Result<&mut T, TransformationError>
fn transform_timerev_mut(&mut self) -> Result<&mut T, TransformationError>
Performs a time-reversal transformation in-place.
The default implementation of the time-reversal transformation for any type that implements
SpinUnitaryTransformable
and ComplexConjugationTransformable
is a spin rotation by
$\pi
$ about the space-fixed $y
$-axis followed by a complex conjugation.