Function mergeAndScore

agent/filefinder/query.go:234–279

(cands []candidate, plan *queryPlan, params scoreParams, topK int)

}

func mergeAndScore(cands []candidate, plan *queryPlan, params scoreParams, topK int) []Result {
	if topK <= 0 || len(cands) == 0 {
		return nil
	}
	query := []byte(plan.Normalized)
	h := &resultHeap{}
	heap.Init(h)
	for i := range cands {
		c := &cands[i]
		s := scorePath([]byte(c.Path), c.BaseOff, c.BaseLen, c.Depth, query, plan.Tokens, params)
		if s <= 0 {
			continue
		}
		// DirTokenHit is applied here rather than in scorePath because
		// it depends on the query plan's directory tokens, which are
		// split from the full query during planning. scorePath operates
		// on raw query bytes without knowledge of token boundaries.
		if len(plan.DirTokens) > 0 {
			segments := extractSegments([]byte(c.Path))
			for _, dt := range plan.DirTokens {
				for _, seg := range segments {
					if equalFoldASCII(seg, dt) {
						s += params.DirTokenHit
						break
					}
				}
			}
		}
		r := Result{Path: c.Path, Score: s, IsDir: c.Flags == uint16(FlagDir)}
		if h.Len() < topK {
			heap.Push(h, r)
		} else if s > (*h)[0].Score {
			(*h)[0] = r
			heap.Fix(h, 0)
		}
	}
	n := h.Len()
	results := make([]Result, n)
	for i := n - 1; i >= 0; i-- {
		v := heap.Pop(h)
		if r, ok := v.(Result); ok {
			results[i] = r
		}
	}
	return results
}

type resultHeap []Result