it.unibz.inf.ontop.iq.impl

Interface QueryTreeComponent

All Known Implementing Classes:

DefaultQueryTreeComponent

public interface QueryTreeComponent

Mutable component used for internal implementations of IntermediateQuery.

Method Summary

Modifier and Type	Method and Description
void	addChild(QueryNode parentNode, QueryNode childNode, Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition, boolean canReplacePreviousChildren) Please consider using an IntermediateQueryBuilder instead of this tree component.
void	addSubTree(IntermediateQuery subQuery, QueryNode subQueryTopNode, QueryNode localTopNode)
boolean	contains(QueryNode node)
QueryTreeComponent	createSnapshot() Keeps the same query node objects but clones the tree edges (since the latter are mutable by default).
Variable	generateNewVariable() Returns a variable that is not used in the intermediate query.
Variable	generateNewVariable(Variable formerVariable) Returns a variable that is not used in the intermediate query.
com.google.common.collect.ImmutableList<QueryNode>	getAncestors(QueryNode descendantNode) From the parent to the oldest ancestor.
com.google.common.collect.ImmutableList<QueryNode>	getChildren(QueryNode node)
Stream<QueryNode>	getChildrenStream(QueryNode node)
Optional<QueryNode>	getFirstChild(QueryNode node)
com.google.common.collect.ImmutableSet<IntensionalDataNode>	getIntensionalNodes()
com.google.common.collect.ImmutableSet<Variable>	getKnownVariables() All the possibly already allocated variables
com.google.common.collect.ImmutableList<QueryNode>	getNodesInBottomUpOrder()
com.google.common.collect.ImmutableList<QueryNode>	getNodesInTopDownOrder()
Optional<BinaryOrderedOperatorNode.ArgumentPosition>	getOptionalPosition(QueryNode parentNode, QueryNode childNode)
Optional<QueryNode>	getParent(QueryNode node)
QueryNode	getRootNode()
com.google.common.collect.ImmutableList<QueryNode>	getSubTreeNodesInTopDownOrder(QueryNode currentNode) All the nodes EXCEPT the root of this sub-tree
com.google.common.collect.ImmutableSet<TrueNode>	getTrueNodes()
com.google.common.collect.ImmutableSet<Variable>	getVariables(QueryNode node)
UUID	getVersionNumber() The version number of the query.
void	insertParent(QueryNode childNode, QueryNode newParentNode) Inserts a new node between a node and its former parent (now grand-parent)
void	insertParent(QueryNode childNode, QueryNode newParentNode, Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition) Inserts a new node between a node and its former parent (now grand-parent)
Optional<QueryNode>	nextSibling(QueryNode node)
QueryNode	removeOrReplaceNodeByUniqueChild(QueryNode node) TODO: explain
void	removeSubTree(QueryNode subTreeRoot)
void	replaceNode(QueryNode previousNode, QueryNode replacingNode)
QueryNode	replaceNodeByChild(QueryNode parentNode, Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalReplacingChildPosition) If no position is given, replaces the parent node by its first child
void	replaceNodesByOneNode(com.google.common.collect.ImmutableList<QueryNode> queryNodes, QueryNode replacingNode, QueryNode parentNode, Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition) TODO: explain
void	replaceSubTree(QueryNode subTreeRootNode, QueryNode replacingNode) Replaces all the sub-tree by one sub-tree node
QueryNode	replaceSubTreeByIQ(QueryNode subTreeRoot, IQTree replacingSubTree)
void	transferChild(QueryNode childNode, QueryNode formerParentNode, QueryNode newParentNode, Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition) Transfers a child node from a parent to another parent

Method Detail

getChildren

com.google.common.collect.ImmutableList<QueryNode> getChildren(QueryNode node)

getChildrenStream

Stream<QueryNode> getChildrenStream(QueryNode node)

getRootNode

QueryNode getRootNode()
               throws IllegalTreeException

Throws:

IllegalTreeException

getNodesInBottomUpOrder

com.google.common.collect.ImmutableList<QueryNode> getNodesInBottomUpOrder()
                                                                    throws IllegalTreeException

Throws:

IllegalTreeException

getNodesInTopDownOrder

com.google.common.collect.ImmutableList<QueryNode> getNodesInTopDownOrder()
                                                                   throws IllegalTreeException

Throws:

IllegalTreeException

getTrueNodes

com.google.common.collect.ImmutableSet<TrueNode> getTrueNodes()

