From 83cccb0f7565b2f3e704965d9299a38785d6af5e Mon Sep 17 00:00:00 2001 From: Looly Date: Thu, 17 Nov 2022 01:12:59 +0800 Subject: [PATCH] back --- .../java/cn/hutool/core/map/GraphTest.java | 18 +++++++++--------- 1 file changed, 9 insertions(+), 9 deletions(-) diff --git a/hutool-core/src/test/java/cn/hutool/core/map/GraphTest.java b/hutool-core/src/test/java/cn/hutool/core/map/GraphTest.java index 758d3e5eb..ae031c59f 100644 --- a/hutool-core/src/test/java/cn/hutool/core/map/GraphTest.java +++ b/hutool-core/src/test/java/cn/hutool/core/map/GraphTest.java @@ -15,7 +15,7 @@ public class GraphTest { @Test public void testPutEdge() { - final Graph graph = new Graph<>(); + Graph graph = new Graph<>(); graph.putEdge(0, 1); graph.putEdge(1, 2); graph.putEdge(2, 0); @@ -30,7 +30,7 @@ public class GraphTest { // 0 -- 1 // | | // 3 -- 2 - final Graph graph = new Graph<>(); + Graph graph = new Graph<>(); graph.putEdge(0, 1); graph.putEdge(1, 2); graph.putEdge(2, 3); @@ -53,7 +53,7 @@ public class GraphTest { @Test public void removeEdge() { - final Graph graph = new Graph<>(); + Graph graph = new Graph<>(); graph.putEdge(0, 1); Assert.assertTrue(graph.containsEdge(0, 1)); @@ -66,7 +66,7 @@ public class GraphTest { // 0 -- 1 // | | // 3 -- 2 - final Graph graph = new Graph<>(); + Graph graph = new Graph<>(); graph.putEdge(0, 1); graph.putEdge(1, 2); graph.putEdge(2, 3); @@ -87,7 +87,7 @@ public class GraphTest { // 0 -- 1 // | | // 3 -- 2 - final Graph graph = new Graph<>(); + Graph graph = new Graph<>(); graph.putEdge(0, 1); graph.putEdge(1, 2); graph.putEdge(2, 3); @@ -113,7 +113,7 @@ public class GraphTest { // 0 -- 1 // | | // 3 -- 2 - final Graph graph = new Graph<>(); + Graph graph = new Graph<>(); graph.putEdge(0, 1); graph.putEdge(1, 2); graph.putEdge(2, 3); @@ -130,7 +130,7 @@ public class GraphTest { // 0 -- 1 // | | // 3 -- 2 - final Graph graph = new Graph<>(); + Graph graph = new Graph<>(); graph.putEdge(0, 1); graph.putEdge(1, 2); graph.putEdge(2, 3); @@ -147,8 +147,8 @@ public class GraphTest { Assert.assertEquals(asSet(2, 0), graph.getAdjacentPoints(3)); } - @SafeVarargs - private static Set asSet(final T... ts) { + + private static Set asSet(T... ts) { return new LinkedHashSet<>(Arrays.asList(ts)); }