Package org.elasticsearch.search.aggregations

Examples of org.elasticsearch.search.aggregations.InternalAggregations

77
78
79
80
81
82
83
        Bucket(boolean keyed, @Nullable ValueFormatter formatter) {
            super(keyed, formatter);
        }

        Bucket(String key, double from, double to, long docCount, List<InternalAggregation> aggregations, boolean keyed, @Nullable ValueFormatter formatter) {
            this(key, from, to, docCount, new InternalAggregations(aggregations), keyed, formatter);
        }
View Full Code Here
79
80
81
82
83
84
85
        public Bucket(boolean keyed, @Nullable ValueFormatter formatter) {
            super(keyed, formatter);
        }

        public Bucket(String key, double from, double to, long docCount, List<InternalAggregation> aggregations, boolean keyed, ValueFormatter formatter) {
            super(key, from, to, docCount, new InternalAggregations(aggregations), keyed, formatter);
        }
View Full Code Here
78
79
80
81
82
83
84
        public Bucket(boolean keyed) {
            super(keyed, ValueFormatter.IPv4);
        }

        public Bucket(String key, double from, double to, long docCount, List<InternalAggregation> aggregations, boolean keyed) {
            super(key, from, to, docCount, new InternalAggregations(aggregations), keyed, ValueFormatter.IPv4);
        }
View Full Code Here
142
143
144
145
146
147
148
149
            List<InternalAggregations> aggregationsList = Lists.newArrayListWithCapacity(ranges.size());
            for (Bucket range : ranges) {
                docCount += range.docCount;
                aggregationsList.add(range.aggregations);
            }
            final InternalAggregations aggs = InternalAggregations.reduce(aggregationsList, context);
            return getFactory().createBucket(key, from, to, docCount, aggs, keyed, formatter);
        }
View Full Code Here
101
102
103
104
105
106
107
108
            for (Bucket bucket : buckets) {
                subsetDf += bucket.subsetDf;
                supersetDf += bucket.supersetDf;
                aggregationsList.add(bucket.aggregations);
            }
            InternalAggregations aggs = InternalAggregations.reduce(aggregationsList, context);
            return newBucket(subsetDf, subsetSize, supersetDf, supersetSize, aggs);
        }
View Full Code Here
98
99
100
101
102
103
104
105
                        docCountError += bucket.docCountError;
                    }
                }
                aggregationsList.add(bucket.aggregations);
            }
            InternalAggregations aggs = InternalAggregations.reduce(aggregationsList, context);
            return newBucket(docCount, aggs, docCountError);
        }
View Full Code Here
139
140
141
142
143
144
145
146
            long docCount = 0;
            for (Bucket bucket : buckets) {
                docCount += bucket.docCount;
                aggregations.add((InternalAggregations) bucket.getAggregations());
            }
            InternalAggregations aggs = InternalAggregations.reduce(aggregations, context);
            return (B) getFactory().createBucket(key, docCount, aggs, keyed, formatter);
        }
View Full Code Here
200
201
202
203
204
205
206
207
208
209
210
            this.bounds = bounds;
        }

        public static EmptyBucketInfo readFrom(StreamInput in) throws IOException {
            Rounding rounding = Rounding.Streams.read(in);
            InternalAggregations aggs = InternalAggregations.readAggregations(in);
            if (in.getVersion().onOrAfter(Version.V_1_1_0)) {
                if (in.readBoolean()) {
                    return new EmptyBucketInfo(rounding, aggs, ExtendedBounds.readFrom(in));
                }
            }
View Full Code Here
132
133
134
135
136
137
138
139
            long docCount = 0;
            for (Bucket bucket : buckets) {
                docCount += bucket.docCount;
                aggregationsList.add(bucket.aggregations);
            }
            final InternalAggregations aggs = InternalAggregations.reduce(aggregationsList, context);
            return new Bucket(geohashAsLong, docCount, aggs);
        }
View Full Code Here
76
77
78
79
80
81
82
83
        for (InternalAggregation aggregation : aggregations) {
            assert aggregation.getName().equals(getName());
            docCount += ((InternalSingleBucketAggregation) aggregation).docCount;
            subAggregationsList.add(((InternalSingleBucketAggregation) aggregation).aggregations);
        }
        final InternalAggregations aggs = InternalAggregations.reduce(subAggregationsList, reduceContext);
        return newAggregation(getName(), docCount, aggs);
    }
View Full Code Here
TOP

Related Classes of org.elasticsearch.search.aggregations.InternalAggregations

  • org.carrot2.elasticsearch.ClusteringAction$TransportClusteringAction
  • org.elasticsearch.common.bytes.BytesReference
  • org.elasticsearch.search.aggregations.bucket.geogrid.InternalGeoHashGrid$Bucket
  • org.elasticsearch.search.aggregations.bucket.histogram.InternalHistogram$Bucket
  • org.elasticsearch.search.aggregations.bucket.histogram.InternalHistogram$EmptyBucketInfo
  • org.elasticsearch.search.aggregations.bucket.InternalSingleBucketAggregation
  • org.elasticsearch.search.aggregations.bucket.range.date.InternalDateRange$Bucket
  • org.elasticsearch.search.aggregations.bucket.range.geodistance.InternalGeoDistance$Bucket
  • org.elasticsearch.search.aggregations.bucket.range.InternalRange$Bucket
  • org.elasticsearch.search.aggregations.bucket.range.ipv4.InternalIPv4Range$Bucket
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.