Simbody  3.6

isInf(x) provides a reliable way to determine if x is one of the two infinities (either negative or positive). More...

## Functions

bool SimTK::isInf (const negator< float > &x)

bool SimTK::isInf (const negator< double > &x)

template<class P >
bool SimTK::isInf (const negator< std::complex< P > > &x)

template<class P >
bool SimTK::isInf (const negator< conjugate< P > > &x)

bool SimTK::isInf (const float &x)

bool SimTK::isInf (const double &x)

template<class P >
bool SimTK::isInf (const std::complex< P > &x)

template<class P >
bool SimTK::isInf (const conjugate< P > &x)

## Detailed Description

isInf(x) provides a reliable way to determine if x is one of the two infinities (either negative or positive).

This routine is specialized for all SimTK scalar types: float, double std::complex<P>, SimTK::conjugate<P>, and SimTK::negator<T>, where T is any of the above. For complex and conjugate types, isInf() returns true if both components are infinite, or one is infinite and the other finite. That is, isInf() will never return true if one component is NaN.

## ◆ isInf() [1/8]

 bool SimTK::isInf ( const negator< float > & x )
inline

## ◆ isInf() [2/8]

 bool SimTK::isInf ( const negator< double > & x )
inline

## ◆ isInf() [3/8]

template<class P >
 bool SimTK::isInf ( const negator< std::complex< P > > & x )
inline

## ◆ isInf() [4/8]

template<class P >
 bool SimTK::isInf ( const negator< conjugate< P > > & x )
inline

## ◆ isInf() [5/8]

 bool SimTK::isInf ( const float & x )
inline

## ◆ isInf() [6/8]

 bool SimTK::isInf ( const double & x )
inline

## ◆ isInf() [7/8]

template<class P >
 bool SimTK::isInf ( const std::complex< P > & x )
inline

## ◆ isInf() [8/8]

template<class P >
 bool SimTK::isInf ( const conjugate< P > & x )
inline