org.maltparser.core.lw.graph

Class LWNode

java.lang.Object

org.maltparser.core.lw.graph.LWNode

All Implemented Interfaces:

java.lang.Comparable<ComparableNode>, Element, ComparableNode, DependencyNode, Node

public final class LWNode
extends java.lang.Object
implements DependencyNode, Node

A lightweight version of org.maltparser.core.syntaxgraph.node.{Token,Root}

Author:

Johan Hall

Constructor Summary

Constructors

Modifier	Constructor and Description
protected	LWNode(LWDependencyGraph _graph, int _index)
protected	LWNode(LWDependencyGraph _graph, LWNode node)
protected	LWNode(LWNode node)

Method Summary

Modifier and Type	Method and Description
void	addColumnLabels(java.lang.String[] columnLabels)
void	addColumnLabels(java.lang.String[] columnLabels, boolean addEdges)
void	addHeadEdgeLabel(LabelSet labelSet)
void	addHeadEdgeLabel(SymbolTable table, int code)
void	addHeadEdgeLabel(SymbolTable table, java.lang.String symbol)
void	addIncomingEdge(Edge in)
void	addLabel(LabelSet labels) Adds the labels of the label set to the label set of the graph element.
void	addLabel(SymbolTable table, int code) Adds a label (an integer value) to the symbol table and to the graph element.
void	addLabel(SymbolTable table, java.lang.String symbol) Adds a label (a string value) to the symbol table and to the graph element.
void	addOutgoingEdge(Edge out)
void	clear() Resets the graph element.
int	compareTo(ComparableNode that)
boolean	equals(java.lang.Object obj)
DependencyNode	findComponent()
DependencyNode	getAncestor()
LabeledStructure	getBelongsToGraph() Returns the graph (structure) in which the graph element belongs to.
DependencyNode	getClosestLeftDependent() Returns the closest left dependent to the node it self, if not found null is returned.
DependencyNode	getClosestRightDependent() Returns the closest right dependent to the node it self, if not found null is returned.
int	getCompareToIndex() Returns the index of the node (only used internal by compareTo).
DependencyNode	getComponent()
int	getDependencyNodeDepth() Returns the depth of the node.
java.util.SortedSet<DependencyNode>	getDependents()
protected DependencyStructure	getGraph()
DependencyNode	getHead() Returns the head dependency node if it exists, otherwise null.
Edge	getHeadEdge() Returns the edge between the head and the node if it exists, otherwise null.
int	getHeadEdgeLabelCode(SymbolTable table)
LabelSet	getHeadEdgeLabelSet()
java.lang.String	getHeadEdgeLabelSymbol(SymbolTable table)
java.util.Set<SymbolTable>	getHeadEdgeLabelTypes()
java.util.Set<Edge>	getHeadEdges()
int	getHeadIndex()
java.util.SortedSet<DependencyNode>	getHeads()
java.util.Iterator<Edge>	getIncomingEdgeIterator()
java.util.SortedSet<Edge>	getIncomingSecondaryEdges() Returns a sorted set of incoming secondary edges.
int	getInDegree() Returns the in degree of the node (number of incoming edges of all types of edges).
int	getIndex() Returns the index of the node.
java.lang.String	getLabel(org.maltparser.concurrent.graph.dataformat.ColumnDescription column)
java.lang.String	getLabel(int columnPosition)
java.lang.String	getLabel(java.lang.String columnName)
int	getLabelCode(SymbolTable table) Returns the label code (an integer representation) of the symbol table if it exists, otherwise an exception is thrown.
java.util.SortedMap<org.maltparser.concurrent.graph.dataformat.ColumnDescription,java.lang.String>	getLabels()
LabelSet	getLabelSet() Returns the label set.
java.lang.String	getLabelSymbol(SymbolTable table) Returns the label symbol(a string representation) of the symbol table if it exists, otherwise an exception is thrown.
java.util.Set<SymbolTable>	getLabelTypes() Returns a set of symbol tables (labeling functions or label types) that labels the graph element.
DependencyNode	getLeftDependent(int leftDependentIndex) Returns the left dependent at the position index, where index==0 equals the left most dependent.
int	getLeftDependentCount() Return the number of left dependents
java.util.SortedSet<DependencyNode>	getLeftDependents() Returns a sorted set of left dependents.
DependencyNode	getLeftmostDependent()
ComparableNode	getLeftmostDescendant() Returns the left-most terminal descendant node.
int	getLeftmostDescendantIndex() Returns the index of the left-most terminal descendant node.
ComparableNode	getLeftmostProperDescendant() Returns the left-most proper terminal descendant node (excluding itself).
int	getLeftmostProperDescendantIndex() Returns the index of the left-most proper terminal descendant node (excluding itself).
DependencyNode	getLeftSibling() Returns the left sibling if it exists, otherwise null
java.util.List<DependencyNode>	getListOfDependents()
java.util.List<DependencyNode>	getListOfLeftDependents()
java.util.List<DependencyNode>	getListOfRightDependents()
int	getOutDegree() Returns the out degree of the node (number of outgoing edges of all types of edges).
java.util.Iterator<Edge>	getOutgoingEdgeIterator()
java.util.SortedSet<Edge>	getOutgoingSecondaryEdges() Returns a sorted set of outgoing secondary edges.
DependencyNode	getPredecessor() Returns the predecessor dependency node in the linear order of the token nodes.
DependencyNode	getProperAncestor()
int	getRank()
DependencyNode	getRightDependent(int rightDependentIndex)
int	getRightDependentCount() Return the number of right dependents
java.util.SortedSet<DependencyNode>	getRightDependents() Returns a sorted set of right dependents.
DependencyNode	getRightmostDependent()
ComparableNode	getRightmostDescendant() Returns the right-most terminal descendant node.
int	getRightmostDescendantIndex() Returns the index of the right-most terminal descendant node.
ComparableNode	getRightmostProperDescendant() Returns the right-most proper terminal descendant node (excluding itself).
int	getRightmostProperDescendantIndex() Returns the index of the right-most proper terminal descendant node (excluding itself).
DependencyNode	getRightSibling() Returns the right sibling if it exists, otherwise null
DependencyNode	getSameSideLeftSibling() Returns the left sibling at the same side of head as the node it self.
DependencyNode	getSameSideRightSibling() Returns the right sibling at the same side of head as the node it self.
DependencyNode	getSuccessor() Returns the successor dependency node in the linear order of the token nodes.
boolean	hasAncestorInside(int left, int right)
boolean	hasAtMostOneHead() Returns true if the node has at most one head, otherwise false.
boolean	hasDependent()
int	hashCode()
boolean	hasHead() Returns true if the node has one or more head(s), otherwise false.
boolean	hasHeadEdgeLabel(SymbolTable table)
boolean	hasLabel(org.maltparser.concurrent.graph.dataformat.ColumnDescription column)
boolean	hasLabel(int columnPosition)
boolean	hasLabel(java.lang.String columnName)
boolean	hasLabel(SymbolTable table) Returns true if the graph element has a label for the symbol table, otherwise false.
boolean	hasLeftDependent() Returns true if the node has one or more left dependents, otherwise false.
boolean	hasRightDependent()
boolean	isHeadEdgeLabeled()
boolean	isHeadLabeled()
boolean	isLabeled() Returns true if the graph element has one or more labels, otherwise false.
boolean	isProjective() Returns true if the head edge is projective, otherwise false.
boolean	isRoot() Returns true if the node is a root node, otherwise false.
int	nHeadEdgeLabels()
int	nLabels() Returns the number of labels of the graph element.
void	removeIncomingEdge(Edge in)
void	removeLabel(SymbolTable table)
void	removeLabels()
void	removeOutgoingEdge(Edge out)
void	setBelongsToGraph(LabeledStructure belongsToGraph) Sets the graph (structure) in which the graph element belongs to.
void	setComponent(DependencyNode x)
void	setIndex(int index)
void	setRank(int r)
java.lang.String	toString()

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, wait, wait, wait

