genscript.parse

Class SearchGraph.Node

java.lang.Object

genscript.parse.SearchGraph.Node

Enclosing class:

SearchGraph

public class SearchGraph.Node
extends java.lang.Object

Constructor Summary

Constructors

Constructor and Description
Node()
Node(java.lang.Object value)
Node(java.lang.Object value, int initialChildrenCapacity)

Method Summary

Modifier and Type	Method and Description
boolean	checkPriority(int priority)
int	childCount()
SearchGraph.Node	clearValue()
void	copyFromNode(SearchGraph.Node sourceNode, boolean onlyChildren)
void	copyToNode(SearchGraph.Node targetNode, boolean onlyChildren)
SearchGraph.Node	getChild(Index index)
SearchGraph.Node	getChild(int index)
int	getChildCount()
java.util.Vector<SearchGraph.Node>	getChildren()
int	getMark()
SearchGraph.NonTerminal	getNonTerminal()
ParseAction<?>	getParseEvent()
int	getPriority()
SearchGraph	getSearchGraph()
java.lang.Object	getValue()
boolean	hasChild(int index)
boolean	hasNonTerminal()
boolean	hasParseEvent()
boolean	hasUnacceptedChildren()
boolean	hasValue()
SearchGraph.Node	insert(java.io.BufferedReader key, java.lang.Object value)
SearchGraph.Node	insert(Index childIndex)
SearchGraph.Node	insert(Index childIndex, java.lang.Object childValue)
SearchGraph.Node	insert(Index childIndex, SearchGraph.Node child)
SearchGraph.Node	insert(int childIndex)
SearchGraph.Node	insert(int childIndex, java.lang.Object childValue)
SearchGraph.Node	insert(int childIndex, SearchGraph.Node child)
SearchGraph.Node	insert(java.lang.String key, java.lang.Object value)
SearchGraph.Node	insertArray(byte[] indices)
SearchGraph.Node	insertArray(byte[] indices, java.lang.Object value)
SearchGraph.Node	insertArray(byte[] indices, SearchGraph.Node node)
boolean	isInserted()
boolean	isMaxPriority()
boolean	isMinPriority()
boolean	isRightAssociative()
boolean	isUnacceptedChild(int index)
SearchGraph.Node	overwriteValue(java.lang.Object value)
boolean	removeChild(int childIndex)
SearchGraph.Node	setAction(ParseAction<?> parseEvent)
SearchGraph.Node	setAction(ParseAction<?> parseEvent, java.lang.Object value)
void	setInserted()
void	setMark(int mark)
SearchGraph.Node	setNonTerminal(NTProductions subSearchGraph)
SearchGraph.Node	setNonTerminal(NTProductions subSearchGraph, int priority)
SearchGraph.Node	setNonTerminal(NTProductions subSearchGraph, SearchGraph.Node node)
SearchGraph.Node	setNonTerminal(NTProductions subSearchGraph, SearchGraph.Node node, int priority)
SearchGraph.Node	setPriority(int priority)
SearchGraph.Node	setRightAssociative()
void	setUnacceptedChildren(java.util.Vector<SearchGraph.Node> children)
SearchGraph.Node	setValue(java.lang.Object value)
java.lang.String	toString()
boolean	traverseTree(SearchGraph.SearchGraphIterationCallback callback)

Methods inherited from class java.lang.Object

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

Constructor Detail

Node

public Node(java.lang.Object value,
            int initialChildrenCapacity)

Node

public Node(java.lang.Object value)

Node

public Node()

Method Detail

insert

public SearchGraph.Node insert(int childIndex,
                               SearchGraph.Node child)

setUnacceptedChildren

public void setUnacceptedChildren(java.util.Vector<SearchGraph.Node> children)

isUnacceptedChild

public boolean isUnacceptedChild(int index)

hasUnacceptedChildren

public boolean hasUnacceptedChildren()

getChildCount

public int getChildCount()

insert

public SearchGraph.Node insert(int childIndex,
                               java.lang.Object childValue)

insert

public SearchGraph.Node insert(int childIndex)

insert

public SearchGraph.Node insert(Index childIndex,
                               SearchGraph.Node child)

insert

public SearchGraph.Node insert(Index childIndex,
                               java.lang.Object childValue)

insert

public SearchGraph.Node insert(Index childIndex)

insert

public SearchGraph.Node insert(java.io.BufferedReader key,
                               java.lang.Object value)

insert

public SearchGraph.Node insert(java.lang.String key,
                               java.lang.Object value)

insertArray

public SearchGraph.Node insertArray(byte[] indices,
                                    SearchGraph.Node node)

insertArray

public SearchGraph.Node insertArray(byte[] indices,
                                    java.lang.Object value)

insertArray

public SearchGraph.Node insertArray(byte[] indices)

removeChild

public boolean removeChild(int childIndex)

copyFromNode

public void copyFromNode(SearchGraph.Node sourceNode,
                         boolean onlyChildren)

copyToNode

public void copyToNode(SearchGraph.Node targetNode,
                       boolean onlyChildren)

childCount

public int childCount()

getChild

public SearchGraph.Node getChild(int index)

getChild

public SearchGraph.Node getChild(Index index)

getChildren

public java.util.Vector<SearchGraph.Node> getChildren()

hasChild

public boolean hasChild(int index)

getValue

public java.lang.Object getValue()

setValue

public SearchGraph.Node setValue(java.lang.Object value)

overwriteValue

public SearchGraph.Node overwriteValue(java.lang.Object value)

isRightAssociative

public boolean isRightAssociative()

setRightAssociative

public SearchGraph.Node setRightAssociative()

isInserted

public boolean isInserted()

setInserted

public void setInserted()

clearValue

public SearchGraph.Node clearValue()

getSearchGraph

public SearchGraph getSearchGraph()

hasValue

public boolean hasValue()

traverseTree

public boolean traverseTree(SearchGraph.SearchGraphIterationCallback callback)

toString

public java.lang.String toString()

Overrides:

toString in class java.lang.Object

getMark

public int getMark()

setMark

public void setMark(int mark)

getNonTerminal

public SearchGraph.NonTerminal getNonTerminal()

setNonTerminal

public SearchGraph.Node setNonTerminal(NTProductions subSearchGraph)

setNonTerminal

public SearchGraph.Node setNonTerminal(NTProductions subSearchGraph,
                                       SearchGraph.Node node,
                                       int priority)

setNonTerminal

public SearchGraph.Node setNonTerminal(NTProductions subSearchGraph,
                                       int priority)

setNonTerminal

public SearchGraph.Node setNonTerminal(NTProductions subSearchGraph,
                                       SearchGraph.Node node)

hasNonTerminal

public boolean hasNonTerminal()

getPriority

public int getPriority()

setPriority

public SearchGraph.Node setPriority(int priority)

isMinPriority

public boolean isMinPriority()

isMaxPriority

public boolean isMaxPriority()

checkPriority

public boolean checkPriority(int priority)

hasParseEvent

public boolean hasParseEvent()

getParseEvent

public ParseAction<?> getParseEvent()

setAction

public SearchGraph.Node setAction(ParseAction<?> parseEvent,
                                  java.lang.Object value)

setAction

public SearchGraph.Node setAction(ParseAction<?> parseEvent)