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
210 lines
5.6 KiB
Go
210 lines
5.6 KiB
Go
package explore
|
|
|
|
import (
|
|
"bytes"
|
|
"context"
|
|
"fmt"
|
|
"net/http"
|
|
"net/http/httptest"
|
|
"strings"
|
|
"testing"
|
|
|
|
"yellowjacket/backend/database"
|
|
)
|
|
|
|
func TestParseDumpSeries(t *testing.T) {
|
|
cases := []struct {
|
|
in string
|
|
want int
|
|
ok bool
|
|
}{
|
|
{"https://x/fullexport/listenbrainz-dump-2593-20260712-000004-full/y.tar", 2593, true},
|
|
{"listenbrainz-dump-2594-20260713-000003-incremental", 2594, true},
|
|
{"listenbrainz-spark-dump-2603-20260722-000003-incremental.tar", 2603, true},
|
|
{"nothing-here", 0, false},
|
|
}
|
|
|
|
for _, c := range cases {
|
|
got, ok := parseDumpSeries(c.in)
|
|
if ok != c.ok || (ok && got != c.want) {
|
|
t.Errorf("parseDumpSeries(%q) = (%d, %v); want (%d, %v)", c.in, got, ok, c.want, c.ok)
|
|
}
|
|
}
|
|
}
|
|
|
|
func popularityOf(t *testing.T, db *database.DB, mbid string) (int, bool) {
|
|
t.Helper()
|
|
|
|
rows, err := db.QueryContext(
|
|
"SELECT popularity FROM explore_index WHERE mbid = ?", dbMBID(mbid),
|
|
)
|
|
if err != nil {
|
|
t.Fatalf("query popularity: %v", err)
|
|
}
|
|
|
|
defer func() { _ = rows.Close() }()
|
|
|
|
if !rows.Next() {
|
|
return 0, false
|
|
}
|
|
|
|
var pop int
|
|
if err := rows.Scan(&pop); err != nil {
|
|
t.Fatalf("scan popularity: %v", err)
|
|
}
|
|
|
|
return pop, true
|
|
}
|
|
|
|
// applyTar runs the incremental split → rollup → commit path against an
|
|
// in-memory tar, mirroring applyIncremental without the HTTP stream.
|
|
func applyTar(t *testing.T, si *SearchIndex, series int, tarBytes []byte) {
|
|
t.Helper()
|
|
|
|
counts, err := aggregateTarListens(context.Background(), bytes.NewReader(tarBytes))
|
|
if err != nil {
|
|
t.Fatalf("aggregate: %v", err)
|
|
}
|
|
|
|
rec, art, rel := splitCountsByKind(counts)
|
|
rg := si.rollupReleaseDeltas(rel)
|
|
|
|
if err := si.commitListenDeltas(series, rec, art, rg); err != nil {
|
|
t.Fatalf("commit series %d: %v", series, err)
|
|
}
|
|
}
|
|
|
|
func TestIncrementalApplyAdditive(t *testing.T) {
|
|
db := database.NewTestDB(t)
|
|
si := NewSearchIndex(db, nil, nil, testLogger())
|
|
|
|
si.upsertBatch([]SearchIndexResult{
|
|
{EntityType: "recording", MBID: recA, Title: "Rec A", Popularity: 100},
|
|
{EntityType: "artist", MBID: artA, Title: "Art A", Popularity: 100},
|
|
{EntityType: "release_group", MBID: rgA, Title: "RG A", Popularity: 100},
|
|
})
|
|
|
|
if _, err := db.ExecContext(
|
|
"INSERT INTO release_to_rg (release_mbid, rg_mbid) VALUES (?, ?)", relA, rgA,
|
|
); err != nil {
|
|
t.Fatalf("seed release_to_rg: %v", err)
|
|
}
|
|
|
|
// 5 listens of recA on relA credited to artA.
|
|
tarBytes := makeTar(t,
|
|
map[string][]byte{
|
|
"listens/1.parquet": makeParquet(t, listensOf(5, recA, relA, []string{artA})),
|
|
},
|
|
[]string{"listens/1.parquet"},
|
|
)
|
|
|
|
applyTar(t, si, 2, tarBytes)
|
|
|
|
for _, c := range []struct {
|
|
mbid string
|
|
want int
|
|
}{{recA, 105}, {artA, 105}, {rgA, 105}} {
|
|
if got, ok := popularityOf(t, db, c.mbid); !ok || got != c.want {
|
|
t.Errorf("popularity(%s) = %d (present=%v); want %d", c.mbid, got, ok, c.want)
|
|
}
|
|
}
|
|
|
|
if hwm, ok := si.metaInt(listensAppliedSeriesKey); !ok || hwm != 2 {
|
|
t.Errorf("high-water-mark = %d (present=%v); want 2", hwm, ok)
|
|
}
|
|
|
|
// A second, later dump accumulates additively.
|
|
applyTar(t, si, 3, tarBytes)
|
|
|
|
if got, _ := popularityOf(t, db, recA); got != 110 {
|
|
t.Errorf("popularity(recA) after second dump = %d; want 110", got)
|
|
}
|
|
|
|
if hwm, _ := si.metaInt(listensAppliedSeriesKey); hwm != 3 {
|
|
t.Errorf("high-water-mark after second dump = %d; want 3", hwm)
|
|
}
|
|
}
|
|
|
|
func TestIncrementalIgnoresUnknownAndUnmapped(t *testing.T) {
|
|
db := database.NewTestDB(t)
|
|
si := NewSearchIndex(db, nil, nil, testLogger())
|
|
|
|
// Only recA is indexed; relA has no release_to_rg mapping.
|
|
si.upsertBatch([]SearchIndexResult{
|
|
{EntityType: "recording", MBID: recA, Title: "Rec A", Popularity: 100},
|
|
})
|
|
|
|
// Listens for recB (not indexed) on relB (unmapped) credited to
|
|
// artB (not indexed). Nothing should change and no row created.
|
|
tarBytes := makeTar(t,
|
|
map[string][]byte{
|
|
"listens/1.parquet": makeParquet(t, listensOf(7, recB, relB, []string{artB})),
|
|
},
|
|
[]string{"listens/1.parquet"},
|
|
)
|
|
|
|
applyTar(t, si, 5, tarBytes)
|
|
|
|
if _, ok := popularityOf(t, db, recB); ok {
|
|
t.Error("recB should not have been inserted into the index")
|
|
}
|
|
|
|
if got, _ := popularityOf(t, db, recA); got != 100 {
|
|
t.Errorf("popularity(recA) = %d; want 100 (untouched)", got)
|
|
}
|
|
}
|
|
|
|
func TestDiscoverIncrementalDumps(t *testing.T) {
|
|
series := []string{"2594", "2595", "2596"}
|
|
|
|
mux := http.NewServeMux()
|
|
|
|
mux.HandleFunc("/incremental/", func(w http.ResponseWriter, r *http.Request) {
|
|
// Only the base listing (exact path); dir listings are handled
|
|
// by their own more-specific patterns below.
|
|
if r.URL.Path != "/incremental/" {
|
|
http.NotFound(w, r)
|
|
|
|
return
|
|
}
|
|
|
|
for _, s := range series {
|
|
_, _ = fmt.Fprintf(w,
|
|
`<a href="listenbrainz-dump-%s-20260713-000003-incremental/">dir</a>`+"\n", s,
|
|
)
|
|
}
|
|
})
|
|
|
|
for _, s := range series {
|
|
dir := fmt.Sprintf("/incremental/listenbrainz-dump-%s-20260713-000003-incremental/", s)
|
|
file := fmt.Sprintf("listenbrainz-spark-dump-%s-20260713-000003-incremental.tar", s)
|
|
|
|
mux.HandleFunc(dir, func(w http.ResponseWriter, _ *http.Request) {
|
|
_, _ = fmt.Fprintf(w, `<a href="%s">file</a>`, file)
|
|
})
|
|
}
|
|
|
|
srv := httptest.NewServer(mux)
|
|
defer srv.Close()
|
|
|
|
dumps, err := discoverIncrementalDumps(
|
|
context.Background(), srv.Client(), srv.URL+"/incremental/", 2594,
|
|
)
|
|
if err != nil {
|
|
t.Fatalf("discover: %v", err)
|
|
}
|
|
|
|
// Only 2595 and 2596 are newer than the 2594 high-water-mark.
|
|
if len(dumps) != 2 {
|
|
t.Fatalf("got %d dumps; want 2: %+v", len(dumps), dumps)
|
|
}
|
|
|
|
if dumps[0].series != 2595 || dumps[1].series != 2596 {
|
|
t.Errorf("series order wrong: %d, %d; want 2595, 2596", dumps[0].series, dumps[1].series)
|
|
}
|
|
|
|
if !strings.Contains(dumps[0].url, "spark-dump-2595") {
|
|
t.Errorf("unexpected url: %s", dumps[0].url)
|
|
}
|
|
}
|