pub struct SimpleHeuristic { /* private fields */ }Expand description
A heuristic that returns the time to connect two vertices of the graph in straight line.
Implementations§
Source§impl SimpleHeuristic
impl SimpleHeuristic
Sourcepub fn new(
transition_system: Arc<SimpleWorld>,
task: Arc<Task<SimpleState, MyTime>>,
) -> Self
pub fn new( transition_system: Arc<SimpleWorld>, task: Arc<Task<SimpleState, MyTime>>, ) -> Self
Creates a new simple heuristic.
§Arguments
transition_system- The transition system in which the agent navigates.task- The task to solve.
Trait Implementations§
Source§impl Heuristic<SimpleWorld, SimpleState, GraphEdgeId, OrderedFloat<f64>, OrderedFloat<f64>> for SimpleHeuristic
impl Heuristic<SimpleWorld, SimpleState, GraphEdgeId, OrderedFloat<f64>, OrderedFloat<f64>> for SimpleHeuristic
Source§fn get_heuristic(&self, state: &SimpleState) -> Option<MyTime>
fn get_heuristic(&self, state: &SimpleState) -> Option<MyTime>
Returns the heuristic value for the given state,
or None if the goal state is not reachable from that state.
Source§impl HeuristicBuilder<SimpleWorld, SimpleState, GraphEdgeId, OrderedFloat<f64>, OrderedFloat<f64>> for SimpleHeuristic
impl HeuristicBuilder<SimpleWorld, SimpleState, GraphEdgeId, OrderedFloat<f64>, OrderedFloat<f64>> for SimpleHeuristic
Source§fn build(
transition_system: Arc<SimpleWorld>,
task: Arc<Task<SimpleState, MyTime>>,
) -> Self
fn build( transition_system: Arc<SimpleWorld>, task: Arc<Task<SimpleState, MyTime>>, ) -> Self
Builds a new heuristic for the given transition system and task. Read more
Auto Trait Implementations§
impl Freeze for SimpleHeuristic
impl RefUnwindSafe for SimpleHeuristic
impl Send for SimpleHeuristic
impl Sync for SimpleHeuristic
impl Unpin for SimpleHeuristic
impl UnwindSafe for SimpleHeuristic
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> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
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>
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)
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)
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
impl<T> DowncastSync for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§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 moreSource§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).Source§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.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.