caboose

Struct SippTask

Source 
pub struct SippTask<S, C, DC>
where
    S: State + Debug + Hash + Eq + Clone,
    C: Eq + PartialOrd + Ord + Add<DC, Output = C> + Sub<C, Output = DC> + Copy + Default + LimitValues,
    DC: Copy,
{ /* private fields */ }
Expand description

Task wrapper for the Safe Interval Path Planning algorithm that extends a given task definition with all SIPP states that correspong to it.

Implementations§

Source§

impl<S, C, DC> SippTask<S, C, DC>
where S: State + Debug + Hash + Eq + Clone, C: Eq + PartialOrd + Ord + Add<DC, Output = C> + Sub<C, Output = DC> + Copy + Default + LimitValues, DC: Copy,

Source

pub fn new( initial_times: Vec<C>, initial_states: Vec<Arc<SippState<S, C, DC>>>, goal_state: S, goal_interval: Interval<C, DC>, internal_task: Arc<Task<S, C>>, ) -> Self

Creates a new task for the SIPP algorithm, that supports multiple initial and goal states.

§Arguments
  • initial_times - The initial times of the task.
  • initial_states - The initial states of the task.
  • goal_state - The goal state of the task.
  • goal_interval - The interval in which the goal state must be reached.
  • internal_task - The internal task to solve.

Auto Trait Implementations§

§

impl<S, C, DC> Freeze for SippTask<S, C, DC>
where S: Freeze, C: Freeze,

§

impl<S, C, DC> RefUnwindSafe for SippTask<S, C, DC>
where S: RefUnwindSafe, C: RefUnwindSafe, DC: RefUnwindSafe,

§

impl<S, C, DC> Send for SippTask<S, C, DC>
where S: Send + Sync, C: Send + Sync, DC: Send,

§

impl<S, C, DC> Sync for SippTask<S, C, DC>
where S: Sync + Send, C: Sync + Send, DC: Sync,

§

impl<S, C, DC> Unpin for SippTask<S, C, DC>
where S: Unpin, C: Unpin, DC: Unpin,

§

impl<S, C, DC> UnwindSafe for SippTask<S, C, DC>
where S: UnwindSafe + RefUnwindSafe, C: UnwindSafe + RefUnwindSafe, DC: UnwindSafe,

Blanket Implementations§

Source§

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

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

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

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

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

Source§

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

Mutably borrows from an owned value. Read more
Source§

impl<T> Downcast for T
where T: Any,

Source§

fn into_any(self: Box<T>) -> Box<dyn Any>

Convert Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can then be further downcast into Box<ConcreteType> where ConcreteType implements Trait.
Source§

fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>

Convert Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be further downcast into Rc<ConcreteType> where ConcreteType implements Trait.
Source§

fn as_any(&self) -> &(dyn Any + 'static)

Convert &Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &Any’s vtable from &Trait’s.
Source§

fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)

Convert &mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &mut Any’s vtable from &mut Trait’s.
Source§

impl<T> DowncastSync for T
where T: Any + Send + Sync,

Source§

fn into_any_arc(self: Arc<T>) -> Arc<dyn Any + Sync + Send>

Convert Arc<Trait> (where Trait: Downcast) to Arc<Any>. Arc<Any> can then be further downcast into Arc<ConcreteType> where ConcreteType implements Trait.
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

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

Source§

fn into(self) -> U

Calls U::from(self).

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

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

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

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

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

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

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

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

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

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

Performs the conversion.
Source§

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

Source§

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

The type returned in the event of a conversion error.
Source§

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

Performs the conversion.