getIntensionalNodes

com.google.common.collect.ImmutableSet<IntensionalDataNode> getIntensionalNodes()

contains

boolean contains(QueryNode node)

replaceNode

void replaceNode(QueryNode previousNode,
                 QueryNode replacingNode)

replaceSubTree

void replaceSubTree(QueryNode subTreeRootNode,
                    QueryNode replacingNode)

Replaces all the sub-tree by one sub-tree node

addSubTree

void addSubTree(IntermediateQuery subQuery,
                QueryNode subQueryTopNode,
                QueryNode localTopNode)
         throws IllegalTreeUpdateException

Throws:

IllegalTreeUpdateException

removeSubTree

void removeSubTree(QueryNode subTreeRoot)

getSubTreeNodesInTopDownOrder

com.google.common.collect.ImmutableList<QueryNode> getSubTreeNodesInTopDownOrder(QueryNode currentNode)

All the nodes EXCEPT the root of this sub-tree

getOptionalPosition

Optional<BinaryOrderedOperatorNode.ArgumentPosition> getOptionalPosition(QueryNode parentNode,
                                                                         QueryNode childNode)

getAncestors

com.google.common.collect.ImmutableList<QueryNode> getAncestors(QueryNode descendantNode)
                                                         throws IllegalTreeException

From the parent to the oldest ancestor.

Throws:

IllegalTreeException

getParent

Optional<QueryNode> getParent(QueryNode node)
                       throws IllegalTreeException

Throws:

IllegalTreeException

removeOrReplaceNodeByUniqueChild

QueryNode removeOrReplaceNodeByUniqueChild(QueryNode node)
                                    throws IllegalTreeUpdateException

TODO: explain

Throws:

IllegalTreeUpdateException

replaceNodesByOneNode

void replaceNodesByOneNode(com.google.common.collect.ImmutableList<QueryNode> queryNodes,
                           QueryNode replacingNode,
                           QueryNode parentNode,
                           Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition)
                    throws IllegalTreeUpdateException

TODO: explain

Throws:

IllegalTreeUpdateException

addChild

void addChild(QueryNode parentNode,
              QueryNode childNode,
              Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition,
              boolean canReplacePreviousChildren)
       throws IllegalTreeUpdateException

Please consider using an IntermediateQueryBuilder instead of this tree component.

Throws:

IllegalTreeUpdateException

nextSibling

Optional<QueryNode> nextSibling(QueryNode node)
                         throws IllegalTreeException

Throws:

IllegalTreeException

getFirstChild

Optional<QueryNode> getFirstChild(QueryNode node)

insertParent

void insertParent(QueryNode childNode,
                  QueryNode newParentNode)
           throws IllegalTreeUpdateException

Inserts a new node between a node and its former parent (now grand-parent)

Throws:

IllegalTreeUpdateException

insertParent

void insertParent(QueryNode childNode,
                  QueryNode newParentNode,
                  Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition)
           throws IllegalTreeUpdateException

Inserts a new node between a node and its former parent (now grand-parent)

Throws:

IllegalTreeUpdateException

transferChild

void transferChild(QueryNode childNode,
                   QueryNode formerParentNode,
                   QueryNode newParentNode,
                   Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition)
            throws IllegalTreeUpdateException

Transfers a child node from a parent to another parent

Throws:

IllegalTreeUpdateException

generateNewVariable

Variable generateNewVariable()

Returns a variable that is not used in the intermediate query.

generateNewVariable

Variable generateNewVariable(Variable formerVariable)

Returns a variable that is not used in the intermediate query. The new variable always differs from the former one.

getKnownVariables

com.google.common.collect.ImmutableSet<Variable> getKnownVariables()

All the possibly already allocated variables

replaceNodeByChild

QueryNode replaceNodeByChild(QueryNode parentNode,
                             Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalReplacingChildPosition)

If no position is given, replaces the parent node by its first child

createSnapshot

QueryTreeComponent createSnapshot()

Keeps the same query node objects but clones the tree edges (since the latter are mutable by default).

getVariables

com.google.common.collect.ImmutableSet<Variable> getVariables(QueryNode node)

getVersionNumber

UUID getVersionNumber()

The version number of the query. Used in fixed-point optimization.

replaceSubTreeByIQ

QueryNode replaceSubTreeByIQ(QueryNode subTreeRoot,
                             IQTree replacingSubTree)