pub struct QuantumCellularAutomaton { /* private fields */ }
Expand description
Quantum cellular automaton simulator
Implementations§
Source§impl QuantumCellularAutomaton
impl QuantumCellularAutomaton
Sourcepub fn with_backend(self) -> Result<Self>
pub fn with_backend(self) -> Result<Self>
Initialize with SciRS2 backend
Sourcepub fn set_initial_state(
&mut self,
initial_state: Array1<Complex64>,
) -> Result<()>
pub fn set_initial_state( &mut self, initial_state: Array1<Complex64>, ) -> Result<()>
Set initial state
Sourcepub fn evolve(&mut self, steps: usize) -> Result<QCAEvolutionResult>
pub fn evolve(&mut self, steps: usize) -> Result<QCAEvolutionResult>
Evolve the QCA for specified number of steps
Sourcepub fn get_evolution_history(&self) -> &[QCASnapshot]
pub fn get_evolution_history(&self) -> &[QCASnapshot]
Get evolution history
Auto Trait Implementations§
impl Freeze for QuantumCellularAutomaton
impl !RefUnwindSafe for QuantumCellularAutomaton
impl Send for QuantumCellularAutomaton
impl Sync for QuantumCellularAutomaton
impl Unpin for QuantumCellularAutomaton
impl !UnwindSafe for QuantumCellularAutomaton
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> 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<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.