pub struct LazyOptimizationPipeline { /* private fields */ }
Expand description
Lazy optimization pipeline
Implementations§
Source§impl LazyOptimizationPipeline
impl LazyOptimizationPipeline
Sourcepub fn new(
config: LazyEvaluationConfig,
optimization_chain: OptimizationChain,
) -> QuantRS2Result<Self>
pub fn new( config: LazyEvaluationConfig, optimization_chain: OptimizationChain, ) -> QuantRS2Result<Self>
Create a new lazy optimization pipeline
Sourcepub fn add_gate(&self, gate: Box<dyn GateOp>) -> QuantRS2Result<usize>
pub fn add_gate(&self, gate: Box<dyn GateOp>) -> QuantRS2Result<usize>
Add a gate to the lazy evaluation pipeline
Sourcepub fn evaluate_gate(
&self,
gate_id: usize,
) -> QuantRS2Result<OptimizationResult>
pub fn evaluate_gate( &self, gate_id: usize, ) -> QuantRS2Result<OptimizationResult>
Evaluate a specific gate (force optimization)
Sourcepub fn evaluate_all(&self) -> QuantRS2Result<Vec<OptimizationResult>>
pub fn evaluate_all(&self) -> QuantRS2Result<Vec<OptimizationResult>>
Evaluate all buffered gates
Sourcepub fn get_statistics(&self) -> LazyEvaluationStats
pub fn get_statistics(&self) -> LazyEvaluationStats
Get optimization statistics
Trait Implementations§
Auto Trait Implementations§
impl Freeze for LazyOptimizationPipeline
impl !RefUnwindSafe for LazyOptimizationPipeline
impl !Send for LazyOptimizationPipeline
impl !Sync for LazyOptimizationPipeline
impl Unpin for LazyOptimizationPipeline
impl !UnwindSafe for LazyOptimizationPipeline
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.