Class

com.signalcollect.triplerush.vertices

SIndex

Related Doc: package vertices

Permalink

final class SIndex extends CardinalityCountingIndex with Forwarding[Any]

Linear Supertypes
Forwarding[Any], CardinalityCountingIndex, OptimizedIndexVertex, IndexVertex[Any], BaseVertex[Any], Vertex[Long, Any, Long, Any], Serializable, Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. SIndex
  2. Forwarding
  3. CardinalityCountingIndex
  4. OptimizedIndexVertex
  5. IndexVertex
  6. BaseVertex
  7. Vertex
  8. Serializable
  9. Serializable
  10. AnyRef
  11. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Instance Constructors

  1. new SIndex(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
    OptimizedIndexVertexIndexVertex
  5. def addEdge(e: Edge[Long], graphEditor: GraphEditor[Long, Any]): Boolean

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

    Permalink
    Definition Classes
    BaseVertex → 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 cardinality: Int

    Permalink
  10. var cardinalityCounter: Int

    Permalink
    Definition Classes
    CardinalityCountingIndex
  11. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  12. def deliverSignalWithSourceId(signal: Any, sourceId: Long, graphEditor: GraphEditor[Long, Any]): Boolean

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

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

    Permalink
    Definition Classes
    OptimizedIndexVertexBaseVertex → Vertex
  15. final def eq(arg0: AnyRef): Boolean

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    CardinalityCountingIndexIndexVertex
  24. def handleChildIdRequest(requestor: Long, graphEditor: GraphEditor[Long, Any]): Unit

    Permalink
    Definition Classes
    OptimizedIndexVertexIndexVertex
  25. def hashCode(): Int

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

    Permalink
    Definition Classes
    IndexVertex → Vertex
  27. final def isInstanceOf[T0]: Boolean

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

    Permalink
    Definition Classes
    AnyRef
  29. def nextRoutingAddress(childDelta: Int): Long

    Permalink
    Definition Classes
    SIndexForwarding
  30. final def notify(): Unit

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

    Permalink
    Definition Classes
    AnyRef
  32. final def numberOfStoredChildDeltas: Int

    Permalink
    Definition Classes
    OptimizedIndexVertex
    Annotations
    @inline()
  33. def processQuery(query: Array[Int], graphEditor: GraphEditor[Long, Any]): Unit

    Permalink
    Definition Classes
    Forwarding
  34. def removeAllEdges(graphEditor: GraphEditor[Long, Any]): Int

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

    Permalink
    Definition Classes
    BaseVertex → Vertex
  36. def scoreCollect: Double

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

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

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

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

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

    Permalink
    Definition Classes
    Forwarding
  42. def toString(): String

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

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

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

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

Inherited from Forwarding[Any]

Inherited from CardinalityCountingIndex

Inherited from OptimizedIndexVertex

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