Plans 013 and 014, the album page that prompted them, and the smaller fixes they turned up. Changelog, largest first. ## The local library is shaped like files, not like MusicBrainz `audio_files` carries its own tags and points at `albums` and `artists`; `file_genres` is the one real many-to-many. `recordings`, `release_group_recordings`, `artist_credit`, `artist_credit_artist`, `recording_genres`, `release_groups` and `release_to_rg` are gone from the local side, and with them a six-way join in every read, a `MIN(release_group_id)` subquery in eleven queries and a first-credited-artist subquery in nine. Measured on a real 25,966-file library, every many-to-many that model expressed was 1:1 in the data. - Ownership is a file. `GetFilePathsByRecordingMBIDs`, `LibraryMBIDIndex.CheckMBIDs`, `collectLibraryEntities` and `pruneStaleLocalCrossReferences` all join `audio_files`, so the 812 orphaned recordings, 216 release groups and 260 artists that library carried are now structurally impossible. - One projection: every track query selects from the `track_metadata` view, one row type, one mapper. Nine hand-rolled copies had drifted far enough to report different years on different screens. - `library_id = 0` means every library, so each list query exists once instead of scoped and unscoped with a branch at every call site. - No migration chain. `sql/schemas/` is the one description of the shape; `sql/migrations/`, `applyMigrations` and `schema_migrations` are squashed away, along with the drift between them that had sqlc generating against a stale schema. - `database.InsertTestTrack` is the one test seeder; twenty test files had been assembling the old FK chain each in its own order. ## The catalog stores its ids as bytes `explore_index`'s three 36-char MBID columns and its entity-type text are 16 raw bytes and a small integer. The table and its six indexes go 780 MB to 405 MB on a real 2,052,200-row catalog, which is why a fresh install is ~0.6 GB rather than ~1.0 GB. - `backend/explore/mbid.go` is the only place the encoding is known; everything above it speaks dashed strings. - `CHECK(length(mbid) = 16)` makes a stringly write fail at the insert rather than silently returning no rows, since SQLite does not coerce between TEXT and BLOB. - The importer asks the artifact what encoding it carries and converts on the way in, so the artifact already published keeps working and no format bump is needed. - `indexRowColumns`/`scanIndexRow` replace four copies of a 22-column list, and `TestStoredEncodingRoundTrips` sweeps every read path. ## An album page that says how much of the album is yours - One question, asked once: is there a file. `filePaths` is filled by a single batched lookup when the tracklist settles, and the badge, the Play count, the dimmed rows and every menu item read it — replacing four claims of decreasing confidence that could show a green tick on an album whose every action did nothing. - Play, Play 7 of 12, or no play button at all. - `total_tracks` on `explore_index` (~2 bytes over 400,677 release groups) and on `audio_files` from tags that have always carried it: a complete MBID-matched album now makes no catalog call at all, where it used to spend the most expensive request the app makes. - A merged cluster shows the running order the most releases agree on, and the version list marks the release you own rather than standing a synthetic entry in for it. - `AlbumReleasesFailed`: a slow fetch is no longer reported as a failed one by a 12-second timer. - Rows not in the library are dimmed in place (with `aria-disabled`) instead of the owned ones wearing a green tick and a legend. ## Caches and cover art get ceilings - Only the three tiers of a cover are stored; the full-resolution copy nothing rendered was 1,134 MB of a 1.4 GB covers directory. - One artist portrait is downloaded and the rest are remembered as URLs — 4.1 GB of a 5.3 GB cache was candidates no code path reads. - `browsedArtBudget` and `httpCacheBudget` bound what an age cannot: the same install held art for 5,770 artists in a 1,301-artist library. - `OrphanedArtistImagesJob` joined a bare MBID onto a sharded directory, so it deleted the rows that were the only record of the files it left behind. `explore.ArtistImageDir` is that layout's one definition now. ## The autotag queue asks whether there is work `tagging_items` was a row per album folder, not a queue, and no query read the `tag_status` column that held the answer. The four queue queries ask the files, which matters most where it is least visible: `startPrefetch` was scoring every album in a tagged library against MusicBrainz. ## Phantom playlist tracks resolve in place An M3U8 imported before its files leaves phantom rows; they now match by path and fall back to position, keep their place in the playlist when resolved, and pair best-first so two phantoms cannot claim the same file. ## Playing a track plays the list it is in Double-click, and Play on a single row's menu, queue the list as displayed with `startIndex` on that row — the album page and the track list used to queue one track and discard the album around it. A multi-row selection still plays exactly itself. Co-Authored-By: Claude Opus 5 (1M context) <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01AfVYUVExXsx1nSWrXN8mAh
183 lines
5.6 KiB
Go
183 lines
5.6 KiB
Go
package explore
|
|
|
|
import (
|
|
"context"
|
|
"log/slog"
|
|
"testing"
|
|
|
|
"yellowjacket/backend/database"
|
|
"yellowjacket/backend/explore/eval"
|
|
)
|
|
|
|
// seedIndexRow inserts one explore_index row. The FTS triggers keep
|
|
// explore_index_fts in sync automatically.
|
|
func seedIndexRow(
|
|
t *testing.T,
|
|
db *database.DB,
|
|
entityType, mbid, title, artist string,
|
|
popularity int,
|
|
) {
|
|
t.Helper()
|
|
|
|
_, err := db.ExecContext(`
|
|
INSERT INTO explore_index
|
|
(entity_type, mbid, title, artist_name, artist_mbid, popularity, listener_count)
|
|
VALUES (?, ?, ?, ?, x'', ?, ?)
|
|
`, dbEntityType(entityType), dbMBID(testMBID(mbid)), title, artist, popularity, popularity/10)
|
|
if err != nil {
|
|
t.Fatalf("seed %s/%s: %v", entityType, mbid, err)
|
|
}
|
|
}
|
|
|
|
// newTestIndex builds a SearchIndex over a seeded in-memory DB. lb and
|
|
// artistImg are nil because Search touches neither.
|
|
func newTestIndex(t *testing.T, db *database.DB) *SearchIndex {
|
|
t.Helper()
|
|
|
|
idx := NewSearchIndex(db, nil, nil, slog.Default())
|
|
idx.MarkReadyIfPopulated()
|
|
|
|
return idx
|
|
}
|
|
|
|
// TestEvalHarnessIndexRanking is the end-to-end wiring of the eval
|
|
// harness against the real FTS index Search. It seeds a controlled
|
|
// corpus where the correct answer is known, then asserts the harness
|
|
// reports a perfect score — proving both the index ranking and the
|
|
// harness plumbing on a case we fully control.
|
|
func TestEvalHarnessIndexRanking(t *testing.T) {
|
|
db := database.NewTestDB(t)
|
|
|
|
// Popular exact-match artist should beat a more obscure namesake
|
|
// and an unrelated album.
|
|
seedIndexRow(t, db, "artist", "rh", "Radiohead", "Radiohead", 5_000_000)
|
|
seedIndexRow(t, db, "artist", "radio-obscure", "Radio Birdman", "Radio Birdman", 40_000)
|
|
seedIndexRow(t, db, "release_group", "okc", "OK Computer", "Radiohead", 2_000_000)
|
|
seedIndexRow(t, db, "artist", "beatles", "The Beatles", "The Beatles", 9_000_000)
|
|
seedIndexRow(t, db, "artist", "teenagers", "The Teenagers", "The Teenagers", 60_000)
|
|
|
|
idx := newTestIndex(t, db)
|
|
|
|
ranker := eval.RankerFunc(func(query string, limit int) []eval.Result {
|
|
hits := idx.Search(context.Background(), query, limit)
|
|
out := make([]eval.Result, 0, len(hits))
|
|
|
|
for _, h := range hits {
|
|
out = append(out, eval.Result{EntityType: h.EntityType, MBID: h.MBID})
|
|
}
|
|
|
|
return out
|
|
})
|
|
|
|
fixtures := []eval.Fixture{
|
|
{
|
|
Query: "radiohead",
|
|
Note: "popular exact artist match",
|
|
Expect: []eval.Expected{{Type: "artist", MBID: testMBID("rh")}},
|
|
},
|
|
{
|
|
Query: "the teenagers",
|
|
Note: "low-popularity exact match must beat high-popularity article match",
|
|
Expect: []eval.Expected{{Type: "artist", MBID: testMBID("teenagers")}},
|
|
},
|
|
}
|
|
|
|
report := eval.Evaluate(ranker, fixtures, 5)
|
|
t.Log("\n" + report.Format())
|
|
|
|
if report.HitRate < 1.0 {
|
|
t.Errorf("expected every query to surface its result, got hit rate %.3f", report.HitRate)
|
|
}
|
|
|
|
if report.Top1Rate < 1.0 {
|
|
t.Errorf("expected every result at rank 1, got top-1 rate %.3f:\n%s",
|
|
report.Top1Rate, report.Format())
|
|
}
|
|
}
|
|
|
|
// TestExploreFTSDiacriticFolding proves migration 37: an unaccented
|
|
// query must find an accented title (and vice versa) now that
|
|
// explore_index_fts folds diacritics.
|
|
func TestExploreFTSDiacriticFolding(t *testing.T) {
|
|
db := database.NewTestDB(t)
|
|
|
|
seedIndexRow(t, db, "artist", "bey", "Beyoncé", "Beyoncé", 8_000_000)
|
|
seedIndexRow(t, db, "artist", "bjork", "Björk", "Björk", 3_000_000)
|
|
|
|
idx := newTestIndex(t, db)
|
|
|
|
cases := []struct {
|
|
query string
|
|
wantMBID string
|
|
}{
|
|
{"beyonce", "bey"}, // unaccented query → accented title
|
|
{"beyoncé", "bey"}, // accented query still works
|
|
{"bjork", "bjork"}, // ö → o folding
|
|
{"björk", "bjork"}, // accented query still works
|
|
}
|
|
|
|
for _, tc := range cases {
|
|
t.Run(tc.query, func(t *testing.T) {
|
|
hits := idx.Search(context.Background(), tc.query, 5)
|
|
if len(hits) == 0 {
|
|
t.Fatalf("query %q returned no hits", tc.query)
|
|
}
|
|
|
|
if hits[0].MBID != testMBID(tc.wantMBID) {
|
|
t.Errorf(
|
|
"query %q: top hit = %q, want %q",
|
|
tc.query,
|
|
hits[0].MBID,
|
|
testMBID(tc.wantMBID),
|
|
)
|
|
}
|
|
})
|
|
}
|
|
}
|
|
|
|
// TestEvalFixtureFileParses guards the checked-in fixture file so a
|
|
// malformed edit fails fast rather than silently skipping queries.
|
|
func TestEvalFixtureFileParses(t *testing.T) {
|
|
fixtures, err := eval.LoadFixtures("eval/testdata/eval_queries.json")
|
|
if err != nil {
|
|
t.Fatalf("load fixtures: %v", err)
|
|
}
|
|
|
|
for i, fx := range fixtures {
|
|
if fx.Query == "" {
|
|
t.Errorf("fixture %d has empty query", i)
|
|
}
|
|
|
|
if len(fx.Expect) == 0 {
|
|
t.Errorf("fixture %q has no expectations", fx.Query)
|
|
}
|
|
}
|
|
}
|
|
|
|
// seedIndexResult writes one explore_index row through the same
|
|
// upsertBatch every other writer uses.
|
|
//
|
|
// The three seeders that used to bind upsertIndexSQL's parameters by
|
|
// hand said, in a comment, that this was on purpose: a schema change
|
|
// should break the tests where it breaks the app. It did not - it
|
|
// broke them at "missing argument with index 25", one file at a time,
|
|
// for a column none of them cares about. Going through the one writer
|
|
// keeps the property they wanted (a field written to the wrong column
|
|
// still fails here) without three copies of a 24-argument list.
|
|
func seedIndexResult(t *testing.T, db *database.DB, r SearchIndexResult) {
|
|
t.Helper()
|
|
|
|
NewSearchIndex(db, nil, nil, slog.Default()).
|
|
upsertBatch([]SearchIndexResult{r})
|
|
|
|
// upsertBatch logs and swallows, which is right for a background
|
|
// merge and useless for a fixture, so the row is checked for.
|
|
var n int
|
|
|
|
if err := db.QueryRowWriter(
|
|
"SELECT COUNT(*) FROM explore_index WHERE mbid = ?", dbMBID(r.MBID),
|
|
).Scan(&n); err != nil || n == 0 {
|
|
t.Fatalf("seed explore_index row %q: not written (%v)", r.MBID, err)
|
|
}
|
|
}
|