/**
* Copyright © 2012 Akiban Technologies, Inc. All rights
* reserved.
*
* This program and the accompanying materials are made available
* under the terms of the Eclipse Public License v1.0 which
* accompanies this distribution, and is available at
* http://www.eclipse.org/legal/epl-v10.html
*
* This program may also be available under different license terms.
* For more information, see www.akiban.com or contact
* licensing@akiban.com.
*
* Contributors:
* Akiban Technologies, Inc.
*/
package com.akiban.sql.parser;
import com.akiban.sql.StandardException;
import java.util.List;
/**
* MySQL's index hint.
*/
public class IndexHintNode extends QueryTreeNode
{
public static enum HintType {
USE, IGNORE, FORCE
}
public static enum HintScope {
JOIN, ORDER_BY, GROUP_BY
}
private HintType hintType;
private HintScope hintScope;
private List<String> indexes;
public void init(Object hintType,
Object hintScope,
Object indexes)
{
this.hintType = (HintType)hintType;
this.hintScope = (HintScope)hintScope;
this.indexes = (List<String>)indexes;
}
public HintType getHintType() {
return hintType;
}
public HintScope getHintScope() {
return hintScope;
}
public List<String> getIndexes() {
return indexes;
}
/**
* Fill this node with a deep copy of the given node.
*/
public void copyFrom(QueryTreeNode node) throws StandardException {
super.copyFrom(node);
IndexHintNode other = (IndexHintNode)node;
this.hintType = other.hintType;
this.hintScope = other.hintScope;
this.indexes = other.indexes;
}
/**
* Convert this object to a String. See comments in QueryTreeNode.java
* for how this should be done for tree printing.
*
* @return This object as a String
*/
public String toString() {
return "hintType: " + hintType + "\n" +
"hintScope: " + hintScope + "\n" +
"indexes: " + indexes + "\n" +
super.toString();
}
}