| Package | Description |
|---|---|
| it.unibz.inf.ontop.iq.impl.tree |
| Modifier and Type | Method and Description |
|---|---|
TreeNode |
TreeNode.cloneShallowly()
Does not clone the query node
|
TreeNode |
TreeNode.findNewTreeNode(Map<QueryNode,TreeNode> newNodeIndex) |
TreeNode |
StandardChildrenRelation.getParent() |
TreeNode |
BinaryChildrenRelation.getParent() |
TreeNode |
ChildrenRelation.getParent() |
| Modifier and Type | Method and Description |
|---|---|
Optional<TreeNode> |
StandardChildrenRelation.getChild(BinaryOrderedOperatorNode.ArgumentPosition position) |
Optional<TreeNode> |
BinaryChildrenRelation.getChild(BinaryOrderedOperatorNode.ArgumentPosition position) |
Optional<TreeNode> |
ChildrenRelation.getChild(BinaryOrderedOperatorNode.ArgumentPosition position) |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<TreeNode> |
StandardChildrenRelation.getChildren() |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<TreeNode> |
BinaryChildrenRelation.getChildren() |
it.unibz.inf.ontop.com.google.common.collect.ImmutableList<TreeNode> |
ChildrenRelation.getChildren() |
Stream<TreeNode> |
StandardChildrenRelation.getChildrenStream() |
Stream<TreeNode> |
BinaryChildrenRelation.getChildrenStream() |
Stream<TreeNode> |
ChildrenRelation.getChildrenStream() |
| Modifier and Type | Method and Description |
|---|---|
void |
StandardChildrenRelation.addChild(TreeNode childNode,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition,
boolean canReplace) |
void |
BinaryChildrenRelation.addChild(TreeNode childNode,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition,
boolean canReplace) |
void |
ChildrenRelation.addChild(TreeNode childNode,
Optional<BinaryOrderedOperatorNode.ArgumentPosition> optionalPosition,
boolean canReplace) |
boolean |
StandardChildrenRelation.contains(TreeNode node) |
boolean |
BinaryChildrenRelation.contains(TreeNode node) |
boolean |
ChildrenRelation.contains(TreeNode node) |
Optional<BinaryOrderedOperatorNode.ArgumentPosition> |
StandardChildrenRelation.getOptionalPosition(TreeNode childTreeNode) |
Optional<BinaryOrderedOperatorNode.ArgumentPosition> |
BinaryChildrenRelation.getOptionalPosition(TreeNode childNode) |
Optional<BinaryOrderedOperatorNode.ArgumentPosition> |
ChildrenRelation.getOptionalPosition(TreeNode childTreeNode) |
void |
StandardChildrenRelation.removeChild(TreeNode childNode) |
void |
BinaryChildrenRelation.removeChild(TreeNode childNode) |
void |
ChildrenRelation.removeChild(TreeNode childNode) |
void |
StandardChildrenRelation.replaceChild(TreeNode formerChild,
TreeNode newChild) |
void |
BinaryChildrenRelation.replaceChild(TreeNode formerChild,
TreeNode newChild) |
void |
ChildrenRelation.replaceChild(TreeNode formerChild,
TreeNode newChild) |
| Modifier and Type | Method and Description |
|---|---|
ChildrenRelation |
StandardChildrenRelation.clone(Map<QueryNode,TreeNode> newNodeIndex) |
ChildrenRelation |
BinaryChildrenRelation.clone(Map<QueryNode,TreeNode> newNodeIndex) |
ChildrenRelation |
ChildrenRelation.clone(Map<QueryNode,TreeNode> newNodeIndex) |
TreeNode |
TreeNode.findNewTreeNode(Map<QueryNode,TreeNode> newNodeIndex) |
| Constructor and Description |
|---|
BinaryChildrenRelation(TreeNode parent) |
StandardChildrenRelation(TreeNode parent) |
Copyright © 2009–2020 Free University of Bozen-Bolzano. All rights reserved.