Fix stylecop issues

Author: Kalkwst

Algorithms/DataCompression/BurrowsWheelerTransform.cs

@@ -16,7 +16,7 @@ public class BurrowsWheelerTransform
     ///     rotation matrix.
     /// </summary>
     /// <param name="s">Input string.</param>
-    public (string encoded, int index) Encode(string s)
+    public (string Encoded, int Index) Encode(string s)
     {
         if (s.Length == 0)
         {

Algorithms/Graph/FloydWarshall.cs

@@ -49,7 +49,7 @@ public class FloydWarshall<T>
         {
             for (var j = 0; j < distances.GetLength(0); j++)
             {
-                var dist = graph.AdjacentDistance(graph.Vertices[i] !, graph.Vertices[j] !);
+                var dist = graph.AdjacentDistance(graph.Vertices[i]!, graph.Vertices[j]!);
                 distances[i, j] = dist != 0 ? dist : double.PositiveInfinity;
             }
         }

Algorithms/LinearAlgebra/Eigenvalue/PowerIteration.cs

@@ -27,7 +27,7 @@ public static class PowerIteration
     /// <returns>Dominant eigenvalue and eigenvector pair.</returns>
     /// <exception cref="ArgumentException">The <paramref name="source" /> matrix is not square-shaped.</exception>
     /// <exception cref="ArgumentException">The length of the start vector doesn't equal the size of the source matrix.</exception>
-    public static (double eigenvalue, double[] eigenvector) Dominant(
+    public static (double Eigenvalue, double[] Eigenvector) Dominant(
         double[,] source,
         double[] startVector,
         double error = 0.00001)
@@ -61,7 +61,7 @@ public static (double eigenvalue, double[] eigenvector) Dominant(
 
         var eigenvalue = source.Multiply(currentEigenVector.ToColumnVector()).ToRowVector().Magnitude();
 
-        return (eigenvalue, eigenvector: currentEigenVector);
+        return (eigenvalue, Eigenvector: currentEigenVector);
     }
 
     /// <summary>
@@ -81,6 +81,6 @@ public static (double eigenvalue, double[] eigenvector) Dominant(
     /// <returns>Dominant eigenvalue and eigenvector pair.</returns>
     /// <exception cref="ArgumentException">The <paramref name="source" /> matrix is not square-shaped.</exception>
     /// <exception cref="ArgumentException">The length of the start vector doesn't equal the size of the source matrix.</exception>
-    public static (double eigenvalue, double[] eigenvector) Dominant(double[,] source, double error = 0.00001) =>
+    public static (double Eigenvalue, double[] Eigenvector) Dominant(double[,] source, double error = 0.00001) =>
         Dominant(source, new Random().NextVector(source.GetLength(1)), error);
 }

Algorithms/ModularArithmetic/ChineseRemainderTheorem.cs

@@ -49,7 +49,7 @@ public static long Compute(List<long> listOfAs, List<long> listOfNs)
             var n_i = listOfNs[i];
             var modulus_i = prodN / n_i;
 
-            var bezout_modulus_i = ExtendedEuclideanAlgorithm.Compute(n_i, modulus_i).bezoutB;
+            var bezout_modulus_i = ExtendedEuclideanAlgorithm.Compute(n_i, modulus_i).BezoutB;
             result += a_i * bezout_modulus_i * modulus_i;
         }
 
@@ -102,7 +102,7 @@ public static BigInteger Compute(List<BigInteger> listOfAs, List<BigInteger> lis
             var n_i = listOfNs[i];
             var modulus_i = prodN / n_i;
 
-            var bezout_modulus_i = ExtendedEuclideanAlgorithm.Compute(n_i, modulus_i).bezoutB;
+            var bezout_modulus_i = ExtendedEuclideanAlgorithm.Compute(n_i, modulus_i).BezoutB;
             result += a_i * bezout_modulus_i * modulus_i;
         }
 
@@ -145,7 +145,7 @@ private static void CheckRequirements(List<long> listOfAs, List<long> listOfNs)
             for (var j = i + 1; j < listOfNs.Count; j++)
             {
                 long gcd;
-                if ((gcd = ExtendedEuclideanAlgorithm.Compute(listOfNs[i], listOfNs[j]).gcd) != 1L)
+                if ((gcd = ExtendedEuclideanAlgorithm.Compute(listOfNs[i], listOfNs[j]).Gcd) != 1L)
                 {
                     throw new ArgumentException($"The GCD of n_{i} = {listOfNs[i]} and n_{j} = {listOfNs[j]} equals {gcd} and thus these values aren't coprime.");
                 }
@@ -182,7 +182,7 @@ private static void CheckRequirements(List<BigInteger> listOfAs, List<BigInteger
             for (var j = i + 1; j < listOfNs.Count; j++)
             {
                 BigInteger gcd;
-                if ((gcd = ExtendedEuclideanAlgorithm.Compute(listOfNs[i], listOfNs[j]).gcd) != BigInteger.One)
+                if ((gcd = ExtendedEuclideanAlgorithm.Compute(listOfNs[i], listOfNs[j]).Gcd) != BigInteger.One)
                 {
                     throw new ArgumentException($"The GCD of n_{i} = {listOfNs[i]} and n_{j} = {listOfNs[j]} equals {gcd} and thus these values aren't coprime.");
                 }

Algorithms/ModularArithmetic/ModularMultiplicativeInverse.cs

@@ -20,13 +20,13 @@ public static long Compute(long a, long n)
         var eeaResult = ExtendedEuclideanAlgorithm.Compute(a, n);
 
         // Check if there is an inverse:
-        if (eeaResult.gcd != 1)
+        if (eeaResult.Gcd != 1)
         {
             throw new ArithmeticException($"{a} is not invertible in Z/{n}Z.");
         }
 
         // Make sure, inverseOfA (i.e. the bezout coefficient of a) is in the interval [0, n).
-        var inverseOfA = eeaResult.bezoutA;
+        var inverseOfA = eeaResult.BezoutA;
         if (inverseOfA < 0)
         {
             inverseOfA += n;
@@ -47,13 +47,13 @@ public static BigInteger Compute(BigInteger a, BigInteger n)
         var eeaResult = ExtendedEuclideanAlgorithm.Compute(a, n);
 
         // Check if there is an inverse:
-        if (eeaResult.gcd != 1)
+        if (eeaResult.Gcd != 1)
         {
             throw new ArithmeticException($"{a} is not invertible in Z/{n}Z.");
         }
 
         // Make sure, inverseOfA (i.e. the bezout coefficient of a) is in the interval [0, n).
-        var inverseOfA = eeaResult.bezoutA;
+        var inverseOfA = eeaResult.BezoutA;
         if (inverseOfA < 0)
         {
             inverseOfA += n;

Algorithms/Search/FastSearcher.cs

@@ -44,7 +44,7 @@ public int FindIndex(Span<int> array, int item)
         return from + FindIndex(array.Slice(from, to - from + 1), item);
     }
 
-    private (int left, int right) ComputeIndices(Span<int> array, int item)
+    private (int Left, int Right) ComputeIndices(Span<int> array, int item)
     {
         var indexBinary = array.Length / 2;
 
@@ -62,7 +62,7 @@ public int FindIndex(Span<int> array, int item)
             : (indexInterpolation, indexBinary);
     }
 
-    private (int from, int to) SelectSegment(Span<int> array, int left, int right, int item)
+    private (int From, int To) SelectSegment(Span<int> array, int left, int right, int item)
     {
         if (item < array[left])
         {

Algorithms/Sorters/Comparison/MergeSorter.cs

@@ -57,7 +57,7 @@ private static void Merge(T[] array, T[] left, T[] right, IComparer<T> comparer)
         }
     }
 
-    private static (T[] left, T[] right) Split(T[] array)
+    private static (T[] Left, T[] Right) Split(T[] array)
     {
         var mid = array.Length / 2;
         return (array.Take(mid).ToArray(), array.Skip(mid).ToArray());