Skip to content
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

Jump to bottom

Add more tests #571

Merged
merged 2 commits into from
Dec 24, 2021
Merged

Add more tests #571

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
f120b22
Add a test for O(2^n) algorithm
Atry Dec 24, 2021
a3928f7
Add type assertion for taskSpec reification
Atry Dec 24, 2021
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
68 changes: 63 additions & 5 deletions domains-Task/.jvm/src/test/scala/com/thoughtworks/dsl/domains/taskSpec.scala
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -6,9 +6,8 @@ import com.thoughtworks.dsl.Dsl.{!!}
import org.scalatest.Assertion
import scala.language.implicitConversions

import com.thoughtworks.dsl.keywords.{Using, Each}
import com.thoughtworks.dsl.keywords.*, Match.+:
import com.thoughtworks.dsl.domains._
import com.thoughtworks.dsl.keywords.Shift

import scala.collection.mutable.ArrayBuffer
import scala.util.control.TailCalls
Expand All @@ -21,12 +20,71 @@ import org.scalatest.matchers.should.Matchers
*/
final class taskSpec extends AsyncFreeSpec with Matchers {

"O(2^n) algorithm should not stack overflow" in {
def fibonacci(n: Int): Task[Int] = {
val reified = reify {
n match {
case 0 =>
0
case 1 =>
1
case _ =>
!Shift(fibonacci(n - 1)) + !Shift(fibonacci(n - 2))
}
}
summon[
reified.type <:<
Typed[FlatMap[
Pure[n.type],
Match.WithIndex[(0), Pure[(0)]]
+:
Match.WithIndex[(1), Pure[(1)]]
+:
Match.WithIndex[(2), FlatMap[
Shift[Task.TaskDomain, Int],
FlatMap[Shift[Task.TaskDomain, Int], Pure[Int]]
]]
+: Nothing
], Int]
]
Task {

n match {
case 0 =>
0
case 1 =>
1
case _ =>
!Shift(fibonacci(n - 1)) + !Shift(fibonacci(n - 2))
}
}
}
Task.toFuture(fibonacci(25)).map {
_ should be(75025)
}
}
"tailRecursion" in Task.toFuture(Task {
def loop(i: Int = 0, accumulator: Int = 0): Task[Int] = Task {
if (i < 10000) {
def loop(i: Int = 0, accumulator: Int = 0): Task[Int] = {
val reified = reify(if (i < 10000) {
!Shift(loop(i + 1, accumulator + i))
} else {
accumulator
})
summon[reified.type <:< Typed[
If[Pure[
Boolean
], Shift[
Task.TaskDomain,
Int
], Pure[Int]],
Int
]]
Task {
if (i < 10000) {
!Shift(loop(i + 1, accumulator + i))
} else {
accumulator
}
}
}

Expand All @@ -42,7 +100,7 @@ final class taskSpec extends AsyncFreeSpec with Matchers {

val task1: Task[Int] = Task.now(1)

val ts = *[Task]/* .join */ apply Seq {
val ts = *[Task] /* .join */ apply Seq {
!Each(0 until 10) + !Shift(task1)
}

Expand Down