Euclidean Class

Contains an implementation of greatest common denominator and least common multiple using the Euclidean algorithm.

Definition

Namespace: Gemstone.Numeric.Analysis
Assembly: Gemstone.Numeric (in Gemstone.Numeric.dll) Version: 1.0.166 -- Release Build+615b5375380e2ef684e1623e3d24332fd3a8e571
public static class Euclidean
Inheritance
Object    Euclidean

Methods

GreatestCommonDenominator(IEnumerableInt32) Gets the greatest common denominator of all the integers in the source collection.
GreatestCommonDenominator(IEnumerableInt64) Gets the greatest common denominator of all the integers in the source collection.
GreatestCommonDenominator(Int32) Gets the greatest common denominator of all the integers in the source collection.
GreatestCommonDenominator(Int64) Gets the greatest common denominator of all the integers in the source collection.
GreatestCommonDenominator(Int32, Int32) Gets the greatest common denominator of the given integers.
GreatestCommonDenominator(Int64, Int64) Gets the greatest common denominator of the given integers.
LeastCommonMultiple(IEnumerableInt32) Gets the least common multiple of all the integers in the source collection.
LeastCommonMultiple(IEnumerableInt64) Gets the least common multiple of all the integers in the source collection.
LeastCommonMultiple(Int32) Gets the least common multiple of all the integers in the source collection.
LeastCommonMultiple(Int64) Gets the least common multiple of all the integers in the source collection.
LeastCommonMultiple(Int32, Int32) Gets the least common multiple of the given integers.
LeastCommonMultiple(Int64, Int64) Gets the least common multiple of the given integers.
Mod Implementation of the modulo operator using Euclidean division.
Wrap Wraps a value to a range of values defined by the given minimum value and range.

See Also