char.hpp

非常好的进化算法EC 实现平台 可以实现多种算法 GA GP

Beagle::Char operator+(const Beagle::Char& inLeftChar, const Beagle::Char& inRightChar)
{
  Beagle_StackTraceBeginM();
  return inLeftChar.getWrappedValue() + inRightChar.getWrappedValue();
  Beagle_StackTraceEndM("Char operator+(const Char& inLeftChar, const Char& inRightChar)");
}


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


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


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


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


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



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


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


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


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


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


/*!
 *  \brief   Multiply a Char with a char.
 *  \param   inLeftChar Left value to multiply.
 *  \param   inRightChar Right value to multiply.
 *  \return  Result of the multiply.
 */
inline
Beagle::Char operator*(const Beagle::Char& inLeftChar, char inRightChar)
{
  Beagle_StackTraceBeginM();
  return inLeftChar.getWrappedValue() * inRightChar;
  Beagle_StackTraceEndM("Char operator*(const Char& inLeftChar, char inRightChar)");
}


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


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


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


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


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


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


#endif // Beagle_Char_hpp