aboutsummaryrefslogtreecommitdiff
path: root/guava-tests/test/com/google/common/graph/TraverserTest.java
diff options
context:
space:
mode:
Diffstat (limited to 'guava-tests/test/com/google/common/graph/TraverserTest.java')
-rw-r--r--guava-tests/test/com/google/common/graph/TraverserTest.java120
1 files changed, 42 insertions, 78 deletions
diff --git a/guava-tests/test/com/google/common/graph/TraverserTest.java b/guava-tests/test/com/google/common/graph/TraverserTest.java
index d4c8cf752..a941b9529 100644
--- a/guava-tests/test/com/google/common/graph/TraverserTest.java
+++ b/guava-tests/test/com/google/common/graph/TraverserTest.java
@@ -21,7 +21,7 @@ import static com.google.common.base.Preconditions.checkArgument;
import static com.google.common.base.Preconditions.checkNotNull;
import static com.google.common.collect.Lists.charactersOf;
import static com.google.common.truth.Truth.assertThat;
-import static org.junit.Assert.fail;
+import static org.junit.Assert.assertThrows;
import com.google.common.collect.HashMultiset;
import com.google.common.collect.ImmutableList;
@@ -311,11 +311,9 @@ public class TraverserTest {
@Test
public void forGraph_breadthFirst_emptyGraph() {
- try {
- Traverser.forGraph(createDirectedGraph()).breadthFirst('a');
- fail("Expected IllegalArgumentException");
- } catch (IllegalArgumentException expected) {
- }
+ assertThrows(
+ IllegalArgumentException.class,
+ () -> Traverser.forGraph(createDirectedGraph()).breadthFirst('a'));
}
/**
@@ -326,11 +324,9 @@ public class TraverserTest {
public void forGraph_breadthFirstIterable_emptyGraph() {
assertEqualCharNodes(
Traverser.forGraph(createDirectedGraph()).breadthFirst(charactersOf("")), "");
- try {
- Traverser.forGraph(createDirectedGraph()).breadthFirst(charactersOf("a"));
- fail("Expected IllegalArgumentException");
- } catch (IllegalArgumentException expected) {
- }
+ assertThrows(
+ IllegalArgumentException.class,
+ () -> Traverser.forGraph(createDirectedGraph()).breadthFirst(charactersOf("a")));
}
/**
@@ -509,22 +505,18 @@ public class TraverserTest {
@Test
public void forGraph_depthFirstPreOrder_emptyGraph() {
- try {
- Traverser.forGraph(createDirectedGraph()).depthFirstPreOrder('a');
- fail("Expected IllegalArgumentException");
- } catch (IllegalArgumentException expected) {
- }
+ assertThrows(
+ IllegalArgumentException.class,
+ () -> Traverser.forGraph(createDirectedGraph()).depthFirstPreOrder('a'));
}
@Test
public void forGraph_depthFirstPreOrderIterable_emptyGraph() {
assertEqualCharNodes(
Traverser.forGraph(createDirectedGraph()).depthFirstPreOrder(charactersOf("")), "");
- try {
- Traverser.forGraph(createDirectedGraph()).depthFirstPreOrder(charactersOf("a"));
- fail("Expected IllegalArgumentException");
- } catch (IllegalArgumentException expected) {
- }
+ assertThrows(
+ IllegalArgumentException.class,
+ () -> Traverser.forGraph(createDirectedGraph()).depthFirstPreOrder(charactersOf("a")));
}
@Test
@@ -691,22 +683,18 @@ public class TraverserTest {
@Test
public void forGraph_depthFirstPostOrder_emptyGraph() {
- try {
- Traverser.forGraph(createDirectedGraph()).depthFirstPostOrder('a');
- fail("Expected IllegalArgumentException");
- } catch (IllegalArgumentException expected) {
- }
+ assertThrows(
+ IllegalArgumentException.class,
+ () -> Traverser.forGraph(createDirectedGraph()).depthFirstPostOrder('a'));
}
@Test
public void forGraph_depthFirstPostOrderIterable_emptyGraph() {
assertEqualCharNodes(
Traverser.forGraph(createDirectedGraph()).depthFirstPostOrder(charactersOf("")), "");
- try {
- Traverser.forGraph(createDirectedGraph()).depthFirstPostOrder(charactersOf("a"));
- fail("Expected IllegalArgumentException");
- } catch (IllegalArgumentException expected) {
- }
+ assertThrows(
+ IllegalArgumentException.class,
+ () -> Traverser.forGraph(createDirectedGraph()).depthFirstPostOrder(charactersOf("a")));
}
@Test
@@ -749,11 +737,7 @@ public class TraverserTest {
MutableGraph<String> graph = GraphBuilder.undirected().build();
graph.putEdge("a", "b");
- try {
- Traverser.forTree(graph);
- fail("Expected exception");
- } catch (IllegalArgumentException expected) {
- }
+ assertThrows(IllegalArgumentException.class, () -> Traverser.forTree(graph));
}
@Test
@@ -770,11 +754,7 @@ public class TraverserTest {
MutableValueGraph<String, Integer> valueGraph = ValueGraphBuilder.undirected().build();
valueGraph.putEdgeValue("a", "b", 11);
- try {
- Traverser.forTree(valueGraph);
- fail("Expected exception");
- } catch (IllegalArgumentException expected) {
- }
+ assertThrows(IllegalArgumentException.class, () -> Traverser.forTree(valueGraph));
}
@Test
@@ -791,11 +771,7 @@ public class TraverserTest {
MutableNetwork<String, Integer> network = NetworkBuilder.undirected().build();
network.addEdge("a", "b", 11);
- try {
- Traverser.forTree(network);
- fail("Expected exception");
- } catch (IllegalArgumentException expected) {
- }
+ assertThrows(IllegalArgumentException.class, () -> Traverser.forTree(network));
}
@Test
@@ -889,22 +865,18 @@ public class TraverserTest {
@Test
public void forTree_breadthFirst_emptyGraph() {
- try {
- Traverser.forTree(createDirectedGraph()).breadthFirst('a');
- fail("Expected IllegalArgumentException");
- } catch (IllegalArgumentException expected) {
- }
+ assertThrows(
+ IllegalArgumentException.class,
+ () -> Traverser.forTree(createDirectedGraph()).breadthFirst('a'));
}
@Test
public void forTree_breadthFirstIterable_emptyGraph() {
assertEqualCharNodes(
Traverser.forTree(createDirectedGraph()).breadthFirst(charactersOf("")), "");
- try {
- Traverser.forTree(createDirectedGraph()).breadthFirst(charactersOf("a"));
- fail("Expected IllegalArgumentException");
- } catch (IllegalArgumentException expected) {
- }
+ assertThrows(
+ IllegalArgumentException.class,
+ () -> Traverser.forTree(createDirectedGraph()).breadthFirst(charactersOf("a")));
}
@Test
@@ -1026,22 +998,18 @@ public class TraverserTest {
@Test
public void forTree_depthFirstPreOrder_emptyGraph() {
- try {
- Traverser.forTree(createDirectedGraph()).depthFirstPreOrder('a');
- fail("Expected IllegalArgumentException");
- } catch (IllegalArgumentException expected) {
- }
+ assertThrows(
+ IllegalArgumentException.class,
+ () -> Traverser.forTree(createDirectedGraph()).depthFirstPreOrder('a'));
}
@Test
public void forTree_depthFirstPreOrderIterable_emptyGraph() {
assertEqualCharNodes(
Traverser.forTree(createDirectedGraph()).depthFirstPreOrder(charactersOf("")), "");
- try {
- Traverser.forTree(createDirectedGraph()).depthFirstPreOrder(charactersOf("a"));
- fail("Expected IllegalArgumentException");
- } catch (IllegalArgumentException expected) {
- }
+ assertThrows(
+ IllegalArgumentException.class,
+ () -> Traverser.forTree(createDirectedGraph()).depthFirstPreOrder(charactersOf("a")));
}
@Test
@@ -1156,22 +1124,18 @@ public class TraverserTest {
@Test
public void forTree_depthFirstPostOrder_emptyGraph() {
- try {
- Traverser.forTree(createDirectedGraph()).depthFirstPostOrder('a');
- fail("Expected IllegalArgumentException");
- } catch (IllegalArgumentException expected) {
- }
+ assertThrows(
+ IllegalArgumentException.class,
+ () -> Traverser.forTree(createDirectedGraph()).depthFirstPostOrder('a'));
}
@Test
public void forTree_depthFirstPostOrderIterable_emptyGraph() {
assertEqualCharNodes(
Traverser.forTree(createDirectedGraph()).depthFirstPostOrder(charactersOf("")), "");
- try {
- Traverser.forTree(createDirectedGraph()).depthFirstPostOrder(charactersOf("a"));
- fail("Expected IllegalArgumentException");
- } catch (IllegalArgumentException expected) {
- }
+ assertThrows(
+ IllegalArgumentException.class,
+ () -> Traverser.forTree(createDirectedGraph()).depthFirstPostOrder(charactersOf("a")));
}
@Test
@@ -1201,11 +1165,11 @@ public class TraverserTest {
}
private static SuccessorsFunction<Character> createDirectedGraph(String... edges) {
- return createGraph(/* directed = */ true, edges);
+ return createGraph(/* directed= */ true, edges);
}
private static SuccessorsFunction<Character> createUndirectedGraph(String... edges) {
- return createGraph(/* directed = */ false, edges);
+ return createGraph(/* directed= */ false, edges);
}
/**