public class AggregateFunction extends Function
Modifier and Type | Field and Description |
---|---|
static String |
AVG |
static String |
COUNT |
static String |
MAX |
static String |
MIN |
static String |
STDDEV_POP |
static String |
STDDEV_SAMP |
static String |
SUM |
static String |
VAR_POP |
static String |
VAR_SAMP |
Constructor and Description |
---|
AggregateFunction(String aggName,
boolean isDistinct,
List<? extends Expression> params,
Class<?> type) |
Modifier and Type | Method and Description |
---|---|
void |
acceptVisitor(LanguageObjectVisitor visitor) |
Expression |
getCondition() |
Expression |
getExpression()
Deprecated.
|
String |
getName()
Get the name of the aggregate function.
|
OrderBy |
getOrderBy() |
boolean |
isDistinct()
Determine whether this function was executed with DISTINCT.
|
void |
setCondition(Expression condition) |
void |
setDistinct(boolean isDistinct)
Set whether this function was executed with DISTINCT.
|
void |
setName(String name)
Set the name of the aggregate function.
|
void |
setOrderBy(OrderBy orderBy) |
getMetadataObject, getParameters, getType, setMetadataObject, setType
toString
public static final String COUNT
public static final String AVG
public static final String SUM
public static final String MIN
public static final String MAX
public static final String STDDEV_POP
public static final String STDDEV_SAMP
public static final String VAR_SAMP
public static final String VAR_POP
public AggregateFunction(String aggName, boolean isDistinct, List<? extends Expression> params, Class<?> type)
public String getName()
public boolean isDistinct()
public Expression getExpression()
public void acceptVisitor(LanguageObjectVisitor visitor)
acceptVisitor
in interface LanguageObject
acceptVisitor
in class Function
public void setName(String name)
public void setDistinct(boolean isDistinct)
isDistinct
- True if DISTINCT mode should be usedpublic Expression getCondition()
public void setCondition(Expression condition)
public OrderBy getOrderBy()
public void setOrderBy(OrderBy orderBy)
Copyright © 2019. All rights reserved.