| Modifier and Type | Interface and Description |
|---|---|
interface |
CompositeIQTree<N extends QueryNode>
For composite trees, isEquivalentTo(o) == equals(o)
|
| Modifier and Type | Interface and Description |
|---|---|
interface |
LeafIQTree |
| Modifier and Type | Method and Description |
|---|---|
QueryNode |
IQTree.getRootNode() |
QueryNode |
IntermediateQueryBuilder.getRootNode() |
QueryNode |
IntermediateQuery.getRootNode() |
| Modifier and Type | Method and Description |
|---|---|
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
IntermediateQuery.getAncestors(QueryNode descendantNode)
From the parent to the oldest ancestor.
|
Optional<QueryNode> |
IntermediateQuery.getChild(QueryNode currentNode,
BinaryOrderedOperatorNode.ArgumentPosition position) |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
IntermediateQueryBuilder.getChildren(QueryNode node) |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
IntermediateQuery.getChildren(QueryNode node) |
Stream<QueryNode> |
IntermediateQuery.getChildrenStream(QueryNode node) |
Optional<QueryNode> |
IntermediateQuery.getFirstChild(QueryNode node) |
Optional<QueryNode> |
IntermediateQuery.getNextSibling(QueryNode node) |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
IntermediateQuery.getNodesInBottomUpOrder() |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
IntermediateQuery.getNodesInTopDownOrder() |
Stream<QueryNode> |
IntermediateQuery.getOtherChildrenStream(QueryNode parent,
QueryNode childToOmit) |
Optional<QueryNode> |
IntermediateQuery.getParent(QueryNode node) |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
IntermediateQuery.getSubTreeNodesInTopDownOrder(QueryNode currentNode)
EXCLUDES the root of the sub-tree (currentNode).
|
| Modifier and Type | Method and Description |
|---|---|
void |
IntermediateQueryBuilder.addChild(QueryNode parentNode,
QueryNode child)
When the parent is NOT a BinaryAsymetricOperatorNode
|
void |
IntermediateQueryBuilder.addChild(QueryNode parentNode,
QueryNode child,
BinaryOrderedOperatorNode.ArgumentPosition position)
When the parent is a BinaryAsymetricOperatorNode.
|
void |
IntermediateQueryBuilder.addChild(QueryNode parentNode,
QueryNode child,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition)
For commodity
|
void |
IntermediateQueryBuilder.addChildren(QueryNode parent,
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> children) |
void |
IntermediateQueryBuilder.appendSubtree(QueryNode subQueryRoot,
IntermediateQuery sourceQuery) |
boolean |
IntermediateQueryBuilder.contains(QueryNode node) |
boolean |
IntermediateQuery.contains(QueryNode node) |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
IntermediateQuery.getAncestors(QueryNode descendantNode)
From the parent to the oldest ancestor.
|
Optional<QueryNode> |
IntermediateQuery.getChild(QueryNode currentNode,
BinaryOrderedOperatorNode.ArgumentPosition position) |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
IntermediateQueryBuilder.getChildren(QueryNode node) |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
IntermediateQuery.getChildren(QueryNode node) |
Stream<QueryNode> |
IntermediateQuery.getChildrenStream(QueryNode node) |
ConstructionNode |
IntermediateQuery.getClosestConstructionNode(QueryNode node)
Returns itself if is a ConstructionNode or its first ancestor that is a construction node otherwise.
|
Optional<QueryNode> |
IntermediateQuery.getFirstChild(QueryNode node) |
Optional<QueryNode> |
IntermediateQuery.getNextSibling(QueryNode node) |
Optional<BinaryOrderedOperatorNode.ArgumentPosition> |
IntermediateQuery.getOptionalPosition(QueryNode child) |
Optional<BinaryOrderedOperatorNode.ArgumentPosition> |
IntermediateQuery.getOptionalPosition(QueryNode parentNode,
QueryNode child)
TODO: explain
|
Stream<QueryNode> |
IntermediateQuery.getOtherChildrenStream(QueryNode parent,
QueryNode childToOmit) |
Optional<QueryNode> |
IntermediateQuery.getParent(QueryNode node) |
IntermediateQuery |
IntermediateQuery.getSubquery(QueryNode root,
DistinctVariableOnlyDataAtom projectionAtom) |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
IntermediateQuery.getSubTreeNodesInTopDownOrder(QueryNode currentNode)
EXCLUDES the root of the sub-tree (currentNode).
|
it.unibz.inf.ontop.com.google.common.collect.ImmutableSet<Variable> |
IntermediateQuery.getVariables(QueryNode subTreeRootNode)
Set of variables that are returned by the sub-tree.
|
it.unibz.inf.ontop.com.google.common.collect.ImmutableSet<Variable> |
IntermediateQuery.getVariablesRequiredByAncestors(QueryNode queryNode)
Minimal set of variables such that a construction node projecting exactly these variables could be inserted
just above this node without altering the query semantics.
|
boolean |
IntermediateQuery.hasAncestor(QueryNode descendantNode,
QueryNode ancestorNode) |
void |
IntermediateQueryBuilder.init(DistinctVariableOnlyDataAtom projectionAtom,
QueryNode rootNode) |
| Modifier and Type | Method and Description |
|---|---|
void |
IntermediateQueryBuilder.addChildren(QueryNode parent,
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> children) |
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractCompositeIQTree<N extends QueryNode> |
| Modifier and Type | Method and Description |
|---|---|
QueryNode |
QueryTreeComponent.getRootNode() |
QueryNode |
IntermediateQueryImpl.getRootNode() |
QueryNode |
QueryTreeComponent.removeOrReplaceNodeByUniqueChild(QueryNode node)
TODO: explain
|
QueryNode |
QueryTreeComponent.replaceNodeByChild(QueryNode parentNode,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalReplacingChildPosition)
If no position is given, replaces the parent node by its first child
|
QueryNode |
QueryTreeComponent.replaceSubTreeByIQ(QueryNode subTreeRoot,
IQTree replacingSubTree) |
| Modifier and Type | Method and Description |
|---|---|
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
QueryTreeComponent.getAncestors(QueryNode descendantNode)
From the parent to the oldest ancestor.
|
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
IntermediateQueryImpl.getAncestors(QueryNode descendantNode) |
Optional<QueryNode> |
IntermediateQueryImpl.getChild(QueryNode currentNode,
BinaryOrderedOperatorNode.ArgumentPosition position) |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
QueryTreeComponent.getChildren(QueryNode node) |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
IntermediateQueryImpl.getChildren(QueryNode node) |
Stream<QueryNode> |
QueryTreeComponent.getChildrenStream(QueryNode node) |
Stream<QueryNode> |
IntermediateQueryImpl.getChildrenStream(QueryNode node) |
Optional<QueryNode> |
QueryTreeComponent.getFirstChild(QueryNode node) |
Optional<QueryNode> |
IntermediateQueryImpl.getFirstChild(QueryNode node) |
Optional<QueryNode> |
IntermediateQueryImpl.getNextSibling(QueryNode node) |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
QueryTreeComponent.getNodesInBottomUpOrder() |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
IntermediateQueryImpl.getNodesInBottomUpOrder() |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
QueryTreeComponent.getNodesInTopDownOrder() |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
IntermediateQueryImpl.getNodesInTopDownOrder() |
Stream<QueryNode> |
IntermediateQueryImpl.getOtherChildrenStream(QueryNode parent,
QueryNode childToOmit) |
Optional<QueryNode> |
QueryTreeComponent.getParent(QueryNode node) |
Optional<QueryNode> |
IntermediateQueryImpl.getParent(QueryNode node) |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
QueryTreeComponent.getSubTreeNodesInTopDownOrder(QueryNode currentNode)
All the nodes EXCEPT the root of this sub-tree
|
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
IntermediateQueryImpl.getSubTreeNodesInTopDownOrder(QueryNode currentNode) |
Optional<QueryNode> |
QueryTreeComponent.nextSibling(QueryNode node) |
| 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) |
boolean |
QueryTreeComponent.contains(QueryNode node) |
boolean |
IntermediateQueryImpl.contains(QueryNode node) |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
QueryTreeComponent.getAncestors(QueryNode descendantNode)
From the parent to the oldest ancestor.
|
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
IntermediateQueryImpl.getAncestors(QueryNode descendantNode) |
Optional<QueryNode> |
IntermediateQueryImpl.getChild(QueryNode currentNode,
BinaryOrderedOperatorNode.ArgumentPosition position) |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
QueryTreeComponent.getChildren(QueryNode node) |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
IntermediateQueryImpl.getChildren(QueryNode node) |
Stream<QueryNode> |
QueryTreeComponent.getChildrenStream(QueryNode node) |
Stream<QueryNode> |
IntermediateQueryImpl.getChildrenStream(QueryNode node) |
ConstructionNode |
IntermediateQueryImpl.getClosestConstructionNode(QueryNode node) |
Optional<QueryNode> |
QueryTreeComponent.getFirstChild(QueryNode node) |
Optional<QueryNode> |
IntermediateQueryImpl.getFirstChild(QueryNode node) |
Optional<QueryNode> |
IntermediateQueryImpl.getNextSibling(QueryNode node) |
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) |
Stream<QueryNode> |
IntermediateQueryImpl.getOtherChildrenStream(QueryNode parent,
QueryNode childToOmit) |
Optional<QueryNode> |
QueryTreeComponent.getParent(QueryNode node) |
Optional<QueryNode> |
IntermediateQueryImpl.getParent(QueryNode node) |
IntermediateQuery |
IntermediateQueryImpl.getSubquery(QueryNode subQueryRoot,
DistinctVariableOnlyDataAtom projectionAtom) |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
QueryTreeComponent.getSubTreeNodesInTopDownOrder(QueryNode currentNode)
All the nodes EXCEPT the root of this sub-tree
|
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
IntermediateQueryImpl.getSubTreeNodesInTopDownOrder(QueryNode currentNode) |
it.unibz.inf.ontop.com.google.common.collect.ImmutableSet<Variable> |
QueryTreeComponent.getVariables(QueryNode node) |
it.unibz.inf.ontop.com.google.common.collect.ImmutableSet<Variable> |
IntermediateQueryImpl.getVariables(QueryNode subTreeRootNode) |
it.unibz.inf.ontop.com.google.common.collect.ImmutableSet<Variable> |
IntermediateQueryImpl.getVariablesRequiredByAncestors(QueryNode queryNode) |
boolean |
IntermediateQueryImpl.hasAncestor(QueryNode descendantNode,
QueryNode ancestorNode)
TODO: replace by a more efficient implementation
|
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)
|
Optional<QueryNode> |
QueryTreeComponent.nextSibling(QueryNode node) |
QueryNode |
QueryTreeComponent.removeOrReplaceNodeByUniqueChild(QueryNode node)
TODO: explain
|
void |
QueryTreeComponent.removeSubTree(QueryNode subTreeRoot) |
void |
QueryTreeComponent.replaceNode(QueryNode previousNode,
QueryNode replacingNode) |
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.replaceSubTree(QueryNode subTreeRootNode,
QueryNode replacingNode)
Replaces all the sub-tree by one sub-tree node
|
QueryNode |
QueryTreeComponent.replaceSubTreeByIQ(QueryNode subTreeRoot,
IQTree replacingSubTree) |
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 |
QueryTreeComponent.replaceNodesByOneNode(it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> queryNodes,
QueryNode replacingNode,
QueryNode parentNode,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition)
TODO:Â explain
|
| Modifier and Type | Method and Description |
|---|---|
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
DefaultQueryTreeComponent.getAncestors(QueryNode descendantNode) |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
StandardChildrenRelation.getChildQueryNodes() |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
ChildrenRelation.getChildQueryNodes() |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
BinaryChildrenRelation.getChildQueryNodes() |
Stream<QueryNode> |
StandardChildrenRelation.getChildQueryNodeStream() |
Stream<QueryNode> |
ChildrenRelation.getChildQueryNodeStream() |
Stream<QueryNode> |
BinaryChildrenRelation.getChildQueryNodeStream() |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
DefaultIntermediateQueryBuilder.getChildren(QueryNode node) |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
DefaultTree.getChildren(QueryNode node) |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
DefaultQueryTreeComponent.getChildren(QueryNode node) |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
QueryTree.getChildren(QueryNode node) |
Stream<QueryNode> |
DefaultTree.getChildrenStream(QueryNode node) |
Stream<QueryNode> |
DefaultQueryTreeComponent.getChildrenStream(QueryNode node) |
Stream<QueryNode> |
QueryTree.getChildrenStream(QueryNode node) |
Optional<QueryNode> |
DefaultQueryTreeComponent.getFirstChild(QueryNode node) |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
DefaultTree.getNodesInBottomUpOrder() |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
DefaultQueryTreeComponent.getNodesInBottomUpOrder() |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
QueryTree.getNodesInBottomUpOrder() |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
DefaultTree.getNodesInTopDownOrder() |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
DefaultQueryTreeComponent.getNodesInTopDownOrder() |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
QueryTree.getNodesInTopDownOrder() |
Optional<QueryNode> |
DefaultTree.getParent(QueryNode childQueryNode) |
Optional<QueryNode> |
DefaultQueryTreeComponent.getParent(QueryNode node) |
Optional<QueryNode> |
QueryTree.getParent(QueryNode childNode) |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
DefaultTree.getSubTreeNodesInTopDownOrder(QueryNode currentQueryNode) |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
DefaultQueryTreeComponent.getSubTreeNodesInTopDownOrder(QueryNode currentNode) |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
QueryTree.getSubTreeNodesInTopDownOrder(QueryNode currentNode)
Excludes the top node from the list
|
Optional<QueryNode> |
DefaultQueryTreeComponent.nextSibling(QueryNode node) |
| Modifier and Type | Method and Description |
|---|---|
void |
DefaultIntermediateQueryBuilder.addChild(QueryNode parentNode,
QueryNode childNode) |
void |
DefaultIntermediateQueryBuilder.addChild(QueryNode parentNode,
QueryNode childNode,
BinaryOrderedOperatorNode.ArgumentPosition position) |
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 |
DefaultIntermediateQueryBuilder.addChildren(QueryNode parent,
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> children) |
void |
DefaultQueryTreeComponent.addSubTree(IntermediateQuery subQuery,
QueryNode subQueryTopNode,
QueryNode localTopNode) |
void |
DefaultIntermediateQueryBuilder.appendSubtree(QueryNode subQueryRoot,
IntermediateQuery sourceQuery) |
protected void |
TreeNode.changeQueryNode(QueryNode newNode) |
boolean |
DefaultIntermediateQueryBuilder.contains(QueryNode node) |
boolean |
DefaultTree.contains(QueryNode node) |
boolean |
DefaultQueryTreeComponent.contains(QueryNode node) |
boolean |
QueryTree.contains(QueryNode node) |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
DefaultQueryTreeComponent.getAncestors(QueryNode descendantNode) |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
DefaultIntermediateQueryBuilder.getChildren(QueryNode node) |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
DefaultTree.getChildren(QueryNode node) |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
DefaultQueryTreeComponent.getChildren(QueryNode node) |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
QueryTree.getChildren(QueryNode node) |
Stream<QueryNode> |
DefaultTree.getChildrenStream(QueryNode node) |
Stream<QueryNode> |
DefaultQueryTreeComponent.getChildrenStream(QueryNode node) |
Stream<QueryNode> |
QueryTree.getChildrenStream(QueryNode node) |
Optional<QueryNode> |
DefaultQueryTreeComponent.getFirstChild(QueryNode node) |
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<QueryNode> |
DefaultTree.getParent(QueryNode childQueryNode) |
Optional<QueryNode> |
DefaultQueryTreeComponent.getParent(QueryNode node) |
Optional<QueryNode> |
QueryTree.getParent(QueryNode childNode) |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
DefaultTree.getSubTreeNodesInTopDownOrder(QueryNode currentQueryNode) |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
DefaultQueryTreeComponent.getSubTreeNodesInTopDownOrder(QueryNode currentNode) |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> |
QueryTree.getSubTreeNodesInTopDownOrder(QueryNode currentNode)
Excludes the top node from the list
|
it.unibz.inf.ontop.com.google.common.collect.ImmutableSet<Variable> |
DefaultQueryTreeComponent.getVariables(QueryNode node)
TODO: optimize by it but materializing (and maintaining) the results.
|
void |
DefaultIntermediateQueryBuilder.init(DistinctVariableOnlyDataAtom projectionAtom,
QueryNode rootNode) |
void |
DefaultQueryTreeComponent.insertParent(QueryNode childNode,
QueryNode newParentNode) |
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) |
Optional<QueryNode> |
DefaultQueryTreeComponent.nextSibling(QueryNode node) |
QueryNode |
DefaultTree.removeOrReplaceNodeByUniqueChild(QueryNode parentQueryNode) |
QueryNode |
DefaultQueryTreeComponent.removeOrReplaceNodeByUniqueChild(QueryNode node) |
QueryNode |
QueryTree.removeOrReplaceNodeByUniqueChild(QueryNode node) |
void |
DefaultTree.removeSubTree(QueryNode subQueryTreeRoot) |
void |
DefaultQueryTreeComponent.removeSubTree(QueryNode subTreeRoot) |
void |
QueryTree.removeSubTree(QueryNode subTreeRoot) |
void |
DefaultTree.replaceNode(QueryNode previousNode,
QueryNode replacingNode) |
void |
DefaultQueryTreeComponent.replaceNode(QueryNode previousNode,
QueryNode replacingNode) |
void |
QueryTree.replaceNode(QueryNode previousNode,
QueryNode replacingNode) |
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 |
DefaultQueryTreeComponent.replaceSubTree(QueryNode subTreeRootNode,
QueryNode replacingNode) |
QueryNode |
DefaultQueryTreeComponent.replaceSubTreeByIQ(QueryNode subTreeRoot,
IQTree replacingSubTree) |
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 |
|---|---|
void |
DefaultIntermediateQueryBuilder.addChildren(QueryNode parent,
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<QueryNode> children) |
ChildrenRelation |
StandardChildrenRelation.clone(Map<QueryNode,TreeNode> newNodeIndex) |
ChildrenRelation |
ChildrenRelation.clone(Map<QueryNode,TreeNode> newNodeIndex) |
ChildrenRelation |
BinaryChildrenRelation.clone(Map<QueryNode,TreeNode> newNodeIndex) |
TreeNode |
TreeNode.findNewTreeNode(Map<QueryNode,TreeNode> newNodeIndex) |
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) |
| Constructor and Description |
|---|
DefaultTree(QueryNode rootQueryNode) |
TreeNode(QueryNode queryNode) |
| Modifier and Type | Interface and Description |
|---|---|
interface |
AggregationNode
Combines GROUP BY and a projection
See IntermediateQueryFactory for creating a new instance.
|
interface |
BinaryNonCommutativeOperatorNode
Operator QueryNode which are binary and whose operands ordering is semantically meaningful.
|
interface |
BinaryOrderedOperatorNode
The ordering of the operands is meaningful procedurally,
and therefore should be preserved.
|
interface |
CommutativeJoinNode
Commutative: the children order does not matter
|
interface |
CommutativeJoinOrFilterNode
Union of CommutativeJoinNode and FilterNode
|
interface |
ConstructionNode
Head node an IntermediateQuery
TODO: further explain
See
IntermediateQueryFactory.createConstructionNode(it.unibz.inf.ontop.com.google.common.collect.ImmutableSet<it.unibz.inf.ontop.model.term.Variable>) for creating a new instance. |
interface |
DistinctNode
See
IntermediateQueryFactory.createDistinctNode() for creating a new instance. |
interface |
EmptyNode
Temporary QueryNode that says that replace a non-satisfied sub-tree.
|
interface |
ExplicitVariableProjectionNode
Node that explicitly declares the variables returned by its sub-tree.
|
interface |
ExtendedProjectionNode
Common abstraction for ConstructionNode and AggregationNode
|
interface |
ExtensionalDataNode
TODO: explain
|
interface |
FilterNode
TODO: explain
See IntermediateQueryFactory for creating a new instance.
|
interface |
InnerJoinLikeNode |
interface |
InnerJoinNode
See IntermediateQueryFactory for creating a new instance.
|
interface |
IntensionalDataNode
TODO: explain
TODO: find a better name
See IntermediateQueryFactory for creating a new instance.
|
interface |
JoinLikeNode
Any kind of JOIN (inner, left join)
|
interface |
JoinOrFilterNode
TODO: explain
|
interface |
LeftJoinNode
See IntermediateQueryFactory for creating a new instance.
|
interface |
NaryOperatorNode
Has at least two children
|
interface |
NativeNode
Represents a serialized query that can be executed by the DB engine
See
IntermediateQueryFactory.createNativeNode(it.unibz.inf.ontop.com.google.common.collect.ImmutableSortedSet<it.unibz.inf.ontop.model.term.Variable>, it.unibz.inf.ontop.com.google.common.collect.ImmutableMap<it.unibz.inf.ontop.model.term.Variable, it.unibz.inf.ontop.model.type.DBTermType>, it.unibz.inf.ontop.com.google.common.collect.ImmutableMap<it.unibz.inf.ontop.model.term.Variable, it.unibz.inf.ontop.dbschema.QuotedID>, java.lang.String, it.unibz.inf.ontop.iq.node.VariableNullability) for creating a new instance. |
interface |
OrderByNode
Follows a NULLS FIRST semantics (if ascending, NULLS LAST otherwise), similarly to SPARQL
See https://www.w3.org/TR/sparql11-query/#modOrderBy
See
IntermediateQueryFactory.createOrderByNode(it.unibz.inf.ontop.com.google.common.collect.ImmutableList<it.unibz.inf.ontop.iq.node.OrderByNode.OrderComparator>) for creating a new instance. |
interface |
QueryModifierNode |
interface |
SliceNode
See
IntermediateQueryFactory.createSliceNode(long, long) for creating a new instance. |
interface |
TrueNode
See
IntermediateQueryFactory.createTrueNode() for creating a new instance. |
interface |
UnaryOperatorNode
Has ONE child
|
interface |
UnionNode
All its children are expected to project its projected variables
See IntermediateQueryFactory for creating a new instance.
|
| Modifier and Type | Method and Description |
|---|---|
QueryNode |
QueryNode.acceptNodeTransformer(HomogeneousQueryNodeTransformer transformer)
"Accept" method for the "Visitor" pattern.
|
QueryNode |
QueryNode.clone()
Cloning is needed for having multiple copies
in the same intermediate query tree.
|
| Modifier and Type | Method and Description |
|---|---|
Optional<QueryNode> |
NodeTransformationProposal.getOptionalNewNodeOrReplacingChild() |
| Modifier and Type | Method and Description |
|---|---|
boolean |
QueryNode.isEquivalentTo(QueryNode queryNode)
Is syntactically equivalent
|
boolean |
QueryNode.isSyntacticallyEquivalentTo(QueryNode node)
TODO: explain
|
| Modifier and Type | Class and Description |
|---|---|
class |
AggregationNodeImpl |
class |
CompositeQueryNodeImpl |
class |
ConstructionNodeImpl |
class |
DataNodeImpl<P extends AtomPredicate> |
class |
DistinctNodeImpl |
class |
EmptyNodeImpl |
class |
ExtendedProjectionNodeImpl |
class |
ExtensionalDataNodeImpl
"Default" implementation for an extensional data node.
|
class |
FilterNodeImpl |
class |
InnerJoinNodeImpl |
class |
IntensionalDataNodeImpl |
class |
JoinLikeNodeImpl |
class |
JoinOrFilterNodeImpl |
class |
LeafIQTreeImpl |
class |
LeftJoinNodeImpl |
class |
NativeNodeImpl |
class |
OrderByNodeImpl |
class |
QueryModifierNodeImpl |
class |
QueryNodeImpl |
class |
SliceNodeImpl |
class |
TrueNodeImpl |
class |
UnionNodeImpl |
| Modifier and Type | Method and Description |
|---|---|
QueryNode |
QueryNodeImpl.clone()
See https://stackoverflow.com/questions/6837362/
|
| Modifier and Type | Method and Description |
|---|---|
Optional<QueryNode> |
NodeTransformationProposalImpl.getOptionalNewNodeOrReplacingChild() |
| Modifier and Type | Method and Description |
|---|---|
boolean |
SliceNodeImpl.isEquivalentTo(QueryNode queryNode) |
boolean |
UnionNodeImpl.isEquivalentTo(QueryNode queryNode) |
boolean |
OrderByNodeImpl.isEquivalentTo(QueryNode queryNode) |
boolean |
FilterNodeImpl.isEquivalentTo(QueryNode queryNode) |
boolean |
InnerJoinNodeImpl.isEquivalentTo(QueryNode queryNode) |
boolean |
LeftJoinNodeImpl.isEquivalentTo(QueryNode queryNode) |
boolean |
ExtensionalDataNodeImpl.isEquivalentTo(QueryNode queryNode) |
boolean |
DistinctNodeImpl.isEquivalentTo(QueryNode queryNode) |
boolean |
TrueNodeImpl.isEquivalentTo(QueryNode queryNode) |
boolean |
EmptyNodeImpl.isEquivalentTo(QueryNode queryNode) |
boolean |
IntensionalDataNodeImpl.isEquivalentTo(QueryNode queryNode) |
boolean |
NativeNodeImpl.isEquivalentTo(QueryNode queryNode) |
boolean |
AggregationNodeImpl.isEquivalentTo(QueryNode queryNode) |
boolean |
ConstructionNodeImpl.isEquivalentTo(QueryNode queryNode) |
boolean |
SliceNodeImpl.isSyntacticallyEquivalentTo(QueryNode node) |
boolean |
UnionNodeImpl.isSyntacticallyEquivalentTo(QueryNode node) |
boolean |
OrderByNodeImpl.isSyntacticallyEquivalentTo(QueryNode node) |
boolean |
FilterNodeImpl.isSyntacticallyEquivalentTo(QueryNode node) |
boolean |
InnerJoinNodeImpl.isSyntacticallyEquivalentTo(QueryNode node) |
boolean |
LeftJoinNodeImpl.isSyntacticallyEquivalentTo(QueryNode node) |
boolean |
ExtensionalDataNodeImpl.isSyntacticallyEquivalentTo(QueryNode node) |
boolean |
DistinctNodeImpl.isSyntacticallyEquivalentTo(QueryNode node) |
boolean |
TrueNodeImpl.isSyntacticallyEquivalentTo(QueryNode node) |
boolean |
EmptyNodeImpl.isSyntacticallyEquivalentTo(QueryNode node) |
boolean |
IntensionalDataNodeImpl.isSyntacticallyEquivalentTo(QueryNode node) |
boolean |
NativeNodeImpl.isSyntacticallyEquivalentTo(QueryNode node) |
boolean |
AggregationNodeImpl.isSyntacticallyEquivalentTo(QueryNode node) |
boolean |
ConstructionNodeImpl.isSyntacticallyEquivalentTo(QueryNode node) |
| Constructor and Description |
|---|
NodeTransformationProposalImpl(NodeTransformationProposedState state,
QueryNode newNodeOrReplacingChild,
it.unibz.inf.ontop.com.google.common.collect.ImmutableSet<Variable> nullVariables) |
| Modifier and Type | Method and Description |
|---|---|
IQTree |
IQConverter.convertTree(IntermediateQuery query,
QueryNode rootNode) |
| Modifier and Type | Method and Description |
|---|---|
static it.unibz.inf.ontop.com.google.common.collect.ImmutableSet<Variable> |
VariableCollector.collectVariables(List<QueryNode> nodes) |
| Modifier and Type | Method and Description |
|---|---|
IQTree |
IQConverterImpl.convertTree(IntermediateQuery query,
QueryNode rootNode)
Recursive
|
Copyright © 2009–2021 Free University of Bozen-Bolzano. All rights reserved.