Files @ r12579:19fb2160904e
Branch filter:

Location: cpp/openttd-patchpack/source/src/core/math_func.cpp

translators
(svn r17029) -Update from WebTranslator v3.0:
catalan - 3 changes by arnaullv
simplified_chinese - 7 changes by Gavin
danish - 31 changes by silentStatic
dutch - 6 changes by Yexo
frisian - 54 changes by huddekul
greek - 40 changes by fumantsu
hungarian - 1 changes by IPG
indonesian - 3 changes by prof
italian - 6 changes by lorenzodv
korean - 6 changes by telk5093
portuguese - 23 changes by SupSuper
serbian - 98 changes by BlueEyedFiend
spanish - 15 changes by Terkhen
turkish - 9 changes by niw3
urdu - 30 changes by yasirniazkhan
/* $Id$ */

/** @file math_func.cpp Math functions. */

#include "../stdafx.h"
#include "math_func.hpp"

/**
 * Compute least common multiple (lcm) of arguments \a a and \a b, the smallest
 * integer value that is a multiple of both \a a and \a b.
 * @param a First number.
 * @param b second number.
 * @return Least common multiple of values \a a and \a b.
 *
 * @note This function only works for non-negative values of \a a and \a b.
 */
int LeastCommonMultiple(int a, int b)
{
	if (a == 0 || b == 0) return 0; // By definition.
	if (a == 1 || a == b) return b;
	if (b == 1) return a;

	return a * b / GreatestCommonDivisor(a, b);
}

/**
 * Compute greatest common divisor (gcd) of \a a and \a b.
 * @param a First number.
 * @param b second number.
 * @return Greatest common divisor of \a a and \a b.
 */
int GreatestCommonDivisor(int a, int b)
{
	while (b != 0) {
		int t = b;
		b = a % b;
		a = t;
	}
	return a;

}