Ksaboor
/
JavaExercism
atdalīts no kristofer/JavaExercism
Vērot 1
Pievienot zvaigznīti 0
Atdalīts 0
Kods Problēmas 0 Izmaiņu pieprasījumi 0 Laidieni 0 Vikivietne Aktivitāte
Pārlūkot izejas kodu

binary-search-tree: add hint to @Ignore tags

Frida Johanne Tveit 9 gadus atpakaļ
vecāks
bbc77030df
revīzija
9984262556
1 mainītis faili ar 8 papildinājumiem un 8 dzēšanām
Dalītais skats Rādīt salīdzināšanas statistiku
  1. 8
    8
      exercises/binary-search-tree/src/test/java/BSTTest.java

+ 8
- 8
exercises/binary-search-tree/src/test/java/BSTTest.java Parādīt failu 

@@ -21,7 +21,7 @@ public class BSTTest {
21 21 
     }
22 22
23 23 
     @Test
24 
-    @Ignore
24 
+    @Ignore("Remove to run test")
25 25 
     public void insertsLess() {
26 26 
         BST<Integer> sut = new BST();
27 27 
         final int expectedRoot = 4;
 
@@ -42,7 +42,7 @@ public class BSTTest {
42 42 
     }
43 43
44 44 
     @Test
45 
-    @Ignore
45 
+    @Ignore("Remove to run test")
46 46 
     public void insertsSame() {
47 47 
         BST<Integer> sut = new BST();
48 48 
         final int expectedRoot = 4;
 
@@ -63,7 +63,7 @@ public class BSTTest {
63 63 
     }
64 64
65 65 
     @Test
66 
-    @Ignore
66 
+    @Ignore("Remove to run test")
67 67 
     public void insertsRight() {
68 68 
         BST<Integer> sut = new BST();
69 69 
         final int expectedRoot = 4;
 
@@ -84,7 +84,7 @@ public class BSTTest {
84 84 
     }
85 85
86 86 
     @Test
87 
-    @Ignore
87 
+    @Ignore("Remove to run test")
88 88 
     public void createsComplexTree() {
89 89 
         BST<Integer> sut = new BST<>();
90 90 
         List<Integer> expected = Collections.unmodifiableList(
 
@@ -101,7 +101,7 @@ public class BSTTest {
101 101 
     }
102 102
103 103 
     @Test
104 
-    @Ignore
104 
+    @Ignore("Remove to run test")
105 105 
     public void sortsSingleElement() {
106 106 
         BST<Integer> sut = new BST<>();
107 107 
         List<Integer> expected = Collections.unmodifiableList(
 
@@ -115,7 +115,7 @@ public class BSTTest {
115 115 
     }
116 116
117 117 
     @Test
118 
-    @Ignore
118 
+    @Ignore("Remove to run test")
119 119 
     public void sortsCollectionOfTwoIfSecondInsertedIsSmallerThanFirst() {
120 120 
         BST<Integer> sut = new BST<>();
121 121 
         List<Integer> expected = Collections.unmodifiableList(
 
@@ -130,7 +130,7 @@ public class BSTTest {
130 130 
     }
131 131
132 132 
     @Test
133 
-    @Ignore
133 
+    @Ignore("Remove to run test")
134 134 
     public void sortsCollectionOfTwoIfSecondInsertedIsBiggerThanFirst() {
135 135 
         BST<Integer> sut = new BST<>();
136 136 
         List<Integer> expected = Collections.unmodifiableList(
 
@@ -145,7 +145,7 @@ public class BSTTest {
145 145 
     }
146 146
147 147 
     @Test
148 
-    @Ignore
148 
+    @Ignore("Remove to run test")
149 149 
     public void iteratesOverComplexTree() {
150 150 
         BST<Integer> sut = new BST<>();
151 151 
         List<Integer> expected = Collections.unmodifiableList(