Constructor Detail

LWNode

protected LWNode(LWNode node)
          throws LWGraphException

Throws:

LWGraphException

LWNode

protected LWNode(LWDependencyGraph _graph,
                 LWNode node)
          throws LWGraphException

Throws:

LWGraphException

LWNode

protected LWNode(LWDependencyGraph _graph,
                 int _index)
          throws LWGraphException

Throws:

LWGraphException

Method Detail

getGraph

protected DependencyStructure getGraph()

getIndex

public int getIndex()

Description copied from interface: ComparableNode

Returns the index of the node.

Specified by:

getIndex in interface ComparableNode

Returns:

the index of the node.

setIndex

public void setIndex(int index)
              throws MaltChainedException

Specified by:

setIndex in interface Node

Throws:

MaltChainedException

getLabel

public java.lang.String getLabel(int columnPosition)

getLabel

public java.lang.String getLabel(java.lang.String columnName)

getLabel

public java.lang.String getLabel(org.maltparser.concurrent.graph.dataformat.ColumnDescription column)

hasLabel

public boolean hasLabel(int columnPosition)

hasLabel

public boolean hasLabel(java.lang.String columnName)

hasLabel

public boolean hasLabel(org.maltparser.concurrent.graph.dataformat.ColumnDescription column)

isLabeled

