pub struct VibrationalCoordinateSymmetryOrbit<'a, G, T>where
G: SymmetryGroupProperties,
T: ComplexFloat + Debug + Lapack,
VibrationalCoordinate<'a, T>: SymmetryTransformable,{ /* private fields */ }
Expand description
Structure to manage symmetry orbits (i.e. orbits generated by symmetry groups) of vibrational coordinates.
Implementations§
source§impl<'a, G, T> VibrationalCoordinateSymmetryOrbit<'a, G, T>where
G: SymmetryGroupProperties + Clone,
T: ComplexFloat + Debug + Lapack,
VibrationalCoordinate<'a, T>: SymmetryTransformable,
impl<'a, G, T> VibrationalCoordinateSymmetryOrbit<'a, G, T>where
G: SymmetryGroupProperties + Clone,
T: ComplexFloat + Debug + Lapack,
VibrationalCoordinate<'a, T>: SymmetryTransformable,
sourcepub fn builder() -> VibrationalCoordinateSymmetryOrbitBuilder<'a, G, T>
pub fn builder() -> VibrationalCoordinateSymmetryOrbitBuilder<'a, G, T>
Returns a builder to construct a new VibrationalCoordinateSymmetryOrbit
.
source§impl<'a, G> VibrationalCoordinateSymmetryOrbit<'a, G, f64>where
G: SymmetryGroupProperties,
impl<'a, G> VibrationalCoordinateSymmetryOrbit<'a, G, f64>where
G: SymmetryGroupProperties,
sourcepub fn calc_xmat(
&mut self,
preserves_full_rank: bool,
) -> Result<&mut Self, Error>
pub fn calc_xmat( &mut self, preserves_full_rank: bool, ) -> Result<&mut Self, Error>
Calculates the $\mathbf{X}
$ matrix for real and symmetric overlap matrix
$\mathbf{S}
$ between the symmetry-equivalent vibrational coordinates in the orbit.
The resulting $\mathbf{X}
$ is stored in the orbit.
§Arguments
preserves_full_rank
- Iftrue
, when $\mathbf{S}
$ is already of full rank, then $\mathbf{X}
$ is set to be the identity matrix to avoid mixing the orbit molecular orbitals. Iffalse
, $\mathbf{X}
$ also orthogonalises $\mathbf{S}
$ even when it is already of full rank.
source§impl<'a, G, T> VibrationalCoordinateSymmetryOrbit<'a, G, Complex<T>>where
G: SymmetryGroupProperties,
T: Float + Scalar<Complex = Complex<T>>,
Complex<T>: ComplexFloat<Real = T> + Scalar<Real = T, Complex = Complex<T>> + Lapack,
VibrationalCoordinate<'a, Complex<T>>: SymmetryTransformable + Overlap<Complex<T>, Ix2>,
impl<'a, G, T> VibrationalCoordinateSymmetryOrbit<'a, G, Complex<T>>where
G: SymmetryGroupProperties,
T: Float + Scalar<Complex = Complex<T>>,
Complex<T>: ComplexFloat<Real = T> + Scalar<Real = T, Complex = Complex<T>> + Lapack,
VibrationalCoordinate<'a, Complex<T>>: SymmetryTransformable + Overlap<Complex<T>, Ix2>,
sourcepub fn calc_xmat(
&mut self,
preserves_full_rank: bool,
) -> Result<&mut Self, Error>
pub fn calc_xmat( &mut self, preserves_full_rank: bool, ) -> Result<&mut Self, Error>
Calculates the $\mathbf{X}
$ matrix for complex and symmetric or Hermitian overlap
matrix $\mathbf{S}
$ between the symmetry-equivalent vibrational coordinates in the
orbit.
The resulting $\mathbf{X}
$ is stored in the orbit.
§Arguments
preserves_full_rank
- Iftrue
, when $\mathbf{S}
$ is already of full rank, then $\mathbf{X}
$ is set to be the identity matrix to avoid mixing the orbit molecular orbitals. Iffalse
, $\mathbf{X}
$ also orthogonalises $\mathbf{S}
$ even when it is already of full rank.
Trait Implementations§
source§impl<'a, G, T> Clone for VibrationalCoordinateSymmetryOrbit<'a, G, T>where
G: SymmetryGroupProperties + Clone,
T: ComplexFloat + Debug + Lapack + Clone,
VibrationalCoordinate<'a, T>: SymmetryTransformable,
impl<'a, G, T> Clone for VibrationalCoordinateSymmetryOrbit<'a, G, T>where
G: SymmetryGroupProperties + Clone,
T: ComplexFloat + Debug + Lapack + Clone,
VibrationalCoordinate<'a, T>: SymmetryTransformable,
source§fn clone(&self) -> VibrationalCoordinateSymmetryOrbit<'a, G, T>
fn clone(&self) -> VibrationalCoordinateSymmetryOrbit<'a, G, T>
Returns a copy 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<'a, G, T> Orbit<G, VibrationalCoordinate<'a, T>> for VibrationalCoordinateSymmetryOrbit<'a, G, T>where
G: SymmetryGroupProperties,
T: ComplexFloat + Debug + Lapack,
VibrationalCoordinate<'a, T>: SymmetryTransformable,
impl<'a, G, T> Orbit<G, VibrationalCoordinate<'a, T>> for VibrationalCoordinateSymmetryOrbit<'a, G, T>where
G: SymmetryGroupProperties,
T: ComplexFloat + Debug + Lapack,
VibrationalCoordinate<'a, T>: SymmetryTransformable,
§type OrbitIter = OrbitIterator<'a, G, VibrationalCoordinate<'a, T>>
type OrbitIter = OrbitIterator<'a, G, VibrationalCoordinate<'a, T>>
Type of the iterator over items in the orbit.
source§fn origin(&self) -> &VibrationalCoordinate<'a, T>
fn origin(&self) -> &VibrationalCoordinate<'a, T>
The origin of the orbit.
source§impl<'a, G, T> RepAnalysis<G, VibrationalCoordinate<'a, T>, T, Dim<[usize; 2]>> for VibrationalCoordinateSymmetryOrbit<'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 + RelativeEq<<T as ComplexFloat>::Real> + AbsDiffEq<Epsilon = <T as Scalar>::Real>,
VibrationalCoordinate<'a, T>: SymmetryTransformable,
impl<'a, G, T> RepAnalysis<G, VibrationalCoordinate<'a, T>, T, Dim<[usize; 2]>> for VibrationalCoordinateSymmetryOrbit<'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 + RelativeEq<<T as ComplexFloat>::Real> + AbsDiffEq<Epsilon = <T as Scalar>::Real>,
VibrationalCoordinate<'a, T>: SymmetryTransformable,
source§fn set_smat(&mut self, smat: Array2<T>)
fn set_smat(&mut self, smat: Array2<T>)
Sets the overlap matrix between the items in the orbit. Read more
source§fn smat(&self) -> Option<&Array2<T>>
fn smat(&self) -> Option<&Array2<T>>
Returns the overlap matrix between the items in the orbit.
source§fn xmat(&self) -> &Array2<T>
fn xmat(&self) -> &Array2<T>
Returns the transformation matrix $
\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>
Returns the norm-preserving scalar map $
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
Returns the threshold for integrality checks of irreducible representation or
corepresentation multiplicities.
source§fn eigenvalue_comparison_mode(&self) -> &EigenvalueComparisonMode
fn eigenvalue_comparison_mode(&self) -> &EigenvalueComparisonMode
Returns the enumerated type specifying the comparison mode for filtering out orbit overlap
eigenvalues.
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>
Calculates and stores the overlap matrix between items in the orbit, with respect to a
metric of the basis in which these items are expressed. Read more
source§fn normalise_smat(&mut self) -> Result<&mut Self, Error>
fn normalise_smat(&mut self) -> Result<&mut Self, Error>
Normalises overlap matrix between items in the orbit such that its diagonal entries are
unity. Read more
source§fn calc_dmat(&self, op: &G::GroupElement) -> Result<Array2<T>, Error>
fn calc_dmat(&self, op: &G::GroupElement) -> Result<Array2<T>, Error>
Computes the representation or corepresentation matrix $
\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>
Computes the character of a particular element $
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>
Computes the characters of the elements in a conjugacy-class transversal of the generating
group in the basis of the orbit. Read more
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 items in the orbit to a
direct sum of the irreducible representations or corepresentations of the generating group. Read more
Auto Trait Implementations§
impl<'a, G, T> Freeze for VibrationalCoordinateSymmetryOrbit<'a, G, T>
impl<'a, G, T> RefUnwindSafe for VibrationalCoordinateSymmetryOrbit<'a, G, T>where
VibrationalCoordinate<'a, T>: Sized,
<T as ComplexFloat>::Real: RefUnwindSafe,
G: RefUnwindSafe,
T: RefUnwindSafe,
impl<'a, G, T> Send for VibrationalCoordinateSymmetryOrbit<'a, G, T>where
VibrationalCoordinate<'a, T>: Sized,
<T as ComplexFloat>::Real: Send + Sync,
G: Sync,
T: Sync + Send,
impl<'a, G, T> Sync for VibrationalCoordinateSymmetryOrbit<'a, G, T>
impl<'a, G, T> Unpin for VibrationalCoordinateSymmetryOrbit<'a, G, T>
impl<'a, G, T> UnwindSafe for VibrationalCoordinateSymmetryOrbit<'a, G, T>where
VibrationalCoordinate<'a, T>: Sized,
<T as ComplexFloat>::Real: UnwindSafe + RefUnwindSafe,
G: RefUnwindSafe,
T: RefUnwindSafe,
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§default unsafe fn clone_to_uninit(&self, dst: *mut T)
default unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)§impl<T> Conv for T
impl<T> Conv for T
§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,
Causes
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,
Causes
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,
Causes
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,
Causes
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,
Causes
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,
Causes
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,
Causes
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,
Causes
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,
Formats each item in a sequence. Read more
§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>
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 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,
Pipes by value. This is generally the method you want to use. Read more
§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,
Borrows
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,
Mutably borrows
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
Borrows
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
Mutably borrows
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
Borrows
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>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
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
Immutable access to the
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
Mutable access to the
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
Immutable access to the
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
Mutable access to the
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
Immutable access to the
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
Mutable access to the
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
Calls
.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
Calls
.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
Calls
.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
Calls
.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
Calls
.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
Calls
.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
Calls
.tap_deref()
only in debug builds, and is erased in release
builds.