Dependants

Value Members

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

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

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

   

   Definition Classes

   AnyRef → Any

4. lazy val allTails: List[Producer[P, Any]]

   

   Definition Classes

   DependantGraph

5. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

6. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

7. def dependantsAfterMerge(inp: Producer[P, Any]): List[Producer[P, Any]]

   

   Return the first dependants of this node AFTER merges.

   Return the first dependants of this node AFTER merges. This will include no MergedProducer nodes, but all parents of the returned nodes will be Merged or the argument.

8. def dependantsOf(p: Producer[P, Any]): Option[List[Producer[P, Any]]]

   

   Definition Classes

   DependantGraph

9. def dependenciesOf(p: Producer[P, Any]): List[Producer[P, Any]]

   

   Definition Classes

   Dependants → DependantGraph

10. def depth(p: Producer[P, Any]): Option[Int]

    

    Definition Classes

    DependantGraph

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

    

    Definition Classes

    AnyRef

12. def fanOut(p: Producer[P, Any]): Option[Int]

    

    Definition Classes

    DependantGraph

13. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    

    Definition Classes

    AnyRef → Any

15. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

16. def isNode(p: Producer[P, Any]): Boolean

    

    The max of zero and 1 + depth of all parents if the node is the graph

    The max of zero and 1 + depth of all parents if the node is the graph

    Definition Classes

    DependantGraph

17. def namesOf(inp: Producer[P, Any]): List[NamedProducer[P, Any]]

    

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

    

    Definition Classes

    AnyRef

19. lazy val nodes: List[Producer[P, Any]]

    

    Definition Classes

    Dependants → DependantGraph

20. final def notify(): Unit

    

    Definition Classes

    AnyRef

21. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

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

    

    Definition Classes

    AnyRef

23. val tail: Producer[P, Any]

    

24. def transitiveDependantsOf(p: Producer[P, Any]): List[Producer[P, Any]]

    

    Return all dependendants of a given node.

    Return all dependendants of a given node. Does not include itself

    Definition Classes

    DependantGraph

25. def transitiveDependantsTillOutput(inp: Producer[P, Any]): List[Producer[P, Any]]

    

    Return all the dependants of this node, but don't go past any output nodes, such as Summer or WrittenProducer.

    Return all the dependants of this node, but don't go past any output nodes, such as Summer or WrittenProducer. This is for searching downstream until write/sum to see if certain optimizations can be enabled

26. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )