Class

org.maltparserx.core.syntaxgraph.node

GraphNode

Related Doc: package node

Permalink

abstract class GraphNode extends GraphElement with Node

Linear Supertypes
Node, ComparableNode, Comparable[ComparableNode], GraphElement, Element, Observable, AnyRef, Any
Known Subclasses
NonTerminal, Root, Token
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. GraphNode
  2. Node
  3. ComparableNode
  4. Comparable
  5. GraphElement
  6. Element
  7. Observable
  8. AnyRef
  9. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new GraphNode()

    Permalink

Abstract Value Members

  1. abstract def getCompareToIndex(): Int

    Permalink
    Definition Classes
    ComparableNode

  2. abstract def getIndex(): Int

    Permalink
    Definition Classes
    GraphNode → ComparableNode

  3. abstract def getLeftmostDescendant(): ComparableNode

    Permalink
    Definition Classes
    ComparableNode

  4. abstract def getLeftmostProperDescendant(): ComparableNode

    Permalink
    Definition Classes
    ComparableNode

  5. abstract def getRightmostDescendant(): ComparableNode

    Permalink
    Definition Classes
    ComparableNode

  6. abstract def getRightmostProperDescendant(): ComparableNode

    Permalink
    Definition Classes
    ComparableNode

  7. abstract def isRoot(): Boolean

    Permalink
    Definition Classes
    GraphNode → ComparableNode

  8. abstract def setIndex(index: Int): Unit

    Permalink
    Definition Classes
    GraphNode → Node

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. def addIncomingEdge(in: Edge): Unit

    Permalink
    Definition Classes
    GraphNode → Node

  5. def addLabel(labels: LabelSet): Unit

    Permalink
    Definition Classes
    GraphElement → Element

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

    Permalink
    Definition Classes
    GraphElement → Element

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

    Permalink
    Definition Classes
    GraphElement → Element

  8. def addObserver(arg0: Observer): Unit

    Permalink
    Definition Classes
    Observable

  9. def addOutgoingEdge(out: Edge): Unit

    Permalink
    Definition Classes
    GraphNode → Node

  10. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  11. def clear(): Unit

    Permalink
    Definition Classes
    GraphNode → GraphElement → Element

  12. def clearChanged(): Unit

    Permalink
    Attributes
    protected[java.util]
    Definition Classes
    Observable

  13. def clone(): AnyRef

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

  14. def compareTo(o: ComparableNode): Int

    Permalink
    Definition Classes
    GraphNode → Comparable

  15. def compareTo(o: GraphElement): Int

    Permalink
    Definition Classes
    GraphElement

  16. def countObservers(): Int

    Permalink
    Definition Classes
    Observable

  17. def deleteObserver(arg0: Observer): Unit

    Permalink
    Definition Classes
    Observable

  18. def deleteObservers(): Unit

    Permalink
    Definition Classes
    Observable

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

    Permalink
    Definition Classes
    AnyRef

  20. def equals(obj: Any): Boolean

    Permalink
    Definition Classes
    GraphNode → GraphElement → AnyRef → Any

  21. def finalize(): Unit

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

  22. def getBelongsToGraph(): SyntaxGraph

    Permalink
    Definition Classes
    GraphElement → Element

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

    Permalink
    Definition Classes
    AnyRef → Any

  24. def getInDegree(): Int

    Permalink
    Definition Classes
    GraphNode → ComparableNode

  25. def getIncomingEdgeIterator(): Iterator[Edge]

    Permalink
    Definition Classes
    GraphNode → Node

  26. def getIncomingSecondaryEdges(): SortedSet[Edge]

    Permalink
    Definition Classes
    GraphNode → ComparableNode

  27. def getLabelCode(table: SymbolTable): Int

    Permalink
    Definition Classes
    GraphElement → Element

  28. def getLabelSet(): LabelSet

    Permalink
    Definition Classes
    GraphElement → Element

  29. def getLabelSymbol(table: SymbolTable): String

    Permalink
    Definition Classes
    GraphElement → Element

  30. def getLabelTypes(): Set[SymbolTable]

    Permalink
    Definition Classes
    GraphElement → Element

  31. def getLeftmostDescendantIndex(): Int

    Permalink
    Definition Classes
    GraphNode → ComparableNode

  32. def getLeftmostProperDescendantIndex(): Int

    Permalink
    Definition Classes
    GraphNode → ComparableNode

  33. def getOutDegree(): Int

    Permalink
    Definition Classes
    GraphNode → ComparableNode

  34. def getOutgoingEdgeIterator(): Iterator[Edge]

    Permalink
    Definition Classes
    GraphNode → Node

  35. def getOutgoingSecondaryEdges(): SortedSet[Edge]

    Permalink
    Definition Classes
    GraphNode → ComparableNode

  36. def getRightmostDescendantIndex(): Int

    Permalink
    Definition Classes
    GraphNode → ComparableNode

  37. def getRightmostProperDescendantIndex(): Int

    Permalink
    Definition Classes
    GraphNode → ComparableNode

  38. def hasChanged(): Boolean

    Permalink
    Definition Classes
    Observable

  39. def hasLabel(table: SymbolTable): Boolean

    Permalink
    Definition Classes
    GraphElement → Element

  40. def hashCode(): Int

    Permalink
    Definition Classes
    GraphNode → GraphElement → AnyRef → Any

  41. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  42. def isLabeled(): Boolean

    Permalink
    Definition Classes
    GraphElement → Element

  43. def nLabels(): Int

    Permalink
    Definition Classes
    GraphElement → Element

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

    Permalink
    Definition Classes
    AnyRef

  45. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  46. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  47. def notifyObservers(arg0: Any): Unit

    Permalink
    Definition Classes
    Observable

  48. def notifyObservers(): Unit

    Permalink
    Definition Classes
    Observable

  49. def removeIncomingEdge(in: Edge): Unit

    Permalink
    Definition Classes
    GraphNode → Node

  50. def removeLabel(table: SymbolTable): Unit

    Permalink
    Definition Classes
    GraphElement → Element

  51. def removeLabels(): Unit

    Permalink
    Definition Classes
    GraphElement → Element

  52. def removeOutgoingEdge(out: Edge): Unit

    Permalink
    Definition Classes
    GraphNode → Node

  53. def setBelongsToGraph(belongsToGraph: SyntaxGraph): Unit

    Permalink
    Definition Classes
    GraphElement → Element

  54. def setChanged(): Unit

    Permalink
    Attributes
    protected[java.util]
    Definition Classes
    Observable

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

    Permalink
    Definition Classes
    AnyRef

  56. def toString(): String

    Permalink
    Definition Classes
    GraphNode → GraphElement → AnyRef → Any

  57. final def wait(): Unit

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

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

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

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

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

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