pub struct BiasBetweenFactor { /* private fields */ }Expand description
Random-walk factor constraining two consecutive IMU biases.
Implementations§
Trait Implementations§
Source§impl Factor for BiasBetweenFactor
impl Factor for BiasBetweenFactor
fn variable_ids(&self) -> &[VariableId]
fn evaluate( &self, values: &[&DVector<f64>], ) -> OptimizationResult<FactorEvaluation>
fn robust_kernel(&self) -> RobustKernel
Auto Trait Implementations§
impl Freeze for BiasBetweenFactor
impl RefUnwindSafe for BiasBetweenFactor
impl Send for BiasBetweenFactor
impl Sync for BiasBetweenFactor
impl Unpin for BiasBetweenFactor
impl UnsafeUnpin for BiasBetweenFactor
impl UnwindSafe for BiasBetweenFactor
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.