pub struct Problem {
    pub total_residual_dimension: usize,
    pub fixed_variable_indexes: HashMap<String, HashSet<usize>>,
    pub variable_bounds: HashMap<String, HashMap<usize, (f64, f64)>>,
    pub variable_manifold: HashMap<String, Arc<dyn Manifold + Sync + Send>>,
    /* private fields */
}Fields§
§total_residual_dimension: usize§fixed_variable_indexes: HashMap<String, HashSet<usize>>§variable_bounds: HashMap<String, HashMap<usize, (f64, f64)>>§variable_manifold: HashMap<String, Arc<dyn Manifold + Sync + Send>>Implementations§
Source§impl Problem
 
impl Problem
pub fn new() -> Problem
pub fn get_variable_name_to_col_idx_dict( &self, parameter_blocks: &HashMap<String, ParameterBlock>, ) -> HashMap<String, usize>
pub fn add_residual_block( &mut self, dim_residual: usize, variable_key_size_list: &[&str], factor: Box<dyn FactorImpl + Send>, loss_func: Option<Box<dyn Loss + Send>>, )
pub fn fix_variable(&mut self, var_to_fix: &str, idx: usize)
pub fn unfix_variable(&mut self, var_to_unfix: &str)
pub fn set_variable_bounds( &mut self, var_to_bound: &str, idx: usize, lower_bound: f64, upper_bound: f64, )
pub fn set_variable_manifold( &mut self, var_name: &str, manifold: Arc<dyn Manifold + Sync + Send>, )
pub fn remove_variable_bounds(&mut self, var_to_unbound: &str)
pub fn initialize_parameter_blocks( &self, initial_values: &HashMap<String, DVector<f64>>, ) -> HashMap<String, ParameterBlock>
pub fn compute_residuals( &self, parameter_blocks: &HashMap<String, ParameterBlock>, with_loss_fn: bool, ) -> Mat<f64>
pub fn compute_residual_and_jacobian( &self, parameter_blocks: &HashMap<String, ParameterBlock>, variable_name_to_col_idx_dict: &HashMap<String, usize>, total_variable_dimension: usize, ) -> (Mat<f64>, SparseColMat<usize, f64>)
Trait Implementations§
Auto Trait Implementations§
impl Freeze for Problem
impl !RefUnwindSafe for Problem
impl Send for Problem
impl Sync for Problem
impl Unpin for Problem
impl !UnwindSafe for Problem
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.