Reformat

Author: Oren (electricessence)

source/Open.Arithmetic.csproj

@@ -17,8 +17,6 @@ Part of the "Open" set of libraries.</Description>
     <PackageTags>dotnet, dotnet-core, dotnetcore, cs, math, dynamic, arithmetic, triangular, statistical, variance, covariance, correlation</PackageTags>
     <Version>1.4.0</Version>
     <PackageReleaseNotes></PackageReleaseNotes>
-    <AssemblyVersion>1.4.0.0</AssemblyVersion>
-    <FileVersion>1.4.0.0</FileVersion>
     <PackageLicenseExpression>MIT</PackageLicenseExpression>
   </PropertyGroup>
 

source/Statistical.cs

@@ -67,23 +67,20 @@ public static IEnumerable<double> Products(this IEnumerable<double> source, IEnu
 				throw new ArgumentNullException(nameof(target));
 			Contract.EndContractBlock();
 
-			using (var sourceEnumerator = source.GetEnumerator())
-			using (var targetEnumerator = target.GetEnumerator())
+			using var sourceEnumerator = source.GetEnumerator();
+			using var targetEnumerator = target.GetEnumerator();
+			while (true)
 			{
+				var sv = sourceEnumerator.MoveNext();
+				var tv = targetEnumerator.MoveNext();
 
-				while (true)
-				{
-					var sv = sourceEnumerator.MoveNext();
-					var tv = targetEnumerator.MoveNext();
+				if (sv != tv)
+					throw new Exception("Products: source and target enumerations have different counts.");
 
-					if (sv != tv)
-						throw new Exception("Products: source and target enumerations have different counts.");
+				if (!sv)
+					break;
 
-					if (!sv)
-						break;
-
-					yield return sourceEnumerator.Current * targetEnumerator.Current;
-				}
+				yield return sourceEnumerator.Current * targetEnumerator.Current;
 			}
 
 		}

source/Triangular.cs

@@ -161,19 +161,17 @@ public static IEnumerable<T> Increasing<T>(IEnumerable<T> source)
 			/// <returns>The repeated sequence.</returns>
 			public static IEnumerable<T> Decreasing<T>(IEnumerable<T> source)
 			{
-				using (var enumerator = source.GetEnumerator())
+				using var enumerator = source.GetEnumerator();
+				if (!enumerator.MoveNext()) yield break; // empty?
+
+				var list = new LinkedList<T>();
+				do
 				{
-					if (!enumerator.MoveNext()) yield break; // empty?
-
-					var list = new LinkedList<T>();
-					do
-					{
-						list.AddLast(enumerator.Current);
-						foreach (var e in list)
-							yield return e;
-					}
-					while (enumerator.MoveNext());
+					list.AddLast(enumerator.Current);
+					foreach (var e in list)
+						yield return e;
 				}
+				while (enumerator.MoveNext());
 			}
 
 			/// <summary>