public class MovAvgBuilder extends PipelineAggregatorBuilder<MovAvgBuilder>
ToXContent.DelegatingMapParams, ToXContent.MapParams, ToXContent.Params
type
EMPTY_PARAMS
Constructor and Description |
---|
MovAvgBuilder(String name) |
Modifier and Type | Method and Description |
---|---|
MovAvgBuilder |
format(String format) |
MovAvgBuilder |
gapPolicy(BucketHelpers.GapPolicy gapPolicy)
Defines what should be done when a gap in the series is discovered
|
protected XContentBuilder |
internalXContent(XContentBuilder builder,
ToXContent.Params params) |
MovAvgBuilder |
minimize(boolean minimize)
Determines if the model should be fit to the data using a cost
minimizing algorithm.
|
MovAvgBuilder |
modelBuilder(MovAvgModelBuilder modelBuilder)
Sets a MovAvgModelBuilder for the Moving Average.
|
MovAvgBuilder |
predict(int numPredictions)
Sets the number of predictions that should be returned.
|
MovAvgBuilder |
settings(Map<String,Object> settings)
The hash of settings that should be provided to the model when it is
instantiated
|
MovAvgBuilder |
window(int window)
Sets the window size for the moving average.
|
setBucketsPaths, setMetaData, toXContent
getName
public MovAvgBuilder(String name)
public MovAvgBuilder format(String format)
public MovAvgBuilder gapPolicy(BucketHelpers.GapPolicy gapPolicy)
gapPolicy
- A GapPolicy enum defining the selected policypublic MovAvgBuilder modelBuilder(MovAvgModelBuilder modelBuilder)
modelBuilder
- A MovAvgModelBuilder which has been prepopulated with settingspublic MovAvgBuilder window(int window)
window
- Size of windowpublic MovAvgBuilder predict(int numPredictions)
numPredictions
- Number of predictions to makepublic MovAvgBuilder minimize(boolean minimize)
minimize
- If the model should be fit to the underlying datapublic MovAvgBuilder settings(Map<String,Object> settings)
protected XContentBuilder internalXContent(XContentBuilder builder, ToXContent.Params params) throws IOException
internalXContent
in class PipelineAggregatorBuilder<MovAvgBuilder>
IOException
Copyright © 2009–2016. All rights reserved.