| Package | Description |
|---|---|
| it.unibz.inf.ontop.iq | |
| it.unibz.inf.ontop.iq.impl | |
| it.unibz.inf.ontop.iq.impl.tree | |
| it.unibz.inf.ontop.iq.node |
| Modifier and Type | Method and Description |
|---|---|
Optional<BinaryOrderedOperatorNode.ArgumentPosition> |
IntermediateQuery.getOptionalPosition(QueryNode child) |
Optional<BinaryOrderedOperatorNode.ArgumentPosition> |
IntermediateQuery.getOptionalPosition(QueryNode parentNode,
QueryNode child)
TODO: explain
|
| Modifier and Type | Method and Description |
|---|---|
void |
IntermediateQueryBuilder.addChild(QueryNode parentNode,
QueryNode child,
BinaryOrderedOperatorNode.ArgumentPosition position)
When the parent is a BinaryAsymetricOperatorNode.
|
Optional<QueryNode> |
IntermediateQuery.getChild(QueryNode currentNode,
BinaryOrderedOperatorNode.ArgumentPosition position) |
| Modifier and Type | Method and Description |
|---|---|
void |
IntermediateQueryBuilder.addChild(QueryNode parentNode,
QueryNode child,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition)
For commodity
|
| Modifier and Type | Method and Description |
|---|---|
Optional<BinaryOrderedOperatorNode.ArgumentPosition> |
IntermediateQueryImpl.getOptionalPosition(QueryNode child) |
Optional<BinaryOrderedOperatorNode.ArgumentPosition> |
QueryTreeComponent.getOptionalPosition(QueryNode parentNode,
QueryNode childNode) |
Optional<BinaryOrderedOperatorNode.ArgumentPosition> |
IntermediateQueryImpl.getOptionalPosition(QueryNode parentNode,
QueryNode childNode) |
| Modifier and Type | Method and Description |
|---|---|
Optional<QueryNode> |
IntermediateQueryImpl.getChild(QueryNode currentNode,
BinaryOrderedOperatorNode.ArgumentPosition position) |
| 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.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.replaceNodeByChild(QueryNode parentNode,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalReplacingChildPosition)
If no position is given, replaces the parent node by its first child
|
void |
QueryTreeComponent.replaceNodesByOneNode(it.unibz.inf.ontop.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 |
|---|---|
Optional<BinaryOrderedOperatorNode.ArgumentPosition> |
DefaultTree.getOptionalPosition(QueryNode parentNode,
QueryNode childNode) |
Optional<BinaryOrderedOperatorNode.ArgumentPosition> |
DefaultQueryTreeComponent.getOptionalPosition(QueryNode parentNode,
QueryNode childNode) |
Optional<BinaryOrderedOperatorNode.ArgumentPosition> |
QueryTree.getOptionalPosition(QueryNode parentNode,
QueryNode childNode) |
Optional<BinaryOrderedOperatorNode.ArgumentPosition> |
StandardChildrenRelation.getOptionalPosition(TreeNode childTreeNode) |
Optional<BinaryOrderedOperatorNode.ArgumentPosition> |
ChildrenRelation.getOptionalPosition(TreeNode childTreeNode) |
Optional<BinaryOrderedOperatorNode.ArgumentPosition> |
BinaryChildrenRelation.getOptionalPosition(TreeNode childNode) |
| Modifier and Type | Method and Description |
|---|---|
void |
DefaultIntermediateQueryBuilder.addChild(QueryNode parentNode,
QueryNode childNode,
BinaryOrderedOperatorNode.ArgumentPosition position) |
Optional<TreeNode> |
StandardChildrenRelation.getChild(BinaryOrderedOperatorNode.ArgumentPosition position) |
Optional<TreeNode> |
ChildrenRelation.getChild(BinaryOrderedOperatorNode.ArgumentPosition position) |
Optional<TreeNode> |
BinaryChildrenRelation.getChild(BinaryOrderedOperatorNode.ArgumentPosition position) |
| Modifier and Type | Method and Description |
|---|---|
void |
DefaultIntermediateQueryBuilder.addChild(QueryNode parentNode,
QueryNode child,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition) |
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 |
StandardChildrenRelation.addChild(TreeNode childNode,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition,
boolean canReplace) |
void |
ChildrenRelation.addChild(TreeNode childNode,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition,
boolean canReplace) |
void |
BinaryChildrenRelation.addChild(TreeNode childNode,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition,
boolean canReplace) |
void |
DefaultTree.insertParent(QueryNode childNode,
QueryNode newParentNode,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition) |
void |
DefaultQueryTreeComponent.insertParent(QueryNode childNode,
QueryNode newParentNode,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition) |
void |
QueryTree.insertParent(QueryNode childNode,
QueryNode newParentNode,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition) |
QueryNode |
DefaultTree.replaceNodeByChild(QueryNode parentNode,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalReplacingChildPosition) |
QueryNode |
DefaultQueryTreeComponent.replaceNodeByChild(QueryNode parentNode,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalReplacingChildPosition) |
QueryNode |
QueryTree.replaceNodeByChild(QueryNode parentNode,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalReplacingChildPosition) |
void |
DefaultTree.replaceNodesByOneNode(it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> nodesToRemove,
QueryNode replacingNode,
QueryNode parentNode,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition) |
void |
DefaultQueryTreeComponent.replaceNodesByOneNode(it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> queryNodes,
QueryNode replacingNode,
QueryNode parentNode,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition) |
void |
QueryTree.replaceNodesByOneNode(it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> queryNodes,
QueryNode replacingNode,
QueryNode parentNode,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition) |
void |
DefaultTree.transferChild(QueryNode childNode,
QueryNode formerParentNode,
QueryNode newParentNode,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition) |
void |
DefaultQueryTreeComponent.transferChild(QueryNode childNode,
QueryNode formerParentNode,
QueryNode newParentNode,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition) |
void |
QueryTree.transferChild(QueryNode childNode,
QueryNode formerParentNode,
QueryNode newParentNode,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition) |
| Modifier and Type | Method and Description |
|---|---|
static BinaryOrderedOperatorNode.ArgumentPosition |
BinaryOrderedOperatorNode.ArgumentPosition.valueOf(String name)
Returns the enum constant of this type with the specified name.
|
static BinaryOrderedOperatorNode.ArgumentPosition[] |
BinaryOrderedOperatorNode.ArgumentPosition.values()
Returns an array containing the constants of this enum type, in
the order they are declared.
|
Copyright © 2009–2021 Free University of Bozen-Bolzano. All rights reserved.