public boolean isLabeled()

Description copied from interface: Element

Returns true if the graph element has one or more labels, otherwise false.

Specified by:

isLabeled in interface Element

Returns:

true if the graph element has one or more labels, otherwise false.

isHeadLabeled

public boolean isHeadLabeled()

getHeadIndex

public int getHeadIndex()

getLabels

public java.util.SortedMap<org.maltparser.concurrent.graph.dataformat.ColumnDescription,java.lang.String> getLabels()

getPredecessor

public DependencyNode getPredecessor()

Description copied from interface: DependencyNode

Returns the predecessor dependency node in the linear order of the token nodes.

Specified by:

getPredecessor in interface DependencyNode

Returns:

the predecessor dependency node in the linear order of the token nodes.

getSuccessor

public DependencyNode getSuccessor()

Description copied from interface: DependencyNode

Returns the successor dependency node in the linear order of the token nodes.

Specified by:

getSuccessor in interface DependencyNode

Returns:

the successor dependency node in the linear order of the token nodes.

isRoot

public boolean isRoot()

Description copied from interface: ComparableNode

Returns true if the node is a root node, otherwise false.

Specified by:

isRoot in interface ComparableNode

Returns:

true if the node is a root node, otherwise false.

hasAtMostOneHead

public boolean hasAtMostOneHead()

Description copied from interface: DependencyNode

Returns true if the node has at most one head, otherwise false.

Specified by:

hasAtMostOneHead in interface DependencyNode

Returns:

true if the node has at most one head, otherwise false.

hasHead

public boolean hasHead()

Description copied from interface: DependencyNode

Returns true if the node has one or more head(s), otherwise false.

Specified by:

hasHead in interface DependencyNode

Returns:

true if the node has one or more head(s), otherwise false.

hasDependent

public boolean hasDependent()

Specified by:

hasDependent in interface DependencyNode

hasLeftDependent

public boolean hasLeftDependent()

Description copied from interface: DependencyNode

Returns true if the node has one or more left dependents, otherwise false.

Specified by:

hasLeftDependent in interface DependencyNode

Returns:

true if the node has one or more left dependents, otherwise false.

hasRightDependent

public boolean hasRightDependent()

Specified by:

hasRightDependent in interface DependencyNode

getHeads

public java.util.SortedSet<DependencyNode> getHeads()

Specified by:

getHeads in interface DependencyNode

getHead

public DependencyNode getHead()

Description copied from interface: DependencyNode

Returns the head dependency node if it exists, otherwise null. If there exists more than one head the first head is returned according to the linear order of the terminals or the root if it is one of the heads.

Specified by:

getHead in interface DependencyNode

Returns:

the head dependency node if it exists, otherwise null.

getLeftDependent

public DependencyNode getLeftDependent(int leftDependentIndex)

Description copied from interface: DependencyNode

Returns the left dependent at the position index, where index==0 equals the left most dependent.

Specified by:

getLeftDependent in interface DependencyNode

Parameters:

leftDependentIndex - the index

Returns:

the left dependent at the position index, where index==0 equals the left most dependent

getLeftDependentCount

public int getLeftDependentCount()

Description copied from interface: DependencyNode

Return the number of left dependents

Specified by:

getLeftDependentCount in interface DependencyNode

Returns:

the number of left dependents

getLeftDependents

public java.util.SortedSet<DependencyNode> getLeftDependents()

Description copied from interface: DependencyNode

Returns a sorted set of left dependents.

Specified by:

getLeftDependents in interface DependencyNode

Returns:

a sorted set of left dependents.

