Skip to content

fix: Added @Ignore to the tests #672

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Oct 20, 2024
Merged

fix: Added @Ignore to the tests #672

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
11 changes: 11 additions & 0 deletions exercises/practice/binary-search-tree/src/test/kotlin/BinarySearchTreeTest.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,3 +1,4 @@
import kotlin.test.Ignore
import kotlin.test.Test
import kotlin.test.assertEquals
import kotlin.test.assertNotNull
Expand All @@ -15,6 +16,7 @@ class BinarySearchTreeTest {
assertEquals(expected, actual)
}

@Ignore
@Test
fun `inserts less`() {
val tree = BinarySearchTree<Char>()
Expand All @@ -32,6 +34,7 @@ class BinarySearchTreeTest {
assertEquals(expectedRoot, actualRoot)
}

@Ignore
@Test
fun `inserts same`() {
val tree = BinarySearchTree<String>()
Expand All @@ -49,6 +52,7 @@ class BinarySearchTreeTest {
assertEquals(expectedRoot, actualRoot)
}

@Ignore
@Test
fun `inserts right`() {
val tree = BinarySearchTree<Int>()
Expand All @@ -66,6 +70,7 @@ class BinarySearchTreeTest {
assertEquals(expectedRoot, actualRoot)
}

@Ignore
@Test
fun `creates complex tree`() {
val tree = BinarySearchTree<Char>()
Expand All @@ -76,6 +81,7 @@ class BinarySearchTreeTest {
assertEquals(expected, actual)
}

@Ignore
@Test
fun `sorts single element`() {
val tree = BinarySearchTree<String>()
Expand All @@ -85,6 +91,7 @@ class BinarySearchTreeTest {
assertEquals(expected, actual)
}

@Ignore
@Test
fun `sorts collection of two if second inserted is smaller than first`() {
val tree = BinarySearchTree<Int>()
Expand All @@ -95,6 +102,7 @@ class BinarySearchTreeTest {
assertEquals(expected, actual)
}

@Ignore
@Test
fun `sorts collection of two if second number is same as first`() {
val tree = BinarySearchTree<Char>()
Expand All @@ -105,6 +113,7 @@ class BinarySearchTreeTest {
assertEquals(expected, actual)
}

@Ignore
@Test
fun `sorts collection of two if second inserted is bigger than first`() {
val tree = BinarySearchTree<Char>()
Expand All @@ -115,6 +124,7 @@ class BinarySearchTreeTest {
assertEquals(expected, actual)
}

@Ignore
@Test
fun `iterates over complex tree`() {
val tree = BinarySearchTree<String>()
Expand All @@ -125,6 +135,7 @@ class BinarySearchTreeTest {
assertEquals(expected, actual)
}

@Ignore
@Test
fun `big tree level order`() {
val tree = BinarySearchTree<Int>()
Expand Down