uint.hpp

来自「非常好的进化算法EC 实现平台 可以实现多种算法 GA GP」· HPP 代码 · 共 564 行 · 第 1/2 页

 *  \param inLeftUInt Left value to add.
 *  \param inRightUInt Right value to add.
 *  \return Result of the addition.
 */
inline
Beagle::UInt operator+(const Beagle::UInt& inLeftUInt, const Beagle::UInt& inRightUInt)
{
  Beagle_StackTraceBeginM();
  return inLeftUInt.getWrappedValue() + inRightUInt.getWrappedValue();
  Beagle_StackTraceEndM("UInt operator+(const UInt& inLeftUInt, const UInt& inRightUInt)");
}


/*!
 *  \brief Add a UInt with a unsigned int.
 *  \param inLeftUInt Left value to add.
 *  \param inRightUInt Right value to add.
 *  \return Result of the addition.
 */
inline
Beagle::UInt operator+(const Beagle::UInt& inLeftUInt, unsigned int inRightUInt)
{
  Beagle_StackTraceBeginM();
  return inLeftUInt.getWrappedValue() + inRightUInt;
  Beagle_StackTraceEndM("UInt operator+(const UInt& inLeftUInt, unsigned int inRightUInt)");
}


/*!
 *  \brief Add a UInt to a UInt.
 *  \param inLeftUInt Left value to which the right one is added.
 *  \param inRightUInt Value to add.
 *  \return Result of the addition.
 */
inline
Beagle::UInt& operator+=(Beagle::UInt& inLeftUInt, const Beagle::UInt& inRightUInt)
{
  Beagle_StackTraceBeginM();
  inLeftUInt.getWrappedValue() += inRightUInt.getWrappedValue();
  return inLeftUInt;
  Beagle_StackTraceEndM("UInt& operator+=(UInt& inLeftUInt, const UInt& inRightUInt)");
}


/*!
 *  \brief Add a unsigned int to a UInt.
 *  \param inLeftUInt Left value to which the right one is added.
 *  \param inRightUInt Value to add.
 *  \return Result of the addition.
 */
inline
Beagle::UInt& operator+=(Beagle::UInt& inLeftUInt, unsigned int inRightUInt)
{
  Beagle_StackTraceBeginM();
  inLeftUInt.getWrappedValue() += inRightUInt;
  return inLeftUInt;
  Beagle_StackTraceEndM("UInt& operator+=(UInt& inLeftUInt, unsigned int inRightUInt)");
}


/*!
 *  \brief Decrement a UInt (prefix version).
 *  \param inUInt UInt to decrement.
 *  \return UInt decremented.
 */
inline
Beagle::UInt& operator--(Beagle::UInt& inUInt)
{
  Beagle_StackTraceBeginM();
  inUInt.getWrappedValue()--;
  return inUInt;
  Beagle_StackTraceEndM("UInt& operator--(UInt& inUInt)");
}


/*!
 *  \brief Decrement a UInt (postfix version).
 *  \param inUInt UInt to decrement.
 *  \return UInt before being decremented.
 */
inline
Beagle::UInt operator--(Beagle::UInt& inUInt, int)
{
  Beagle_StackTraceBeginM();
  Beagle::UInt lUInt = inUInt;
  inUInt.getWrappedValue()--;
  return lUInt;
  Beagle_StackTraceEndM("UInt operator--(UInt& inUInt, int)");
}


/*!
 *  \brief Subtract two UInt.
 *  \param inLeftUInt Left value to subtract.
 *  \param inRightUInt Right value to subtract.
 *  \return Result of the subtract.
 */
inline
Beagle::UInt operator-(const Beagle::UInt& inLeftUInt, const Beagle::UInt& inRightUInt)
{
  Beagle_StackTraceBeginM();
  return inLeftUInt.getWrappedValue() - inRightUInt.getWrappedValue();
  Beagle_StackTraceEndM("UInt operator-(const UInt& inLeftUInt, const UInt& inRightUInt)");
}


/*!
 *  \brief Subtract a unsigned int from a UInt.
 *  \param inLeftUInt Left value to subtract.
 *  \param inRightUInt Right value to subtract.
 *  \return Result of the subtract.
 */
inline
Beagle::UInt operator-(const Beagle::UInt& inLeftUInt, unsigned int inRightUInt)
{
  Beagle_StackTraceBeginM();
  return inLeftUInt.getWrappedValue() - inRightUInt;
  Beagle_StackTraceEndM("UInt operator-(const UInt& inLeftUInt, unsigned int inRightUInt)");
}


/*!
 *  \brief Subtract a UInt from a UInt.
 *  \param inLeftUInt Left value from which the right unsigned int is subtracted.
 *  \param inRightUInt Value to subtract.
 *  \return Result of the subtraction.
 */
inline
Beagle::UInt& operator-=(Beagle::UInt& inLeftUInt, const Beagle::UInt& inRightUInt)
{
  Beagle_StackTraceBeginM();
  inLeftUInt.getWrappedValue() -= inRightUInt.getWrappedValue();
  return inLeftUInt;
  Beagle_StackTraceEndM("UInt& operator-=(UInt& inLeftUInt, const UInt& inRightUInt)");
}


/*!
 *  \brief Subtract a unsigned int from a UInt.
 *  \param inLeftUInt Left value from which the right unsigned int is subtracted.
 *  \param inRightUInt Value to subtract.
 *  \return Result of the subtraction.
 */
