Uses of Class
psdi.app.recontask.engine.BinaryTreeNode

Packages that use BinaryTreeNode

Package	Description
psdi.app.recontask.engine

Uses of BinaryTreeNode in psdi.app.recontask.engine

Fields in psdi.app.recontask.engine declared as BinaryTreeNode

Modifier and Type	Field and Description
BinaryTreeNode	BinaryTreeNode.left
BinaryTreeNode	BinaryTreeNode.right
protected BinaryTreeNode	ReconExpression.rootNode the root of the compiled binary tree

Methods in psdi.app.recontask.engine that return BinaryTreeNode

Modifier and Type	Method and Description
protected BinaryTreeNode	ReconExpression.convertInfixToExpressionTree() Loops through this list of infix expressions from left to right according to the following steps.

Methods in psdi.app.recontask.engine with parameters of type BinaryTreeNode

Modifier and Type	Method and Description
protected void	ReconExpression.convertTreeToInfixString(BinaryTreeNode root, java.lang.StringBuffer ret, boolean topLevel) Traverse the binary tree using a recursive algorithm
protected ReconCompResult	ReconCompMatchesFoundExpression.evaluateExpressionTree(BinaryTreeNode root, ComparisonQueryHelper queries) Traverse the binary tree using a recursive algorithm
protected ReconCompResult	ReconCompAttributesEqualityExpression.evaluateExpressionTree(BinaryTreeNode root, ComparisonQueryHelper queries) Traverse the binary tree using a recursive algorithm
protected ReconCompFilterReturn	ReconCompFilterExpression.evaluateExpressionTree(BinaryTreeNode root, ComparisonQueryHelper queries) Traverse the binary tree using a recursive algorithm
protected java.util.List	ReconLinkExpression.evaluateLinkExpressionTree(BinaryTreeNode root, ReconValue leadingObject, SubordinateSetAttribute[] subordinateSetAttributes) Traverse the binary tree using a recursive algorithm
protected java.util.List	ReconExpression.handleLogicalOperator(BinaryTreeNode operatorNode, java.util.List rightResult, java.util.List leftResult)
void	BinaryTreeNode.LinkChildren(BinaryTreeNode left, BinaryTreeNode right)
protected void	ReconExpression.walkTreeReplaceAttributeNamesWithIndexes(BinaryTreeNode root, ReconValueSet leadingSet, ReconValueSet subordinateSet) Traverse the binary tree using a recursive algorithm
protected void	ReconExpression.walkTreeToGetAttribSet(BinaryTreeNode root, java.util.Set attribSet, boolean getLeftSide) Recurse the tree to build a set of unique left or right sides
protected void	ReconExpression.walkTreeToGetAttribToUnitMap(BinaryTreeNode root, java.util.Map attributeToUnitMap, boolean getLeftSide) Recurse the tree to build a map unique left or right sides to their unit names