getListOfLeftDependents

public java.util.List<DependencyNode> getListOfLeftDependents()

Specified by:

getListOfLeftDependents in interface DependencyNode

getLeftSibling

public DependencyNode getLeftSibling()

Description copied from interface: DependencyNode

Returns the left sibling if it exists, otherwise null

Specified by:

getLeftSibling in interface DependencyNode

Returns:

the left sibling if it exists, otherwise null

getSameSideLeftSibling

public DependencyNode getSameSideLeftSibling()

Description copied from interface: DependencyNode

Returns the left sibling at the same side of head as the node it self. If not found null is returned

Specified by:

getSameSideLeftSibling in interface DependencyNode

Returns:

the left sibling at the same side of head as the node it self. If not found null is returned

getClosestLeftDependent

public DependencyNode getClosestLeftDependent()

Description copied from interface: DependencyNode

Returns the closest left dependent to the node it self, if not found null is returned.

Specified by:

getClosestLeftDependent in interface DependencyNode

Returns:

the closest left dependent to the node it self, if not found null is returned.

getLeftmostDependent

public DependencyNode getLeftmostDependent()

Specified by:

getLeftmostDependent in interface DependencyNode

getRightDependent

public DependencyNode getRightDependent(int rightDependentIndex)

Specified by:

getRightDependent in interface DependencyNode

getRightDependentCount

public int getRightDependentCount()

Description copied from interface: DependencyNode

Return the number of right dependents

Specified by:

getRightDependentCount in interface DependencyNode

Returns:

the number of right dependents

getRightDependents

public java.util.SortedSet<DependencyNode> getRightDependents()

Description copied from interface: DependencyNode

Returns a sorted set of right dependents.

Specified by:

getRightDependents in interface DependencyNode

Returns:

a sorted set of right dependents.

getListOfRightDependents

public java.util.List<DependencyNode> getListOfRightDependents()

Specified by:

getListOfRightDependents in interface DependencyNode

getRightSibling

public DependencyNode getRightSibling()

Description copied from interface: DependencyNode

Returns the right sibling if it exists, otherwise null

Specified by:

getRightSibling in interface DependencyNode

Returns:

the right sibling if it exists, otherwise null

getSameSideRightSibling

public DependencyNode getSameSideRightSibling()

Description copied from interface: DependencyNode

Returns the right sibling at the same side of head as the node it self. If not found null is returned

Specified by:

getSameSideRightSibling in interface DependencyNode

Returns:

the right sibling at the same side of head as the node it self. If not found null is returned

getClosestRightDependent

public DependencyNode getClosestRightDependent()

Description copied from interface: DependencyNode

Returns the closest right dependent to the node it self, if not found null is returned.

Specified by:

getClosestRightDependent in interface DependencyNode

Returns:

the closest right dependent to the node it self, if not found null is returned.

getRightmostDependent

public DependencyNode getRightmostDependent()

Specified by:

getRightmostDependent in interface DependencyNode

getDependents

public java.util.SortedSet<DependencyNode> getDependents()

getListOfDependents

public java.util.List<DependencyNode> getListOfDependents()

Specified by:

getListOfDependents in interface DependencyNode

getInDegree

public int getInDegree()

Description copied from interface: ComparableNode

Returns the in degree of the node (number of incoming edges of all types of edges).

Specified by:

getInDegree in interface ComparableNode

Returns:

the in degree of the node (number of incoming edges of all types of edges).

getOutDegree

public int getOutDegree()

Description copied from interface: ComparableNode

Returns the out degree of the node (number of outgoing edges of all types of edges).

Specified by:

getOutDegree in interface ComparableNode

Returns:

the out degree of the node (number of outgoing edges of all types of edges).

getAncestor

public DependencyNode getAncestor()
                           throws MaltChainedException

Specified by:

getAncestor in interface DependencyNode

Throws:

MaltChainedException

getProperAncestor

public DependencyNode getProperAncestor()
                                 throws MaltChainedException

Specified by:

getProperAncestor in interface DependencyNode

Throws:

MaltChainedException

hasAncestorInside

public boolean hasAncestorInside(int left,
                                 int right)
                          throws MaltChainedException

Specified by:

hasAncestorInside in interface DependencyNode

Throws:

MaltChainedException

isProjective

public boolean isProjective()
                     throws MaltChainedException

Description copied from interface: DependencyNode

Returns true if the head edge is projective, otherwise false. Undefined if the node has more than one head.

Specified by:

isProjective in interface DependencyNode

Returns:

true if the head edge is projective, otherwise false.

Throws:

MaltChainedException

getDependencyNodeDepth

public int getDependencyNodeDepth()
                           throws MaltChainedException

Description copied from interface: DependencyNode

Returns the depth of the node. The root node has the depth 0.

Specified by:

getDependencyNodeDepth in interface DependencyNode

Returns:

the depth of the node.

Throws:

MaltChainedException

getCompareToIndex

public int getCompareToIndex()

Description copied from interface: ComparableNode

Returns the index of the node (only used internal by compareTo).

Specified by:

getCompareToIndex in interface ComparableNode

Returns:

the index of the node (only used internal by compareTo).

getLeftmostProperDescendant

public ComparableNode getLeftmostProperDescendant()
                                           throws MaltChainedException

Description copied from interface: ComparableNode

Returns the left-most proper terminal descendant node (excluding itself).

Specified by:

getLeftmostProperDescendant in interface ComparableNode

Returns:

the left-most proper terminal descendant node.

Throws:

MaltChainedException

getRightmostProperDescendant

public ComparableNode getRightmostProperDescendant()
                                            throws MaltChainedException

Description copied from interface: ComparableNode

Returns the right-most proper terminal descendant node (excluding itself).

Specified by:

getRightmostProperDescendant in interface ComparableNode

Returns:

the right-most proper terminal descendant node.

Throws:

MaltChainedException

getLeftmostProperDescendantIndex

public int getLeftmostProperDescendantIndex()
                                     throws MaltChainedException

Description copied from interface: ComparableNode

Returns the index of the left-most proper terminal descendant node (excluding itself).

Specified by:

getLeftmostProperDescendantIndex in interface ComparableNode

Returns:

the index of the left-most proper terminal descendant node.

Throws:

MaltChainedException

getRightmostProperDescendantIndex

public int getRightmostProperDescendantIndex()
                                      throws MaltChainedException

Description copied from interface: ComparableNode

Returns the index of the right-most proper terminal descendant node (excluding itself).

Specified by:

getRightmostProperDescendantIndex in interface ComparableNode

Returns:

the index of the right-most proper terminal descendant node.

Throws:

MaltChainedException

getLeftmostDescendant

public ComparableNode getLeftmostDescendant()
                                     throws MaltChainedException

Description copied from interface: ComparableNode

Returns the left-most terminal descendant node.

Specified by:

getLeftmostDescendant in interface ComparableNode

Returns:

the left-most terminal descendant node.

Throws:

MaltChainedException

getRightmostDescendant

public ComparableNode getRightmostDescendant()
                                      throws MaltChainedException

Description copied from interface: ComparableNode

Returns the right-most terminal descendant node.

Specified by:

getRightmostDescendant in interface ComparableNode

Returns:

the right-most terminal descendant node.

Throws:

MaltChainedException

getLeftmostDescendantIndex

public int getLeftmostDescendantIndex()
                               throws MaltChainedException

Description copied from interface: ComparableNode

Returns the index of the left-most terminal descendant node.

Specified by:

getLeftmostDescendantIndex in interface ComparableNode

Returns:

the index of the left-most terminal descendant node.

Throws:

MaltChainedException

getRightmostDescendantIndex

public int getRightmostDescendantIndex()
                                throws MaltChainedException

Description copied from interface: ComparableNode

Returns the index of the right-most terminal descendant node.

Specified by:

getRightmostDescendantIndex in interface ComparableNode

Returns:

the index of the right-most terminal descendant node.

Throws:

MaltChainedException

getIncomingSecondaryEdges

public java.util.SortedSet<Edge> getIncomingSecondaryEdges()
                                                    throws MaltChainedException

Description copied from interface: ComparableNode

Returns a sorted set of incoming secondary edges.

Specified by:

getIncomingSecondaryEdges in interface ComparableNode

Returns:

a sorted set of incoming secondary edges.

Throws:

MaltChainedException

getOutgoingSecondaryEdges

public java.util.SortedSet<Edge> getOutgoingSecondaryEdges()
                                                    throws MaltChainedException

Description copied from interface: ComparableNode

Returns a sorted set of outgoing secondary edges.

Specified by:

getOutgoingSecondaryEdges in interface ComparableNode

Returns:

a sorted set of outgoing secondary edges.

Throws:

MaltChainedException

getHeadEdges

public java.util.Set<Edge> getHeadEdges()

Specified by:

getHeadEdges in interface DependencyNode

getHeadEdge

public Edge getHeadEdge()

Description copied from interface: DependencyNode

Returns the edge between the head and the node if it exists, otherwise null. If there exists more than one head edge the first head edge is returned according to the linear order of the terminals or the root if it is one of the heads.

Specified by:

getHeadEdge in interface DependencyNode

Returns:

the edge between the head and the node if it exists, otherwise null.

addHeadEdgeLabel

public void addHeadEdgeLabel(SymbolTable table,
                             java.lang.String symbol)
                      throws MaltChainedException

Specified by:

addHeadEdgeLabel in interface DependencyNode

Throws:

MaltChainedException

addHeadEdgeLabel

public void addHeadEdgeLabel(SymbolTable table,
                             int code)
                      throws MaltChainedException

Specified by:

addHeadEdgeLabel in interface DependencyNode

Throws:

MaltChainedException

addHeadEdgeLabel

public void addHeadEdgeLabel(LabelSet labelSet)
                      throws MaltChainedException

Specified by:

addHeadEdgeLabel in interface DependencyNode

Throws:

MaltChainedException

hasHeadEdgeLabel

public boolean hasHeadEdgeLabel(SymbolTable table)
                         throws MaltChainedException

Specified by:

hasHeadEdgeLabel in interface DependencyNode

Throws:

MaltChainedException

getHeadEdgeLabelSymbol

public java.lang.String getHeadEdgeLabelSymbol(SymbolTable table)
                                        throws MaltChainedException

Specified by:

getHeadEdgeLabelSymbol in interface DependencyNode

Throws:

MaltChainedException

getHeadEdgeLabelCode

public int getHeadEdgeLabelCode(SymbolTable table)
                         throws MaltChainedException

Specified by:

getHeadEdgeLabelCode in interface DependencyNode

Throws:

MaltChainedException

getHeadEdgeLabelTypes

public java.util.Set<SymbolTable> getHeadEdgeLabelTypes()
                                                 throws MaltChainedException

Specified by:

getHeadEdgeLabelTypes in interface DependencyNode

Throws:

MaltChainedException

getHeadEdgeLabelSet

public LabelSet getHeadEdgeLabelSet()
                             throws MaltChainedException

Specified by:

getHeadEdgeLabelSet in interface DependencyNode

Throws:

MaltChainedException

addIncomingEdge

public void addIncomingEdge(Edge in)
                     throws MaltChainedException

Specified by:

addIncomingEdge in interface Node

Throws:

MaltChainedException

addOutgoingEdge

public void addOutgoingEdge(Edge out)
                     throws MaltChainedException

Specified by:

addOutgoingEdge in interface Node

Throws:

MaltChainedException

removeIncomingEdge

public void removeIncomingEdge(Edge in)
                        throws MaltChainedException

Specified by:

removeIncomingEdge in interface Node

Throws:

MaltChainedException

removeOutgoingEdge

public void removeOutgoingEdge(Edge out)
                        throws MaltChainedException

Specified by:

removeOutgoingEdge in interface Node

Throws:

MaltChainedException

getIncomingEdgeIterator

public java.util.Iterator<Edge> getIncomingEdgeIterator()

Specified by:

getIncomingEdgeIterator in interface Node

getOutgoingEdgeIterator

public java.util.Iterator<Edge> getOutgoingEdgeIterator()

Specified by:

getOutgoingEdgeIterator in interface Node

setRank

public void setRank(int r)

Specified by:

setRank in interface DependencyNode

getComponent

public DependencyNode getComponent()

Specified by:

getComponent in interface DependencyNode

setComponent

public void setComponent(DependencyNode x)

Specified by:

setComponent in interface DependencyNode

findComponent

public DependencyNode findComponent()

Specified by:

findComponent in interface DependencyNode

getRank

public int getRank()

Specified by:

getRank in interface DependencyNode

isHeadEdgeLabeled

public boolean isHeadEdgeLabeled()

Specified by:

isHeadEdgeLabeled in interface DependencyNode

nHeadEdgeLabels

public int nHeadEdgeLabels()

Specified by:

nHeadEdgeLabels in interface DependencyNode

addColumnLabels

public void addColumnLabels(java.lang.String[] columnLabels)
                     throws MaltChainedException

Throws:

MaltChainedException

addColumnLabels

public void addColumnLabels(java.lang.String[] columnLabels,
                            boolean addEdges)
                     throws MaltChainedException

Throws:

MaltChainedException

addLabel

public void addLabel(SymbolTable table,
                     java.lang.String symbol)
              throws MaltChainedException

Adds a label (a string value) to the symbol table and to the graph element.

Specified by:

addLabel in interface Element

Parameters:

table - the symbol table

symbol - a label symbol

Throws:

MaltChainedException

addLabel

public void addLabel(SymbolTable table,
                     int code)
              throws MaltChainedException

Adds a label (an integer value) to the symbol table and to the graph element.

Specified by:

addLabel in interface Element

Parameters:

table - the symbol table

code - a label code

Throws:

MaltChainedException

addLabel

public void addLabel(LabelSet labels)
              throws MaltChainedException

Adds the labels of the label set to the label set of the graph element.

Specified by:

addLabel in interface Element

Parameters:

labels - a label set.

Throws:

MaltChainedException

hasLabel

public boolean hasLabel(SymbolTable table)
                 throws MaltChainedException

Returns true if the graph element has a label for the symbol table, otherwise false.

Specified by:

hasLabel in interface Element

Parameters:

table - the symbol table

Returns:

true if the graph element has a label for the symbol table, otherwise false.

Throws:

MaltChainedException

getLabelSymbol

public java.lang.String getLabelSymbol(SymbolTable table)
                                throws MaltChainedException

Returns the label symbol(a string representation) of the symbol table if it exists, otherwise an exception is thrown.

Specified by:

getLabelSymbol in interface Element

Parameters:

table - the symbol table

Returns:

the label (a string representation) of the symbol table if it exists.

Throws:

MaltChainedException

getLabelCode

public int getLabelCode(SymbolTable table)
                 throws MaltChainedException

Returns the label code (an integer representation) of the symbol table if it exists, otherwise an exception is thrown.

Specified by:

getLabelCode in interface Element

Parameters:

table - the symbol table

Returns:

the label code (an integer representation) of the symbol table if it exists

Throws:

MaltChainedException

nLabels

public int nLabels()

Returns the number of labels of the graph element.

Specified by:

nLabels in interface Element

Returns:

the number of labels of the graph element.

getLabelTypes

public java.util.Set<SymbolTable> getLabelTypes()

Returns a set of symbol tables (labeling functions or label types) that labels the graph element.

Specified by:

getLabelTypes in interface Element

Returns:

a set of symbol tables (labeling functions or label types)

getLabelSet

public LabelSet getLabelSet()

Returns the label set.

Specified by:

getLabelSet in interface Element

Returns:

the label set.

removeLabel

public void removeLabel(SymbolTable table)
                 throws MaltChainedException

Specified by:

removeLabel in interface Element

Throws:

MaltChainedException

removeLabels

public void removeLabels()
                  throws MaltChainedException

Specified by:

removeLabels in interface Element

Throws:

MaltChainedException

getBelongsToGraph

public LabeledStructure getBelongsToGraph()

Returns the graph (structure) in which the graph element belongs to.

Specified by:

getBelongsToGraph in interface Element

Returns:

the graph (structure) in which the graph element belongs to.

setBelongsToGraph

public void setBelongsToGraph(LabeledStructure belongsToGraph)

Description copied from interface: Element

Sets the graph (structure) in which the graph element belongs to.

Specified by:

setBelongsToGraph in interface Element

Parameters:

belongsToGraph - a graph (structure).

clear

public void clear()
           throws MaltChainedException

Resets the graph element.

Specified by:

clear in interface Element

Throws:

MaltChainedException

compareTo

public int compareTo(ComparableNode that)

Specified by:

compareTo in interface java.lang.Comparable<ComparableNode>

hashCode

public int hashCode()

Overrides:

hashCode in class java.lang.Object

equals

public boolean equals(java.lang.Object obj)

Overrides:

equals in class java.lang.Object

toString

public java.lang.String toString()

Overrides:

toString in class java.lang.Object