/**
* Destructor.
*/
- virtual ~GHOST_Rect()
- {};
+ virtual ~GHOST_Rect() {}
/**
* Access to rectangle width.
public:
GHOST_NDOFManager(GHOST_System&);
- virtual ~GHOST_NDOFManager() {};
+ virtual ~GHOST_NDOFManager() {}
// whether multi-axis functionality is available (via the OS or driver)
// does not imply that a device is plugged in or being used
* Constructor.
* Protected default constructor to force use of static createSystem member.
*/
- GHOST_SystemPaths() {};
+ GHOST_SystemPaths() {}
/**
* Destructor.
* Protected default constructor to force use of static dispose member.
*/
- virtual ~GHOST_SystemPaths() {};
+ virtual ~GHOST_SystemPaths() {}
public:
*/
virtual GHOST_TSuccess setProgressBar(float progress) {
return GHOST_kFailure;
- };
+ }
/**
* Hides the progress bar in the icon
*/
virtual GHOST_TSuccess endProgressBar() {
return GHOST_kFailure;
- };
+ }
/**
* Tells if the ongoing drag'n'drop object can be accepted upon mouse drop
*/
virtual GHOST_TSuccess setWindowCursorGrab(GHOST_TGrabCursorMode mode) {
return GHOST_kSuccess;
- };
+ }
/**
* Sets the cursor shape on the window using
{
public:
IK_QJacobianSolver();
- ~IK_QJacobianSolver() {};
+ ~IK_QJacobianSolver() {}
// setup pole vector constraint
void SetPoleVectorConstraint(IK_QSegment *tip, MT_Vector3& goal,
MT_Vector3& polegoal, float poleangle, bool getangle);
- float GetPoleAngle() { return m_poleangle; };
+ float GetPoleAngle() { return m_poleangle; }
// call setup once before solving, if it fails don't solve
bool Setup(IK_QSegment *root, std::list<IK_QTask*>& tasks);
virtual void UpdateAngleApply()=0;
// set joint limits
- virtual void SetLimit(int, MT_Scalar, MT_Scalar) {};
+ virtual void SetLimit(int, MT_Scalar, MT_Scalar) {}
// set joint weights (per axis)
- virtual void SetWeight(int, MT_Scalar) {};
+ virtual void SetWeight(int, MT_Scalar) {}
virtual void SetBasis(const MT_Matrix3x3& basis) { m_basis = basis; }
bool active,
const IK_QSegment *segment
);
- virtual ~IK_QTask() {};
+ virtual ~IK_QTask() {}
int Id() const
{ return m_size; }
const MT_Matrix3x3& goal
);
- MT_Scalar Distance() const { return m_distance; };
+ MT_Scalar Distance() const { return m_distance; }
void ComputeJacobian(IK_QJacobian& jacobian);
private:
class IK_QSolver {
public:
IK_QSolver() : root(NULL) {
- };
+ }
IK_QJacobianSolver solver;
IK_QSegment *root;
const MT_Quaternion &q
) {
setRotation(q);
- };
+ }
/**
* Accessors
vector(
) const {
return m_v;
- };
+ }
/**
* Set the exponential map from a quaternion
// constructors
- Matrix() : m_(0), n_(0), mn_(0), v_(0), row_(0), vm1_(0), rowm1_(0) {};
+ Matrix() : m_(0), n_(0), mn_(0), v_(0), row_(0), vm1_(0), rowm1_(0) {}
Matrix(const Matrix<T> &A)
{
// constructors
- Vector() : v_(0), vm1_(0), n_(0) {};
+ Vector() : v_(0), vm1_(0), n_(0) {}
Vector(const Vector<T> &A) : v_(0), vm1_(0), n_(0)
{
/**
* @brief determine the actual data type and channel info.
*/
- void relinkConnections(OutputSocket *relinkToSocket) { this->relinkConnections(relinkToSocket, false); };
+ void relinkConnections(OutputSocket *relinkToSocket) { this->relinkConnections(relinkToSocket, false); }
void relinkConnections(OutputSocket *relinkToSocket, bool single);
const int getNumberOfConnections() { return this->m_connections.size(); }