Class

org.maltparserx.core.syntaxgraph.node

Root

Related Doc: package node

Permalink

class Root extends GraphNode with DependencyNode with PhraseStructureNode with NonTerminalNode

Linear Supertypes
NonTerminalNode, PhraseStructureNode, DependencyNode, GraphNode, Node, ComparableNode, Comparable[ComparableNode], GraphElement, Element, Observable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Root
  2. NonTerminalNode
  3. PhraseStructureNode
  4. DependencyNode
  5. GraphNode
  6. Node
  7. ComparableNode
  8. Comparable
  9. GraphElement
  10. Element
  11. Observable
  12. AnyRef
  13. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Root()

    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 addHeadEdgeLabel(labelSet: LabelSet): Unit

    Permalink
    Definition Classes
    Root → DependencyNode

  5. def addHeadEdgeLabel(table: SymbolTable, code: Int): Unit

    Permalink
    Definition Classes
    Root → DependencyNode

  6. def addHeadEdgeLabel(table: SymbolTable, symbol: String): Unit

    Permalink
    Definition Classes
    Root → DependencyNode

  7. def addIncomingEdge(in: Edge): Unit

    Permalink
    Definition Classes
    Root → GraphNode → Node

  8. def addLabel(labels: LabelSet): Unit

    Permalink
    Definition Classes
    GraphElement → Element

  9. def addLabel(table: SymbolTable, code: Int): Unit

    Permalink
    Definition Classes
    GraphElement → Element

  10. def addLabel(table: SymbolTable, symbol: String): Unit

    Permalink
    Definition Classes
    GraphElement → Element

  11. def addObserver(arg0: Observer): Unit

    Permalink
    Definition Classes
    Observable

  12. def addOutgoingEdge(out: Edge): Unit

    Permalink
    Definition Classes
    Root → GraphNode → Node

  13. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  14. def clear(): Unit

    Permalink
    Definition Classes
    Root → GraphNode → GraphElement → Element

  15. def clearChanged(): Unit

    Permalink
    Attributes
    protected[java.util]
    Definition Classes
    Observable

  16. def clone(): AnyRef

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

  17. def compareTo(o: ComparableNode): Int

    Permalink
    Definition Classes
    Root → GraphNode → Comparable

  18. def compareTo(o: GraphElement): Int

    Permalink
    Definition Classes
    GraphElement

  19. def countObservers(): Int

    Permalink
    Definition Classes
    Observable

  20. def deleteObserver(arg0: Observer): Unit

    Permalink
    Definition Classes
    Observable

  21. def deleteObservers(): Unit

    Permalink
    Definition Classes
    Observable

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

    Permalink
    Definition Classes
    AnyRef

  23. def equals(obj: Any): Boolean

    Permalink
    Definition Classes
    Root → GraphNode → GraphElement → AnyRef → Any

  24. def finalize(): Unit

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

  25. def findComponent(): DependencyNode

    Permalink
    Definition Classes
    Root → DependencyNode

  26. def getAncestor(): DependencyNode

    Permalink
    Definition Classes
    Root → DependencyNode

  27. def getBelongsToGraph(): SyntaxGraph

    Permalink
    Definition Classes
    GraphElement → Element

  28. def getChild(index: Int): PhraseStructureNode

    Permalink
    Definition Classes
    Root → NonTerminalNode

  29. def getChildren(): SortedSet[PhraseStructureNode]

    Permalink
    Definition Classes
    Root → NonTerminalNode

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

    Permalink
    Definition Classes
    AnyRef → Any

  31. def getClosestLeftDependent(): DependencyNode

    Permalink
    Definition Classes
    Root → DependencyNode

  32. def getClosestRightDependent(): DependencyNode

    Permalink
    Definition Classes
    Root → DependencyNode

  33. def getCompareToIndex(): Int

    Permalink
    Definition Classes
    Root → ComparableNode

  34. def getComponent(): DependencyNode

    Permalink
    Definition Classes
    Root → DependencyNode

  35. def getDependencyDominationSet(dominationSet: SortedSet[DependencyNode]): Unit

    Permalink
    Attributes
    protected[org.maltparserx.core.syntaxgraph.node]

  36. def getDependencyNodeDepth(): Int

    Permalink
    Definition Classes
    Root → DependencyNode

  37. def getHead(): DependencyNode

    Permalink
    Definition Classes
    Root → DependencyNode

  38. def getHeadChild(): PhraseStructureNode

    Permalink
    Definition Classes
    Root → NonTerminalNode

  39. def getHeadChild(headRules: HeadRules): PhraseStructureNode

    Permalink
    Definition Classes
    Root → NonTerminalNode

  40. def getHeadEdge(): Edge

    Permalink
    Definition Classes
    Root → DependencyNode

  41. def getHeadEdgeLabelCode(table: SymbolTable): Int

    Permalink
    Definition Classes
    Root → DependencyNode

  42. def getHeadEdgeLabelSet(): LabelSet

    Permalink
    Definition Classes
    Root → DependencyNode

  43. def getHeadEdgeLabelSymbol(table: SymbolTable): String

    Permalink
    Definition Classes
    Root → DependencyNode

  44. def getHeadEdgeLabelTypes(): Set[SymbolTable]

    Permalink
    Definition Classes
    Root → DependencyNode

  45. def getHeadEdges(): Set[Edge]

    Permalink
    Definition Classes
    Root → DependencyNode

  46. def getHeads(): Set[DependencyNode]

    Permalink
    Definition Classes
    Root → DependencyNode

  47. def getHeight(): Int

    Permalink
    Definition Classes
    Root → NonTerminalNode

  48. def getInDegree(): Int

    Permalink
    Definition Classes
    GraphNode → ComparableNode

  49. def getIncomingEdgeIterator(): Iterator[Edge]

    Permalink
    Definition Classes
    GraphNode → Node

  50. def getIncomingSecondaryEdges(): SortedSet[Edge]

    Permalink
    Definition Classes
    GraphNode → ComparableNode

  51. def getIndex(): Int

    Permalink
    Definition Classes
    Root → GraphNode → ComparableNode

  52. def getLabelCode(table: SymbolTable): Int

    Permalink
    Definition Classes
    GraphElement → Element

  53. def getLabelSet(): LabelSet

    Permalink
    Definition Classes
    GraphElement → Element

  54. def getLabelSymbol(table: SymbolTable): String

    Permalink
    Definition Classes
    GraphElement → Element

  55. def getLabelTypes(): Set[SymbolTable]

    Permalink
    Definition Classes
    GraphElement → Element

  56. def getLeftChild(): PhraseStructureNode

    Permalink
    Definition Classes
    Root → NonTerminalNode

  57. def getLeftDependent(index: Int): DependencyNode

    Permalink
    Definition Classes
    Root → DependencyNode

  58. def getLeftDependentCount(): Int

    Permalink
    Definition Classes
    Root → DependencyNode

  59. def getLeftDependents(): SortedSet[DependencyNode]

    Permalink
    Definition Classes
    Root → DependencyNode

  60. def getLeftSibling(): DependencyNode

    Permalink
    Definition Classes
    Root → DependencyNode

  61. def getLeftmostDependent(): DependencyNode

    Permalink
    Definition Classes
    Root → DependencyNode

  62. def getLeftmostDescendant(): ComparableNode

    Permalink
    Definition Classes
    Root → ComparableNode

  63. def getLeftmostDescendantIndex(): Int

    Permalink
    Definition Classes
    GraphNode → ComparableNode

  64. def getLeftmostProperDescendant(): ComparableNode

    Permalink
    Definition Classes
    Root → ComparableNode

  65. def getLeftmostProperDescendantIndex(): Int

    Permalink
    Definition Classes
    GraphNode → ComparableNode

  66. def getLexicalHead(): TokenNode

    Permalink
    Definition Classes
    Root → NonTerminalNode

  67. def getLexicalHead(headRules: HeadRules): TokenNode

    Permalink
    Definition Classes
    Root → NonTerminalNode

  68. def getOutDegree(): Int

    Permalink
    Definition Classes
    GraphNode → ComparableNode

  69. def getOutgoingEdgeIterator(): Iterator[Edge]

    Permalink
    Definition Classes
    GraphNode → Node

  70. def getOutgoingSecondaryEdges(): SortedSet[Edge]

    Permalink
    Definition Classes
    GraphNode → ComparableNode

  71. def getParent(): PhraseStructureNode

    Permalink
    Definition Classes
    Root → PhraseStructureNode

  72. def getParentEdge(): Edge

    Permalink
    Definition Classes
    Root → PhraseStructureNode

  73. def getParentEdgeLabelCode(table: SymbolTable): Int

    Permalink
    Definition Classes
    Root → PhraseStructureNode

  74. def getParentEdgeLabelSymbol(table: SymbolTable): String

    Permalink
    Definition Classes
    Root → PhraseStructureNode

  75. def getProperAncestor(): DependencyNode

    Permalink
    Definition Classes
    Root → DependencyNode

  76. def getRank(): Int

    Permalink
    Definition Classes
    Root → DependencyNode

  77. def getRightChild(): PhraseStructureNode

    Permalink
    Definition Classes
    Root → NonTerminalNode

  78. def getRightDependent(index: Int): DependencyNode

    Permalink
    Definition Classes
    Root → DependencyNode

  79. def getRightDependentCount(): Int

    Permalink
    Definition Classes
    Root → DependencyNode

  80. def getRightDependents(): SortedSet[DependencyNode]

    Permalink
    Definition Classes
    Root → DependencyNode

  81. def getRightSibling(): DependencyNode

    Permalink
    Definition Classes
    Root → DependencyNode

  82. def getRightmostDependent(): DependencyNode

    Permalink
    Definition Classes
    Root → DependencyNode

  83. def getRightmostDescendant(): ComparableNode

    Permalink
    Definition Classes
    Root → ComparableNode

  84. def getRightmostDescendantIndex(): Int

    Permalink
    Definition Classes
    GraphNode → ComparableNode

  85. def getRightmostProperDescendant(): ComparableNode

    Permalink
    Definition Classes
    Root → ComparableNode

  86. def getRightmostProperDescendantIndex(): Int

    Permalink
    Definition Classes
    GraphNode → ComparableNode

  87. def getSameSideLeftSibling(): DependencyNode

    Permalink
    Definition Classes
    Root → DependencyNode

  88. def getSameSideRightSibling(): DependencyNode

    Permalink
    Definition Classes
    Root → DependencyNode

  89. def hasAncestorInside(left: Int, right: Int): Boolean

    Permalink
    Definition Classes
    Root → DependencyNode

  90. def hasAtMostOneHead(): Boolean

    Permalink
    Definition Classes
    Root → DependencyNode

  91. def hasChanged(): Boolean

    Permalink
    Definition Classes
    Observable

  92. def hasDependent(): Boolean

    Permalink
    Definition Classes
    Root → DependencyNode

  93. def hasHead(): Boolean

    Permalink
    Definition Classes
    Root → DependencyNode

  94. def hasHeadEdgeLabel(table: SymbolTable): Boolean

    Permalink
    Definition Classes
    Root → DependencyNode

  95. def hasLabel(table: SymbolTable): Boolean

    Permalink
    Definition Classes
    GraphElement → Element

  96. def hasLeftDependent(): Boolean

    Permalink
    Definition Classes
    Root → DependencyNode

  97. def hasNonTerminalChildren(): Boolean

    Permalink
    Definition Classes
    Root → NonTerminalNode

  98. def hasParentEdgeLabel(table: SymbolTable): Boolean

    Permalink
    Definition Classes
    Root → PhraseStructureNode

  99. def hasRightDependent(): Boolean

    Permalink
    Definition Classes
    Root → DependencyNode

  100. def hasTerminalChildren(): Boolean

    Permalink
    Definition Classes
    Root → NonTerminalNode

  101. def hashCode(): Int

    Permalink
    Definition Classes
    Root → GraphNode → GraphElement → AnyRef → Any

  102. def identifyHead(headRules: HeadRules): TokenNode

    Permalink
    Definition Classes
    Root → NonTerminalNode

  103. def isContinuous(): Boolean

    Permalink
    Definition Classes
    Root → NonTerminalNode

  104. def isContinuousExcludeTerminalsAttachToRoot(): Boolean

    Permalink
    Definition Classes
    Root → NonTerminalNode

  105. def isHeadEdgeLabeled(): Boolean

    Permalink
    Definition Classes
    Root → DependencyNode

  106. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  107. def isLabeled(): Boolean

    Permalink
    Definition Classes
    GraphElement → Element

  108. def isProjective(): Boolean

    Permalink
    Definition Classes
    Root → DependencyNode

  109. def isRoot(): Boolean

    Permalink
    Definition Classes
    Root → GraphNode → ComparableNode

  110. def nChildren(): Int

    Permalink
    Definition Classes
    Root → NonTerminalNode

  111. def nHeadEdgeLabels(): Int

    Permalink
    Definition Classes
    Root → DependencyNode

  112. def nLabels(): Int

    Permalink
    Definition Classes
    GraphElement → Element

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

    Permalink
    Definition Classes
    AnyRef

  114. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  115. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  116. def notifyObservers(arg0: Any): Unit

    Permalink
    Definition Classes
    Observable

  117. def notifyObservers(): Unit

    Permalink
    Definition Classes
    Observable

  118. def removeIncomingEdge(in: Edge): Unit

    Permalink
    Definition Classes
    Root → GraphNode → Node

  119. def removeLabel(table: SymbolTable): Unit

    Permalink
    Definition Classes
    GraphElement → Element

  120. def removeLabels(): Unit

    Permalink
    Definition Classes
    GraphElement → Element

  121. def removeOutgoingEdge(out: Edge): Unit

    Permalink
    Definition Classes
    Root → GraphNode → Node

  122. def setBelongsToGraph(belongsToGraph: SyntaxGraph): Unit

    Permalink
    Definition Classes
    GraphElement → Element

  123. def setChanged(): Unit

    Permalink
    Attributes
    protected[java.util]
    Definition Classes
    Observable

  124. def setComponent(x: DependencyNode): Unit

    Permalink
    Definition Classes
    Root → DependencyNode

  125. def setIndex(index: Int): Unit

    Permalink
    Definition Classes
    Root → GraphNode → Node

  126. def setRank(r: Int): Unit

    Permalink
    Definition Classes
    Root → DependencyNode

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

    Permalink
    Definition Classes
    AnyRef

  128. def toString(): String

    Permalink
    Definition Classes
    Root → GraphNode → GraphElement → AnyRef → Any

  129. final def wait(): Unit

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

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

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

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

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

Inherited from NonTerminalNode

Inherited from PhraseStructureNode

Inherited from DependencyNode

Inherited from GraphNode

Inherited from Node

Inherited from ComparableNode

Inherited from Comparable[ComparableNode]

Inherited from GraphElement

Inherited from Element

Inherited from Observable

Inherited from AnyRef

Inherited from Any

Ungrouped