diff --git a/src/Compilers/Core/CodeAnalysisTest/Collections/TopologicalSortTests.cs b/src/Compilers/Core/CodeAnalysisTest/Collections/TopologicalSortTests.cs
index e453dc7527617e70329da4f4cf90cd51a32a014d..135f2492d34f09f47df918c62ae4d82778cbbc88 100644
--- a/src/Compilers/Core/CodeAnalysisTest/Collections/TopologicalSortTests.cs
+++ b/src/Compilers/Core/CodeAnalysisTest/Collections/TopologicalSortTests.cs
@@ -129,7 +129,7 @@ public void TestRandom(int seed)
 
             // Then we produce a set of edges that is consistent with that possible topological sort
             int[][] successors = new int[numberOfNodes][];
-            for (int i = numberOfNodes-1; i >= 0; i--)
+            for (int i = numberOfNodes - 1; i >= 0; i--)
             {
                 successors[possibleSort[i]] = randomSubset((int)Math.Sqrt(i), i);
             }
diff --git a/src/Test/Utilities/Portable/Compilation/OperationTreeVerifier.cs b/src/Test/Utilities/Portable/Compilation/OperationTreeVerifier.cs
index f5e74f6ccb964672d20f10f5a95cc89466ea633e..a5136a6b30bf09183d2c2390fa33efd1d731729a 100644
--- a/src/Test/Utilities/Portable/Compilation/OperationTreeVerifier.cs
+++ b/src/Test/Utilities/Portable/Compilation/OperationTreeVerifier.cs
@@ -1773,7 +1773,8 @@ public override void VisitRecursivePattern(IRecursivePatternOperation operation)
             LogNewLine();
 
             VisitArray(operation.DeconstructionSubpatterns, $"{nameof(operation.DeconstructionSubpatterns)} ", true, true);
-            VisitArrayCommon(operation.PropertySubpatterns, $"{nameof(operation.PropertySubpatterns)} ", true, true, subpat => {
+            VisitArrayCommon(operation.PropertySubpatterns, $"{nameof(operation.PropertySubpatterns)} ", true, true, subpat =>
+            {
                 LogSymbol(subpat.Item1, "MatchedSymbol");
                 Visit(subpat.Item2, ", Pattern");
             });