pub struct BiasPriorFactor { /* private fields */ }Expand description
Prior factor for one six-dimensional accelerometer/gyroscope bias.
Implementations§
Trait Implementations§
Source§impl Factor for BiasPriorFactor
impl Factor for BiasPriorFactor
fn variable_ids(&self) -> &[VariableId]
fn evaluate( &self, values: &[&DVector<f64>], ) -> OptimizationResult<FactorEvaluation>
fn robust_kernel(&self) -> RobustKernel
Auto Trait Implementations§
impl Freeze for BiasPriorFactor
impl RefUnwindSafe for BiasPriorFactor
impl Send for BiasPriorFactor
impl Sync for BiasPriorFactor
impl Unpin for BiasPriorFactor
impl UnsafeUnpin for BiasPriorFactor
impl UnwindSafe for BiasPriorFactor
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
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.