Producer

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. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

5. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

6. def dependenciesOf[P <: Platform[P]](p: Producer[P, Any]): List[Producer[P, Any]]

   

   the list of the Producers, this producer directly depends on

7. def entireGraphOf[P <: Platform[P]](p: Producer[P, Any]): List[Producer[P, Any]]

   

   return this and the recursively reachable nodes in depth first, left first order Differs from transitiveDependencies in that this goes up both sides of an either and it returns the input node.

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

   

   Definition Classes

   AnyRef

9. def equals(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

10. implicit def evToKeyed[P <: Platform[P], T, K, V](producer: Producer[P, T])(implicit ev: <:<[T, (K, V)]): KeyedProducer[P, K, V]

    

    implicit conversion from Producer[P, T] to KeyedProducer[P, K, V] when the type T is a tuple of (K, V) as proven by evidence ev enabling the operations on keys (sumByKey, ...)

11. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    

    Definition Classes

    AnyRef → Any

13. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

14. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

15. def isNoOp[P <: Platform[P]](p: Producer[P, Any]): Boolean

    

    Returns true if this node does not directly change the data (does not apply any transformation)

16. def isOutput[P <: Platform[P]](p: Producer[P, Any]): Boolean

    

    returns true if this Producer is an output of the DAG (Summer and WrittenProducer)

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

    

    Definition Classes

    AnyRef

18. final def notify(): Unit

    

    Definition Classes

    AnyRef

19. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

20. def parentsOf[P <: Platform[P]](in: Producer[P, Any]): List[Producer[P, Any]]

    

    The parents of the current node, possibly not its dependencies It differs from dependencies in that it will also return the predecessor of an AlsoProducer

21. def retrieveSummer[P <: Platform[P]](paths: List[Producer[P, _]]): Option[Summer[P, _, _]]

    

    Returns the first Summer of the provided list of Producers

22. implicit def semigroup[P <: Platform[P], T]: Semigroup[Producer[P, T]]

    

    a semigroup on producers where + means merge

23. def source[P <: Platform[P], T](s: Producer.source.P.Source[T]): Producer[P, T]

    

    A producer DAG starts from sources.

    A producer DAG starts from sources. The actual source type depend on the Platform. For example: An iterator for in-memory.

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

    

    Definition Classes

    AnyRef

25. implicit def toKeyed[P <: Platform[P], K, V](producer: Producer[P, (K, V)]): KeyedProducer[P, K, V]

    

    implicit conversion from Producer[P, (K, V)] to KeyedProducer[P, K, V] enabling the operations on keys (sumByKey, ...)

26. def toString(): String

    

    Definition Classes

    AnyRef → Any

27. def transitiveDependenciesOf[P <: Platform[P]](p: Producer[P, Any]): List[Producer[P, Any]]

    

    Return all dependencies of a given node in depth first, left first order.

28. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )