Files
milvus/internal/agg/aggregate_reducer.go
T
e2787d3981 enhance: standardize error handling on merr + Sys/Input classification (#50221)
issue: #47420

## What this PR does

Project-wide migration of raw `fmt.Errorf` / `errors.New` in function
bodies onto
the `merr` framework, plus the Sys-vs-Input error classification and the
machinery it drives (retriability, fine-grained metrics, segcore
unification),
plus the convention docs and a linter that keeps it from regressing.

Scope: storage, proxy, coordinators (root/data/query), query node, data
node,
`pkg/util` & `internal/util`, expression parser, message queue,
streaming, and
misc packages. Bare raw-error usages went from ~3000 to a ~340 allowlist
(package-level sentinels / build-tag / test sites).

---

## How to review this PR

It is large but the vast majority is mechanical. Changes fall into three
tiers;
spend review budget on Part 2 and Part 3.

### Part 1 — Mechanical standardization (low risk, verify by rule)

Each converted call follows one of a small fixed set of rules. To
review, check
that each site obeys the matching rule rather than reading every line:

| Pattern | Rule |
|---|---|
| `fmt.Errorf("...")` originating a new error | →
`merr.WrapErrXxxMsg("...")` with a code matching the failure's meaning |
| Adding context to an existing typed error | → `merr.Wrap(err, "...")`
/ `merr.Wrapf(...)` — **preserves** the inner code (never `WrapErr*Err`,
which overwrites it) |
| Errors inside the streaming subsystem | → `status.New*` factories
(StreamingError), **not** merr — this is the component-internal dialect
(see `docs/dev/error_handling_guide.md`) |
| Low-level / control-flow signal caught by `errors.Is` | → kept as a
package-level `errors.New` sentinel (lowercase, same-package) |

Conventions are documented in `docs/dev/error_handling_guide.md`
(how-to) and
`docs/dev/error_sentinel_convention.md` (rules + audit). A
`gocritic`/`ruleguard`
rule (`rawmerrerror`, in `rules.go`) enforces "no raw `return
errors.New/fmt.Errorf`"
under `make verifiers`.

### Part 2 — Behavior changes (review these closely)

These are the sites where the wire contract or runtime behavior changes,
not just
the source text. Listed by category; representative locations given,
full set in
the diff.

**A. gRPC wire-code shifts: `UnexpectedError(1)/Code 65535` → typed
code.**
Where a handler previously returned a raw error (collapsed to
`Code=65535` on the
wire), it now returns a typed merr, so the client sees a real code. The
most
common shift is to `IllegalArgument(5)/Code 1100` (ParameterInvalid).
Touch
points include datanode task handlers (CreateTask/Query/Drop), proxy
Upsert,
querynode GetMetrics, datacoord CreateIndex, httpserver query-response
builder,
and typeutil schema validation. One code refinement: an index-param
validation
moved `1100` → `1101` (ParameterMissing). **Client/SDK assertions and
any code
that switched on `Code=65535` for these paths must be re-checked** (the
go_client
e2e assertions were already aligned in this PR).

**B. Prometheus `status` label contract change (externally visible).**
The proxy metric's coarse `fail` / `rejected` values are split into
`fail_input` / `fail_system` and `rejected_user` / `rejected_system` (in
`requestutil.ParseMetricLabel`; auth/privilege rejections count as
`rejected_user`), so dashboards can attribute a failure to caller vs
operator.
**Dashboards/alerts querying `status="fail"` must migrate to
`status=~"fail_.*"`, and `status="rejected"` to
`status=~"rejected_.*"`.** The
in-repo Grafana dashboard is already migrated; external dashboards built
on the
old values silently go empty after upgrade. This is the one change that
requires an ops-side migration.

**C. Retriability semantics.**
- C1: `merr.Status(err)` now forces `Retriable=false` when the error is
an
`InputError` — a malformed request can never succeed on blind retry, so
clients
never get the self-contradictory "your input is wrong but you may
retry".
- C2: `retry.Do` short-circuits an `InputError` (non-retriable) — **but
only when
  the caller did not pass a `RetryErr` predicate**. The check is an
`if c.isRetryErr != nil { ... } else if InputError { ... }` *mutually
exclusive*
branch (`pkg/util/retry/retry.go`): an explicit `RetryErr` takes
precedence and
bypasses the InputError abort. `retry.Handle` deliberately does **not**
apply
the InputError abort (its callers signal abort via `shouldRetry=false`).
Four
flusher startup callsites that must retry through transient "not ready"
errors
  were given explicit `RetryErr` escape hatches.

**D. segcore (C++→Go) error classification.**
A single shared Go-side table (`pkg/util/merr/segcore.go`) maps each
segcore code
to a merr sentinel + InputError/signal category, replacing scattered
hand-written
`if errorCode == ...` switches in the cgo wrappers. **Wire `Code` values
change
for every segcore pass-through error, not just the remapped ones.**
Named
sentinels remap (C++ `2003` → merr `2001`, `2033` → `2002`,
Folly/Knowhere codes
likewise); **all remaining pass-through codes (`2004`–`2043`, previously
surfaced to clients as raw C++ enum values) now serialize as `2000`**
(`ErrSegcore`), with the original C++ code preserved in the `Reason`
text
(`segcoreCode=...`); unknown/future codes collapse to `2000` as well
(pinned by
the `wire_code_projection` test). Transient segcore classes (object
storage /
file IO / OOM / mmap / FieldNotLoaded — 11 codes) now report
`Retriable=true`.
**Any client switching on raw segcore codes in the `2004`–`2043` range
must be
re-checked**; the in-Reason code remains available for diagnostics.
Signal
codes (PretendFinished / FollyCancel) are recognized centrally.
`errors.Is`-based
control flow on these (e.g. scheduler skip/retry) is preserved.

**E. InputError classification (25 sentinels + dynamic marks).**
25 sentinels in `errors.go` carry `WithErrorType(InputError)` (the
Collection /
ResourceGroup / Database families, `ErrIndexDuplicate`,
`ErrParameterInvalid`,
`ErrPrivilegeNotAuthenticated`, `ErrImportFailed`, `ErrQueryPlan`, ...),
plus dynamic
marks for the 8 segcore input codes (ExprInvalid, DimNotMatch,
MetricTypeInvalid, FieldIDInvalid, ...) and
`WrapErrAsInputError`. The widest blast radius is `ErrParameterInvalid`
(1100):
~2335 `WrapErrParameterInvalid*` callsites now classify as input /
non-retriable. Because of C1/C2 this changes retriability for
any path that returns these. **The audit to confirm no transient path
was
mis-marked is the single most important review item** (see Part 3). One
reverse
correction: storage field-stats parsing moved from `ErrParameterInvalid`
(input)
to `ErrDataIntegrity` — a corrupted stored stat is data corruption, not
user
input.

### Part 3 — Known risks & traps (called out proactively)

1. **`merr.Wrap` vs `WrapErr*Err` (code-masking).** `WrapErr*Err` builds
a
`wrappedMilvusError{sentinel: ErrServiceInternal}` whose `code()`
returns the
*outer* sentinel — it overwrites the inner typed code and hides the
`errors.Is`
chain. This is intentional (use it to *deliberately* downgrade), but it
was a
recurring conversion defect; the rule "add context with `merr.Wrap`,
downgrade
with `WrapErr*Err`" is enforced by convention and reviewed across the
diff.
2. **InputError × `retry.Do` blast radius.** Marking a sentinel
`InputError` makes
any `retry.Do(...)` without a `RetryErr` predicate stop retrying it.
Reviewers
should sanity-check that no transient use of the 19 newly-marked
sentinels
(especially `ErrParameterInvalid`) sits inside a retry loop that needed
to keep
   spinning. The known flusher cases were handled (see C2).
3. **The ~340 raw-error allowlist.** What remains as bare `errors.New`
is, by
design: package-level sentinels (caught by `errors.Is`), `//go:build
test`
sites, and out-of-band trees (`cmd/`, `tests/`, codegen, walimpls). The
linter
only bans the *direct-return* form; assignment-then-return escapes and
the full
no-exceptions ban are deferred to an AST-based linter (Tier 2,
documented).
4. **segcore C++ second step deferred.** This PR unifies classification
on the Go
side; splitting the dual-semantic C++ codes at the source is a
follow-up.

---

## Validation

- `make verifiers`: Go side clean (gofmt + static-check across modules,
including
  the new `rawmerrerror` rule with a 0-hit baseline repo-wide).
- `make test-go`: passing; the one real regression introduced (a
datanode
`invalid_task_type` assertion shifting `1` → `5` from a ParameterInvalid
  conversion) was fixed in-tree.
- go_client e2e CreateIndex assertions aligned to the new merr messages.

---------

Signed-off-by: zhenshan.cao <zhenshan.cao@zilliz.com>
Co-authored-by: Claude Opus 4.7 (1M context) <noreply@anthropic.com>
2026-06-12 15:04:51 -07:00

492 lines
17 KiB
Go

package agg
import (
"context"
"github.com/milvus-io/milvus-proto/go-api/v3/schemapb"
typeutil2 "github.com/milvus-io/milvus/internal/util/typeutil"
"github.com/milvus-io/milvus/pkg/v3/proto/internalpb"
"github.com/milvus-io/milvus/pkg/v3/proto/planpb"
"github.com/milvus-io/milvus/pkg/v3/proto/segcorepb"
"github.com/milvus-io/milvus/pkg/v3/util/merr"
"github.com/milvus-io/milvus/pkg/v3/util/paramtable"
"github.com/milvus-io/milvus/pkg/v3/util/typeutil"
)
type GroupAggReducer struct {
groupByFieldIds []int64
aggregates []*planpb.Aggregate
hashValsMap map[uint64]*Bucket
groupLimit int64
schema *schemapb.CollectionSchema
}
func NewGroupAggReducer(groupByFieldIds []int64, aggregates []*planpb.Aggregate, groupLimit int64, schema *schemapb.CollectionSchema) *GroupAggReducer {
return &GroupAggReducer{
groupByFieldIds: groupByFieldIds,
aggregates: aggregates,
hashValsMap: make(map[uint64]*Bucket), // Initialize hashValsMap
groupLimit: groupLimit,
schema: schema,
}
}
type AggregationResult struct {
fieldDatas []*schemapb.FieldData
allRetrieveCount int64
}
func NewAggregationResult(fieldDatas []*schemapb.FieldData, allRetrieveCount int64) *AggregationResult {
if fieldDatas == nil {
fieldDatas = make([]*schemapb.FieldData, 0)
}
return &AggregationResult{
fieldDatas: fieldDatas,
allRetrieveCount: allRetrieveCount,
}
}
// GetFieldDatas returns the fieldDatas slice
func (ar *AggregationResult) GetFieldDatas() []*schemapb.FieldData {
return ar.fieldDatas
}
func (ar *AggregationResult) GetAllRetrieveCount() int64 {
return ar.allRetrieveCount
}
func (reducer *GroupAggReducer) EmptyAggResult() (*AggregationResult, error) {
helper, err := typeutil.CreateSchemaHelper(reducer.schema)
if err != nil {
return nil, err
}
ret := NewAggregationResult(nil, 0)
appendEmptyField := func(fieldId int64) error {
field, err := helper.GetFieldFromID(fieldId)
if err != nil {
return err
}
emptyFieldData, err := typeutil.GenEmptyFieldData(field)
if err != nil {
return err
}
ret.fieldDatas = append(ret.fieldDatas, emptyFieldData)
return nil
}
for _, grpFid := range reducer.groupByFieldIds {
err := appendEmptyField(grpFid)
if err != nil {
return nil, err
}
}
for _, agg := range reducer.aggregates {
if agg.GetOp() == planpb.AggregateOp_count {
countField := genEmptyLongFieldData(schemapb.DataType_Int64, []int64{0})
ret.fieldDatas = append(ret.fieldDatas, countField)
} else {
field, err := helper.GetFieldFromID(agg.GetFieldId())
if err != nil {
return nil, merr.Wrapf(err, "failed to get field schema for aggregate fieldID %d", agg.GetFieldId())
}
resultType, err := getAggregateResultType(agg.GetOp(), field.GetDataType())
if err != nil {
return nil, merr.Wrapf(err, "failed to get result type for aggregate fieldID %d", agg.GetFieldId())
}
emptyFieldData, err := genEmptyFieldDataByType(resultType)
if err != nil {
return nil, merr.Wrapf(err, "failed to generate empty field data for result type %s", resultType.String())
}
ret.fieldDatas = append(ret.fieldDatas, emptyFieldData)
}
}
return ret, nil
}
func genEmptyLongFieldData(dataType schemapb.DataType, data []int64) *schemapb.FieldData {
return &schemapb.FieldData{
Type: dataType,
Field: &schemapb.FieldData_Scalars{
Scalars: &schemapb.ScalarField{
Data: &schemapb.ScalarField_LongData{LongData: &schemapb.LongArray{Data: data}},
},
},
}
}
// genEmptyFieldDataByType generates empty field data based on the data type
func genEmptyFieldDataByType(dataType schemapb.DataType) (*schemapb.FieldData, error) {
switch dataType {
case schemapb.DataType_Int64:
return genEmptyLongFieldData(dataType, []int64{0}), nil
case schemapb.DataType_Double:
return &schemapb.FieldData{
Type: dataType,
Field: &schemapb.FieldData_Scalars{
Scalars: &schemapb.ScalarField{
Data: &schemapb.ScalarField_DoubleData{DoubleData: &schemapb.DoubleArray{Data: []float64{0}}},
},
},
}, nil
case schemapb.DataType_Int8, schemapb.DataType_Int16, schemapb.DataType_Int32:
return &schemapb.FieldData{
Type: dataType,
Field: &schemapb.FieldData_Scalars{
Scalars: &schemapb.ScalarField{
Data: &schemapb.ScalarField_IntData{IntData: &schemapb.IntArray{Data: []int32{0}}},
},
},
}, nil
case schemapb.DataType_Float:
return &schemapb.FieldData{
Type: dataType,
Field: &schemapb.FieldData_Scalars{
Scalars: &schemapb.ScalarField{
Data: &schemapb.ScalarField_FloatData{FloatData: &schemapb.FloatArray{Data: []float32{0}}},
},
},
}, nil
case schemapb.DataType_VarChar, schemapb.DataType_String, schemapb.DataType_Text:
return &schemapb.FieldData{
Type: dataType,
Field: &schemapb.FieldData_Scalars{
Scalars: &schemapb.ScalarField{
Data: &schemapb.ScalarField_StringData{StringData: &schemapb.StringArray{Data: []string{}}},
},
},
}, nil
case schemapb.DataType_Timestamptz:
return genEmptyLongFieldData(dataType, []int64{0}), nil
default:
// For other types, try to use the original field's GenEmptyFieldData
return nil, merr.WrapErrParameterInvalidMsg("unsupported data type for aggregate result: %s", dataType.String())
}
}
// getAggregateResultType returns the expected result type for an aggregate operation
// based on the aggregate operator type and the input field type.
func getAggregateResultType(op planpb.AggregateOp, inputType schemapb.DataType) (schemapb.DataType, error) {
switch op {
case planpb.AggregateOp_count:
// count aggregation always returns Int64
return schemapb.DataType_Int64, nil
case planpb.AggregateOp_avg:
// avg aggregation always returns Double
return schemapb.DataType_Double, nil
case planpb.AggregateOp_min, planpb.AggregateOp_max:
// min/max keep the original field type
return inputType, nil
case planpb.AggregateOp_sum:
// sum returns Int64 for integer types, Double for float types
switch inputType {
case schemapb.DataType_Int8, schemapb.DataType_Int16, schemapb.DataType_Int32, schemapb.DataType_Int64:
return schemapb.DataType_Int64, nil
case schemapb.DataType_Timestamptz:
return schemapb.DataType_Timestamptz, nil
case schemapb.DataType_Float, schemapb.DataType_Double:
return schemapb.DataType_Double, nil
default:
return schemapb.DataType_None, merr.WrapErrParameterInvalidMsg("unsupported input type %s for sum aggregation", inputType.String())
}
default:
return schemapb.DataType_None, merr.WrapErrParameterInvalidMsg("unknown aggregate operator: %d", op)
}
}
// validateAggregationResults validates the input AggregationResult slice
// It checks:
// 1. Each result's fieldDatas length equals numGroupingKeys + numAggs
// 2. No nil fieldData in any result
// 3. Each fieldData's Type matches the expected type from schema
func (reducer *GroupAggReducer) validateAggregationResults(results []*AggregationResult) error {
if reducer.schema == nil {
return merr.WrapErrParameterInvalidMsg("schema is nil, cannot validate field types")
}
helper, err := typeutil.CreateSchemaHelper(reducer.schema)
if err != nil {
return merr.Wrap(err, "failed to create schema helper")
}
numGroupingKeys := len(reducer.groupByFieldIds)
numAggs := len(reducer.aggregates)
expectedColumnCount := numGroupingKeys + numAggs
// Build expected types for each column
expectedTypes := make([]schemapb.DataType, 0, expectedColumnCount)
// Add types for grouping keys
for _, fieldID := range reducer.groupByFieldIds {
field, err := helper.GetFieldFromID(fieldID)
if err != nil {
return merr.Wrapf(err, "failed to get field schema for groupBy fieldID %d", fieldID)
}
expectedTypes = append(expectedTypes, field.GetDataType())
}
// Add types for aggregates
for _, agg := range reducer.aggregates {
var expectedType schemapb.DataType
if agg.GetOp() == planpb.AggregateOp_count {
// count aggregation always returns Int64
expectedType = schemapb.DataType_Int64
} else {
field, err := helper.GetFieldFromID(agg.GetFieldId())
if err != nil {
return merr.Wrapf(err, "failed to get field schema for aggregate fieldID %d", agg.GetFieldId())
}
expectedType, err = getAggregateResultType(agg.GetOp(), field.GetDataType())
if err != nil {
return merr.Wrapf(err, "failed to get aggregate result type for aggregate fieldID %d", agg.GetFieldId())
}
}
expectedTypes = append(expectedTypes, expectedType)
}
// Validate each result
for resultIdx, result := range results {
if result == nil {
return merr.WrapErrServiceInternalMsg("result at index %d is nil", resultIdx)
}
fieldDatas := result.GetFieldDatas()
// Check 1: fieldDatas length
if len(fieldDatas) != expectedColumnCount {
return merr.WrapErrServiceInternalMsg("result at index %d has fieldDatas length %d, expected %d (numGroupingKeys=%d, numAggs=%d)",
resultIdx, len(fieldDatas), expectedColumnCount, numGroupingKeys, numAggs)
}
// Check 2: no nil fieldData and Check 3: type matching
for colIdx, fieldData := range fieldDatas {
if fieldData == nil {
return merr.WrapErrServiceInternalMsg("result at index %d has nil fieldData at column %d", resultIdx, colIdx)
}
expectedType := expectedTypes[colIdx]
actualType := fieldData.GetType()
if actualType != expectedType {
return merr.WrapErrServiceInternalMsg("result at index %d, column %d has type %s, expected %s",
resultIdx, colIdx, schemapb.DataType_name[int32(actualType)], schemapb.DataType_name[int32(expectedType)])
}
}
}
return nil
}
func (reducer *GroupAggReducer) Reduce(ctx context.Context, results []*AggregationResult) (*AggregationResult, error) {
if len(results) == 0 {
return reducer.EmptyAggResult()
}
// Validate input results before processing
if err := reducer.validateAggregationResults(results); err != nil {
return nil, err
}
if len(results) == 1 {
return results[0], nil
}
// 0. set up aggregates
aggs := make([]AggregateBase, len(reducer.aggregates))
for idx, aggPb := range reducer.aggregates {
agg, err := FromPB(aggPb)
if err != nil {
return nil, err
}
aggs[idx] = agg
}
// 1. set up hashers and accumulators
numGroupingKeys := len(reducer.groupByFieldIds)
numAggs := len(reducer.aggregates)
hashers := make([]FieldAccessor, numGroupingKeys)
accumulators := make([]FieldAccessor, numAggs)
firstFieldData := results[0].GetFieldDatas() //nolint:gosec // results[0] is safe: empty/single-result cases already returned above
outputColumnCount := len(firstFieldData)
for idx, fieldData := range firstFieldData {
accessor, err := NewFieldAccessor(fieldData.GetType())
if err != nil {
return nil, err
}
if idx < numGroupingKeys {
hashers[idx] = accessor
} else {
accumulators[idx-numGroupingKeys] = accessor
}
}
reducedResult := NewAggregationResult(nil, 0)
isGlobal := numGroupingKeys == 0
if isGlobal {
reducedResult.fieldDatas = typeutil.PrepareResultFieldData(firstFieldData, 1)
rows := make([]*Row, len(results))
for idx, result := range results {
reducedResult.allRetrieveCount += result.GetAllRetrieveCount()
fieldValues := make([]*FieldValue, outputColumnCount)
for col := 0; col < outputColumnCount; col++ {
fieldData := result.GetFieldDatas()[col]
accumulators[col].SetVals(fieldData)
if accumulators[col].IsNullAt(0) {
fieldValues[col] = NewNullFieldValue()
} else {
fieldValues[col] = NewFieldValue(accumulators[col].ValAt(0))
}
}
rows[idx] = NewRow(fieldValues)
}
for r := 1; r < len(rows); r++ {
for c := 0; c < outputColumnCount; c++ {
rows[0].UpdateFieldValue(rows[r], c, aggs[c])
}
}
AssembleSingleRow(outputColumnCount, rows[0], reducedResult.fieldDatas)
return reducedResult, nil
}
// 2. compute hash values for all rows in the result retrieved
var totalGroupCount int64 = 0
maxGroupByGroups := paramtable.Get().CommonCfg.GroupByMaxGroups.GetAsInt64()
limitReached := false
for _, result := range results {
if result == nil {
return nil, merr.WrapErrServiceInternalMsg("input result from any sources cannot be nil")
}
reducedResult.allRetrieveCount += result.GetAllRetrieveCount()
fieldDatas := result.GetFieldDatas()
if outputColumnCount != len(fieldDatas) {
return nil, merr.WrapErrServiceInternalMsg("retrieved results from different segments have different size of columns")
}
if outputColumnCount == 0 {
return nil, merr.WrapErrServiceInternalMsg("retrieved results have no column data")
}
rowCount := -1
for i := 0; i < outputColumnCount; i++ {
fieldData := fieldDatas[i]
if i < numGroupingKeys {
hashers[i].SetVals(fieldData)
} else {
accumulators[i-numGroupingKeys].SetVals(fieldData)
}
if rowCount == -1 {
rowCount = hashers[i].RowCount()
} else if i < numGroupingKeys {
if rowCount != hashers[i].RowCount() {
return nil, merr.WrapErrServiceInternalMsg("field data:%d for different columns have different row count, %d vs %d, wrong state",
i, rowCount, hashers[i].RowCount())
}
} else if rowCount != accumulators[i-numGroupingKeys].RowCount() {
return nil, merr.WrapErrServiceInternalMsg("field data:%d for different columns have different row count, %d vs %d, wrong state",
i, rowCount, accumulators[i-numGroupingKeys].RowCount())
}
}
for row := 0; row < rowCount; row++ {
rowFieldValues := make([]*FieldValue, outputColumnCount)
var hashVal uint64
for col := 0; col < outputColumnCount; col++ {
if col < numGroupingKeys {
if col > 0 {
hashVal = typeutil2.HashMix(hashVal, hashers[col].Hash(row))
} else {
hashVal = hashers[col].Hash(row)
}
if hashers[col].IsNullAt(row) {
rowFieldValues[col] = NewNullFieldValue()
} else {
rowFieldValues[col] = NewFieldValue(hashers[col].ValAt(row))
}
} else {
if accumulators[col-numGroupingKeys].IsNullAt(row) {
rowFieldValues[col] = NewNullFieldValue()
} else {
rowFieldValues[col] = NewFieldValue(accumulators[col-numGroupingKeys].ValAt(row))
}
}
}
newRow := NewRow(rowFieldValues)
if bucket := reducer.hashValsMap[hashVal]; bucket == nil {
// New group: check groupLimit before adding.
// When limitReached, new groups/sub-groups are skipped, but
// accumulation into existing groups continues (line 434).
// This is intentional: groupLimit controls the number of output
// groups, not the amount of input data processed. Existing groups
// should accumulate all matching rows for correct aggregation
// (e.g., count/sum must reflect all data, not just early rows).
if limitReached {
continue
}
newBucket := NewBucket()
newBucket.AddRow(newRow)
totalGroupCount++
reducer.hashValsMap[hashVal] = newBucket
if reducer.groupLimit != -1 && totalGroupCount >= reducer.groupLimit {
limitReached = true
}
} else {
if rowIdx := bucket.Find(newRow, numGroupingKeys); rowIdx == NONE {
// New sub-group in existing bucket: check groupLimit
if limitReached {
continue
}
bucket.AddRow(newRow)
totalGroupCount++
if reducer.groupLimit != -1 && totalGroupCount >= reducer.groupLimit {
limitReached = true
}
} else {
if err := bucket.Accumulate(newRow, rowIdx, numGroupingKeys, aggs); err != nil {
return nil, err
}
}
}
if totalGroupCount > maxGroupByGroups {
return nil, merr.WrapErrParameterInvalidMsg("GROUP BY produced too many groups (%d). "+
"Add filters or increase common.groupBy.maxGroups (current: %d)",
totalGroupCount, maxGroupByGroups)
}
// Don't guarantee specific groups to be returned before milvus support order by
}
}
// 3. assemble reduced buckets into retrievedResult
reducedResult.fieldDatas = typeutil.PrepareResultFieldData(firstFieldData, totalGroupCount)
for _, bucket := range reducer.hashValsMap {
err := AssembleBucket(bucket, reducedResult.GetFieldDatas())
if err != nil {
return nil, err
}
}
return reducedResult, nil
}
func InternalResult2AggResult(results []*internalpb.RetrieveResults) []*AggregationResult {
aggResults := make([]*AggregationResult, len(results))
for i := 0; i < len(results); i++ {
aggResults[i] = NewAggregationResult(results[i].GetFieldsData(), results[i].GetAllRetrieveCount())
}
return aggResults
}
func AggResult2internalResult(aggRes *AggregationResult) *internalpb.RetrieveResults {
return &internalpb.RetrieveResults{FieldsData: aggRes.GetFieldDatas(), AllRetrieveCount: aggRes.GetAllRetrieveCount()}
}
func SegcoreResults2AggResult(results []*segcorepb.RetrieveResults) ([]*AggregationResult, error) {
aggResults := make([]*AggregationResult, len(results))
for i := 0; i < len(results); i++ {
if results[i] == nil {
return nil, merr.WrapErrServiceInternalMsg("input segcore query results from any sources cannot be nil")
}
fieldsData := results[i].GetFieldsData()
allRetrieveCount := results[i].GetAllRetrieveCount()
aggResults[i] = NewAggregationResult(fieldsData, allRetrieveCount)
}
return aggResults, nil
}
func AggResult2segcoreResult(aggRes *AggregationResult) *segcorepb.RetrieveResults {
return &segcorepb.RetrieveResults{FieldsData: aggRes.GetFieldDatas(), AllRetrieveCount: aggRes.GetAllRetrieveCount()}
}