TrampolineUsage

Value Members

1. final def !=(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

2. final def !=(arg0: Any): Boolean

   Definition Classes

   Any

3. final def ##(): Int

   Definition Classes

   AnyRef → Any

4. final def ==(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

5. final def ==(arg0: Any): Boolean

   Definition Classes

   Any

6. def ack(m: Int, n: Int): Int

7. def ackermann(m: Int, n: Int): Free.Trampoline[Int]

8. def args: Array[String]

   Attributes

   protected

   Definition Classes

   App

9. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

10. def clone(): AnyRef

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

11. def delayedInit(body: ⇒ Unit): Unit

    Definition Classes

    App → DelayedInit

12. final def eq(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

13. def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

14. val executionStart: Long

    Definition Classes

    App

15. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

16. final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

17. def hashCode(): Int

    Definition Classes

    AnyRef → Any

18. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

19. def main(args: Array[String]): Unit

    Definition Classes

    App

20. final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

21. final def notify(): Unit

    Definition Classes

    AnyRef

22. final def notifyAll(): Unit

    Definition Classes

    AnyRef

23. def quickSort[F[+_], T](xs: List[T])(implicit arg0: Applicative[F], arg1: Order[T]): Free[F, List[T]]

24. def quickSort2[F[+_], F2[+_], T](xs: List[T], nat: ~>[F2, F], threshold: Int)(implicit arg0: Applicative[F], arg1: Applicative[F2], arg2: Order[T]): Free[F, List[T]]

    Run using F1 as a binding for lists longer than threshold, and F2 otherwise.

25. def runQuickSort[F[+_], T](xs: List[T])(implicit arg0: Applicative[F], arg1: Comonad[F], arg2: Order[T]): List[T]

26. def runQuickSort2[F[+_], F2[+_], T](xs: List[T], nat: ~>[F2, F], threshold: Int)(implicit arg0: Applicative[F], arg1: Comonad[F], arg2: Applicative[F2], arg3: Order[T]): List[T]

27. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes

    AnyRef

28. def toString(): String

    Definition Classes

    AnyRef → Any

29. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

30. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

31. final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

32. val xs: List[Int]