inline
Beagle::UInt& operator-=(Beagle::UInt& inLeftUInt, unsigned int inRightUInt)
{
  Beagle_StackTraceBeginM();
  inLeftUInt.getWrappedValue() -= inRightUInt;
  return inLeftUInt;
  Beagle_StackTraceEndM("UInt& operator-=(UInt& inLeftUInt, unsigned int inRightUInt)");
}


/*!
 *  \brief Multiply two UInt.
 *  \param inLeftUInt Left value to multiply.
 *  \param inRightUInt Right value to multiply.
 *  \return Result of the multiply.
 */
inline
Beagle::UInt operator*(const Beagle::UInt& inLeftUInt, const Beagle::UInt& inRightUInt)
{
  Beagle_StackTraceBeginM();
  return inLeftUInt.getWrappedValue() * inRightUInt.getWrappedValue();
  Beagle_StackTraceEndM("UInt operator*(const UInt& inLeftUInt, const UInt& inRightUInt)");
}


/*!
 *  \brief Multiply a UInt with a unsigned int.
 *  \param inLeftUInt Left value to multiply.
 *  \param inRightUInt Right value to multiply.
 *  \return Result of the multiply.
 */
inline
Beagle::UInt operator*(const Beagle::UInt& inLeftUInt, unsigned int inRightUInt)
{
  Beagle_StackTraceBeginM();
  return inLeftUInt.getWrappedValue() * inRightUInt;
  Beagle_StackTraceEndM("UInt operator*(const UInt& inLeftUInt, unsigned int inRightUInt)");
}


/*!
 *  \brief Multiply a UInt with a UInt.
 *  \param inLeftUInt Left value to which the right unsigned int is multiplied.
 *  \param inRightUInt Right value to multiply.
 *  \return Result of the multiplication.
 */
inline
Beagle::UInt& operator*=(Beagle::UInt& inLeftUInt, const Beagle::UInt& inRightUInt)
{
  Beagle_StackTraceBeginM();
  inLeftUInt.getWrappedValue() *= inRightUInt.getWrappedValue();
  return inLeftUInt;
  Beagle_StackTraceEndM("UInt& operator*=(UInt& inLeftUInt, const UInt& inRightUInt)");
}


/*!
 *  \brief Multiply a UInt with a unsigned int.
 *  \param inLeftUInt Left value from which the right unsigned int is multiplied.
 *  \param inRightUInt Right value to multiply.
 *  \return Result of the multiplication.
 */
inline
Beagle::UInt& operator*=(Beagle::UInt& inLeftUInt, unsigned int inRightUInt)
{
  Beagle_StackTraceBeginM();
  inLeftUInt.getWrappedValue() *= inRightUInt;
  return inLeftUInt;
  Beagle_StackTraceEndM("UInt& operator*=(UInt& inLeftUInt, unsigned int inRightUInt)");
}


/*!
 *  \brief Divide two UInt.
 *  \param inLeftUInt Left value to divide.
 *  \param inRightUInt Right value to divide.
 *  \return Result of the division.
 */
inline
Beagle::UInt operator/(const Beagle::UInt& inLeftUInt, const Beagle::UInt& inRightUInt)
{
  Beagle_StackTraceBeginM();
  return inLeftUInt.getWrappedValue() / inRightUInt.getWrappedValue();
  Beagle_StackTraceEndM("UInt operator/(const UInt& inLeftUInt, const UInt& inRightUInt)");
}


/*!
 *  \brief Divide a UInt with a unsigned int.
 *  \param inLeftUInt Left value to divide.
 *  \param inRightUInt Right value to divide.
 *  \return Result of the division.
 */
inline
Beagle::UInt operator/(const Beagle::UInt& inLeftUInt, unsigned int inRightUInt)
{
  Beagle_StackTraceBeginM();
  return inLeftUInt.getWrappedValue() / inRightUInt;
  Beagle_StackTraceEndM("UInt operator/(const UInt& inLeftUInt, unsigned int inRightUInt)");
}


/*!
 *  \brief Divide a UInt with a UInt.
 *  \param inLeftUInt Left value to which the right unsigned int is divided.
 *  \param inRightUInt Right value to divide.
 *  \return Result of the division.
 */
inline
Beagle::UInt& operator/=(Beagle::UInt& inLeftUInt, const Beagle::UInt& inRightUInt)
{
  Beagle_StackTraceBeginM();
  inLeftUInt.getWrappedValue() /= inRightUInt.getWrappedValue();
  return inLeftUInt;
  Beagle_StackTraceEndM("UInt& operator/=(UInt& inLeftUInt, const UInt& inRightUInt)");
}


/*!
 *  \brief Divide a UInt with a unsigned int.
 *  \param inLeftUInt Left value from which the right unsigned int is divided.
 *  \param inRightUInt Right value to divide.
 *  \return Result of the division.
 */
inline
Beagle::UInt operator/=(Beagle::UInt& inLeftUInt, unsigned int inRightUInt)
{
  Beagle_StackTraceBeginM();
  inLeftUInt.getWrappedValue() /= inRightUInt;
  return inLeftUInt;
  Beagle_StackTraceEndM("UInt operator/=(UInt& inLeftUInt, unsigned int inRightUInt)");
}


#endif // Beagle_UInt_hpp