Skip to main content

OpProduct

Struct OpProduct 

Source
pub struct OpProduct { /* private fields */ }
Expand description

Typed ordered product of local actions.

splits identify factor boundaries. A single split retains the traditional spinful-fermion meaning; multiple (including repeated) boundaries describe arbitrary tensor products with empty factor actions.

Implementations§

Source§

impl OpProduct

Source

pub fn parse(label: impl AsRef<str>) -> Result<Self>

Parse QMBED’s compact operator-label grammar.

| records a tensor-factor boundary and every other character maps to one built-in or custom local action.

Source

pub fn new(local: impl IntoIterator<Item = LocalOperator>) -> Result<Self>

Construct a single-factor ordered product.

The product must contain at least one local action. Sites are attached later by Coupling, allowing this parsed action to be reused.

Source

pub fn spinful( up: impl IntoIterator<Item = LocalOperator>, down: impl IntoIterator<Item = LocalOperator>, ) -> Result<Self>

Construct a two-species product and record the species boundary.

Source

pub fn with_split( local: impl IntoIterator<Item = LocalOperator>, split: Option<usize>, ) -> Result<Self>

Construct a product with zero or one explicit factor boundary.

Source

pub fn with_splits( local: impl IntoIterator<Item = LocalOperator>, splits: impl IntoIterator<Item = usize>, ) -> Result<Self>

Construct an operator product with any number of ordered factor boundaries. Duplicate boundaries preserve empty tensor factors such as the middle factor in x||z.

Source

pub fn local_operators(&self) -> &[LocalOperator]

Return the local actions in coupling-site order.

Source

pub const fn split(&self) -> Option<usize>

Return the single species boundary, when exactly one exists.

Source

pub fn splits(&self) -> &[usize]

Return every ordered tensor-factor boundary.

Source

pub fn label(&self) -> &str

Return the canonical compact operator label.

Trait Implementations§

Source§

impl Clone for OpProduct

Source§

fn clone(&self) -> OpProduct

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Debug for OpProduct

Source§

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

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

impl PartialEq for OpProduct

Source§

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

Tests for self and other values to be equal, and is used by ==.
1.0.0 (const: unstable) · Source§

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
Source§

impl Eq for OpProduct

Source§

impl StructuralPartialEq for OpProduct

Auto Trait Implementations§

Blanket Implementations§

Source§

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

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

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

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

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

Source§

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

Mutably borrows from an owned value. Read more
§

impl<T> ByRef<T> for T

§

fn by_ref(&self) -> &T

Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

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

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.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
§

impl<SS, SP> SupersetOf<SS> for SP
where 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 T
where T: Clone,

Source§

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 T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

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

Performs the conversion.
Source§

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

Source§

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

The type returned in the event of a conversion error.
Source§

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

Performs the conversion.
§

impl<T, U> Imply<T> for U
where T: ?Sized, U: ?Sized,

Source§

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