mirrors/element-android
1
0
Fork 0
mirror of https://github.com/element-hq/element-android synced 2024-11-28 05:31:21 +03:00
Code Issues Projects Releases Packages Wiki Activity

Use Junit import

Browse source
This commit is contained in:
Benoit Marty 2021-05-04 10:50:31 +02:00
parent 0a9fdea26d
commit 4189db0f89
1 changed files with 11 additions and 11 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

22
matrix-sdk-android/src/test/java/org/matrix/android/sdk/internal/util/GraphUtilsTest.kt
View file

@ -16,14 +16,14 @@
package org.matrix.android.sdk.internal.util package org.matrix.android.sdk.internal.util
import org.junit.Assert.assertEquals
import org.junit.Assert.assertNotNull
import org.junit.Assert.assertTrue
import org.junit.FixMethodOrder import org.junit.FixMethodOrder
import org.junit.Test import org.junit.Test
import org.junit.runners.MethodSorters import org.junit.runners.MethodSorters
import org.matrix.android.sdk.MatrixTest import org.matrix.android.sdk.MatrixTest
import org.matrix.android.sdk.internal.session.room.summary.Graph import org.matrix.android.sdk.internal.session.room.summary.Graph
import kotlin.test.assertEquals
import kotlin.test.assertNotNull
import kotlin.test.assertTrue
@FixMethodOrder(MethodSorters.JVM) @FixMethodOrder(MethodSorters.JVM)
class GraphUtilsTest : MatrixTest { class GraphUtilsTest : MatrixTest {
@ -44,7 +44,7 @@ class GraphUtilsTest : MatrixTest {
val backEdges = graph.findBackwardEdges(graph.getOrCreateNode("E")) val backEdges = graph.findBackwardEdges(graph.getOrCreateNode("E"))
assertTrue(backEdges.isEmpty(), "There should not be any cycle in this graphs") assertTrue("There should not be any cycle in this graphs", backEdges.isEmpty())
} }
@Test @Test
@ -68,21 +68,21 @@ class GraphUtilsTest : MatrixTest {
val backEdges = graph.findBackwardEdges(graph.getOrCreateNode("E")) val backEdges = graph.findBackwardEdges(graph.getOrCreateNode("E"))
System.out.println(backEdges.joinToString(" | ") { "${it.source.name} -> ${it.destination.name}" }) System.out.println(backEdges.joinToString(" | ") { "${it.source.name} -> ${it.destination.name}" })
assertTrue(backEdges.size == 2, "There should be 2 backward edges not ${backEdges.size}") assertEquals("There should be 2 backward edges not ${backEdges.size}", 2, backEdges.size)
val edge1 = backEdges.find { it.source.name == "C" } val edge1 = backEdges.find { it.source.name == "C" }
assertNotNull(edge1, "There should be a back edge from C") assertNotNull("There should be a back edge from C", edge1)
assertEquals("E", edge1.destination.name, "There should be a back edge C -> E") assertEquals("There should be a back edge C -> E", "E", edge1!!.destination.name)
val edge2 = backEdges.find { it.source.name == "B" } val edge2 = backEdges.find { it.source.name == "B" }
assertNotNull(edge2, "There should be a back edge from B") assertNotNull("There should be a back edge from B", edge2)
assertEquals("B", edge2.destination.name, "There should be a back edge C -> C") assertEquals("There should be a back edge C -> C", "B", edge2!!.destination.name)
// clean the graph // clean the graph
val acyclicGraph = graph.withoutEdges(backEdges) val acyclicGraph = graph.withoutEdges(backEdges)
System.out.println(acyclicGraph.toString()) System.out.println(acyclicGraph.toString())
assertTrue(acyclicGraph.findBackwardEdges(acyclicGraph.getOrCreateNode("E")).isEmpty(), "There should be no backward edges") assertTrue("There should be no backward edges", acyclicGraph.findBackwardEdges(acyclicGraph.getOrCreateNode("E")).isEmpty())
val flatten = acyclicGraph.flattenDestination() val flatten = acyclicGraph.flattenDestination()
@ -93,7 +93,7 @@ class GraphUtilsTest : MatrixTest {
assertTrue(flattenParentsB.contains(acyclicGraph.getOrCreateNode("A"))) assertTrue(flattenParentsB.contains(acyclicGraph.getOrCreateNode("A")))
val flattenParentsE = flatten[acyclicGraph.getOrCreateNode("E")] val flattenParentsE = flatten[acyclicGraph.getOrCreateNode("E")]
assertTrue(flattenParentsE!!.size == 3) assertEquals(3, flattenParentsE!!.size)
assertTrue(flattenParentsE.contains(acyclicGraph.getOrCreateNode("A"))) assertTrue(flattenParentsE.contains(acyclicGraph.getOrCreateNode("A")))
assertTrue(flattenParentsE.contains(acyclicGraph.getOrCreateNode("C"))) assertTrue(flattenParentsE.contains(acyclicGraph.getOrCreateNode("C")))
assertTrue(flattenParentsE.contains(acyclicGraph.getOrCreateNode("D"))) assertTrue(flattenParentsE.contains(acyclicGraph.getOrCreateNode("D")))