1
0
Fork 0
mirror of https://github.com/ethauvin/kobalt.git synced 2025-04-26 08:27:12 -07:00

Test refactoring.

This commit is contained in:
Cedric Beust 2016-04-25 19:46:54 -07:00
parent 0d68524271
commit 23e0a15385

View file

@ -36,36 +36,38 @@ class DynamicGraphTest {
@Test @Test
fun testExecutor() { fun testExecutor() {
val dg = DynamicGraph<String>(); DynamicGraph<String>().apply {
dg.addEdge("compile", "runApt") addEdge("compile", "runApt")
dg.addEdge("compile", "generateVersion") addEdge("compile", "generateVersion")
val runNodes = arrayListOf<String>() val runNodes = arrayListOf<String>()
val factory = createFactory(runNodes, { true }) val factory = createFactory(runNodes, { true })
DynamicGraphExecutor(dg, factory).run() DynamicGraphExecutor(this, factory).run()
Assert.assertEquals(runNodes.size, 3) Assert.assertEquals(runNodes.size, 3)
}
} }
@Test @Test
private fun testExecutorWithSkip() { private fun testExecutorWithSkip() {
DynamicGraph<Int>().apply {
val g = DynamicGraph<Int>() // 2 and 3 depend on 1, 4 depend on 3, 10 depends on 4
// 2 and 3 depend on 1, 4 depend on 3, 10 depends on 4 // 3 will blow up, which should make 4 and 10 skipped
// 3 will blow up, which should make 4 and 10 skipped addEdge(2, 1)
g.addEdge(2, 1) addEdge(3, 1)
g.addEdge(3, 1) addEdge(4, 3)
g.addEdge(4, 3) addEdge(10, 4)
g.addEdge(10, 4) addEdge(5, 2)
g.addEdge(5, 2) arrayListOf<Int>().let { runNodes ->
val runNodes = arrayListOf<Int>() val factory = createFactory(runNodes, { n -> n != 3 })
val factory = createFactory(runNodes, { n -> n != 3 }) val ex = DynamicGraphExecutor(this, factory)
val ex = DynamicGraphExecutor(g, factory) ex.run()
ex.run() Thread.`yield`()
Thread.`yield`() Assert.assertTrue(!runNodes.contains(4))
Assert.assertTrue(! runNodes.contains(4)) Assert.assertTrue(!runNodes.contains(10))
Assert.assertTrue(! runNodes.contains(10)) }
}
} }
@Test @Test
@ -130,7 +132,6 @@ class DynamicGraphTest {
@Test @Test
fun runAfter() { fun runAfter() {
DynamicGraph<String>().apply { DynamicGraph<String>().apply {
// a -> b // a -> b
// b -> c, d // b -> c, d