[Bot] Automated ReSharper CLT update

Author: kreghek

src/CombatDicesTeam.Graphs/DirectedGraph.cs

@@ -1,11 +1,11 @@
 using JetBrains.Annotations;
 
-namespace CombatDicesTeam.Graphs;
-
-/// <summary>
-/// Base implementation of the graph.
-/// </summary>
-/// <typeparam name="TNodePayload">Type of node data.</typeparam>
+namespace CombatDicesTeam.Graphs;
+
+/// <summary>
+/// Base implementation of the graph.
+/// </summary>
+/// <typeparam name="TNodePayload">Type of node data.</typeparam>
 [PublicAPI]
 public sealed class DirectedGraph<TNodePayload> : IGraph<TNodePayload>
 {

tests/CombatDicesTeam.Graphs.Tests/DirectedGraphTests.cs

@@ -3,40 +3,40 @@
 namespace CombatDicesTeam.Graphs.Tests;
 
 public class DirectedGraphTests
-{
-    /// <summary>
-    /// Test checks a node from the middle of linear directed graph returns related node from the end as next.
-    /// </summary>
-    [Test]
-    public void GetNext_LinearGraph3_ReturnsSingleNodeFromRoot()
-    {
-        // ARRANGE
-
-        var graph = new DirectedGraph<int>();
-
-        var nodeList = new List<IGraphNode<int>>();
-        const int SEQUENCE_LENGTH = 3;
-        for (var i = 0; i < SEQUENCE_LENGTH; i++)
-        {
-            var nodePayload = i;
-            var graphNode = Mock.Of<IGraphNode<int>>(x => x.Payload == nodePayload);
-            nodeList.Add(graphNode);
-        }
-
-        CreateLinearGraph(graph, nodeList);
-
-        // ACT
-
-        var next = graph.GetNext(nodeList[1]);
-
-        // ASSERT
-
-        next.Should().HaveCount(1).And.Subject.Should().Satisfy(x => x == nodeList[2]);
-    }
-
-    /// <summary>
-    /// Test checks a root returns related node as next.
-    /// </summary>
+{
+    /// <summary>
+    /// Test checks a node from the middle of linear directed graph returns related node from the end as next.
+    /// </summary>
+    [Test]
+    public void GetNext_LinearGraph3_ReturnsSingleNodeFromRoot()
+    {
+        // ARRANGE
+
+        var graph = new DirectedGraph<int>();
+
+        var nodeList = new List<IGraphNode<int>>();
+        const int SEQUENCE_LENGTH = 3;
+        for (var i = 0; i < SEQUENCE_LENGTH; i++)
+        {
+            var nodePayload = i;
+            var graphNode = Mock.Of<IGraphNode<int>>(x => x.Payload == nodePayload);
+            nodeList.Add(graphNode);
+        }
+
+        CreateLinearGraph(graph, nodeList);
+
+        // ACT
+
+        var next = graph.GetNext(nodeList[1]);
+
+        // ASSERT
+
+        next.Should().HaveCount(1).And.Subject.Should().Satisfy(x => x == nodeList[2]);
+    }
+
+    /// <summary>
+    /// Test checks a root returns related node as next.
+    /// </summary>
     [Test]
     public void GetNext_SimplestGraph_ReturnsSingleOtherNode()
     {