Execute

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 addCaller[T](caller: A[T], target: A[T]): Unit

7. def addChecked[T](node: A[T])(implicit strategy: Strategy): Unit

   Ensures the given node has been added to the system.

   Ensures the given node has been added to the system. Once added, a node is pending until its inputs and dependencies have completed. Its computation is then evaluated and made available for nodes that have it as an input.

8. def addNew[T](node: A[T])(implicit strategy: Strategy): Unit

   Adds a node that has not yet been registered with the system.

   Adds a node that has not yet been registered with the system. If all of the node's dependencies have finished, the node's computation scheduled to run. The node's dependencies will be added (transitively) if they are not already registered.

9. def addReverse(node: A[_], dependent: A[_]): Unit

10. def added(d: A[_]): Boolean

11. def addedCheck(node: A[_]): Unit

12. def addedInv(node: A[_]): Unit

13. final def asInstanceOf[T0]: T0

    Definition Classes

    Any

14. def atState(d: A[_], s: State): Boolean

15. def call[T](node: A[T], target: A[T])(implicit strategy: Strategy): Unit

16. def callerResult[T](node: A[T], result: Result[T]): Result[T]

17. def calling(d: A[_]): Boolean

18. def clone(): AnyRef

    Attributes

    protected[lang]

    Definition Classes

    AnyRef

    Annotations

    @throws()

19. def complete: Boolean

20. def cycleCheck[T](node: A[T], target: A[T]): Unit

21. def cyclic[T](caller: A[T], target: A[T], msg: String): Nothing

22. def dependencies(v: sbt.Node[A, _]): Iterable[A[_]]

23. def dependencies(node: A[_]): Iterable[A[_]]

24. def dependencyCheck(node: A[_]): Unit

25. def done(d: A[_]): Boolean

26. def dump: String

27. def dumpCalling: String

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

    Definition Classes

    AnyRef

29. def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

30. def finalize(): Unit

    Attributes

    protected[lang]

    Definition Classes

    AnyRef

    Annotations

    @throws()

31. final def getClass(): java.lang.Class[_]

    Definition Classes

    AnyRef → Any

32. def getSeq(map: Map[A[_], Seq[A[_]]], node: A[_]): Seq[A[_]]

33. def hashCode(): Int

    Definition Classes

    AnyRef → Any

34. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

35. def isNew(d: A[_]): Boolean

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

    Definition Classes

    AnyRef

37. def newPre(node: A[_]): Unit

38. def notDone(d: A[_]): Boolean

39. final def notify(): Unit

    Definition Classes

    AnyRef

40. final def notifyAll(): Unit

    Definition Classes

    AnyRef

41. def notifyDone(node: A[_], dependent: A[_])(implicit strategy: Strategy): Unit

42. def pending(d: A[_]): Boolean

43. def pendingInv(node: A[_]): Unit

44. def post(f: ⇒ Unit): Unit

    Annotations

    @elidable( ASSERTION )

45. def pre(f: ⇒ Unit): Unit

    Annotations

    @elidable( ASSERTION )

46. def processAll()(implicit strategy: Strategy): Unit

47. def ready[T](node: A[T])(implicit strategy: Strategy): Unit

    Called when a pending 'node' becomes runnable.

    Called when a pending 'node' becomes runnable. All of its dependencies must be done. This schedules the node's computation with 'strategy'.

48. def readyInv(node: A[_]): Unit

49. def register[T](node: A[T]): Node[A, T]

    Enters the given node into the system.

50. def remove[K, V](map: Map[K, V], k: K): V

51. def retire[T](node: A[T], result: Result[T])(implicit strategy: Strategy): Unit

52. def run[T](root: A[T])(implicit strategy: Strategy): Result[T]

53. def runBefore(node: A[_]): Seq[A[_]]

54. def runKeep[T](root: A[T])(implicit strategy: Strategy): RMap[A, Result]

55. def running(d: A[_]): Boolean

56. def runningInv(node: A[_]): Unit

57. def snapshotCycleCheck(): Unit

58. def submit[T](node: A[T])(implicit strategy: Strategy): Unit

    Send the work for this node to the provided Strategy.

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

    Definition Classes

    AnyRef

60. def toString(): String

    Definition Classes

    AnyRef → Any

61. def topologicalSort(node: A[_]): Seq[A[_]]

62. def triggeredBy(node: A[_]): Seq[A[_]]

63. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws()

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

    Definition Classes

    AnyRef

    Annotations

    @throws()

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

    Definition Classes

    AnyRef

    Annotations

    @throws()

66. def work[T](node: A[T], f: ⇒ Either[A[T], T])(implicit strategy: Strategy): Completed

    Evaluates the computation 'f' for 'node'.

    Evaluates the computation 'f' for 'node'. This returns a Completed instance, which contains the post-processing to perform after the result is retrieved from the Strategy.