LGram16
dd97ddec92
Move git root from Client/ to src/ to track all source code: - Client: Game client source (moved to Client/Client/) - Server: Game server source - GameTools: Development tools - CryptoSource: Encryption utilities - database: Database scripts - Script: Game scripts - rylCoder_16.02.2008_src: Legacy coder tools - GMFont, Game: Additional resources 🤖 Generated with [Claude Code](https://claude.com/claude-code) Co-Authored-By: Claude <noreply@anthropic.com>
60 lines
1.2 KiB
C++
60 lines
1.2 KiB
C++
// Copyright (C) 2000 Stephen Cleary (shammah@voyager.net)
|
|
//
|
|
// This file can be redistributed and/or modified under the terms found
|
|
// in "copyright.html"
|
|
// This software and its documentation is provided "as is" without express or
|
|
// implied warranty, and with no claim as to its suitability for any purpose.
|
|
//
|
|
// See http://www.boost.org for updates, documentation, and revision history.
|
|
|
|
#ifndef BOOST_POOL_GCD_LCM_HPP
|
|
#define BOOST_POOL_GCD_LCM_HPP
|
|
|
|
namespace boost {
|
|
|
|
namespace details {
|
|
namespace pool {
|
|
|
|
// Greatest common divisor and least common multiple
|
|
|
|
//
|
|
// gcd is an algorithm that calculates the greatest common divisor of two
|
|
// integers, using Euclid's algorithm.
|
|
//
|
|
// Pre: A > 0 && B > 0
|
|
// Recommended: A > B
|
|
template <typename Integer>
|
|
Integer gcd(Integer A, Integer B)
|
|
{
|
|
do
|
|
{
|
|
const Integer tmp(B);
|
|
B = A % B;
|
|
A = tmp;
|
|
} while (B != 0);
|
|
|
|
return A;
|
|
}
|
|
|
|
//
|
|
// lcm is an algorithm that calculates the least common multiple of two
|
|
// integers.
|
|
//
|
|
// Pre: A > 0 && B > 0
|
|
// Recommended: A > B
|
|
template <typename Integer>
|
|
Integer lcm(const Integer & A, const Integer & B)
|
|
{
|
|
Integer ret = A;
|
|
ret /= gcd(A, B);
|
|
ret *= B;
|
|
return ret;
|
|
}
|
|
|
|
} // namespace pool
|
|
} // namespace details
|
|
|
|
} // namespace boost
|
|
|
|
#endif
|