AbstractSearchWithHalting

mapf::planner::search

Struct AbstractSearchWithHalting 

Source 
pub struct AbstractSearchWithHalting<Solution, Halting> { /* private fields */ }

Trait Implementations§

Source§

impl<A, G, H> From<Search<A, G, H>> for AbstractSearchWithHalting<A::Solution, H>
where A: Solvable<G> + 'static, H: Halt<A::Memory> + 'static, A::StepError: Into<Anyhow>, G: 'static,

Source§

fn from(value: Search<A, G, H>) -> Self

Converts to this type from the input type.
Source§

impl<Solution, Halting> SearchInterface<Solution> for AbstractSearchWithHalting<Solution, Halting>

Source§

fn solve(&mut self) -> Result<SearchStatus<Solution>>

Source§

fn step(&mut self) -> Result<SearchStatus<Solution>>

Source§

impl<Solution, Halting> WithHalting<Halting> for AbstractSearchWithHalting<Solution, Halting>

Source§

fn view_halting<T, F: FnOnce(&Halting) -> T>(&self, f: F) -> T

Source§

fn update_halting<T, F: FnOnce(&mut Halting) -> T>(&mut self, f: F) -> T

Auto Trait Implementations§

§

impl<Solution, Halting> Freeze for AbstractSearchWithHalting<Solution, Halting>

§

impl<Solution, Halting> !RefUnwindSafe for AbstractSearchWithHalting<Solution, Halting>

§

impl<Solution, Halting> !Send for AbstractSearchWithHalting<Solution, Halting>

§

impl<Solution, Halting> !Sync for AbstractSearchWithHalting<Solution, Halting>

§

impl<Solution, Halting> Unpin for AbstractSearchWithHalting<Solution, Halting>

§

impl<Solution, Halting> !UnwindSafe for AbstractSearchWithHalting<Solution, Halting>

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> 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.