mirror of https://github.com/KLayout/klayout.git
59 lines
1.2 KiB
C++
59 lines
1.2 KiB
C++
|
|
/*
|
|
|
|
KLayout Layout Viewer
|
|
Copyright (C) 2006-2017 Matthias Koefferlein
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation; either version 2 of the License, or
|
|
(at your option) any later version.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program; if not, write to the Free Software
|
|
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
|
|
|
*/
|
|
|
|
|
|
#ifndef HDR_tlMath
|
|
#define HDR_tlMath
|
|
|
|
#include "tlAssert.h"
|
|
|
|
namespace tl
|
|
{
|
|
|
|
/**
|
|
* @brief Compute the largest common divider of two numbers using the euclidian method
|
|
*/
|
|
template <class T>
|
|
T lcd (T a, T b)
|
|
{
|
|
while (true) {
|
|
if (a < b) {
|
|
b %= a;
|
|
if (b == 0) {
|
|
return a;
|
|
}
|
|
} else if (b < a) {
|
|
a %= b;
|
|
if (a == 0) {
|
|
return b;
|
|
}
|
|
} else {
|
|
return a;
|
|
}
|
|
}
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|