Skip to main content

UserBasisBuilder

Struct UserBasisBuilder 

Source
pub struct UserBasisBuilder<State>
where State: Copy + Eq + Hash + Send + Sync,
{ /* private fields */ }

Implementations§

Source§

impl<State> UserBasisBuilder<State>
where State: Copy + Eq + Hash + Send + Sync + 'static,

Source

pub fn states(self, states: impl IntoIterator<Item = State>) -> Self

Source

pub fn deferred_states<F>(self, factory: F) -> Self
where F: Fn() -> Result<Vec<State>> + Send + Sync + 'static,

Defer potentially expensive state enumeration until materialize or build is called.

Source

pub fn operator<F>(self, name: char, action: F) -> Self
where F: Fn(State, usize) -> Result<Option<(State, Complex64)>> + Send + Sync + 'static,

Source

pub fn branching_operator<F>(self, name: char, action: F) -> Self
where F: Fn(State, usize) -> Result<Vec<(State, Complex64)>> + Send + Sync + 'static,

Register a local action with more than one nonzero destination.

Source

pub fn build(self) -> Result<UserBasis<State>>

Source

pub fn materialize(self) -> Result<UserBasis<State>>

Source§

impl UserBasisBuilder<u128>

Source

pub fn state_filter<F>(self, keep: F) -> Result<Self>
where F: Fn(u128) -> bool,

Source

pub fn state_filter_parallel<F>(self, keep: F) -> Result<Self>
where F: Fn(u128) -> bool + Sync,

Deterministically enumerate a filtered binary state space in parallel.

Auto Trait Implementations§

§

impl<State> Freeze for UserBasisBuilder<State>

§

impl<State> !RefUnwindSafe for UserBasisBuilder<State>

§

impl<State> Send for UserBasisBuilder<State>

§

impl<State> Sync for UserBasisBuilder<State>

§

impl<State> Unpin for UserBasisBuilder<State>
where State: Unpin,

§

impl<State> UnsafeUnpin for UserBasisBuilder<State>

§

impl<State> !UnwindSafe for UserBasisBuilder<State>

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> 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, 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,