| Package | Description |
|---|---|
| it.unibz.inf.ontop.iq.impl | |
| it.unibz.inf.ontop.iq.impl.tree |
| Modifier and Type | Method and Description |
|---|---|
void |
QueryTreeComponent.addChild(QueryNode parentNode,
QueryNode childNode,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition,
boolean canReplacePreviousChildren)
Please consider using an IntermediateQueryBuilder instead of this tree component.
|
void |
QueryTreeComponent.addSubTree(IntermediateQuery subQuery,
QueryNode subQueryTopNode,
QueryNode localTopNode) |
void |
QueryTreeComponent.insertParent(QueryNode childNode,
QueryNode newParentNode)
Inserts a new node between a node and its former parent (now grand-parent)
|
void |
QueryTreeComponent.insertParent(QueryNode childNode,
QueryNode newParentNode,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition)
Inserts a new node between a node and its former parent (now grand-parent)
|
QueryNode |
QueryTreeComponent.removeOrReplaceNodeByUniqueChild(QueryNode node)
TODO: explain
|
void |
QueryTreeComponent.replaceNodesByOneNode(com.google.common.collect.ImmutableList<QueryNode> queryNodes,
QueryNode replacingNode,
QueryNode parentNode,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition)
TODO: explain
|
void |
QueryTreeComponent.transferChild(QueryNode childNode,
QueryNode formerParentNode,
QueryNode newParentNode,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition)
Transfers a child node from a parent to another parent
|
| Modifier and Type | Method and Description |
|---|---|
void |
DefaultQueryTreeComponent.addChild(QueryNode parentNode,
QueryNode childNode,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition,
boolean canReplace) |
void |
DefaultTree.addChild(QueryNode parentQueryNode,
QueryNode childQueryNode,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition,
boolean mustBeNew,
boolean canReplace) |
void |
QueryTree.addChild(QueryNode parentQueryNode,
QueryNode childQueryNode,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition,
boolean mustBeNew,
boolean canReplace) |
void |
BinaryChildrenRelation.addChild(TreeNode childNode,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition,
boolean canReplace) |
void |
ChildrenRelation.addChild(TreeNode childNode,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition,
boolean canReplace) |
void |
DefaultQueryTreeComponent.addSubTree(IntermediateQuery subQuery,
QueryNode subQueryTopNode,
QueryNode localTopNode) |
void |
DefaultQueryTreeComponent.insertParent(QueryNode childNode,
QueryNode newParentNode) |
void |
DefaultQueryTreeComponent.insertParent(QueryNode childNode,
QueryNode newParentNode,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition) |
void |
DefaultTree.insertParent(QueryNode childNode,
QueryNode newParentNode,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition) |
void |
QueryTree.insertParent(QueryNode childNode,
QueryNode newParentNode,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition) |
QueryNode |
DefaultQueryTreeComponent.removeOrReplaceNodeByUniqueChild(QueryNode node) |
QueryNode |
DefaultTree.removeOrReplaceNodeByUniqueChild(QueryNode parentQueryNode) |
QueryNode |
QueryTree.removeOrReplaceNodeByUniqueChild(QueryNode node) |
void |
DefaultQueryTreeComponent.replaceNodesByOneNode(com.google.common.collect.ImmutableList<QueryNode> queryNodes,
QueryNode replacingNode,
QueryNode parentNode,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition) |
void |
DefaultTree.replaceNodesByOneNode(com.google.common.collect.ImmutableList<QueryNode> nodesToRemove,
QueryNode replacingNode,
QueryNode parentNode,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition) |
void |
QueryTree.replaceNodesByOneNode(com.google.common.collect.ImmutableList<QueryNode> queryNodes,
QueryNode replacingNode,
QueryNode parentNode,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition) |
void |
DefaultQueryTreeComponent.transferChild(QueryNode childNode,
QueryNode formerParentNode,
QueryNode newParentNode,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition) |
Copyright © 2009–2020 Free University of Bozen-Bolzano. All rights reserved.