identityCheck is checking whether the same edge has already added to the node. return whether truncation is needed that means the node has too many ed

Absolute value. See also:** Documentation for [std::fabs](https://en.cppreference.com/w/cpp/numeric/math/fabs). \param arg operand \return absolute va

Fixed point binary logarithm. This uses the BKM algorithm in L-mode. \param m mantissa in [1,2) as Q1.30 \param n number of iterations (at most 32) \r

Select value or signaling NaN. \param x preferred half-precision value \param y ignored half-precision value except for signaling NaN \return \a y if

Raise pole error and return infinity. \param sign half-precision value with sign bit only \return half-precision infinity with sign of \a sign \except

Hyperbolic area cosine. This function is exact to rounding for all rounding modes. See also:** Documentation for [std::acosh](https://en.cppreference

Nearest integer not greater than half value. See also:** Documentation for [std::floor](https://en.cppreference.com/w/cpp/numeric/math/floor). \param

Platform-independent sign mask. \param arg integer value in two's complement \retval -1 if \a arg negative \retval 0 if \a arg positive

64-bit division. \param x upper 32 bit of dividend \param y divisor \param s variable to store sticky bit for rounding \return (\a x << 32) / \a y

64-bit multiplication. \param x first factor \param y second factor \return upper 32 bit of \a x * \a y rounded to nearest

Fixed point binary exponential. This uses the BKM algorithm in E-mode. \param m exponent in [0,1) as Q0.31 \param n number of iterations (at most 32)

remove the specified object by id id : Object id.

Absolute value. See also:** Documentation for [std::abs](https://en.cppreference.com/w/cpp/numeric/math/fabs). \param arg operand \return absolute val

Check and signal for any NaN. \param x first half-precision value to check \param y second half-precision value to check \retval true if either \a x o