Producer

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

   Definition Classes

   Any

7. def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

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

9. 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.

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

    Definition Classes

    AnyRef

11. def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

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

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. def hashCode(): Int

    Definition Classes

    AnyRef → Any

16. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

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 retrieveSummer[P <: Platform[P]](paths: List[Producer[P, _]]): Option[Summer[P, _, _]]

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

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

    Begin from some base representation.

    Begin from some base representation. An iterator for in-memory, for example.

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

    Definition Classes

    AnyRef

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

25. def toString(): String

    Definition Classes

    AnyRef → Any

26. 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.

27. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )