|
Euclidean Class |
Contains an implementation of greatest common denominator
and least common multiple using the Euclidean algorithm.
Inheritance Hierarchy
Namespace: GSF.NumericalAnalysis
Assembly: GSF.Core (in GSF.Core.dll) Version: 2.4.181-beta
SyntaxThe Euclidean type exposes the following members.
Methods| Name | Description | |
|---|---|---|
 | 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