pub struct AdvancedQuantumOptimizer { /* private fields */ }
Expand description
✅ Advanced MODE: Fast quantum-inspired optimizer with SIMD acceleration
Implementations§
Source§impl AdvancedQuantumOptimizer
impl AdvancedQuantumOptimizer
Sourcepub fn new(
dimension: usize,
population_size: usize,
bounds: Vec<(f64, f64)>,
_max_iterations: usize,
) -> Result<Self>
pub fn new( dimension: usize, population_size: usize, bounds: Vec<(f64, f64)>, _max_iterations: usize, ) -> Result<Self>
✅ Advanced OPTIMIZATION: Create optimized quantum optimizer
Sourcepub fn optimize_advanced<F>(
&mut self,
objectivefunction: F,
maxiterations: usize,
) -> Result<(Array1<f64>, f64)>
pub fn optimize_advanced<F>( &mut self, objectivefunction: F, maxiterations: usize, ) -> Result<(Array1<f64>, f64)>
✅ Advanced MODE: Fast parallel quantum optimization
Sourcepub const fn get_advanced_diagnostics(&self) -> &AdvancedQuantumMetrics
pub const fn get_advanced_diagnostics(&self) -> &AdvancedQuantumMetrics
✅ Advanced MODE: Get comprehensive performance diagnostics
Sourcepub fn optimize<F>(
&mut self,
objectivefunction: F,
) -> Result<(Array1<f64>, f64)>
pub fn optimize<F>( &mut self, objectivefunction: F, ) -> Result<(Array1<f64>, f64)>
✅ Advanced MODE: Optimize with default parameters (wrapper method)
Sourcepub const fn get_adaptive_params(&self) -> &AdvancedQuantumParams
pub const fn get_adaptive_params(&self) -> &AdvancedQuantumParams
✅ Advanced MODE: Get adaptive parameters state
Auto Trait Implementations§
impl Freeze for AdvancedQuantumOptimizer
impl RefUnwindSafe for AdvancedQuantumOptimizer
impl Send for AdvancedQuantumOptimizer
impl Sync for AdvancedQuantumOptimizer
impl Unpin for AdvancedQuantumOptimizer
impl UnwindSafe for AdvancedQuantumOptimizer
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.