pub struct Pid<R: FlightFloat> {
pub p: R,
pub i: R,
pub d: R,
pub max: R,
pub min: R,
pub tau: R,
pub integrator: R,
pub differentiator: R,
pub prev_x: R,
pub prev_t: R,
}Fields§
§p: R§i: R§d: R§max: R§min: R§tau: R§integrator: R§differentiator: R§prev_x: R§prev_t: RImplementations§
Source§impl<R: FlightFloat> Pid<R>
impl<R: FlightFloat> Pid<R>
Trait Implementations§
Source§impl<R: FlightFloat> Default for Pid<R>
impl<R: FlightFloat> Default for Pid<R>
impl<R: Copy + FlightFloat> Copy for Pid<R>
Auto Trait Implementations§
impl<R> Freeze for Pid<R>where
R: Freeze,
impl<R> RefUnwindSafe for Pid<R>where
R: RefUnwindSafe,
impl<R> Send for Pid<R>
impl<R> Sync for Pid<R>
impl<R> Unpin for Pid<R>where
R: Unpin,
impl<R> UnsafeUnpin for Pid<R>where
R: UnsafeUnpin,
impl<R> UnwindSafe for Pid<R>where
R: UnwindSafe,
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§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.