Trait

renesca.schema

Node

Related Doc: package schema

Permalink

trait Node extends Item with Filter

Linear Supertypes
Filter, Item, AnyRef, Any
Known Subclasses
HyperRelation
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Node
  2. Filter
  3. Item
  4. AnyRef
  5. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract val label: Label

    Permalink

  2. abstract val labels: Set[Label]

    Permalink

  3. abstract def rawItem: graph.Node

    Permalink
    Definition Classes
    Node → Item

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

    Permalink
    Definition Classes
    Any

  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef

  7. def equals(other: Any): Boolean

    Permalink
    Definition Classes
    Item → AnyRef → Any

  8. def filterHyperRelations[START <: Node, STARTRELATION <: Relation[START, HYPERRELATION], HYPERRELATION <: HyperRelation[START, STARTRELATION, HYPERRELATION, ENDRELATION, END], ENDRELATION <: Relation[HYPERRELATION, END], END <: Node](nodes: Seq[graph.Node], relations: Seq[graph.Relation], hyperRelationFactory: HyperRelationFactory[START, STARTRELATION, HYPERRELATION, ENDRELATION, END]): Seq[HYPERRELATION]

    Permalink
    Definition Classes
    Filter

  9. def filterNodes[T <: Node](nodes: Seq[graph.Node], nodeFactory: NodeFactory[T]): Seq[T]

    Permalink
    Definition Classes
    Filter

  10. def filterRelations[START <: Node, RELATION <: Relation[START, END], END <: Node](relations: Seq[graph.Relation], relationFactory: RelationFactory[START, RELATION, END]): Seq[RELATION]

    Permalink
    Definition Classes
    Filter

  11. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

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

    Permalink
    Definition Classes
    AnyRef → Any

  13. implicit def graph: graph.Graph

    Permalink
    Definition Classes
    Node → Filter

  14. def hashCode(): Int

    Permalink
    Definition Classes
    Item → AnyRef → Any

  15. def inRelationsAs[START <: Node, STARTRELATION <: Relation[START, HYPERRELATION], HYPERRELATION <: HyperRelation[START, STARTRELATION, HYPERRELATION, ENDRELATION, END], ENDRELATION <: Relation[HYPERRELATION, END], END <: Node](hyperRelationFactory: HyperRelationFactory[START, STARTRELATION, HYPERRELATION, ENDRELATION, END]): Seq[HYPERRELATION]

    Permalink

  16. def inRelationsAs[START <: Node, RELATION <: Relation[START, END], END <: Node](relationFactory: RelationFactory[START, RELATION, END]): Seq[RELATION]

    Permalink

  17. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    AnyRef

  19. def neighboursAs[T <: Node](nodeFactory: NodeFactory[T]): Seq[T]

    Permalink

  20. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  21. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  22. def outRelationsAs[START <: Node, STARTRELATION <: Relation[START, HYPERRELATION], HYPERRELATION <: HyperRelation[START, STARTRELATION, HYPERRELATION, ENDRELATION, END], ENDRELATION <: Relation[HYPERRELATION, END], END <: Node](hyperRelationFactory: HyperRelationFactory[START, STARTRELATION, HYPERRELATION, ENDRELATION, END]): Seq[HYPERRELATION]

    Permalink

  23. def outRelationsAs[START <: Node, RELATION <: Relation[START, END], END <: Node](relationFactory: RelationFactory[START, RELATION, END]): Seq[RELATION]

    Permalink

  24. def predecessorsAs[RELNODE <: Node, NODE <: RELNODE](nodeFactory: NodeFactory[NODE], hyperRelationFactory: HyperRelationFactory[RELNODE, _, _, _, _]): Seq[NODE]

    Permalink

  25. def predecessorsAs[RELNODE <: Node, NODE <: RELNODE](nodeFactory: NodeFactory[NODE], relationFactory: RelationFactory[RELNODE, _, _]): Seq[NODE]

    Permalink

  26. def relationsAs[START <: Node, STARTRELATION <: Relation[START, HYPERRELATION], HYPERRELATION <: HyperRelation[START, STARTRELATION, HYPERRELATION, ENDRELATION, END], ENDRELATION <: Relation[HYPERRELATION, END], END <: Node](hyperRelationFactory: HyperRelationFactory[START, STARTRELATION, HYPERRELATION, ENDRELATION, END]): Seq[HYPERRELATION]

    Permalink

  27. def relationsAs[START <: Node, RELATION <: Relation[START, END], END <: Node](relationFactory: RelationFactory[START, RELATION, END]): Seq[RELATION]

    Permalink

  28. def successorsAs[RELNODE <: Node, NODE <: RELNODE](nodeFactory: NodeFactory[NODE], hyperRelationFactory: HyperRelationFactory[_, _, _, _, RELNODE]): Seq[NODE]

    Permalink

  29. def successorsAs[RELNODE <: Node, NODE <: RELNODE](nodeFactory: NodeFactory[NODE], relationFactory: RelationFactory[_, _, RELNODE]): Seq[NODE]

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  31. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  32. def validate: Option[String]

    Permalink
    Definition Classes
    Item

  33. final def wait(): Unit

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

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

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

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

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

Inherited from Filter

Inherited from Item

Inherited from AnyRef

Inherited from Any

Ungrouped