Struct arci::PartialJointTrajectoryClient
source · pub struct PartialJointTrajectoryClient<C>where
C: JointTrajectoryClient,{ /* private fields */ }Implementations§
source§impl<C> PartialJointTrajectoryClient<C>where
C: JointTrajectoryClient,
impl<C> PartialJointTrajectoryClient<C>where C: JointTrajectoryClient,
sourcepub fn new(joint_names: Vec<String>, shared_client: C) -> Result<Self, Error>
pub fn new(joint_names: Vec<String>, shared_client: C) -> Result<Self, Error>
Generate Partial Joint Client
This function check partial joint name and full joint name. Only allow unique partial joint name and joint name contained full.
Important point
Partial Joint name is changed to dictionary order.
Trait Implementations§
source§impl<C> JointTrajectoryClient for PartialJointTrajectoryClient<C>where
C: JointTrajectoryClient,
impl<C> JointTrajectoryClient for PartialJointTrajectoryClient<C>where C: JointTrajectoryClient,
source§fn joint_names(&self) -> Vec<String>
fn joint_names(&self) -> Vec<String>
Returns names of joints that this client handles.
source§fn current_joint_positions(&self) -> Result<Vec<f64>, Error>
fn current_joint_positions(&self) -> Result<Vec<f64>, Error>
Returns the current joint positions.
source§fn send_joint_positions(
&self,
positions: Vec<f64>,
duration: Duration
) -> Result<WaitFuture, Error>
fn send_joint_positions( &self, positions: Vec<f64>, duration: Duration ) -> Result<WaitFuture, Error>
Send the specified joint positions and returns a future that waits until
complete the move joints. Read more
source§fn send_joint_trajectory(
&self,
trajectory: Vec<TrajectoryPoint>
) -> Result<WaitFuture, Error>
fn send_joint_trajectory( &self, trajectory: Vec<TrajectoryPoint> ) -> Result<WaitFuture, Error>
Send the specified joint trajectory and returns a future that waits until
complete the move joints. Read more
Auto Trait Implementations§
impl<C> RefUnwindSafe for PartialJointTrajectoryClient<C>where C: RefUnwindSafe,
impl<C> Send for PartialJointTrajectoryClient<C>
impl<C> Sync for PartialJointTrajectoryClient<C>
impl<C> Unpin for PartialJointTrajectoryClient<C>where C: Unpin,
impl<C> UnwindSafe for PartialJointTrajectoryClient<C>where C: UnwindSafe,
Blanket Implementations§
source§impl<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
§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.