it.unibz.inf.ontop.iq.impl.tree

Interface QueryTree

All Known Implementing Classes:

DefaultTree

public interface QueryTree

TODO: describe

Method Summary

Modifier and Type	Method and Description
void	addChild(QueryNode parentQueryNode, QueryNode childQueryNode, Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition, boolean mustBeNew, boolean canReplace)
boolean	contains(QueryNode node)
QueryTree	createSnapshot() Keeps the same query node objects but clones the tree edges (since the latter are mutable by default).
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode>	getChildren(QueryNode node)
Stream<QueryNode>	getChildrenStream(QueryNode node)
it.unibz.inf.ontop.com.google.common.collect.ImmutableSet<IntensionalDataNode>	getIntensionalNodes()
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode>	getNodesInBottomUpOrder()
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode>	getNodesInTopDownOrder()
Optional<BinaryOrderedOperatorNode.ArgumentPosition>	getOptionalPosition(QueryNode parentNode, QueryNode childNode)
Optional<QueryNode>	getParent(QueryNode childNode)
QueryNode	getRootNode()
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode>	getSubTreeNodesInTopDownOrder(QueryNode currentNode) Excludes the top node from the list
it.unibz.inf.ontop.com.google.common.collect.ImmutableSet<TrueNode>	getTrueNodes()
UUID	getVersionNumber()
void	insertParent(QueryNode childNode, QueryNode newParentNode, Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition)
QueryNode	removeOrReplaceNodeByUniqueChild(QueryNode node)
void	removeSubTree(QueryNode subTreeRoot)
void	replaceNode(QueryNode previousNode, QueryNode replacingNode)
QueryNode	replaceNodeByChild(QueryNode parentNode, Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalReplacingChildPosition)
void	replaceNodesByOneNode(it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> queryNodes, QueryNode replacingNode, QueryNode parentNode, Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition)
void	transferChild(QueryNode childNode, QueryNode formerParentNode, QueryNode newParentNode, Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition)

Method Detail

getRootNode

QueryNode getRootNode()

addChild

void addChild(QueryNode parentQueryNode,
              QueryNode childQueryNode,
              Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition,
              boolean mustBeNew,
              boolean canReplace)
       throws IllegalTreeUpdateException

Throws:

IllegalTreeUpdateException

getChildren

it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> getChildren(QueryNode node)

getChildrenStream

Stream<QueryNode> getChildrenStream(QueryNode node)

contains

boolean contains(QueryNode node)

getNodesInBottomUpOrder

it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> getNodesInBottomUpOrder()

getNodesInTopDownOrder

it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> getNodesInTopDownOrder()

replaceNode

void replaceNode(QueryNode previousNode,
                 QueryNode replacingNode)

removeSubTree

void removeSubTree(QueryNode subTreeRoot)

getSubTreeNodesInTopDownOrder

it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> getSubTreeNodesInTopDownOrder(QueryNode currentNode)

Excludes the top node from the list

getParent

Optional<QueryNode> getParent(QueryNode childNode)

removeOrReplaceNodeByUniqueChild

QueryNode removeOrReplaceNodeByUniqueChild(QueryNode node)
                                    throws IllegalTreeUpdateException

Throws:

IllegalTreeUpdateException

replaceNodesByOneNode

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

Throws:

IllegalTreeUpdateException

getOptionalPosition

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

insertParent

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

Throws:

IllegalTreeUpdateException

getTrueNodes

it.unibz.inf.ontop.com.google.common.collect.ImmutableSet<TrueNode> getTrueNodes()

replaceNodeByChild

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

getIntensionalNodes

it.unibz.inf.ontop.com.google.common.collect.ImmutableSet<IntensionalDataNode> getIntensionalNodes()

createSnapshot

QueryTree createSnapshot()

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

transferChild

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

getVersionNumber

UUID getVersionNumber()