Class

com.signalcollect.triplerush.vertices

SOIndex

Related Doc: package vertices

Permalink

final class SOIndex extends SearchableIndexVertex[Nothing, Nothing] with Binding

Linear Supertypes
Binding, SearchableIndexVertex[Nothing, Nothing], IndexVertex[Any], BaseVertex[Any], Vertex[Long, Any, Long, Any], Serializable, Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. SOIndex
  2. Binding
  3. SearchableIndexVertex
  4. IndexVertex
  5. BaseVertex
  6. Vertex
  7. Serializable
  8. Serializable
  9. AnyRef
  10. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Instance Constructors

  1. new SOIndex(id: Long)

    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 addChildDelta(delta: Int): Boolean

    Permalink
    Definition Classes
    SearchableIndexVertexIndexVertex
  5. def addEdge(e: Edge[Long], ge: GraphEditor[Long, Any]): Boolean

    Permalink
    Definition Classes
    BindingIndexVertexBaseVertex → Vertex
  6. def afterInitialization(graphEditor: GraphEditor[Long, Any]): Unit

    Permalink
    Definition Classes
    SearchableIndexVertexBaseVertex → Vertex
  7. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  8. def beforeRemoval(graphEditor: GraphEditor[Long, Any]): Unit

    Permalink
    Definition Classes
    BaseVertex → Vertex
  9. def bindIndividualQuery(childDelta: Int, query: Array[Int]): Array[Int]

    Permalink
    Definition Classes
    SOIndexBinding
    Annotations
    @inline()
  10. def bindQueryToAllTriples(query: Array[Int], graphEditor: GraphEditor[Long, Any]): Unit

    Permalink
    Definition Classes
    Binding
  11. def cardinality: Int

    Permalink
    Definition Classes
    SearchableIndexVertexIndexVertex
  12. final def childIdsContain(n: Int): Boolean

    Permalink
    Definition Classes
    SearchableIndexVertex
    Annotations
    @inline()
  13. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  14. def decrementParentIndexCardinalities(ge: GraphEditor[Long, Any]): Unit

    Permalink
    Definition Classes
    Binding
  15. def deliverSignalWithSourceId(signal: Any, sourceId: Long, graphEditor: GraphEditor[Long, Any]): Boolean

    Permalink
    Definition Classes
    BaseVertex → Vertex
  16. def deliverSignalWithoutSourceId(signal: Any, graphEditor: GraphEditor[Long, Any]): Boolean

    Permalink
    Definition Classes
    IndexVertex → Vertex
  17. def edgeCount: Int

    Permalink
    Definition Classes
    SearchableIndexVertexBaseVertex → Vertex
  18. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  19. def equals(other: Any): Boolean

    Permalink
    Definition Classes
    Vertex → AnyRef → Any
  20. def executeCollectOperation(graphEditor: GraphEditor[Long, Any]): Unit

    Permalink
    Definition Classes
    BaseVertex → Vertex
  21. def executeSignalOperation(graphEditor: GraphEditor[Long, Any]): Unit

    Permalink
    Definition Classes
    BaseVertex → Vertex
  22. def expose: Map[String, Any]

    Permalink
    Definition Classes
    IndexVertex → Vertex
  23. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  24. def foreachChildDelta(f: (Int) ⇒ Unit): Unit

    Permalink
    Definition Classes
    SearchableIndexVertexIndexVertex
    Annotations
    @inline()
  25. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  26. def handleCardinalityIncrement(i: Int): Unit

    Permalink
    Definition Classes
    IndexVertex
  27. def handleCardinalityRequest(c: CardinalityRequest, graphEditor: GraphEditor[Long, Any]): Unit

    Permalink

    Need to check if the pattern is fully bound, then answer with appropriate cardinality.

    Need to check if the pattern is fully bound, then answer with appropriate cardinality.

    Definition Classes
    SOIndexIndexVertex
  28. def handleChildIdRequest(requestor: Long, graphEditor: GraphEditor[Long, Any]): Unit

    Permalink
    Definition Classes
    SearchableIndexVertexIndexVertex
  29. def handleObjectCount(count: ObjectCountSignal): Unit

    Permalink
    Definition Classes
    IndexVertex
  30. def handleQueryBinding(childDelta: Int, query: Array[Int], graphEditor: GraphEditor[Long, Any]): Unit

    Permalink
    Definition Classes
    Binding
  31. def handleSubjectCount(count: SubjectCountSignal): Unit

    Permalink
    Definition Classes
    IndexVertex
  32. def hashCode(): Int

    Permalink
    Definition Classes
    Vertex → AnyRef → Any
  33. val id: Long

    Permalink
    Definition Classes
    IndexVertex → Vertex
  34. def incrementParentIndexCardinalities(ge: GraphEditor[Long, Any]): Unit

    Permalink
    Definition Classes
    Binding
  35. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  36. final def ne(arg0: AnyRef): Boolean

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

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

    Permalink
    Definition Classes
    AnyRef
  39. def onEdgeAdded(ge: GraphEditor[Long, Any]): Unit

    Permalink
    Definition Classes
    SOIndexBinding
  40. def processQuery(query: Array[Int], graphEditor: GraphEditor[Long, Any]): Unit

    Permalink

    Binds the queries to the pattern of this vertex and routes them to their next destinations.

    Binds the queries to the pattern of this vertex and routes them to their next destinations.

    Definition Classes
    SOIndexBindingIndexVertex
  41. def removeAllEdges(graphEditor: GraphEditor[Long, Any]): Int

    Permalink
    Definition Classes
    BaseVertex → Vertex
  42. def removeEdge(targetId: Long, graphEditor: GraphEditor[Long, Any]): Boolean

    Permalink
    Definition Classes
    BaseVertex → Vertex
  43. def routeSuccessfullyBound(boundParticle: Array[Int], graphEditor: GraphEditor[Long, Any]): Unit

    Permalink
    Definition Classes
    Binding
  44. def scoreCollect: Double

    Permalink
    Definition Classes
    BaseVertex → Vertex
  45. def scoreSignal: Double

    Permalink
    Definition Classes
    BaseVertex → Vertex
  46. def setState(s: Any): Unit

    Permalink
    Definition Classes
    BaseVertex → Vertex
  47. var state: Any

    Permalink
    Definition Classes
    BaseVertex → Vertex
  48. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  49. def targetIds: Traversable[Long]

    Permalink
    Definition Classes
    BaseVertex → Vertex
  50. def toString(): String

    Permalink
    Definition Classes
    BaseVertex → AnyRef → Any
  51. final def wait(): Unit

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

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

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

Inherited from Binding

Inherited from SearchableIndexVertex[Nothing, Nothing]

Inherited from IndexVertex[Any]

Inherited from BaseVertex[Any]

Inherited from Vertex[Long, Any, Long, Any]

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped