org.corpus_tools.salt.util.internal.persistence.dot

Class SDocumentGraphDOTWriter

java.lang.Object

org.corpus_tools.salt.util.internal.persistence.dot.SDocumentGraphDOTWriter

All Implemented Interfaces:

GraphTraverseHandler

public class SDocumentGraphDOTWriter
extends Object
implements GraphTraverseHandler

Field Summary

Fields

Modifier and Type	Field and Description
protected static String	KW_DOT_NS Namespace for dot flags
protected static String	KW_DOT_STORED String to identify a flag in salt elements or relations, which say that the current element or relation has already been stored or not

Constructor Summary

Constructors

Constructor and Description
SDocumentGraphDOTWriter()

Method Summary

Modifier and Type	Method and Description
boolean	checkConstraint(SGraph.GRAPH_TRAVERSE_TYPE traversalType, String traversalId, SRelation<SNode,SNode> relation, SNode currNode, long order) This method is called during a traversal to check if the current node and eventually its sub-graph shall be traversed or not.
SDocumentGraph	getDocumentGraph()
org.eclipse.emf.common.util.URI	getOutputURI()
void	nodeLeft(SGraph.GRAPH_TRAVERSE_TYPE traversalType, String traversalId, SNode currNode, SRelation<SNode,SNode> relation, SNode fromNode, long order) This method will be invoked, when a node is left, after the method #checkConstraint(GRAPH_TRAVERSE_TYPE, String, SRelation, SNode, long) has returned true and the method #nodeReached(GRAPH_TRAVERSE_TYPE, String, SNode, SRelation, SNode, long) has been invoked.
void	nodeReached(SGraph.GRAPH_TRAVERSE_TYPE traversalType, String traversalId, SNode currNode, SRelation relation, SNode fromNode, long order) This method will be invoked, when a node is reached, after the method #checkConstraint(GRAPH_TRAVERSE_TYPE, String, SRelation, SNode, long) has returned true and before the method #nodeLeft(GRAPH_TRAVERSE_TYPE, String, SNode, SRelation, SNode, long) is invoked.
void	save()
void	setDocumentGraph(SDocumentGraph documentGraph)
void	setOutputURI(org.eclipse.emf.common.util.URI outputURI)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

KW_DOT_NS

protected static final String KW_DOT_NS

Namespace for dot flags

See Also:

Constant Field Values

KW_DOT_STORED

protected static final String KW_DOT_STORED

String to identify a flag in salt elements or relations, which say that the current element or relation has already been stored or not

See Also:

Constant Field Values

Constructor Detail

SDocumentGraphDOTWriter

public SDocumentGraphDOTWriter()

Method Detail

setOutputURI

public void setOutputURI(org.eclipse.emf.common.util.URI outputURI)

getOutputURI

public org.eclipse.emf.common.util.URI getOutputURI()

setDocumentGraph

public void setDocumentGraph(SDocumentGraph documentGraph)

getDocumentGraph

public SDocumentGraph getDocumentGraph()

save

public void save()

nodeLeft

public void nodeLeft(SGraph.GRAPH_TRAVERSE_TYPE traversalType,
                     String traversalId,
                     SNode currNode,
                     SRelation<SNode,SNode> relation,
                     SNode fromNode,
                     long order)

Description copied from interface: GraphTraverseHandler

This method will be invoked, when a node is left, after the method #checkConstraint(GRAPH_TRAVERSE_TYPE, String, SRelation, SNode, long) has returned true and the method #nodeReached(GRAPH_TRAVERSE_TYPE, String, SNode, SRelation, SNode, long) has been invoked.

Specified by:

nodeLeft in interface GraphTraverseHandler

Parameters:

traversalType - the type of current traversal

traversalId - the id of current traversal, given by the invoking object

currNode - the current node

relation - the relation via which the current node was reached

fromNode - the parent node

order - the number of the relation in the parent node

checkConstraint

public boolean checkConstraint(SGraph.GRAPH_TRAVERSE_TYPE traversalType,
                               String traversalId,
                               SRelation<SNode,SNode> relation,
                               SNode currNode,
                               long order)

Description copied from interface: GraphTraverseHandler

This method is called during a traversal to check if the current node and eventually its sub-graph shall be traversed or not. If the return value is false, the traversal for the current path, will stop at the current node and the methods #nodeReached(GRAPH_TRAVERSE_TYPE, String, SNode, SRelation, SNode, long) and #nodeLeft(GRAPH_TRAVERSE_TYPE, String, SNode, SRelation, SNode, long) as well will not be invoked. Otherwise the method #nodeReached(GRAPH_TRAVERSE_TYPE, String, SNode, SRelation, SNode, long) will be invoked, when a new node is reached and #nodeLeft(GRAPH_TRAVERSE_TYPE, String, SNode, SRelation, SNode, long) will be invoked, when this node is left.

Specified by:

checkConstraint in interface GraphTraverseHandler

Parameters:

traversalType - the type of current traversal

traversalId - the id of current traversal, given by the invoking object

relation - the relation via which the current node was reached

currNode - the current node

order - the number of the relation in the parent node

nodeReached

public void nodeReached(SGraph.GRAPH_TRAVERSE_TYPE traversalType,
                        String traversalId,
                        SNode currNode,
                        SRelation relation,
                        SNode fromNode,
                        long order)

Description copied from interface: GraphTraverseHandler

This method will be invoked, when a node is reached, after the method #checkConstraint(GRAPH_TRAVERSE_TYPE, String, SRelation, SNode, long) has returned true and before the method #nodeLeft(GRAPH_TRAVERSE_TYPE, String, SNode, SRelation, SNode, long) is invoked.

Specified by:

nodeReached in interface GraphTraverseHandler

Parameters:

traversalType - the type of current traversal

traversalId - the id of current traversal, given by the invoking object

currNode - the current node

relation - the relation via which the current node was reached

fromNode - the parent node

order - the number of the relation in the parent node