Struct Filter

pub struct Filter<T, DimZ, DimX>where
    T: RealField,
    DimZ: Dim + DimName,
    DimX: Dim + DimName,
    DefaultAllocator: Allocator<T, DimX> + Allocator<T, DimX, DimX> + Allocator<T, DimZ, DimX> + Allocator<T, DimZ, DimZ>,
{ /* private fields */ }

Implementations§

impl<T, DimZ, DimX> Filter<T, DimZ, DimX>
where T: RealField, DimZ: Dim + DimName, DimX: Dim + DimName, DefaultAllocator: Allocator<T, DimX> + Allocator<T, DimZ> + Allocator<T, DimX, DimX> + Allocator<T, DimX, DimZ> + Allocator<T, DimZ, DimX> + Allocator<T, DimZ, DimZ>,

pub fn new( x: VectorN<T, DimX>, p: MatrixN<T, DimX>, f: MatrixN<T, DimX>, r: MatrixN<T, DimZ>, h: MatrixMN<T, DimZ, DimX>, q: MatrixN<T, DimX>, ) -> Filter<T, DimZ, DimX>

pub fn run( &mut self, z: VectorN<T, DimZ>, ) -> Result<(VectorN<T, DimX>, MatrixN<T, DimX>, VectorN<T, DimZ>, MatrixN<T, DimZ>, MatrixN<T, DimZ>), KfError>

pub fn set_p(&mut self, p: MatrixN<T, DimX>)

pub fn set_x(&mut self, x: VectorN<T, DimX>)

Auto Trait Implementations§

impl<T, DimZ, DimX> !Freeze for Filter<T, DimZ, DimX>

impl<T, DimZ, DimX> !RefUnwindSafe for Filter<T, DimZ, DimX>

impl<T, DimZ, DimX> !Send for Filter<T, DimZ, DimX>

impl<T, DimZ, DimX> !Sync for Filter<T, DimZ, DimX>

impl<T, DimZ, DimX> !Unpin for Filter<T, DimZ, DimX>

impl<T, DimZ, DimX> !UnwindSafe for Filter<T, DimZ, DimX>

Blanket Implementations§

impl<T> Any for T
where T: 'static + ?Sized,

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

impl<T> Borrow<T> for T
where T: ?Sized,

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

impl<T> BorrowMut<T> for T
where T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

impl<T> From<T> for T

fn from(t: T) -> T

Returns the argument unchanged.

impl<T, U> Into<U> for T
where U: From<T>,

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

impl<T> Same for T

type Output = T

Should always be Self

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

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

Checks if self is actually part of its subset T (and can be converted to it).

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

The inclusion map: converts self to the equivalent element of its superset.

impl<T, U> TryFrom<U> for T
where U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

fn vzip(self) -> V