chore(async search): search per N-minute intervals

[forshev]

Description

search per N-minute intervals instead of per-fraction to support compaction

Fixes #463

---

• I have read and followed all requirements in CONTRIBUTING.md;
• I used LLM/AI assistance to make this pull request;

If you have used LLM/AI assistance please provide model name and full prompt:

Model: {{model-name}}
Prompt: {{prompt}}

[codecov-commenter]

Codecov Report

❌ Patch coverage is 62.32877% with 55 lines in your changes missing coverage. Please review.
✅ Project coverage is 70.35%. Comparing base (4ad8f17) to head (010fcb2).

Files with missing lines	Patch %	Lines
asyncsearcher/async_searcher.go	57.25%	39 Missing and 14 partials ⚠️
fracmanager/fractions_snapshot.go	87.50%	1 Missing and 1 partial ⚠️

Additional details and impacted files

@@            Coverage Diff             @@
##             main     #471      +/-   ##
==========================================
- Coverage   70.44%   70.35%   -0.10%     
==========================================
  Files         232      232              
  Lines       18371    18448      +77     
==========================================
+ Hits        12942    12979      +37     
- Misses       4453     4481      +28     
- Partials      976      988      +12     

☔ View full report in Codecov by Harness.
📢 Have feedback on the report? Share it here.

🚀 New features to boost your workflow:

• ❄️ Test Analytics: Detect flaky tests, report on failures, and find test suite problems.
• 📦 JS Bundle Analysis: Save yourself from yourself by tracking and limiting bundle sizes in JS merges.

[dkharms]

By the way, we can reuse this API for regular fetches and searches. IIRC, now we acquire all fractions -- even those that do not intersect with user provided time range.

[dkharms]

One important thing to notice.

compaction and asyncsearcher can acquire the same fraction set. So, when both processes release fractions, compaction deletes merged fractions -- how result of asynchronous search will be returned in this case?

I understand that QPR is self-sufficient, but QPR contains IDSources which in their turn contain Hint (fraction name) which is used in Fetch stage.

[dkharms]

I think I've broken the invariant from comment in fractionSnapshot definition:

fractions   []frac.Fraction // The actual fractions in chronological order

Now, we build snapshot in this way and it is totally possible that chronological order is broken:

for s := range r.sealed.All() {
	all.AddSealed(s)
}

for _, c := range r.compacting {
	all.AddSealed(c)
}

So I suggest to remove this comment and filter fractions using the same approach as we have here:

func (l List) FilterInRange(from, to seq.MID) List {
	res := make(List, 0, len(l))
	for _, f := range l {
		if f.IsIntersecting(from, to) {
			res = append(res, f)
		}
	}
	return res
}