Struct k::SerialChain
source · pub struct SerialChain<T: RealField> { /* private fields */ }
Expand description
Kinematic chain without any branch.
All joints are connected sequentially.
Implementations§
source§impl<T> SerialChain<T>
impl<T> SerialChain<T>
sourcepub fn new_unchecked(inner: Chain<T>) -> Self
pub fn new_unchecked(inner: Chain<T>) -> Self
Convert Chain into SerialChain without any check
If the input Chain has any branches it causes serious bugs.
sourcepub fn try_new(inner: Chain<T>) -> Option<Self>
pub fn try_new(inner: Chain<T>) -> Option<Self>
Convert Chain into SerialChain
If the input Chain has any branches it fails.
§Examples
let node = k::NodeBuilder::<f32>::new().into_node();
let chain = k::Chain::from_root(node);
assert!(k::SerialChain::try_new(chain).is_some());
let node0 = k::NodeBuilder::<f32>::new().into_node();
let node1 = k::NodeBuilder::new().into_node();
let node2 = k::NodeBuilder::new().into_node();
node1.set_parent(&node0);
node2.set_parent(&node0);
let chain = k::Chain::from_root(node0);
assert!(k::SerialChain::try_new(chain).is_none());
sourcepub fn from_end(end_joint: &Node<T>) -> SerialChain<T>
pub fn from_end(end_joint: &Node<T>) -> SerialChain<T>
Create SerialChain from the end Node
§Examples
let node = k::NodeBuilder::<f32>::new().into_node();
let s_chain = k::SerialChain::from_end(&node);
sourcepub fn from_end_to_root(
end_joint: &Node<T>,
root_joint: &Node<T>,
) -> SerialChain<T>
pub fn from_end_to_root( end_joint: &Node<T>, root_joint: &Node<T>, ) -> SerialChain<T>
Create SerialChain from the end Node
and root Node
.
§Examples
let node0 = k::NodeBuilder::<f32>::new().into_node();
let node1 = k::NodeBuilder::<f32>::new().into_node();
let node2 = k::NodeBuilder::<f32>::new().into_node();
let node3 = k::NodeBuilder::<f32>::new().into_node();
use k::connect;
connect![node0 => node1 => node2 => node3];
let s_chain = k::SerialChain::from_end_to_root(&node2, &node1);
assert_eq!(s_chain.iter().count(), 2);
sourcepub fn end_transform(&self) -> Isometry3<T>
pub fn end_transform(&self) -> Isometry3<T>
Calculate transform of the end joint
Methods from Deref<Target = Chain<T>>§
sourcepub fn set_origin(&self, pose: Isometry3<T>)
pub fn set_origin(&self, pose: Isometry3<T>)
Set the Chain
’s origin
§Examples
use k::*;
let l0 = Node::new(Joint::new("fixed0", JointType::Fixed));
let l1 = Node::new(Joint::new("fixed1", JointType::Fixed));
l1.set_parent(&l0);
let c = Chain::<f32>::from_end(&l1);
let mut o = c.origin();
assert!(o.translation.vector[0].abs() < 0.000001);
o.translation.vector[0] = 1.0;
c.set_origin(o);
assert!((o.translation.vector[0] - 1.0).abs() < 0.000001);
sourcepub fn iter(&self) -> impl Iterator<Item = &Node<T>>
pub fn iter(&self) -> impl Iterator<Item = &Node<T>>
Iterate for all joint nodes
The order is from parent to children. You can assume that parent is already iterated.
§Examples
use k::*;
let l0 = Node::new(Joint::new("fixed0", JointType::Fixed));
let l1 = Node::new(Joint::new("fixed1", JointType::Fixed));
l1.set_parent(&l0);
let tree = Chain::<f64>::from_root(l0);
let names = tree.iter().map(|node| node.joint().name.to_owned()).collect::<Vec<_>>();
assert_eq!(names.len(), 2);
assert_eq!(names[0], "fixed0");
assert_eq!(names[1], "fixed1");
sourcepub fn iter_joints(&self) -> impl Iterator<Item = JointRefGuard<'_, T>>
pub fn iter_joints(&self) -> impl Iterator<Item = JointRefGuard<'_, T>>
Iterate for movable joints
Fixed joints are ignored. If you want to manipulate on Fixed,
use iter()
instead of iter_joints()
sourcepub fn iter_links(&self) -> impl Iterator<Item = LinkRefGuard<'_, T>>
pub fn iter_links(&self) -> impl Iterator<Item = LinkRefGuard<'_, T>>
Iterate for links
sourcepub fn dof(&self) -> usize
pub fn dof(&self) -> usize
Calculate the degree of freedom
§Examples
use k::*;
let l0 = NodeBuilder::new()
.joint_type(JointType::Fixed)
.finalize()
.into();
let l1 : Node<f64> = NodeBuilder::new()
.joint_type(JointType::Rotational{axis: Vector3::y_axis()})
.finalize()
.into();
l1.set_parent(&l0);
let tree = Chain::from_root(l0);
assert_eq!(tree.dof(), 1);
sourcepub fn find(&self, joint_name: &str) -> Option<&Node<T>>
pub fn find(&self, joint_name: &str) -> Option<&Node<T>>
Find the joint by name
§Examples
use k::*;
let l0 = Node::new(NodeBuilder::new()
.name("fixed")
.finalize());
let l1 = Node::new(NodeBuilder::new()
.name("pitch1")
.translation(Translation3::new(0.0, 0.1, 0.0))
.joint_type(JointType::Rotational{axis: Vector3::y_axis()})
.finalize());
l1.set_parent(&l0);
let tree = Chain::from_root(l0);
let j = tree.find("pitch1").unwrap();
j.set_joint_position(0.5).unwrap();
assert_eq!(j.joint_position().unwrap(), 0.5);
sourcepub fn find_link(&self, link_name: &str) -> Option<&Node<T>>
pub fn find_link(&self, link_name: &str) -> Option<&Node<T>>
Find the joint by link name
§Examples
use k::*;
let l0 = Node::new(NodeBuilder::new()
.name("fixed")
.finalize());
l0.set_link(Some(link::LinkBuilder::new().name("link0").finalize()));
let mut l1 = Node::new(NodeBuilder::new()
.name("pitch1")
.translation(Translation3::new(0.0, 0.1, 0.0))
.joint_type(JointType::Rotational{axis: Vector3::y_axis()})
.finalize());
l1.set_parent(&l0);
l1.set_link(Some(link::LinkBuilder::new().name("link1").finalize()));
let tree = Chain::from_root(l0);
let joint_name = tree.find_link("link1").unwrap()
.joint().name.clone();
assert_eq!(joint_name, "pitch1");
sourcepub fn joint_positions(&self) -> Vec<T>
pub fn joint_positions(&self) -> Vec<T>
Get the positions of the joints
FixedJoint
is ignored. the length is the same with dof()
sourcepub fn set_joint_positions(&self, positions_vec: &[T]) -> Result<(), Error>
pub fn set_joint_positions(&self, positions_vec: &[T]) -> Result<(), Error>
Set the positions of the joints
FixedJoints
are ignored. the input number must be equal with dof()
sourcepub fn set_joint_positions_clamped(&self, positions_vec: &[T])
pub fn set_joint_positions_clamped(&self, positions_vec: &[T])
Set the clamped positions of the joints
This function is safe, in contrast to set_joint_positions_unchecked
.
sourcepub fn set_joint_positions_unchecked(&self, positions_vec: &[T])
pub fn set_joint_positions_unchecked(&self, positions_vec: &[T])
Fast, but without check, dangerous set_joint_positions
sourcepub fn update_transforms(&self) -> Vec<Isometry3<T>>
pub fn update_transforms(&self) -> Vec<Isometry3<T>>
Update world_transform() of the joints
sourcepub fn update_velocities(&self) -> Vec<Velocity<T>>
pub fn update_velocities(&self) -> Vec<Velocity<T>>
Update world_velocity() of the joints
sourcepub fn update_link_transforms(&self)
pub fn update_link_transforms(&self)
Update transforms of the links
Trait Implementations§
source§impl<T> Clone for SerialChain<T>
impl<T> Clone for SerialChain<T>
source§impl<T> Deref for SerialChain<T>where
T: RealField,
impl<T> Deref for SerialChain<T>where
T: RealField,
Auto Trait Implementations§
impl<T> Freeze for SerialChain<T>
impl<T> RefUnwindSafe for SerialChain<T>
impl<T> Send for SerialChain<T>
impl<T> Sync for SerialChain<T>
impl<T> Unpin for SerialChain<T>
impl<T> UnwindSafe for SerialChain<T>
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
source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
clone_to_uninit
)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>
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>
self
from the equivalent element of its
superset. Read moresource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
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
self.to_subset
but without any property checks. Always succeeds.source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self
to the equivalent element of its superset.