All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.eclipse.rdf4j.query.algebra.QueryModelNode Maven / Gradle / Ivy

There is a newer version: 5.0.2
Show newest version
/*******************************************************************************
 * Copyright (c) 2015 Eclipse RDF4J contributors, Aduna, and others.
 *
 * All rights reserved. This program and the accompanying materials
 * are made available under the terms of the Eclipse Distribution License v1.0
 * which accompanies this distribution, and is available at
 * http://www.eclipse.org/org/documents/edl-v10.php.
 *
 * SPDX-License-Identifier: BSD-3-Clause
 *******************************************************************************/
package org.eclipse.rdf4j.query.algebra;

import java.io.Serializable;

import org.eclipse.rdf4j.common.annotation.Experimental;

/**
 * Main interface for all query model nodes.
 */
public interface QueryModelNode extends Cloneable, Serializable {

	/**
	 * Visits this node. The node reports itself to the visitor with the proper runtime type.
	 */
	 void visit(QueryModelVisitor visitor) throws X;

	/**
	 * Visits the children of this node. The node calls {@link #visit(QueryModelVisitor)} on all of its child nodes.
	 */
	 void visitChildren(QueryModelVisitor visitor) throws X;

	/**
	 * Gets the node's parent.
	 *
	 * @return The parent node, if any.
	 */
	QueryModelNode getParentNode();

	/**
	 * Sets the node's parent.
	 *
	 * @param parent The parent node for this node.
	 */
	void setParentNode(QueryModelNode parent);

	/**
	 * Replaces one of the child nodes with a new node.
	 *
	 * @param current     The current child node.
	 * @param replacement The new child node.
	 * @throws IllegalArgumentException If current is not one of node's children.
	 * @throws ClassCastException       If replacement is of an incompatible type.
	 */
	void replaceChildNode(QueryModelNode current, QueryModelNode replacement);

	/**
	 * Substitutes this node with a new node in the query model tree.
	 *
	 * @param replacement The new node.
	 * @throws IllegalStateException If this node does not have a parent node.
	 * @throws ClassCastException    If replacement is of an incompatible type.
	 */
	void replaceWith(QueryModelNode replacement);

	/**
	 * Returns true if this query model node and its children are recursively equal to o and its
	 * children.
	 */
	@Override
	boolean equals(Object o);

	/**
	 * Returns an indented print of the node tree, starting from this node.
	 */
	@Override
	String toString();

	/**
	 * Returns the signature of this query model node. Signatures normally include the node's name and any parameters,
	 * but not parent or child nodes. This method is used by {@link #toString()}.
	 *
	 * @return The node's signature, e.g. SLICE (offset=10, limit=10).
	 */
	String getSignature();

	/**
	 * Returns a (deep) clone of this query model node. This method recursively clones the entire node tree, starting
	 * from this nodes.
	 *
	 * @return A deep clone of this query model node.
	 */
	QueryModelNode clone();

	/**
	 * Returns the number of tuples that this QueryNode predicts will be outputted. For a StatementPattern this would be
	 * the estimated cardinality provided by the EvaluationStatistics. For a Join the would be the resulting number of
	 * joined tuples.
	 *
	 * @return rows
	 */
	@Experimental
	default double getResultSizeEstimate() {
		return -1;
	}

	@Experimental
	default void setResultSizeEstimate(double rows) {
		// no-op for backwards compatibility
	}

	@Experimental
	default long getResultSizeActual() {
		return -1;
	}

	@Experimental
	default void setResultSizeActual(long resultSizeActual) {
		// no-op for backwards compatibility
	}

	@Experimental
	default double getCostEstimate() {
		return -1;
	}

	@Experimental
	default void setCostEstimate(double costEstimate) {
		// no-op for backwards compatibility
	}

	@Experimental
	default long getTotalTimeNanosActual() {
		return -1;
	}

	@Experimental
	default void setTotalTimeNanosActual(long totalTime) {
		// no-op
	}

}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy