com.crawljax.stateabstractions.dom.RTED

Class InfoTree

java.lang.Object

com.crawljax.stateabstractions.dom.RTED.InfoTree

public class InfoTree
extends Object

Stores all needed information about a single tree in several indeces.

Author:

Mateusz Pawlik

Field Summary

Fields

Modifier and Type	Field and Description
int[][]	info
static byte	KR
boolean[][]	nodeType
static byte	POST2_DESC_SUM
static byte	POST2_KR_SUM
static byte	POST2_LABEL
static byte	POST2_LLD
static byte	POST2_MIN_KR
static byte	POST2_PARENT
static byte	POST2_PRE
static byte	POST2_REV_KR_SUM
static byte	POST2_SIZE
static byte	POST2_STRATEGY
static byte	PRE2_POST
static byte	RKR
static byte	RPOST2_MIN_RKR
static byte	RPOST2_POST
static byte	RPOST2_RLD

Constructor Summary

Constructors

Constructor and Description
InfoTree(LblTree aInputTree, LabelDictionary aLd) Creates an InfoTree object, gathers all information about aInputTree and stores in indexes.

Method Summary

Modifier and Type	Method and Description
int	getCurrentNode() Returns the postorder of current root node.
int	getInfo(int infoCode, int nodesPostorder) For given infoCode and postorder of a node returns requested information of that node.
int[]	getInfoArray(int infoCode) For given infoCode returns an info array (index array)
int[]	getNodeRelSubtrees(int pathType, int nodePostorder) Returns relevant subtrees for given node.
boolean[]	getNodeTypeArray(int type)
int[]	getPath(int pathType) Returns an array representation of a given path's type.
int	getSize() Returns the size of the tree.
boolean	ifNodeOfType(int postorder, int type)
boolean	isSwitched()
void	setCurrentNode(int postorder) Sets postorder of the current node in the recursion.
void	setSwitched(boolean value)

Methods inherited from class java.lang.Object

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

Field Detail

POST2_SIZE

public static final byte POST2_SIZE

See Also:

Constant Field Values

POST2_KR_SUM

public static final byte POST2_KR_SUM

See Also:

Constant Field Values

POST2_REV_KR_SUM

public static final byte POST2_REV_KR_SUM

See Also:

Constant Field Values

POST2_DESC_SUM

public static final byte POST2_DESC_SUM

See Also:

Constant Field Values

POST2_PRE

public static final byte POST2_PRE

See Also:

Constant Field Values

POST2_PARENT

public static final byte POST2_PARENT

See Also:

Constant Field Values

POST2_LABEL

public static final byte POST2_LABEL

See Also:

Constant Field Values

KR

public static final byte KR

See Also:

Constant Field Values

POST2_LLD

public static final byte POST2_LLD

See Also:

Constant Field Values

POST2_MIN_KR

public static final byte POST2_MIN_KR

See Also:

Constant Field Values

RKR

public static final byte RKR

See Also:

Constant Field Values

RPOST2_RLD

public static final byte RPOST2_RLD

See Also:

Constant Field Values

RPOST2_MIN_RKR

public static final byte RPOST2_MIN_RKR

See Also:

Constant Field Values

RPOST2_POST

public static final byte RPOST2_POST

See Also:

Constant Field Values

POST2_STRATEGY

public static final byte POST2_STRATEGY

See Also:

Constant Field Values

PRE2_POST

public static final byte PRE2_POST

See Also:

Constant Field Values

info

public int[][] info

nodeType

public boolean[][] nodeType

Constructor Detail

InfoTree

public InfoTree(LblTree aInputTree,
                LabelDictionary aLd)

Creates an InfoTree object, gathers all information about aInputTree and stores in indexes. aInputTree is not needed any more. Remember to pass the same LabelDictionary object to both trees which are compared.

Parameters:

aInputTree - an LblTree object

aLd - a LabelDictionary object

Method Detail

getSize

public int getSize()

Returns the size of the tree.

Returns:

ifNodeOfType

public boolean ifNodeOfType(int postorder,
                            int type)

getNodeTypeArray

public boolean[] getNodeTypeArray(int type)

getInfo

public int getInfo(int infoCode,
                   int nodesPostorder)

For given infoCode and postorder of a node returns requested information of that node.

Parameters:

infoCode -

nodesPostorder - postorder of a node

Returns:

a value of requested information

getInfoArray

public int[] getInfoArray(int infoCode)

For given infoCode returns an info array (index array)

Parameters:

infoCode -

Returns:

array with requested index

getNodeRelSubtrees

public int[] getNodeRelSubtrees(int pathType,
                                int nodePostorder)

Returns relevant subtrees for given node. Assuming that child v of given node belongs to given path, all children of given node are returned but node v.

Parameters:

pathType -

nodePostorder - postorder of a node

Returns:

an array with relevant subtrees of a given node

getPath

public int[] getPath(int pathType)

Returns an array representation of a given path's type.

Parameters:

pathType -

Returns:

an array with a requested path

getCurrentNode

public int getCurrentNode()

Returns the postorder of current root node.

Returns:

setCurrentNode

public void setCurrentNode(int postorder)

Sets postorder of the current node in the recursion.

Parameters:

postorder -

setSwitched

public void setSwitched(boolean value)

isSwitched

public boolean isSwitched()