Struct rtt::PlannerClosestNodeFound
[−]
[src]
pub struct PlannerClosestNodeFound<RT, NR, S> { /* fields omitted */ }
Methods
impl<RT, NR, S> PlannerClosestNodeFound<RT, NR, S>[src]
pub fn rtt(&self) -> &RT[src]
pub fn node_ref(&self) -> &NR[src]
pub fn sample(&self) -> &S[src]
pub fn no_transition<TR>(
self,
trans: TR
) -> Result<PlannerReadyToSample<RT>, TR::Error> where
TR: TransNoTransition<RT, NR>, [src]
self,
trans: TR
) -> Result<PlannerReadyToSample<RT>, TR::Error> where
TR: TransNoTransition<RT, NR>,
pub fn no_transition_ok<TR>(self, trans: TR) -> PlannerReadyToSample<RT> where
TR: TransNoTransition<RT, NR, Error = NeverError>, [src]
TR: TransNoTransition<RT, NR, Error = NeverError>,
pub fn has_transition<TR>(
self,
trans: TR
) -> Result<PlannerRttNode<RT, TR::RttNodeRef>, TR::Error> where
TR: TransHasTransition<RT, NR, S>, [src]
self,
trans: TR
) -> Result<PlannerRttNode<RT, TR::RttNodeRef>, TR::Error> where
TR: TransHasTransition<RT, NR, S>,
pub fn has_transition_ok<TR>(
self,
trans: TR
) -> PlannerRttNode<RT, TR::RttNodeRef> where
TR: TransHasTransition<RT, NR, S, Error = NeverError>, [src]
self,
trans: TR
) -> PlannerRttNode<RT, TR::RttNodeRef> where
TR: TransHasTransition<RT, NR, S, Error = NeverError>,
Trait Implementations
Auto Trait Implementations
impl<RT, NR, S> Send for PlannerClosestNodeFound<RT, NR, S> where
NR: Send,
RT: Send,
S: Send,
NR: Send,
RT: Send,
S: Send,
impl<RT, NR, S> Sync for PlannerClosestNodeFound<RT, NR, S> where
NR: Sync,
RT: Sync,
S: Sync,
NR: Sync,
RT: Sync,
S: Sync,