mfbt/MathAlgorithms.h
author Geoff Brown <gbrown@mozilla.com>
Tue, 18 Dec 2012 22:18:03 -0700
changeset 125609 f9e5c189ae6bb96424ee9a243c5238c747951810
parent 108984 b2ad6e5fc690e5fd561ef698d0bf8e0f291d9d04
child 134111 5a8b3e397ffcc45895074dfdc68ee4ed947ec8b0
permissions -rw-r--r--
Bug 817235 - Make xpcshell tests work with sutAgent; r=jmaher

/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* This Source Code Form is subject to the terms of the Mozilla Public
 * License, v. 2.0. If a copy of the MPL was not distributed with this
 * file, You can obtain one at http://mozilla.org/MPL/2.0/. */

/* mfbt maths algorithms. */

#ifndef mozilla_MathAlgorithms_h_
#define mozilla_MathAlgorithms_h_

#include "mozilla/Assertions.h"

namespace mozilla {

// Greatest Common Divisor
template<typename IntegerType>
MOZ_ALWAYS_INLINE IntegerType
EuclidGCD(IntegerType a, IntegerType b)
{
  // Euclid's algorithm; O(N) in the worst case.  (There are better
  // ways, but we don't need them for the current use of this algo.)
  MOZ_ASSERT(a > 0);
  MOZ_ASSERT(b > 0);

  while (a != b) {
    if (a > b) {
      a = a - b;
    } else {
      b = b - a;
    }
  }

  return a;
}

// Least Common Multiple
template<typename IntegerType>
MOZ_ALWAYS_INLINE IntegerType
EuclidLCM(IntegerType a, IntegerType b)
{
  // Divide first to reduce overflow risk.
  return (a / EuclidGCD(a, b)) * b;
}

} /* namespace mozilla */

#endif  /* mozilla_MathAlgorithms_h_ */