Object/Class

eu.cdevreeze.tqa.xpathaware.extension.table

ConceptRelationshipNodeData

Related Docs: class ConceptRelationshipNodeData | package table

Permalink

object ConceptRelationshipNodeData

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ConceptRelationshipNodeData
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. final case class ConceptTreeWalkSpec(startConcept: EName, includeSelf: Boolean, generationsOption: Option[Int], linkroleOption: Option[String], arcrole: String, linknameOption: Option[EName], arcnameOption: Option[EName]) extends Product with Serializable

    Permalink

    Specification of a concept tree walk starting with one concept (which must not be xfi:root but a real concept).

    Specification of a concept tree walk starting with one concept (which must not be xfi:root but a real concept). The tree walk finds descendant-or-self concepts in the network, but if the start concept must be excluded the tree walk only finds descendant concepts.

    The optional generations cannot contain 0. None means unbounded.

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(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  8. def filterDescendantOrSelfConcepts(treeWalkSpec: ConceptTreeWalkSpec, taxo: BasicTableTaxonomy): Set[EName]

    Permalink

    Returns the descendant-or-self concepts in a concept tree walk according to the parameter specification of the walk.

    Returns the descendant-or-self concepts in a concept tree walk according to the parameter specification of the walk. If the start concept must not be included, the tree walk finds descendant concepts instead of descendant-or-self concepts.

    TODO Mind networks of relationships (that is, after resolution of prohibition/overriding).

  9. def finalize(): Unit

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

  10. def findAllConceptsInConceptRelationshipNode(conceptRelationshipNode: ConceptRelationshipNode, taxo: BasicTableTaxonomy)(implicit xpathEvaluator: XPathEvaluator, scope: Scope): Set[EName]

    Permalink

    Finds all concepts referred to by the given concept relationship node in the given taxonomy.

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

    Permalink
    Definition Classes
    AnyRef → Any

  12. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  13. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    AnyRef

  15. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  16. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Definition Classes
    AnyRef

  18. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  19. final def wait(): Unit

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

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

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

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

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

Inherited from AnyRef

Inherited from Any

Ungrouped