Class

io.gearpump.streaming.javaapi

Graph

Related Doc: package javaapi

Permalink

class Graph extends util.Graph[streaming.Processor[_ <: task.Task], Partitioner]

Linear Supertypes
util.Graph[streaming.Processor[_ <: task.Task], Partitioner], Serializable, Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Graph
  2. Graph
  3. Serializable
  4. Serializable
  5. AnyRef
  6. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Graph()

    Permalink

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. def addEdge(node1: streaming.Processor[_ <: task.Task], edge: Partitioner, node2: streaming.Processor[_ <: task.Task]): Unit

    Permalink
    Definition Classes
    Graph
  5. def addEdge(edge: (streaming.Processor[_ <: task.Task], Partitioner, streaming.Processor[_ <: task.Task])): Unit

    Permalink
    Definition Classes
    Graph
  6. def addGraph(other: util.Graph[streaming.Processor[_ <: task.Task], Partitioner]): util.Graph[streaming.Processor[_ <: task.Task], Partitioner]

    Permalink
    Definition Classes
    Graph
  7. def addVertex(vertex: streaming.Processor[_ <: task.Task]): Unit

    Permalink
    Definition Classes
    Graph
  8. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  9. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  10. def copy: util.Graph[streaming.Processor[_ <: task.Task], Partitioner]

    Permalink
    Definition Classes
    Graph
  11. def edges: List[(streaming.Processor[_ <: task.Task], Partitioner, streaming.Processor[_ <: task.Task])]

    Permalink
    Definition Classes
    Graph
  12. def edgesOf(node: streaming.Processor[_ <: task.Task]): List[(streaming.Processor[_ <: task.Task], Partitioner, streaming.Processor[_ <: task.Task])]

    Permalink
    Definition Classes
    Graph
  13. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  14. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  15. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  16. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  17. def hasCycle(): Boolean

    Permalink
    Definition Classes
    Graph
  18. def hasDuplicatedEdge(): Boolean

    Permalink
    Definition Classes
    Graph
  19. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  20. def inDegreeOf(node: streaming.Processor[_ <: task.Task]): Int

    Permalink
    Definition Classes
    Graph
  21. def incomingEdgesOf(node: streaming.Processor[_ <: task.Task]): List[(streaming.Processor[_ <: task.Task], Partitioner, streaming.Processor[_ <: task.Task])]

    Permalink
    Definition Classes
    Graph
  22. def isEmpty: Boolean

    Permalink
    Definition Classes
    Graph
  23. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  24. def mapEdge[NewEdge](fun: (streaming.Processor[_ <: task.Task], Partitioner, streaming.Processor[_ <: task.Task]) ⇒ NewEdge): util.Graph[streaming.Processor[_ <: task.Task], NewEdge]

    Permalink
    Definition Classes
    Graph
  25. def mapVertex[NewNode](fun: (streaming.Processor[_ <: task.Task]) ⇒ NewNode): util.Graph[NewNode, Partitioner]

    Permalink
    Definition Classes
    Graph
  26. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  27. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  28. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  29. def outDegreeOf(node: streaming.Processor[_ <: task.Task]): Int

    Permalink
    Definition Classes
    Graph
  30. def outgoingEdgesOf(node: streaming.Processor[_ <: task.Task]): List[(streaming.Processor[_ <: task.Task], Partitioner, streaming.Processor[_ <: task.Task])]

    Permalink
    Definition Classes
    Graph
  31. def removeVertex(node: streaming.Processor[_ <: task.Task]): Unit

    Permalink
    Definition Classes
    Graph
  32. def replaceVertex(node: streaming.Processor[_ <: task.Task], newNode: streaming.Processor[_ <: task.Task]): util.Graph[streaming.Processor[_ <: task.Task], Partitioner]

    Permalink
    Definition Classes
    Graph
  33. def subGraph(node: streaming.Processor[_ <: task.Task]): util.Graph[streaming.Processor[_ <: task.Task], Partitioner]

    Permalink
    Definition Classes
    Graph
  34. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  35. def toString(): String

    Permalink
    Definition Classes
    Graph → AnyRef → Any
  36. def topologicalOrderIterator: Iterator[streaming.Processor[_ <: task.Task]]

    Permalink
    Definition Classes
    Graph
  37. def topologicalOrderWithCirclesIterator: Iterator[streaming.Processor[_ <: task.Task]]

    Permalink
    Definition Classes
    Graph
  38. def vertexHierarchyLevelMap(): Map[streaming.Processor[_ <: task.Task], Int]

    Permalink
    Definition Classes
    Graph
  39. def vertices: List[streaming.Processor[_ <: task.Task]]

    Permalink
    Definition Classes
    Graph
  40. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  41. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  42. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from util.Graph[streaming.Processor[_ <: task.Task], Partitioner]

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped