Go to the documentation of this file.
26 #ifndef TESSERACT_COMMON_JOINT_STATE_H
27 #define TESSERACT_COMMON_JOINT_STATE_H
31 #include <boost/serialization/export.hpp>
32 #include <boost/serialization/version.hpp>
33 #include <boost/uuid/uuid.hpp>
80 template <
class Archive>
81 void serialize(Archive& ar,
const unsigned int version);
106 using pointer =
typename std::vector<value_type>::pointer;
110 using reference =
typename std::vector<value_type>::reference;
114 using size_type =
typename std::vector<value_type>::size_type;
118 using iterator =
typename std::vector<value_type>::iterator;
126 template <
class InputIt>
208 template <
class InputIt>
211 states.insert(pos, first, last);
215 template <
class... Args>
226 template <
typename... Args>
227 #if __cplusplus > 201402L
236 void swap(std::vector<value_type>& other) noexcept;
241 template <
class Archive>
242 void serialize(Archive& ar,
const unsigned int version);
253 #endif // TESSERACT_COMMON_JOINT_STATE_H
bool empty() const
checks whether the container is empty
bool operator==(const JointTrajectory &other) const
size_type max_size() const
returns the maximum possible number of elements
reference at(size_type n)
access specified element with bounds checking
typename std::vector< value_type >::reference reference
typename std::vector< value_type >::iterator iterator
Eigen::VectorXd effort
The Effort at the waypoint (optional)
reference back()
access the last element
const_iterator cend() const
returns an iterator to the end
Eigen::VectorXd velocity
The velocity at the waypoint (optional)
reference front()
access the first element
reverse_iterator rend()
returns a reverse iterator to the end
iterator insert(const_iterator p, const value_type &x)
inserts element
void clear()
clears the contents
#define TESSERACT_COMMON_IGNORE_WARNINGS_PUSH
typename std::vector< value_type >::pointer pointer
reverse_iterator rbegin()
returns a reverse iterator to the beginning
friend class boost::serialization::access
JointTrajectory(std::string description="")
iterator erase(const_iterator p)
erases element
iterator begin()
returns an iterator to the beginning
iterator end()
returns an iterator to the end
typename std::vector< value_type >::const_pointer const_pointer
void pop_back()
removes the last element
reference operator[](size_type pos)
access specified element
bool operator==(const JointState &other) const
std::vector< std::string > joint_names
The joint corresponding to the position vector.
iterator emplace(const_iterator pos, Args &&... args)
constructs element in-place
const_iterator cbegin() const
returns an iterator to the beginning
void serialize(Archive &ar, const unsigned int version)
Eigen::VectorXd acceleration
The Acceleration at the waypoint (optional)
Represents a joint trajectory.
const_reverse_iterator crbegin() const
returns a reverse iterator to the beginning
void serialize(Archive &ar, const unsigned int version)
JointTrajectory(InputIt first, InputIt last)
void emplace_back(Args &&... args)
constructs an element in-place at the end
bool operator!=(const JointTrajectory &rhs) const
void insert(const_iterator pos, InputIt first, InputIt last)
double time
The Time from start at the waypoint (optional)
void reserve(size_type n)
reserve number of elements
const_reverse_iterator crend() const
returns a reverse iterator to the end
friend class boost::serialization::access
#define TESSERACT_COMMON_IGNORE_WARNINGS_POP
void shrink_to_fit()
reduces memory usage by freeing unused memory
size_type size() const
returns the number of elements
pointer data()
direct access to the underlying array
typename std::vector< value_type >::reverse_iterator reverse_iterator
Eigen::VectorXd position
The joint position at the waypoint.
std::vector< JointState > states
typename std::vector< value_type >::difference_type difference_type
typename std::vector< value_type >::const_reference const_reference
bool operator!=(const JointState &rhs) const
typename std::vector< value_type >::size_type size_type
void push_back(const value_type &x)
adds an element to the end
typename std::vector< value_type >::const_iterator const_iterator
size_type capacity() const
returns the number of elements that can be held in currently allocated storage
typename std::vector< value_type >::const_reverse_iterator const_reverse_iterator
void swap(std::vector< value_type > &other) noexcept
swaps the contents
tesseract_common
Author(s): Levi Armstrong
autogenerated on Sun May 18 2025 03:01:40